DocumentCode
3343990
Title
Simple and Efficient k-Coverage Verification without Location Information
Author
Bejerano, Yigal
Author_Institution
Bell-Labs., Alcatel-Lucent, Murray Hill, NJ
fYear
2008
fDate
13-18 April 2008
Abstract
Wireless sensor networks (WSNs) have recently emerged as a prominent technology for environmental monitoring and hazardous event detection. Yet, their success depends considerably on their ability to ensure reliable event detection. Such guarantees can be provided only if the target field monitored by a WSN does not contain coverage holes that are not monitored by any sensor. Currently, the coverage-holes detection solutions require accurate knowledge of the sensors locations, which cannot be easily obtained, or they cannot provide guarantees on the coverage quality. In this study we address the challenge of designing an accurate k-coverage verification scheme, without using location information, for a predefined kges1. To this end, we present an efficient, distributed and localized k-coverage verification scheme with proven guarantees on its coverage detection quality. Our simulations show that the scheme accurately detects coverage holes of various sizes.
Keywords
wireless sensor networks; coverage hole detection; distributed-localized k-coverage verification scheme; environmental monitoring; hazardous event detection; wireless sensor networks; Ad hoc networks; Collaboration; Communications Society; Event detection; Global Positioning System; Monitoring; Peer to peer computing; Quality of service; Wireless communication; Wireless sensor networks;
fLanguage
English
Publisher
ieee
Conference_Titel
INFOCOM 2008. The 27th Conference on Computer Communications. IEEE
Conference_Location
Phoenix, AZ
ISSN
0743-166X
Print_ISBN
978-1-4244-2025-4
Type
conf
DOI
10.1109/INFOCOM.2008.67
Filename
4509662
Link To Document