Vector method based coverage hole recovery in wireless sensor networks

Authors:
Prasan Kumar Sahoo;Jang-Zern Tsai;Hong-Lin Ke
Affiliations:
Dept. of Information Management, Vanung University, Chungli, Taiwan;Dept. of Electrical Engineering, National Central University, Chungli, Taiwan;Dept. of Electrical Engineering, National Central University, Chungli, Taiwan
Venue:
COMSNETS'10 Proceedings of the 2nd international conference on COMmunication systems and NETworks
Year:
2010

Citing 10
Cited 1

GPSR: greedy perimeter stateless routing for wireless networks

MobiCom '00 Proceedings of the 6th annual international conference on Mobile computing and networking
PEAS: A Robust Energy Conserving Protocol for Long-lived Sensor Networks

ICDCS '03 Proceedings of the 23rd International Conference on Distributed Computing Systems
Dynamic Coverage Maintenance Algorithms for Sensor Networks with Limited Mobility

PERCOM '05 Proceedings of the Third IEEE International Conference on Pervasive Computing and Communications
Movement-Assisted Sensor Deployment

IEEE Transactions on Mobile Computing
Redundancy and coverage detection in sensor networks

ACM Transactions on Sensor Networks (TOSN)
A Delaunay Triangulation Based Method for Wireless Sensor Network Deployment

ICPADS '06 Proceedings of the 12th International Conference on Parallel and Distributed Systems - Volume 1
Trade-offs between mobility and density for coverage in wireless sensor networks

Proceedings of the 13th annual ACM international conference on Mobile computing and networking
Integrated Coverage and Connectivity in Wireless Sensor Networks: A Two-Dimensional Percolation Problem

IEEE Transactions on Computers
Coverage and Lifetime Optimization of Wireless Sensor Networks with Gaussian Distribution

IEEE Transactions on Mobile Computing
Connectivity-Guaranteed and Obstacle-Adaptive Deployment Schemes for Mobile Sensor Networks

IEEE Transactions on Mobile Computing

Review: A survey on coverage and connectivity issues in wireless sensor networks

Journal of Network and Computer Applications

Quantified Score

Hi-index	0.00

Visualization

Abstract

In Wireless Sensor Networks (WSN), sensors form the network dynamically without help of any infrastructure. The accidental death of the nodes due to technical failures or death due to power exhaustion may disturb the existing coverage and connectivity of the network. In this paper, distributed coverage hole recovery algorithms for the wireless sensor networks are designed that use the vector methods to decide the magnitude and direction of the mobile nodes. In the post deployment scenario, coverage holes of the network are repaired by moving the nodes in a self organized manner. To minimize the energy consumption of the nodes due to mobility, algorithms are designed in such a way that the mobility is limited within only one-hop of the nodes and highest coverage (k-coverage) of a node is not increased after its mobility. Performance evaluation of the proposed algorithms show that cent percent of coverage recovery could be possible by moving the nodes within their communication range. Besides, the average mobility distance of the nodes is very small to recover the coverage holes by our algorithms.