期刊文献+

无线传感器网络中能量有效的最小连通支配集算法

An energy-efficient minimum connected dominating set algorithm in wireless sensor network
下载PDF
导出
摘要 提出了一种分布式最小连通支配集求解算法,对Rule K算法中的标记算法进行了优化,从而形成了连通支配集,并通过新的剪枝算法对连通支配集进行了有效缩减.模拟仿真结果表明:在增加算法复杂度的前提下,该算法求得的连通支配集比前算法更小. Minimum connected dominating set(MCDS) is a NP-C problem,and it is generally solved using approximate methods.A distributed minimum connected dominating set algorithm is proposed.It optimizes the marking process of the Rule K algorithm to construct a connected dominating set,and a new pruning algorithm is formed to reduce CDS.The simulation results show that the size of the connected dominating set is smaller than the previous dominating set.
作者 于晓 付春
出处 《西安石油大学学报(自然科学版)》 CAS 北大核心 2012年第5期102-105,12,共4页 Journal of Xi’an Shiyou University(Natural Science Edition)
关键词 无线传感器网络 最小连通支配集 剪枝算法 wireless sensor network minimum connected dominating set pruning algorithm
  • 相关文献

参考文献10

  • 1Estrin D. Wireless sensor networks tutorial part IV : sensor network protocols [ C ]. Procedings of the ACM Mobile Computing and Networking, Atlanta, GA,2002.
  • 2Van Veen B D, Buckley K M. Beamforming: a versatile approach to spatial filtering [ C ]. IEEE, ASSP, April 1988:4-24.
  • 3Guha S, Khuller S. Approxmation algorithims for connect- ed dominating sets [ J ]. Algorithmica, 1998,20 ( 4 ) : 374- 387.
  • 4Wu J, Li H. On calculating connected dominating set for efficient routing in ad hoc wireless networks [ C ]. Pro-ceedings of 3rd International Workshop on Discrete Algo- rithms and Methods for Mobile Computing and Communi- cations, ACM, 1999:7-14.
  • 5Lee J, Mans B. Energy efficient virtual backbones for re- ception aware MANET [J]. Vehicular Technology Confer- ence, Montreal : IEEE ,2006,3 : 1097-1101.
  • 6Das B, Harghavan V B. Routing in ad Hoc networks using minimum connected dominating sets [ C ]. IEEE Interna- tional Conference on Communications (ICC97). Monreal, Quebec, Canada, 1997 : 1-20.
  • 7Dai F, Wu J. An extended localized algorithm for connect- ed dominating set formation in ad hoc wireless networks [ J ]. IEEE Trans on Parallel and Distributed Systems, 2004,15(10) :908-920.
  • 8毛莺池,冯国富,陈力军,陈道蓄.与位置无关的无线传感器网络连通性覆盖协议[J].软件学报,2007,18(7):1672-1684. 被引量:18
  • 9崔国华,洪帆,余祥宣.确定平面点集凸包的一类最优算法[J].计算机学报,1997,20(4):330-334. 被引量:15
  • 10刘光惠,陈传波.求解简单多边形和平面点集凸包的新算法[J].计算机科学,2007,34(12):222-226. 被引量:13

二级参考文献47

  • 1孔宪庶,蔡洪学.简单多边形凸包的双动线检测算法[J].计算机学报,1994,17(8):596-600. 被引量:18
  • 2崔国华,洪帆,余祥宣.确定平面点集凸包的一类最优算法[J].计算机学报,1997,20(4):330-334. 被引量:15
  • 3Akyildiz IF,Su W,Sankarasubramaniam Y,Cayirci E.Wireless sensor networks:A survey.Computer Networks,2002,38(4):393-422.
  • 4Ren FY,Huang HN,Lin C.Wireless sensor networks.Journal of Software,2003,14(7):1282-1291.http://www.jos.org.cn/1000-9825/14/1282.htm
  • 5Stojmenovic I.Position based routing in ad hoc networks.IEEE Communications Magazine,2002,40(7):128-134.
  • 6Wan PJ,Alzoubi KM,Frieder O.Distributed construction of connected dominating set in wireless ad hoc networks.In:Kermani P,ed.Proc.of the IEEE Infocom.New York:IEEE Press,2002.1597-1604.
  • 7Das B,Sivakumar R,Bhargavan V.Routing in ad hoc networks using a spine.In:Makki K,ed.Proc.of the Int'l Conf.on Computer Communications and Networks (ICCCN).Los Alamitos:IEEE Press,1997.34-41.
  • 8Qayyum A,Viennot L,Laouiti L.Multipoint relaying:An efficient technique for flooding in mobile wireless networks.Technical Report,3898,INRIA-Rapport de Recherché,2000.
  • 9Alzoubi KM,Wan PJ,Frieder O.Message-Optimal connected dominating sets in mobile ad hoc networks.In:Hubaux JP,ed.Proc.of the ACM Int'l Symp.on Mobile Ad Hoc Networking and Computing (MobiHoc).New York:ACM Press,2002.157-164.
  • 10Chen Y,Liestman A.Approximating minimum size weakly-connected dominating sets for clustering mobile ad hoc networks.In:Hubaux JP,ed.Proc.of the ACM Int'l Symp.on Mobile Ad Hoc Networking and Computing (MobiHoc).New York:ACM Press,2002.165-172.

共引文献43

相关作者

内容加载中请稍等...

相关机构

内容加载中请稍等...

相关主题

内容加载中请稍等...

浏览历史

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