|
|
|
| Study on Path Coverage in Wireless Sensor Networks |
| Li Lei① Zhang Bao-xian② Huang He-qing① Liu Hai-tao① |
①(Key Laboratory of Wireless Sensor Network & Communication, Shanghai Institute of Micro-system and Information Technology, Chinese Academy of Sciences, Shanghai 200050, China)
②(Research Center of Ubiquitous Sensor Networks, Graduate University of Chinese Academy of Sciences, Beijing 100049, China) |
|
|
|
|
Abstract Targets tracking is one of the key applications of wireless sensor networks. In this kind of applications, the sensing process on the targets’ moving paths, rather than in the whole area, is often of more concern. The path 1-coverage problem has been extensively investigated, however, the path k-coverage (k>1) problem receives little attention. To address this issue, in this paper, the coverage problem induced on an intrusion path by a randomly deployed two-dimensional sensor network is first transformed into a one-dimensional coverage problem, and then a theoretical lower bound to the full k-coverage probability of a randomly selected straight path is derived. Experimental results show that this lower bound is very close to the simulation results, especially when k is small.
|
|
Received: 06 November 2009
|
|
|
|
Corresponding Authors:
Li Lei
E-mail: simit.lilei@gmail.com
|
|
|
|
|
|
|
2010, Vol. 32 
