Improved APAC algorithm for minimizing delay in wireless sensor network with mobile sink
Journal: International Journal of Advanced Computer Research (IJACR) (Vol.7, No. 28)Publication Date: 2016-12-27
Authors : Hinal Upadhyay; Mala Mehta;
Page : 23-31
Keywords : Wireless sensor network (WSN); Delivery latency minimization problem (DLMP); Clustering; Mobile sink.;
Abstract
A wireless sensor network (WSN) is a collection of small randomly dispersed devices. It is denoted as sensor nodes, which can sense the physical or environmental conditions, such as temperature, sound, pressure, etc. and pass their data through the network to a main location. Currently, research is going on in the field of WSN about latency, energy consumption, speed and security. This paper is focused on delivery latency minimization problem (DLMP). To reduce the latency, shortest path must be found. If the travelling path is shorter than latency can be decreased. This research presented improved anchor point algorithm with clustering (APAC) in WSNs. Using better anchor point selection in point substitution method, latency can be minimized. After applying point substitution method, the clustering method with low-energy adaptive clustering hierarchy (LEACH) protocol has been applied. Results show that latency is reduced compared to the only point substitution method.
Other Latest Articles
- Finding the most efficient paths between two vertices in a knapsack-item weighted graph
- Tri-mode dual level 3-D image compression over medical MRI images
- A local search algorithm based on chromatic classes for university course timetabling problem
- Ver, Compreender e Aprender: estudo comparado com guias de uso de apps editoriais para dispositivos móveis
- Embalagens Sustentáveis: análise da exposição de embalagens do setor alimentício em gôndolas de supermercado
Last modified: 2017-01-03 15:52:47