DocumentCode :
2823303
Title :
Deployment patterns for k-coverage and l-connectivity in Wireless Sensor Networks
Author :
Zhuang Miao ; Lingguo Cui ; Baihai Zhang ; Jun Li
Author_Institution :
Sch. of Autom., Bejing Inst. of Technol., Bejing, China
fYear :
2010
fDate :
15-17 Nov. 2010
Firstpage :
73
Lastpage :
77
Abstract :
In this paper, the patterns for k-coverage (2≤k≤4) based on optimal /-connectivity (3≤/≤6) patterns are deeply discussed and a series of deployment patterns for k-coverage and I-connectivity are proposed under different ratios of sensor communication range (denoted by Rc) over sensing range (denoted by Rs) for Wireless Sensor Networks (WSNs). The patterns proposed are based on regular graphs and have precise thresholds that discriminate different k-coverage and I-connectivity when Rc/Rs≤1. Also, the mathematical operations of MAPN (Maximum Area per Node) in all patterns are described in the paper. In the end, comparison graphs of coverage rate for each pattern are illustrated and different values of k and I in k-coverage and I-connectivity´s coverage varying rates could be observed.
Keywords :
graph theory; wireless sensor networks; I-connectivity; deployment patterns; k-coverage; maximum area per node; regular graphs; sensor communication range; wireless sensor networks; Wireless Sensor Networks; deployment patterns; k-coverage and l-connectivity;
fLanguage :
English
Publisher :
iet
Conference_Titel :
Wireless Sensor Network, 2010. IET-WSN. IET International Conference on
Conference_Location :
Beijing
Type :
conf
DOI :
10.1049/cp.2010.1031
Filename :
5741073
Link To Document :
بازگشت