无线传感器网络路径覆盖问题研究

李磊; 张宝贤; 黄河清; 刘海涛

doi:10.3724/SP.J.1146.2009.01433

无线传感器网络路径覆盖问题研究

doi: 10.3724/SP.J.1146.2009.01433

李磊^{① 张宝贤,},
张宝贤,
黄河清,
刘海涛

基金项目:

国家自然科学基金(60970137)，国家科技重大专项(2009ZX03006-001-02，2009ZX03006-006)资助课题

计量
- 文章访问数: 3014
- HTML全文浏览量: 81
- PDF下载量: 1188
- 被引次数: 0
出版历程
- 收稿日期: 2009-11-06
- 修回日期: 2010-06-29
- 刊出日期: 2010-10-19

Study on Path Coverage in Wireless Sensor Networks

摘要

摘要: 目标跟踪是无线传感器网络的重要应用之一。在目标跟踪过程中，用户通常更关心目标移动路径的覆盖情况，而不是整个网络部署区域的覆盖情况。学术界对路径1覆盖的问题做了详细的研究，但是并没有给出路径k(k1)覆盖的分析。针对这一问题，该文首先将节点随机布设的2维传感器网络中目标移动路径的覆盖问题转化为1维线段覆盖问题，并通过理论分析给出任意直线路径满足k(k1)覆盖的概率下限。实验表明，在k较小时，该下限可以较好的逼近仿真结果。
- 无线传感网 /
- 入侵检测 /
- 路径覆盖
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 (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.
- Wireless Sensor Networks (WSN) /
- Intrusion detection /
- Path coverage

HTML全文

参考文献(1)

[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.

施引文献

资源附件(0)

访问统计