期刊文献+

无线传感器网络中能耗均衡的覆盖控制算法 被引量:4

An Energy-Cost-Balancing Coverage Control Algorithm for Wireless Sensor Networks
下载PDF
导出
摘要 覆盖控制作为无线传感器网络的一个基本问题,对网络的生存时间、部署策略、通信协议和组网等问题的解决具有重要影响。在传感器节点随机冗余部署方式下,传统的方式是在保证覆盖要求和通信连通的前提下仅将最少量的节点投入活跃工作状态,从而降低网络能耗。但是,若频繁地激活同一批节点,会造成这些节点由于能耗过快而较早失效,使整个网络的冗余程度降低。然而,冗余度是传感器网络在单个节点性能有限的情况下提高整个网络的可靠性、容错性、精确性等的基础。为此,本文提出了一个能耗均衡ECB的覆盖问题,指出它是NP完全的,并给出了一个集中式近似算法。该算法根据节点的剩余能量赋于每个节点非负权,再基于Voronoi划分和贪心边方法,在保证覆盖要求的同时选择权和最小的节点激活。仿真实验结果表明,ECB算法求得的活跃节点集小,可以达到有效覆盖,并且可以保持网络的冗余度。 One of the most fundamental problems in wireless sensor networks is the coverage control problem. It is very important to network lifetime, deployment strategy, communication protocol and sensor networking. When a large sensor population is deployed in the drop zone, the traditional approach to conserving system energy is to keep only a minimal number of sensors active, which maintains the communication cormectivity and covers the target region completely. However, if some nodes burn energy more frequently so as to be disabled, the whole network redundancy that is the basis to improve reliability, fault-tolerance and accuracy will decline. Therefore, an energy-cost-balancing (ECB) coverage control algorithm is proposed in this paper. It weighs every node according to its power availablity and topology, activates some nodes with the minimum weight sum through centralized Voronoi tessellation and greedy edges to ensure coverage. Experimental results show that the activated nodes set that ECB constructs is small and can cover the target area besides maintaining network redundancy.
出处 《计算机工程与科学》 CSCD 2008年第12期15-18,共4页 Computer Engineering & Science
基金 国家973计划资助项目(613610202)
关键词 无线传感器网络 覆盖控制 能耗均衡 VORONOI划分 wireless sensor network coverage control energy-cost-balancing Voronoi tessellation
  • 相关文献

参考文献7

  • 1Hefeeda M, Bagheri M. Randomized k-Coverage Algorithms for Dense Sensor Networks [C]//Proc of INFOCOM' 07 2007 : 2376-2380.
  • 2任彦,张思东,张宏科.无线传感器网络中覆盖控制理论与算法[J].软件学报,2006,17(3):422-433. 被引量:156
  • 3Wu Yongan, Li Min, Cai Zhiping, et al. A Distributed Algorithrn to Approximate Node-Weighted Minimum α-Connected (θ, κ)-Coverage in Dense Sensor Networks[C]//Proc of the Int'l Frontiers of Algorithrnies Workshop, 2008.
  • 4Slijepcevic S, Potkonjak M. Power Efficient Organization of Wireless Sensor Networks [C]//Proc of the Int'l Conf on Communications, 2001:472-476.
  • 5Gupta H, Bas S R, GU Q. Connected Sensor Cover: Self- Organization of Sensor Networks for Efficient Query Execution[C]//Proc of ACM MobiHoc'03,2003 : 189-200.
  • 6蒋杰,方力,张鹤颖,窦文华.无线传感器网络最小连通覆盖集问题求解算法[J].软件学报,2006,17(2):175-184. 被引量:90
  • 7Okabe A, Boots B, Sugihara K, et al. Spatial Tessellations:Concepts and Applications of Voronoi Diagram[M]. 2nd ed, New York: John Wiley & Sons, 1999.

二级参考文献19

  • 1Bulusu N,Heidemann J,Estrin D.GPS-Less low cost outdoor localization for very small devices.IEEE Personal Communications Magazine,2000,7(5):28-34.
  • 2He H,Huang C,Blum BM,Stankovic JA,Abdelzaher TF.Range-Free localization schemes in large scale sensor networks.In:Johnson DB,ed.Proc.of the ACM MobiCom 2003.San Diego:ACM Press,2003.81-95.
  • 3Romer K,Zurich E.The lighthouse location system for smart dust.In:Siewiorek D,ed.Proc.of the 1st Int'l Conf.on Mobile Systems,Applications,and Services.San Francisco:ACM Press,2004.15-30.
  • 4Okabe A,Boots B,Sugihara K,Chiu S.Spatial Tessellations:Concepts and Applications of Voronoi Diagram.2nd ed.,New York:John Wiley & Sons,1999.
  • 5Hochbaum DS.Approximation Algorithms for NP-Hard Problems.Cambridge:PWS Publishing Company,1995.
  • 6Cormen TH,Leiserson CE,Rivest RL,Stein C.Introduction to Algorithms.2nd ed.,Cambridge:MIT Press,2001.
  • 7Yah T,He T,Stankovic J.Differentiated surveillance service for sensor networks.In:Akyildiz IF,Estion D,eds.Proc.of the 1st Int'l Conf.on Embedded Networked Sensor Systems.Los Angels:ACM Press,2003.51-63.
  • 8Gupta H,Das SR,GU Q.Connected sensor cover:Self-Organization of sensor networks for efficient query execution.In:Gerla M,ed.Proc.of the ACM MobiHoc 2003.Annapolis:ACM Press,2003.189-200.
  • 9Akyildiz IF,Su W,Sankarasubramaniam Y,Cayirci E.Wireless sensor networks:A survey.Computer Networks,2002,38(4):393-422.
  • 10Elson J,Estrin D.Sensor Networks:A Bridge to the Physical World.Norwell:Kluwer Academic Publishers,2004.3-20.

共引文献223

同被引文献41

  • 1张玉国,赵湛,方震,郭鹏.无线传感器网络节点能量供应系统设计[J].微计算机信息,2008(4):129-130. 被引量:11
  • 2蒋杰,方力,张鹤颖,窦文华.无线传感器网络最小连通覆盖集问题求解算法[J].软件学报,2006,17(2):175-184. 被引量:90
  • 3周培德.计算几何[M].北京:清华大学出版社,2000..
  • 4Cai Wenyu,Liu Jingbiao,Zhang Xueting. CDS-based coveragecontrol algorithm for buoys sensor networks [ C ]//Proc ofOCEANS 2010. Sydney:IEEE,2010:l-5.
  • 5蔡文郁,刘敬彪,章雪挺.一种海洋浮标传感监测网:中国,200920294859. 2[P]. 2010-08-18.
  • 6Huang C F,Tseng Y C. The coverage problem in a wirelesssensor network [ C ]//Proc of the ACM int,1 workshop onwireless sensor networks and applications ( WSNA). NewYork:ACM Press,2003:115-121.
  • 7Feng X, Kumar P R. The number of neighbors needed for con-nectivity of wireless networks[ J] . Wireless networks,2004,10(2):169-181.
  • 8Tan Li, Chen Yucheng, Yang Minh, et al. Priority Coverage Algo-rithm and Performance Simulation for Node Deployment in Direc-tional Sensor Networks[J]. Sensor Letters,2014,12(2) :275-280.
  • 9Xiao Yang L, Kai Liang W, Yanmin Z, et al. Mobility Increasesthe Surface Coverage of Distributed Sensor Networks [J]. Comput-er Networks ,2013,57: 2348-2361.
  • 10Wei L, Wei Z. Coverage Hole and Boundary Nodes Detection inWireless Sensor Networks [J]. Journal of Network and ComputerApplication,2015,45 : 35-43.

引证文献4

二级引证文献23

相关作者

内容加载中请稍等...

相关机构

内容加载中请稍等...

相关主题

内容加载中请稍等...

浏览历史

内容加载中请稍等...
;
使用帮助 返回顶部