ESA: An Efficient Self-deployment Algorithm for Coverage in Wireless Sensor Networks

Abstract

The fundamental challenge after an arbitrary initial distribution of sensor nodes in wireless sensor network (WSN), is the problems of the coverage and the connectivity. Where we can find that the some portions of area of interest (AI) are not covered; and some sensor nodes are isolated. To solve this problem, several protocols were proposed which are generally based on geometrical approaches. In this paper, we suggest a distributed and localized protocol, called Efficient Self-deployment Algorithm (ESA) to improve the coverage and to maintain the connectivity in mobile WSN. Where mobile sensors can move and self-organize in the best positions. The suggested protocol runs at periods of equal time. In each period, the nodes move toward new destinations in order to increase the coverage and the connectivity gradually although the existing obstacles in AI. Our simulations show the robustness of our solution and that it provides better results than Centroid, Dual-Centroid, VOR and Minmax algorithms in terms of coverage ratio and moving distance.