期刊文献+

无线传感器网络中使用连通支配集的最小能耗广播算法 被引量:4

Minimum-energy Broadcast Algorithm in Wireless Sensor Networks Using Connected Dominating Sets
在线阅读 下载PDF
导出
摘要 广播是无线传感器网络中一种基本而重要的操作,其能耗大小对整个网络性能有着重要影响.在节点传输半径固定的情况下,考虑到无线通信的多向传输等特性,无线传感器网络广播操作中参与转发的节点数越少,则广播操作总能耗也就越小.如何寻找最少转发节点的广播树问题等同于求解图论中的最小连通支配集问题,这是一个NP难问题.本文提出了一种有效的构造最小连通支配集的启发式算法(EMCDS)来构造广播树,在此基础上提出了一种无线传感器网络中的最小能耗广播算法(MEBA).实验结果表明,EMCDS算法能够找到较小的连通支配集,而MEBA算法可依据节点剩余能量来动态选择转发节点,通过实现节点能量的均衡分布来有效延长网络的生命周期. Broadcast is a fundamental and essential operation in the wireless sensor networks. The energy consumption of broadcast operation has an important influence on the network performance. In case that the transmission range of the sensors is a constant value and the broadcasting characteristic of wireless communication is considered, it is seen that the less nodes involved in the relay-and-for- ward process, the smaller total energy consumption resulted in the broadcast operation. The problem to find the minimum forwarding nodes for a given network is equivalent to find the minimum connected dominating set in graph theory, which is a NP-hard problem. In this paper~ we have proposed an Effective heuristic algorithm to construct a Minimum Connected Dominating Set { EMCDS), and then proposed a Minimum-Energy Broadcast Algorithm { MEBA } for wireless sensor networks. The experimental results have shown that the EMCDS algorithm can find smaller connected dominating set and the MEBA algorithm can dynamically select the forwarding nodes according to the remained energy, and prolong the network lifetime efficiently accordingly by energy balance among the nodes.
出处 《小型微型计算机系统》 CSCD 北大核心 2014年第1期74-79,共6页 Journal of Chinese Computer Systems
基金 福建省自然科学基金项目(2011J01345)资助 福建省教育厅科技项目(2012JA12027)资助 福州大学发展基金项目(2008-XQ-23)资助 福建省科技创新平台项目(2009J1007)资助
关键词 无线传感器网络 最小连通支配集 最小能耗广播 网络生命周期 wireless sensor networks minimum connected dominating set minimum-energy broadcast lifetime of network
  • 相关文献

参考文献12

  • 1彭伟,卢锡城.移动自组网络中采用连通支配集的有效广播技术(英文)[J].软件学报,2001,12(4):529-536. 被引量:8
  • 2Das A K,Marks R J,El-Sharkawi M,et al,r-shrink:a heuristicfor improving minimum power broadcast trees in wireless networks[C].In:Proceedings of IEEE GLOBECOM,2003:523-527.
  • 3Tseng Y C,Ni S Y,Chen J P.The broadcast storm problem in amobile ad hoc network[J].Wireless Networks,2002,8(2):153-167.
  • 4Alzoubi K M,Wan P J.Distributed heuristics for connected domina-ting set in wireless ad hoc networks[J].IEEE Com Soc/KICSJournal on Communication Networks,2002,4(1):22-29.
  • 5Cagalj M,Hubaux J P,Enz C.Minimum-energy broadcast in all-wireless networks:NP.completeness and distribution issues[C].In:Proceedings of the 8th Annual International Conference on Mo-bile Computing and Networking,2002:172-182.
  • 6dementi A E F,Crescenzi P,Penna P,et al.On the complexity ofcomputing minimum energy consumption broadcast subgraphs[C].In:Proceedings of the 18th Annual Symposium on Theoreti-cal Aspects of Computer Science,2001:121-131.
  • 7Wieselthier J E,Nguyen G D,Ephremides A.On the construction ofenergy-efficient broadcast and multicast trees in wireless networks[C].In:Proceedings of the IEEE INFOCOM,2000:58:5-594.
  • 8Lou W,Wu J.Toward broadcast reliability in mobile ad hoc net-works with double coverage[J].IEEE Transactions on MobileComputing,2007,6(2):148-163.
  • 9Montemanni R,Gambardella L M,Das A K.The minimum powerbroadcast problem in wireless networks:a simulated annealing ap-proach[C].In:Proceedings of the Wireless Communications andNetworking Conference,2005:2057-2062.
  • 10Han B,Fu H H,Lin L D,et al.Efficient construction of connecteddominating set in wireless ad hoc networks[C].Mobile Ad-hoc andSensor Systems,EEEE International Conference on,2004:570-572.

二级参考文献8

共引文献14

同被引文献37

  • 1Tseng Y,Ni S,Chen Y,et al.The broadcast storm problem in a mobile Ad-Hoc network[J].Wireless Networks,2002,8(2/3):153-167.
  • 2Gao S,Vu C T,Li Y S.Sensor scheduling for k-coverage in wireless sensor networks[C]∥Proc of the MSN,2006:268-280.
  • 3Ravi Prakash.A routing algorithm for wireless Ad Hoc networks with unidirectional links[J].Wireless Networks,2001,7:617-625.
  • 4Alzoubi K M,Wan P J,Freider O.Distributed heuristics for connected dominating set in wireless Ad Hoc networks[J].IEEE Com Soc/KICS Journal on Communication Networks,2002,4(1):22-29.
  • 5Han Bo,Fu Haohuan,Lin Lidong,et al.Efficient construction of connected dominating set in wireless Ad Hoc networks[C]∥2004IEEE International Conference on Mobile Ad-Hoc and Sensor Systems,2004:570-572.
  • 6Gao Bo,Yang Yuhang,Ma Huiye.A new distributed approximation algorithm for constructing minimum connected dominating set in wireless Ad Hoc networks[C]∥Proceedings of the Second International Symposium on Parallel and Distributed Processing and Applications,ISPA 2004,Hong Kong,China,2004:3358.
  • 7Yick J, Mukherjee B, Ghosal D. Wireless Sensor Network Survey[j].Computer Networks,2008,52( 12) :2292-2330.
  • 8Liu Z, Wang B W, Guo L J. A Survey on Connected DominatingSet Construction Algorithm for Wireless Sensor Networks [J]. In-formation Technology ,2010,9(6) : 1081-1092.
  • 9Garey M R, Johnson D S. Computers and Intractability : A Guideto the Theory of NP-Completeness [M]. New York: W H Freeman& Co., 1979.
  • 10Johnson D S. The NP-completeness column:the many limits on ap-proximation [j]. ACM Transactions on Algorithms, 2006,2(3):473-489.

引证文献4

二级引证文献5

相关作者

内容加载中请稍等...

相关机构

内容加载中请稍等...

相关主题

内容加载中请稍等...

浏览历史

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