Abstract

From the coverage and connectivity perspective, a wide range of applications in wireless sensor networks rely on node deployment algorithms to accomplish their functionalities. This is especially of great significance when the sensor nodes are mobile and can autonomously move to appropriate locations to provide optimal or near-optimal coverage. In this article, we review the state of the art of deployment algorithms proposed for blanket coverage in mobile wireless sensor networks. To this, we first discuss the node deployment challenges and their impact on network performance from different perspectives. Afterwards, currently available deployment algorithms in mobile sensor networks are categorised into two main categories: Force-based, and Geometrical deployment algorithms. The advantages and disadvantages of each category are discussed, and the latest advancements are then presented. Finally, we present a qualitative comparison of all the algorithms reported in the literature and also discuss some possible future directions.

Full Text
Published version (Free)

Talk to us

Join us for a 30 min session where you can share your feedback and ask us any queries you have

Schedule a call