无线传感器网络中连通与覆盖控制算法研究
详细信息    本馆镜像全文|  推荐本文 |  |   获取CNKI官网全文
摘要
连通与覆盖控制是无线传感器网络的两个最基本的问题。连通是指网络中任意两个节点可以进行通信,这是节点自组织形成网络的前提。覆盖是指利用网络中的传感器节点对整个目标区域进行监测,从而达到信息采集的目的。
     本文首先对无线传感器网络的基本理论及国内外的研究进行了简要介绍。由于无线传感器网络中存在着大量冗余节点,且传感器节点能量有限,为了减少整个网络的能耗,本文提出了一种最小连通覆盖集求解算法,算法降低了网络覆盖冗余,减少了网络检测过程中的能量消耗,在不满足通信半径大于2倍感知半径的情况下,进一步提出了两种求解最小连通集的算法,虚拟半径调整的连通算法和基于最小生成树的连通算法。保证了通信半径和感知半径在任何比例下网络覆盖集的连通性。仿真实验表明,通过本文算法求解的连通覆盖集的节点数目相对较少了,并保证了整个工作节点网络的连通性。
     目前,大部分的无线传感器网络连通与覆盖算法都是依赖节点位置信息对节点进行冗余判断,忽略了节点的定位也需要浪费很多能耗的问题。为此,本文提出了一种无位置无关的覆盖控制算法,分析讨论了节点时钟异步对网络覆盖强度的影响,并通过在生成树中广播时间同步算法保证了工作节点网络的时间同步,减少了时间异步对网络覆盖强度的影响。通过实验仿真比较表明,该算法不依赖节点的位置信息,可以减少网络中工作节点,并保持网络的连通性。
Two of the most fundamental problems in Wireless Sensor Network (WSN) are connectivity and coverage. Connectivity indicates that every node can communicate with any other nodes in WSN, which is the precondition to create a self-organization network. Coverage means that overall area should be sensed by all nodes so that the observer can obtain the whole information.
     In the thesis, the basic principle and the research status worldwide of wireless sensor network are introduced briefly. Since there are many redundant nodes in WSN, and the sensor node energy is limited, in order to reduce the energy consumption of the entire network, this thesis proposes a minimum connected cover set algorithm, which reduces the coverage redundancy, reduce network energy consumption in the testing process. When the communication radius is less than the two times of the perception radius, it further proposes two algorithms to solve the minimum connected set, i.e., the connected algorithm to adjust the virtual radius and the connected algorithm based on minimum spanning tree. So the communication radius and perception radius of coverage in any proportion connectedness of the set can be ensured. Simulation results show that this algorithm needs a small number of nodes to the connected cover set, and ensures the work of the node network connectivity.
     Currently, most algorithms are dependent on node location information to determine redundant nodes, ignoring the positioning of the nodes need to waste a lot of energy problems. To this end, we propose a non-position independent coverage control algorithm, and analyze and discuss the affection of the node clock asynchronous on the strength of network coverage. By the broadcasting algorithm in the spanning tree, the time synchronization of working node network can be ensured, and the affection of the time asynchronization on network coverage intensity be reduced. Simulation results show that the algorithm is independent of node location information and can reduce the work of the network nodes and maintain the network connectivity.
引文
[1]Ren Y, Zhang S D, Zhang H K. Theories and Algorithms of Coverage Control for Wireless Sensor Networks. Journal of Software,2006,17(3):422-433
    [2]孙利民等.无线传感器网络.北京:清华大学出版社.2005
    [3]吕伟琴.无线传感器网络的能量均衡自适应路由算法研究:[硕士论文].青岛:中国海洋大学,2007
    [4]潘家根.无线传感器网络通信机制与节能的研究:[硕士论文].成都:电子科技大学,2007
    [5]何普江.无线传感器网络若干安全问题研究:[硕士论文].合肥:中国科学技术大学,2007
    [6]Cregory. J Pottie, Wiliam. J Kaiser. Embedding the Internet:Wireless Integrated Network Sensors.Communications of the ACM,2000,43(5):51-58
    [7]马祖长,孙怡宁,梅涛.无线传感器网络综述.通信学报,2004,25(4):114-124.
    [8]陈林星.无线传感器网络技术与应用.北京:电子工业出版社,2009
    [9]蒋鹏,孔一凡.面向水环境监测的无线传感器网络数据视频基站设计.传感技术学报,2009,21(09):1580-1585
    [10]KebinLiu, LeiChen, YunhaoLiu. Robust and efficient aggregate query processing in wireless sensor networks. Mobile NetwAppl,2008,2(13):212-227
    [11]POTTIE G,KAISER W. Wireless sensor networks. Communication of the ACM.2000,43(5):51-58
    [12]孙利民,李建中等.无线传感器网络.北京:清华大学出版社,2005
    [13]杨少军,史浩山,刘利章.无线传感器网络分析与仿真.计算机工程,June2006,32(22):116-118
    [14]Ye F, Zhong G, Cheng J, Lu S, Zhang L. PEAS:A robust energy conserving protocol for long-lived sensor network. In:Proc. of the 23rd International Conference on Distributed Computing Systems (ICDCS 2003),2003,28-37
    [15]Xu Y, Heidemann J, Est rin D. Geography informed energy conservation for ad hoc routing. In:Proc. of ACM MOBICOM'01, July 2001,70-84
    [16]Zhang H, Hou JC. Maintaining scheme coverage and connectivity in large sensor networks. Wireless Ad Hoc and Sensor Networks:An International Journal, 2005,1(2):89-123
    [17]Wang X, Xing G, Zhang Y, Lu C, Pless R, Gill C. Integrated coverage and connectivity configuration in wireless sensor networks. In:Proc of the 1st International Conference on Embedded Networked Sensor Systems (Sensys 2003),2003,28-39
    [18]Chen B,Jamieson K, Balakrishnan H, Morris R. SPAN:An energy-efficient coordination algorithm for topology maintenance in ad hoc wireless networks. ACM Wireless Networks Journal.2002,8(5):481-494
    [19]Laouiti A, Qayyum A, Viennot L. Multipoint relaying:An efficient technique for flooding in mobile wireless network. In:Proceedings of t he Hawaii International Conference on System Sciences,2002
    [20]Carle J, Gallais A, Simplot-Ryl D. Preserving area coverage in wireless sensor networks by using surface coverage relay dominating sets. In:Ammar R, Saracco R, eds. Proc. of the 10th IEEE Symp. on Computers and Communications (ISCC). Cartagena:IEEE Press,2005,347-352
    [21]Gupta H G, SR D, Gu Q. Connected sensor cover:Self-Organization of sensor networks for efficient query execution. In:Proc of the ACM Int'l Symposium, on Mobile Ad Hoc Networking and Computing (MobiHOC). New York:ACM Press,2003,189-200
    [22]Slijepcevic S, Pot konjak M. Power efficient organization of wireless sensor networks. In:Pro. of IEEE Conference on Communications, Helsinki, Finland, June 2001,2:472-476
    [23]Cardei M, MarCallum D, Cheng X, Min M, Jia X, Li D, Du D. Wireless sensor networks with energy efficient organization. Journal of Interconnection Networks,2002,3(324):213-229
    [24]Tian D, Georganas N. A coverage preserved node scheduling scheme for large wireless sensor network. In:Proc. of First International Workshop on Wireless Sensor Networks and Applications (WSNA'02), Atlanta, USA, September,2002, 32-41
    [25]Mao Y, Liu M, Chen L, Chen D, Xie L. A Distributed Energy Efficient Location Independent Coverage Protocol in Wireless Sensor Networks. Computer Research and Development,2006,43(2):187-195
    [26]Kumar S, Lai T H, Balogh J. On k-coverage in a mostly sleeping sensor network. In:Proceedings of the 10t h Annual International Conference on Mobile Computing and Networking (Mobicom'04),2004,144-158
    [27]Gao Y, Wu K, Li F. Analysis on the redundancy of wireless sensor networks. In: Raghavendra CS, Sivalingam K, eds. Proc. of the 2nd ACM Int'l Workshop on Wireless Sensor Networks and Applications (WSNA). New York:ACM Press, 2003,108-114
    [28]Mao Y, Gong H, Liu M, Chen D, Xie L. An Energy Efficient and Location Independent Qos Protocol for Wireless Sensor Networks. Computer Research and Development,2006,43(6):1019-1026
    [29]Akyildiz IF, Su W, Sankarasubramaniam Y, Cayirci E. Wireless sensor networks: A survey. Computer Networks.2002,38(4):393-422
    [30]Balister, B. Bollobas, A. Sarkar, and S. Kumar. Reliable Density Estimates for Coverage and Connectivity in Thin Strips of Finite Length, in ACM MobiCom, 2007,9-14
    [31]HOLGER K,ANDREAS W.无线传感器网络协议与体系结构.邱天爽,唐洪,李婷,等译.北京:电子工业出版社,2007,76-83
    [32]MEGUERDICHIAN S,KOUSHANFAR F,QU Gang, et al. Exposure in wireless Ad hoc sensor networks.Proc of the 7th International Conference on Mobile Computing and Networking. New York:ACM Press,2001,139-150
    [33]VELTRI QHUANG Qing-feng, QU Gang, et al. Minimal and maximal exposure path algorithms for wireless emended sensor networks. Proc of the 15th International Conference on Embedded Networked Sensor.2003,40-50
    [34]蒋杰.无线传感器网络覆盖控制研究:[博士论文].长沙:国防科学技术大学,2005
    [35]蒋丽萍,王良民,熊书明等.基于感知概率的无线传感器网络k重覆盖算法.计算机应用研究,2009,26(9):3484-3486,3489
    [36]史彬斌,秦宁宁,徐保国.能量和移动距离有效传感器网络部署.计算机仿真,2009,26(5):146-149
    [37]李石坚.面向目标跟踪的自组织传感器网研究:[硕士论文].杭州:浙江大学,2006
    [38]LI Shi-jian, XU Cong-fu, PAN Wei-ke, et al. Sensor deployment optimization for detecting maneuvering targets. Proc of the 7th International Conference on Information Fusion.2005,1-7
    [39]蒋鹏,陈峰.基于概率的三维无线传感器网络K-覆盖控制方法.传感技术学报,2009,22(5):706-711
    [40]QIN Ning-ning, ZHANG Lin, SHAN Xiu-ming, et al. Locomotion trajectory with cooperative metrics in wireless sensor networks. Journal of China Universities of Posts and Telecommunications,2007,14(2):64-68
    [41]Slijepcevic S, Potkonjak M. Power efficient organization of wireless sensor networks. In:Glisic S, ed. Proc of the IEEE Int'l Conf. on Communications (ICC). Helsinki:IEEE Press,2001,472-476
    [42]Cardei M,Du DZ. Improving wireless sensor network lifetime through power aware organization. Wireless Networks,2005,11(3):333-340
    [43]Lin FYS, Chiu PL. A near-optimal sensor placement algorithm to achieve complete coverage discrimination in sensor networks. IEEE Communications Letters,2005,9(1):43-45
    [44]Cortes J, Martinez S, Karatas T, et al. Coverage control for mobile sensing networks. IEEE Trans, on Robotics and Automation,2004,20(2):243-255
    [45]Megerian S, Koushanfar F, Potkonjak M et al. Worst and best-case coverage in sensor networks. IEEE Trans, on Mobile Computing,2005,4(1):84-92
    [46]Meguerdichian S, Koushanfar F, Qu G, et al. Exposure in wireless ad-hoc sensor networks. In:Rose C, ed. Proc of the ACM Int'l Conf. on Mobile Computing and Networking(MobiCom). New York:ACM Press,2001,139-150
    [47]Cardei M, Wu J. Coverage in wireless sensor networks.CRC Ilyas M, Magboub I, eds. Handbook of Sensor Networks,2004,chapter 19
    [48]Chien-Chung Shen, Chavalit Srisatha PornPha. CLTC:A Cluster-Based Topology Control Framework for Ad-Hoc Networks, IEEE Transaction on Mobile Computing,2004,3(1):18-32
    [49]Schurgets. C, Tsiatsis. V, Srivastava. M,B. STEM:Topology management for energy efficient sensor networks. IEEE Aerospace Conference,2002,1099-1108
    [50]毛莺池,陈力军,陈道蓄.无线传感器网络覆盖控制技术研究.计算机科学,2007,34(3):20-26
    [51]H. Gupta, Z. Zhou,S. R. Das, Q. Gu. Connected Sensor Cover:Self-Organization of sensor networks for efficient query execution, ACM/IEEE Transactions on Networking,2005,189-200
    [52]Shakkottai S, Srikant R,Shroff N. Unreliable sensor grids:Coverage, connectivity and diameter. In:Bauer F, ed. Proc of the IEEE. San Francisco: IEEE Press,2003,1073-1083
    [53]Q. Du, M. Gunzburger, L. Ju. Probabilistic methods for centroidal Voronoi tessellations and their parallel implementations, Journal of Parallel Computing 2002,28:1477-1500
    [54]LIU C, WU K, KING V. Randomized coverage-preserving scheduling schemes for wireless sensor networks. Processing IFIP Networking Conference. Heidelberg:Springer Verlag,2005,956-967
    [55]W. R. Heinzelman, A. P. Chandrakasan, H. Balakrishnan. An application-specific protocol architecture for wireless sensor networks. IEEE Trans, on Wireless Communications,2002,1 (4):660-670
    [56]C. F. Huang, Y. C. Tseng. The Coverage Problem in a Wireless Sensor Networks. Proceedings of the 2nd ACM International Workshop on Wireless Sensor Networks and Applications (WSNA'03), San Diego, California, U S A,2003, 115-121
    [57]Huang CF, Tseng YC, Lo LC. The coverage problem in three-dimensional wireless sensor networks. In:Shah R, ed. Proc. of the CLOBECOM. Dallas: IEEE Press.2004,3182-3186
    [58]Li Ming He. Time Synchronization for Wireless Sensor Network,2009 10th ACIS International Conference on Software Engineering.2009,438-442

© 2004-2018 中国地质图书馆版权所有 京ICP备05064691号 京公网安备11010802017129号

地址:北京市海淀区学院路29号 邮编:100083

电话:办公室:(+86 10)66554848;文献借阅、咨询服务、科技查新:66554700