Advanced Search
Volume 32 Issue 10
Dec.  2010
Turn off MathJax
Article Contents
Li Lei, Zhang Bao-Xian, Huang He-Qing, Liu Hai-Tao. Study on Path Coverage in Wireless Sensor Networks[J]. Journal of Electronics & Information Technology, 2010, 32(10): 2429-2433. doi: 10.3724/SP.J.1146.2009.01433
Citation: Li Lei, Zhang Bao-Xian, Huang He-Qing, Liu Hai-Tao. Study on Path Coverage in Wireless Sensor Networks[J]. Journal of Electronics & Information Technology, 2010, 32(10): 2429-2433. doi: 10.3724/SP.J.1146.2009.01433

Study on Path Coverage in Wireless Sensor Networks

doi: 10.3724/SP.J.1146.2009.01433
  • Received Date: 2009-11-06
  • Rev Recd Date: 2010-06-29
  • Publish Date: 2010-10-19
  • 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 (k1) 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.
  • loading
  • [1] Hall P. Introduction to the Theory of Coverage Processes[M]. New York: John Wiley Sons, 1988: 79-119. [2] Shakkottai S.[J].Srikant R, and Shroff N. Unreliable sensor grids: coverage, connectivity and diameter[C]. Proceedings of IEEE INFOCOM03, San Francisco, CA, USA, Mar. 30-Apr.2003,3:- [3] Kumar S.[J].Lai T H, and Balogh J. On k-coverage in a mostly sleeping sensor network[C]. Proceedings of ACM MOBICOM04, Philadelphia, PA, USA, Sept. 26 - Oct.2004,1:- [4] Ram S S, Manjunath D, Iyer S K, and Yogeshwaran D. On the path coverage properties of random sensor networks[J].IEEE Transactions on Mobile Computing.2007, 6(5):494-506 [5] Manohar P, Ram S S, and Manjunath D. Path coverage by a sensor field: the nonhomogeneous case[J]. ACM Transactions on Sensor Networks, 2009, 5(2): 1-26. [6] Harada J.[J].Shioda S, and Saito H. Path coverage property of randomly deployed sensor networks with nite communication ranges[C]. Proceedings of IEEE ICC08, Beijing, China, May 19-2.2008,:- [7] Goldenberg D K.[J].Bihler P, and Cao M, et al.. Localization in sparse networks using sweeps[C]. Proceedings of ACM MOBICOM06, Los Angeles, CA, USA, Sep. 23-2.2006,:- [8] Sheu J, Hu W, and Lin J. Distributed localization scheme for mobile sensor networks[J].IEEE Transactions on Mobile Computing.2010, 9(4):516-526 [9] Kumar S.[J].Lai T H, and Arora A. Barrier coverage with wireless sensors[C]. Proceedings of ACM MOBICOM05, Cologne, Germany, Aug. 28-Sept.2005,2:- [10] Saipulla A.[J].Westphal C, Liu B, and Wang J. Barrier coverage of line-based deployed wireless sensor networks[C]. Proceedings of IEEE INFOCOM09, Rio de Janeiro, Brizil, Apr. 19-2.2009,:- [11] Meester R and Roy R. Continuum Percolation[M]. Cambridge: Cambridge University Press, 1996: 31-34.
  • 加载中

Catalog

    通讯作者: 陈斌, bchen63@163.com
    • 1. 

      沈阳化工大学材料科学与工程学院 沈阳 110142

    1. 本站搜索
    2. 百度学术搜索
    3. 万方数据库搜索
    4. CNKI搜索

    Article Metrics

    Article views (3036) PDF downloads(1188) Cited by()
    Proportional views
    Related

    /

    DownLoad:  Full-Size Img  PowerPoint
    Return
    Return