ResearchBib Share Your Research, Maximize Your Social Impacts
Sign for Notice Everyday Sign up >> Login

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:

Authors : ; ;

Page : 23-31

Keywords : Wireless sensor network (WSN); Delivery latency minimization problem (DLMP); Clustering; Mobile sink.;

Source : Downloadexternal Find it from : Google Scholarexternal

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.

Last modified: 2017-01-03 15:52:47