Distributed algorithms for dynamic coverage in sensor networks
Proceedings of the twenty-sixth annual ACM symposium on Principles of distributed computing
Jointly optimizing data acquisition and delivery in traffic monitoring VANETs
Proceedings of the 2009 ACM symposium on Applied Computing
An obstacle-free and power-efficient deployment algorithm for wireless sensor networks
IEEE Transactions on Systems, Man, and Cybernetics, Part A: Systems and Humans
Vector method based coverage hole recovery in wireless sensor networks
COMSNETS'10 Proceedings of the 2nd international conference on COMmunication systems and NETworks
Limited mobility coverage and connectivity maintenance protocols for wireless sensor networks
Computer Networks: The International Journal of Computer and Telecommunications Networking
Energy-Efficient deployment of mobile sensor networks by PSO
APWeb'06 Proceedings of the 2006 international conference on Advanced Web and Network Technologies, and Applications
| Hi-index | 0.00 |
Sensor networks consist of small wireless sensor nodes deployed randomly over an area to monitor the environment or detect intrusion. The coverage provided by sensor networks is very crucial to their effectiveness. Many of the important applications of sensor networks demand autonomous mobility for the sensor nodes. Early failure of sensor nodes can lead to coverage loss that requires coverage maintenance schemes. In this paper, we propose Dynamic Coverage Maintenance (DCM) schemes that exploit the limited mobility of the sensor nodes. The main objective of coverage maintenance is to compensate the loss of coverage with minimum expenditure of energy. We propose a set of DCM schemes which can be executed on individual sensor nodes having a knowledge of only their local neighborhood topology. We propose four algorithms to decide which neighbors to migrate, and to what distance, such that the energy expended is minimized and the coverage obtained for a given number of live nodes is maximized. The decision and movement is completely autonomous in the network, and involves movement of one-hop neighbors of a dead sensor node. We also propose an extension to these algorithms, called Cascaded DCM, which extends the migrations to multiple hops. We have also compared the performance of the different algorithms in terms of the improvement in coverage, average migration distance of the nodes, and the lifetime of the network.