DocumentCode :
2288214
Title :
The generalized k-coverage under probabilistic sensing model in sensor networks
Author :
Wang, Hung-Lung ; Chung, Wei-Ho
fYear :
2012
fDate :
1-4 April 2012
Firstpage :
1737
Lastpage :
1742
Abstract :
The usage of wireless sensor networks (WSNs) to monitor a region is an important functionality in defense and security applications. In these applications, a fundamental issue is to determine the minimum degree of coverage in the concerned region. The past researches focus on the binary disk sensing model, where sensors are assumed to be accurate in detecting targets within their sensing ranges. In this paper, we investigate the coverage problem under a more realistic model, the probabilistic sensing model, in which the probability of detection by a sensor decays with the distances. We generalize the coverage problem to the probabilistic sensing model and propose an algorithm to calculate the minimum degree of coverage. The accuracy of the proposed algorithm is verified via simulations.
Keywords :
probability; wireless sensor networks; WSN; binary disk sensing model; defense applications; detection probability; generalized k-coverage; minimum degree of coverage; probabilistic sensing model; security applications; sensing ranges; sensor decays; target detection; wireless sensor networks; Approximation algorithms; Approximation methods; Monitoring; Probabilistic logic; Sensors; Upper bound; Wireless sensor networks; Generalized k-Coverage; Probabilistic Sensing Model; Wireless Sensor Network;
fLanguage :
English
Publisher :
ieee
Conference_Titel :
Wireless Communications and Networking Conference (WCNC), 2012 IEEE
Conference_Location :
Shanghai
ISSN :
1525-3511
Print_ISBN :
978-1-4673-0436-8
Type :
conf
DOI :
10.1109/WCNC.2012.6214064
Filename :
6214064
Link To Document :
بازگشت