期刊文献+

无线传感器网络(k,m)-容错连通支配集的分布式构建 被引量:2

Distributed Construction for (k,m)-Fault Tolerant Connected Dominating Set in Wireless Sensor Network
下载PDF
导出
摘要 采用连通支配集作为虚拟骨干可以延长无线传感器网络的生命时间,但是考虑到节点容易失效,虚拟骨干还需要具有一定的容错性。对此,针对任意k和m取值,提出了一种完全分布式的k-连通m-支配集构建算法,其中k-连通保证了网络中支配节点之间的容错性,m-支配则保证了普通节点与支配节点之间的容错性。该算法可以在异构网络中进行扩展,首先构建连通支配集,然后采用最大独立集和贪心的思想将普通节点进行m支配,最后在局部拓扑中通过公共邻居节点将连通支配集扩展为k-连通。仿真实验证实,该算法可以通过较低的通信开销获得规模较优的k-连通m-支配集。 Virtual backbone based on connected dominating set can prolong the lifetime of wireless sensor network.However,considering nodes are prone to failure,virtual backbone also needs to have a certain degree of fault tolerance.In this regard,a fully distributed algorithm was proposed for fault tolerance constructing k-connected m-dominated set for arbitrary kand mvalues.The algorithm can be extended in the heterogeneous network.It constructs connected dominating set firstly,then makes all common nodes m-dominating with the idea of maximum independent set and greedy,and finally extends the connected dominated set k-connectivity by the common neighbor nodes in the local topology.Simulation experiments confirm that the algorithm can obtain better size k-connected m-dominating set with low message overhead.
出处 《计算机科学》 CSCD 北大核心 2016年第1期128-132,158,共6页 Computer Science
基金 国家自然科学基金(61402414 61304256 61379123) "十二五"国家科技支撑计划(2012BAD10B01) 浙江省自然科学基金(LQ14F020005 LQ13F030013) 浙江省教育厅项目(Y201431815 Y201327006)资助
关键词 无线传感器网络 容错 k-连通m-支配集 异构 分布式算法 Wireless sensor network Fault tolerance k-connected m-dominated set Heterogeneity Distributed algorithm
  • 相关文献

参考文献17

  • 1Aziz A A, Sekercioglu Y A, Fitzpatrick P, et al. A Survey on Distributed Topology Control Techniques for Extending the I.i- fetime of Battery Powered Wireless Sensor Networks [J]. IEEE Communications Surveys & Tutorials, 2013,15 ( 1 ) .. 121-144.
  • 2Lee S, Mohamed Y. Recovery from multiple simultaneous fai- lures in wireless sensor networks using minimum Steiner tree [J]. Parallel and Distributed Computing, 2010,70(5):525-536.
  • 3洪榛,俞立,张贵军,陈友荣.基于最小连通支配集的无线传感网拓扑构建研究[J].电子与信息学报,2012,34(8):2000-2006. 被引量:6
  • 4奎晓燕,杜华坤,梁俊斌.无线传感器网络中一种能量均衡的基于连通支配集的数据收集算法[J].电子学报,2013,41(8):1521-1528. 被引量:14
  • 5马晨明,王万良,洪榛.异构无线传感器网络中基于CDS树的拓扑控制方法[J].传感技术学报,2014,27(6):814-820. 被引量:6
  • 6Das A, Mandal C, Reade C, et aL An improved greedy construe tion of minimum connected dominating sets in wireless networks [C]//Proe. of IEEE Wireless Communications and Networking Conference. Cancun, Mexico, 2011 : 790 -795.
  • 7He Jing, Ji Shou-ling, Fan Ping-zhi, et al. Constructing a load- balanced virtual backbone in wireless sensor networks [C]// Proe. of International Conference on Computing Networking and Communications. Maui, Hawaii, USA, 2012 : 959-963.
  • 8Dai Fei,Wu Jie. On Constructing k-Connected k-Dominating Set in Wireless Networks[C]//Proc. of the 19th IEEE International Parallel and Distributed Processing Symposium. Denver, Colo- rado, 2005 : 81-90.
  • 9Wang Feng,Thai M T, Du Ding-zhu. On the construction of 2- connected virtual backbone in wireless networks [J]. IEEE Transactions on Wireless Communications, 2009, 8 ( 3 ) : 1230- 1237.
  • 10Xiaofeng Gao,Bosheng Xu,Jun Li.A Distributed Design for Minimum 2-Connected m-Dominating Set in Bidirectional Wireless Ad-Hoc Networks[J].Tsinghua Science and Technology,2012,17(5):553-566. 被引量:3

二级参考文献35

  • 1Kim 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.
  • 2Du 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.
  • 3Sajid 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.
  • 4Khalid 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.
  • 5Wu 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.
  • 6Donghyun 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.
  • 7M 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.
  • 8Andreas 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.
  • 9V Mhatre, C Rosenberg. Design guidelines for wireless sensor networks: communication, clustering and aggregation [ J ]. Ad Hoc Networks, 2004,2( 1 ) :45 - 63.
  • 10R Malholra. IP Routing[M]. O'REILLY,2002.

共引文献26

同被引文献6

引证文献2

二级引证文献2

相关作者

内容加载中请稍等...

相关机构

内容加载中请稍等...

相关主题

内容加载中请稍等...

浏览历史

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