Lightweight sensing and communication protocols for target enumeration and aggregation
Proceedings of the 4th ACM international symposium on Mobile ad hoc networking & computing
The coverage problem in a wireless sensor network
WSNA '03 Proceedings of the 2nd ACM international conference on Wireless sensor networks and applications
A Bidding Protocol for Deploying Mobile Sensors
ICNP '03 Proceedings of the 11th IEEE International Conference on Network Protocols
Differentiated surveillance for sensor networks
Proceedings of the 1st international conference on Embedded networked sensor systems
Tracking a moving object with a binary sensor network
Proceedings of the 1st international conference on Embedded networked sensor systems
Movement-Assisted Sensor Deployment
IEEE Transactions on Mobile Computing
Coverage and hole-detection in sensor networks via homology
IPSN '05 Proceedings of the 4th international symposium on Information processing in sensor networks
Boundary estimation in sensor networks: theory and methods
IPSN'03 Proceedings of the 2nd international conference on Information processing in sensor networks
On perimeter coverage in wireless sensor networks
IEEE Transactions on Wireless Communications
Minimum perimeter coverage of query regions in a heterogeneous wireless sensor network
Information Sciences: an International Journal
A survey of communication/networking in Smart Grids
Future Generation Computer Systems
A hybrid optimisation algorithm for coverage enhancement in 3D directional sensor networks
International Journal of Sensor Networks
Hi-index | 0.00 |
The extent of coverage of a Wireless Sensor Network (WSN) is of fundamental importance and determines the utility and effectiveness of the deployment. Determining the least number of sensors required to cover the boundary of a region (boundary coverage) as well as determining the boundary of the sensor cover (coverage boundary) are required for a variety of applications. In this paper, these problems are rigorously analysed and computationally simple algorithms are developed for their distributed implementation. The 'Coverage Hole' problem in sensor networks is also analysed and a distributed algorithm is developed that can identify the boundary of the holes in the sensor cover. Numerical simulations show that the reduced boundary cover has better energy efficiency compared to the standard Random Deployment (RD) of sensor nodes in terms of the overall system lifetime. The proposed algorithms are easy to implement and their computational efficiency is validated through complexity analysis.