Research Article
Dynamic Coverage and Connectivity Maintenance Algorithms for Wireless Sensor Networks
@INPROCEEDINGS{10.1109/COMSWA.2007.382574, author={Prasan Kumar Sahoo and Jang-Ping Sheu and Wei-Shin Lin}, title={Dynamic Coverage and Connectivity Maintenance Algorithms for Wireless Sensor Networks}, proceedings={2nd International IEEE Conference on Communication System Software and Middleware}, publisher={IEEE}, proceedings_a={COMSWARE}, year={2007}, month={7}, keywords={Computer science Distributed algorithms Energy consumption Information management Maintenance engineering Mobile communication Monitoring Performance analysis Proposals Wireless sensor networks}, doi={10.1109/COMSWA.2007.382574} }
- Prasan Kumar Sahoo
Jang-Ping Sheu
Wei-Shin Lin
Year: 2007
Dynamic Coverage and Connectivity Maintenance Algorithms for Wireless Sensor Networks
COMSWARE
IEEE
DOI: 10.1109/COMSWA.2007.382574
Abstract
In wireless sensor network, accidental death of nodes in predictable or unpredictable way may cause coverage and connectivity problems of the original network. In this paper, potential approaches to maintain the network in the post deployment scenario is proposed that lets the sensors work alternatively by identifying the redundant sensing regions in the dense networks under the assumption that the transmission range (Rc) is equal to the sensing range (Rs) or < 2Rs of a node. The proposed coverage and connectivity maintenance algorithms decide which neighbors of a dead node to migrate, and to what distance, so that the loss of coverage and connectivity can be repaired with low mobility of the nodes. In this work, decision and movement of the nodes are completely autonomous and involve movement of only one-hop neighbors of a dead node to minimize energy consumption due to mobility. Performance analysis of the algorithms show that average mobility distance of the nodes is very small and energy consumption is very less by maintaining the coverage and connectivity.