Distributed Node Deployment Algorithms in Mobile Wireless Sensor Networks: Survey and Challenges

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.

Automated summary

In this article, the state of the art of deployment algorithms for blanket coverage in mobile wireless sensor networks is reviewed. The challenges of node deployment and their impact on network performance are discussed, followed by the classification of available deployment algorithms into force-based and geometrical algorithms. The advantages and disadvantages of each category are discussed, and the article concludes with a qualitative comparison of all reported algorithms and potential future directions.