DocumentCode
1941094
Title
Robust coverage under uncertainty in wireless sensor networks
Author
Vu, Khuong ; Zheng, Rong
Author_Institution
Dept. of Comput. Sci., Univ. of Houston, Houston, TX, USA
fYear
2011
fDate
10-15 April 2011
Firstpage
2015
Lastpage
2023
Abstract
Uncertainty in sensor locations is a norm in both planned and unplanned deployments. Even carefully positioned in the deployment phase, sensors may be displaced due to environmental or human factors during the course of operation. In this paper, we present a systematic study of the impact of location uncertainty on the coverage properties of wireless sensor networks. The uncertainty is modeled as disks of possibly different radius around the nominal positions. We introduce the concept of order-k (k ≥ 1) max Voronoi Diagram (VD) and devise an efficient polynomial algorithm to construct order-k VDs. Order-k max VD is critical in determining the minimum sensing radius needed to ensure worst-case k-coverage, call k-exposure. Simulation studies validate the correctness of the proposed algorithms and demonstrate their superiority over a naive approach.
Keywords
computational geometry; polynomial approximation; uncertain systems; wireless sensor networks; Voronoi diagram; call k-exposure; coverage property; location uncertainty; minimum sensing radius; order-k VD; order-k max VD; polynomial algorithm; robust coverage; sensor locations; systematic study; unplanned deployments; wireless sensor networks; worst-case k-coverage; Algorithm design and analysis; Complexity theory; Optimization; Robustness; Sensors; Uncertainty; Wireless sensor networks;
fLanguage
English
Publisher
ieee
Conference_Titel
INFOCOM, 2011 Proceedings IEEE
Conference_Location
Shanghai
ISSN
0743-166X
Print_ISBN
978-1-4244-9919-9
Type
conf
DOI
10.1109/INFCOM.2011.5935008
Filename
5935008
Link To Document