期刊文献+
任意字段
题名或关键词
题名
关键词
文摘
作者
第一作者
机构
刊名
分类号
参考文献
作者简介
基金资助
栏目信息

无线传感器网络最小连通覆盖的节能算法 被引量：7

Energy Saving Algorithm for MCCS in WSN
下载PDF
导出
摘要 网络的生存期是WSN发展的一个障碍,降低能耗是WSN设计的一个方向,在性能得以保障的前提下,用最少的节点投入工作是节能的有效方法。在目标区域中寻找最小连通覆盖集(MCCS)是一个NP问题,设计了通过CVT+MST构造MCCS的节能算法,当节点的通讯半径大于等于感知圆盘2倍时,CVT求得的就是MCCS,否则需要用MST算法计算WSN的最大独立子集添加辅助节点使之成为MCCS,通过仿真和性能分析,上述节能算法具有时间复杂度低,满足节点均匀环境的要求,为延长网络生存期的研究提供了依据。 The drawback in the development of WSN is its network life cycle. One of the aims of WSN design is to reduce energy consumption, i.e. , to apply the minimum nodes without sacrificing efficiency is a valid method to save energy. Searching for MCCS in the target area is an NP problem, which provides an energy-saving algorithm based on CVT＋MST structure. When the communication radius of the node is twice as long as that of the perception disc, the result of CVT is MCCS, otherwise, the MST algorithm should be applied to calculate the maximum independent sub- sets of WSN appending auxiliary nodes, thus to get MCCS. Through the simulation and the performance analysis, the energy-saving algorithm provides the rationales for the study of prolonging the network life cycle with the advantage of low time complexity and meeting the needs of well-distributed condition of the nodes.
作者 陈业纲 徐则同
机构地区 长江师范学院数学与计算机学院 中国科学院数学研究所
出处 《计算机仿真》 CSCD 北大核心 2014年第3期324-327,350,共5页 Computer Simulation
基金 重庆市教委科学技术研究项目(KJ131322)
关键词 最小连通覆盖集 最大独立子集 无线传感器网络 MCCS Maximum independent sets WSN
分类号 TP393 [自动化与计算机技术—计算机应用技术]
  • 相关文献

参考文献19

  • 1S Slijepcevic, M Potkonjak. Power efficient organization of wireless sensor networks [ C ]. In : Glisic S, ed. Proc. of the IEEE Intel Conf on Communications(ICC) , Helsinki: IEEE Press, 2001:472 -476.
  • 2M Cardei, D Z Dn. Improving wireless sensor network lifetime through power aware organization [ J ]. Wireless Networks, 2005, 11 (3) :333-340.
  • 3T Yan, T He, J A Stankovic. Differentiated surveillance for sensor networks [ C ]. In : Akyildiz IF, Estion D, eds. Proc. of the ACMInt' 1 Conf. on Embedded Netwoi'ked Sensor Systems ( SenSys ) , New York: ACM Press, 2003 : 51-62.
  • 4D Tian, N D Georganas. A node scheduling scheme for energy conservation in large wireless sensor networks. Wireless Optimiza- tion in Mobile, Ad Hoc and Wireless Networks[J]. Sophia-Anti- polis: IEEE Press, 2003:50-52.
  • 5F Ye, G Zhong, J Cheng, S W Lu, L X Zhang. PEAS: A robust energy conserving protocol for long- lived sensor networks. In: Stankovic J, Zhao W, eds. Proc. of the Int' 1 Conf. on Distributed Computing Systems ( ICDCS ) [ J ]. Providence : IEEE Press, 2003.
  • 6S Megerian, F Koushanfar, M Potkonjak, Srivastava MB. Worst and best-case coverage in sensor networks. IEEE Trans[J]. on Mobile Computing, 2005,4 ( 1 ) :84-92.
  • 7J Cortes, S Martinez, T Karatas, F Bullo. Coverage control for mo- bile sensing networks[J]. IEEE Trans. on Robotics and Automa- tion, 2004,20(2) :243-255.
  • 8S Meguerdichian, F Koushanfar, M Potkonjak, M B Srivastava. Coverage problems in wireless ad-hoc sensor network [ C ]. In: Sengupta B, ed. Proc. of the IEEE INFOCOM, Anchorage : IEEE Press, 2001. 1380-1387.
  • 9X Y Li, P J Wan, O Frieder. Coverage in wireless ad hoc sensor networks[ J]. IEEE Trans. on Computers, 2003,52 (6) : 753 - 763.
  • 10S Meguerdicbian, F Koushanfar G, Qu, M Potkonjak. Exposure in wireless ad-hoc sensor networks [ C ]. In : Rose C, ed. Proc. of the ACM Int' 1 Conf. on Mobile Computing and Networking (MobiCom), New York: ACM Press, 2001. 139-150.

二级参考文献18

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

共引文献89

同被引文献75

引证文献7

二级引证文献23

计算机仿真
2014年 第3期

相关作者

内容加载中请稍等...

相关机构

内容加载中请稍等...

相关主题

内容加载中请稍等...

浏览历史

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