期刊文献+

无线传感器网络中一种能量均衡的基于连通支配集的数据收集算法 被引量:14

An Energy-Balanced Connected Dominating Sets for Data Gatheringin Wireless Sensor Networks
下载PDF
导出
摘要 采用连通支配集来构建虚拟骨干可以减轻无线传感器网络的广播风暴问题.目前已有大量工作通过构造最小连通支配集形成网络虚拟骨干来进行高效数据收集.然而,最小连通支配集并不能有效均衡节点的能量耗费,导致网络生命周期较短.提出了一种能量均衡的基于连通支配集的分布式算法EBCDS来进行数据收集,通过选择能量水平和度均比较大的节点组成连通支配集,支配集中的节点组成一个规模不大但具有较高能量水平的网络骨干.网络中的所有数据沿骨干在较小的寻路空间中转发,能够节省节点能量,使骨干节点不会因为能量不足而过早死亡.理论分析表明,EBCDS能以O(nlogn)的消息复杂度构造连通支配集,仿真实验表明,EBCDS能有效节省节点能耗并延长网络生命周期. Connected Dominating Sets(CDS) has been proposed as the virtual backbone to alleviate the broadcasting storm problem and perform some other tasks such as data gathering in wireless sensor networks.Many previous researches mainly focus on how to construct a small virtual backbone for high efficient data gathering,which is modeled as the Minimum Connected Dominating Set(MCDS) problem.However,the MCDS cannot balance the energy consumptions among nodes,which shorten the network lifetime.Therefore,it is desirable to construct an energy-balanced CDS.In this paper,a novel distributed schema,called EBCDS(Energy-Balanced Connected Dominating Sets) algorithm is proposed to balance the energy consumption of the network and enlarge the network lifetime.In EBCDS,each node in the CDS has high energy and large degree,and these nodes form a virtual backbone in the network.By transmitting data through the backbone with small routing space,each node can preserve its energy effectively.Moreover,the nodes in the backbone would not die quickly because of lacking of energy.Theoretical analyses show that EBCDS can construct a CDS with O(nlogn) message complexity,and simulations results prove the efficiency of the proposed algorithm in terms of energy consumption and network lifetime.
出处 《电子学报》 EI CAS CSCD 北大核心 2013年第8期1521-1528,共8页 Acta Electronica Sinica
基金 国家自然科学基金(No.61103245) 广西省自然科学基金(No.2012GXNSFBA053163)
关键词 能量均衡 连通支配集 数据收集 无线传感器网络 energy-balanced connected dominating sets data gathering wireless sensor networks
  • 相关文献

参考文献12

  • 1郑婵,孙世新,黄天云.Ad Hoc网络和无线传感器网络中连通支配集的分布式构造(英文)[J].软件学报,2011,22(5):1053-1066. 被引量:14
  • 2郜帅,张宏科.时延受限传感器网络移动Sink路径选择方法研究[J].电子学报,2011,39(4):742-747. 被引量:24
  • 3Kim Donghyun, Wu Yiwei, Li Yingshu, et al. Constructing minimum connected dominating sets with bounded diameters in wireless networks[ J]. IEEE Transactions on Parallel and Dis- tributed Systems, 2009,20(2 ) : 147 - 157.
  • 4Du Hongwei, Ye Qiang, Wu Weili, et at. Constant appmxima- aon for virtual backbone construction with guaranteed routing cost in wireless sensor networEs[A]. In Proc. of the 30th IEEE International Conference on Computer Communications (INFO- UOM 2011) [C]. Shanghai,China:IEEE 2011.1737- 1744.
  • 5Sajid Hussain, Mubashsharul I. Shafique, Laurence T Yang. Constructing a CDS-based network backbone for energy effi- ciency in industrial wireless sensor networkE A]. In Proc of the 12th IEEE International Conference on High Performance Computing and Communications ( HPCC 2010 ) [ C ]. Mel- bourne, VIC, Australia: IF, RE 2010.322 - 328.
  • 6Khalid Ateyia M. Almahorg, Sagar Naik, Shen Xuemin. Effi- cient localized protocols to compute connected dominating sets for Ad Hoc networks[ A]. In Proc of the IEEE Global Commu- nications Conference (Globecom 2010) [ C]. Miami, Florida, USA: IEE 2010.1 - 5.
  • 7Wu Yiwei, Li Yingshu. Construction algorithms for k-connected m-dominating sets in wireless sensor networks[ A]. In Proc of the 9th ACM International Symposium on Mobile Ad Hoc Net-working and Computing ( MobiHoc 2008 ) [ C ]. New York, NY, USA: ACM,May 2008.83 - 90.
  • 8Donghyun Kim, Wang Wei, Li Xianyue, Zhang Zhao, Wu Weili. A new constant factor approximation for computing 3- connected m-dominating sets in homogeneous wireless net- works~ A1. In Proc of the 29th 1EEE Intemalional Conference on Computer Communications ( INFEX2OM 2010) [ C ]. San Diego, CA, USA: IEEE Computer Society,2010.1 - 9.
  • 9M T Thai, Zhang N, R Tiwari, Xu X. On approximation algo- rithms of k-connected m-dominating sets in disk graphs [ J ]. Theoretical Computer Science, 2007,385( 1 ) :49 - 59.
  • 10Andreas Larsson, Philipp Tsigas. A self-stabilizing ( k, r)- clustering algorithm with multiple paths for wireless Ad-hoc networks[ A]. In Proc of the 31 st International Conference on Distributed Computing Systems (I 2011)[ C]. Min- neapolis, MN, USA: IF.FF. 2011.353 - 362.

二级参考文献59

  • 1Basu P, Khan N, Little TDC. A mobility based metric for clustering in mobile ad hoc networks. In: Proc. of the 21st Int'l Conf. on Distributed Computing Systems Workshops (ICDCSW 2001). 2001. [doi: 10.1109/CDCS.2001.918738].
  • 2ER II, Seah WKG. Mobility-Based d-hop clustering algorithm for mobile ad hoc networks. In: Proc. of the WCNC 2004. 2004. [doi: 10.1109/WCNC.2004,1311457].
  • 3Wu J. An enhanced approach to determine a small forward node set based on multipoint relay. In: Proc. of the 58th IEEE Seminannual Vehicular Technology Conf. (VTC 2003-Fall). Orlando, 2003. [doi: 10.1109/VETECF.2003.1286086].
  • 4Kumar S, Lai TH, Balogh JO. On k-coverage in a mostly sleeping sensor network. In: Proc. of the MobiCom. 2004. Idol: 10.I145/I023720.1023735].
  • 5Bahramgiri M, Hajiaghayi M, Mirrokni VS. Fault-Tolerant and 3-dimensional distributed topology control algorithms in wireless multi-hop networks. In: Proc. of the ICCCN. 2002. [doi: 10.1007/sl 1276-005-5265-z].
  • 6Li XY, Wan P J, Wang Y, Yi CW. Fault tolerant deployment and topology control in wireless networks. In: Proc. of the MobiHoc. 2003. [doi: 10.1145/778415.778431].
  • 7Basu P, Redi J. Movement control algorithms for realization of fault tolerant ad hoc robot networks. IEEE Networks, 2004,18(4): 36-44. [doi: 10.1109/MNET.2004.1316760].
  • 8ki N, Hou JC. Localized fault-tolerant topology control in wireless ad hoc networks. IEEE Trans. on Parallel and Distributed Systems, 2006,17(4):307-320. [doi: 10.1109/TPDS.2006.51].
  • 9Li LE, Halpern JY, Bahl P, Wang YM. A cone-based distributed topology-control algorithm for wireless multi-hop networks. IEEE/ACM Trans. on Networking, 2005,13 (1): 147-159. [doi: 10. 1109/TNET.2004.842229].
  • 10Bettstetter C. On the minimum node degree and connectivity of a wireless multihop network. In: Proc. of the ACM MobiHoc. 2002. [doi: 10.1145/513800.513811].

共引文献34

同被引文献145

引证文献14

二级引证文献58

相关作者

内容加载中请稍等...

相关机构

内容加载中请稍等...

相关主题

内容加载中请稍等...

浏览历史

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