Geography-informed energy conservation for Ad Hoc routing
Proceedings of the 7th annual international conference on Mobile computing and networking
Proceedings of the 7th annual international conference on Mobile computing and networking
A coverage-preserving node scheduling scheme for large wireless sensor networks
WSNA '02 Proceedings of the 1st ACM international workshop on Wireless sensor networks and applications
PEAS: A Robust Energy Conserving Protocol for Long-lived Sensor Networks
ICDCS '03 Proceedings of the 23rd International Conference on Distributed Computing Systems
Analysis on the redundancy of wireless sensor networks
WSNA '03 Proceedings of the 2nd ACM international conference on Wireless sensor networks and applications
The coverage problem in a wireless sensor network
WSNA '03 Proceedings of the 2nd ACM international conference on Wireless sensor networks and applications
Integrated coverage and connectivity configuration in wireless sensor networks
Proceedings of the 1st international conference on Embedded networked sensor systems
Differentiated surveillance for sensor networks
Proceedings of the 1st international conference on Embedded networked sensor systems
On k-coverage in a mostly sleeping sensor network
Proceedings of the 10th annual international conference on Mobile computing and networking
Estimating Coverage Holes and Enhancing Coverage in Mixed Sensor Networks
LCN '04 Proceedings of the 29th Annual IEEE International Conference on Local Computer Networks
Barrier coverage with wireless sensors
Proceedings of the 11th annual international conference on Mobile computing and networking
An energy aware coverage-preserving scheme for wireless sensor networks
PE-WASUN '05 Proceedings of the 2nd ACM international workshop on Performance evaluation of wireless ad hoc, sensor, and ubiquitous networks
Handbook of Algorithms for Wireless Networking and Mobile Computing (Chapman & Hall/Crc Computer & Information Science)
Sensor coverage in wireless ad hoc sensor networks
International Journal of Sensor Networks
A performance evaluation of a coverage compensation based algorithm for wireless sensor networks
Proceedings of the 11th international symposium on Modeling, analysis and simulation of wireless and mobile systems
Irregular sensing range detection model for coverage based protocols in wireless sensor networks
GLOBECOM'09 Proceedings of the 28th IEEE conference on Global telecommunications
Topography-aware sensor deployment optimization with CMA-ES
PPSN'10 Proceedings of the 11th international conference on Parallel problem solving from nature: Part II
Sensing task assignment via sensor selection for maximum target coverage in WSNs
Journal of Network and Computer Applications
Primal and dual-based algorithms for sensing range adjustment in WSNs
The Journal of Supercomputing
A geometry-based coverage strategy over urban VANETs
Proceedings of the 10th ACM symposium on Performance evaluation of wireless ad hoc, sensor, & ubiquitous networks
International Journal of Ad Hoc and Ubiquitous Computing
| Hi-index | 0.00 |
Coverage is an important issue related to WSN quality of service. Several centralized/decentralized solutions based on geometry information and under the assumption of disk sensing range have been introduced in the literature. However, disk sensing range assumption is too strong in the real world and cannot be held in scenarios requiring high accuracy, such as the emergency preparedness class of applications. This paper proposes a new intersection point method (IPM) that extends the disk sensing range assumption to an irregular simple polygon assumption. A unit circle test method has also been devised in order to provide a controllable degree of accuracy in the determination of fully covered nodes. By adjusting the radius r"u of this unit circle test, the algorithm can be made tolerant to holes of a certain size which makes the solution flexible when the degree of accuracy must be controlled. IPM performance was evaluated through a set of simulation experiments implemented in the NS-2 simulator, which were compared to the results obtained using the central angle method (CAM) proposed by D. Tian and N.D. Georganas, and the association sponsors method (ASM) proposed by A. Boukerche, X. Fei and Regina B. Araujo. The results show that under the simple polygon sensing range assumption, our solution can efficiently identify fully covered sensors, discover holes (blind points) and archive better quality results than CAM and ASM. The performance and flexibility of IPM makes it a potential solution for applications that require a high rate of coverage with controllable hole tolerance.