期刊文献+

无线传感器网络中具有容错能力的连通支配集构造算法 被引量:3

Construction of fault tolerant connected dominating sets in WSN
下载PDF
导出
摘要 根据无线传感器网络中虚拟骨干节点极易失效的问题,建立了一个具有容错能力的连通支配集。首先提出了一种分布式连通支配集构造算法DACDS;然后在这个算法基础上,根据一般构造容错支配集的规则,提出了容错算法kCDS;最后根据该算法的缺点,对其作了一个改进,并对kCDS和改进kCDS算法进行了仿真。仿真结果表明,改进kCDS算法具有更好的性能。 It is neeessary to construct a fault tolerant CDS because the nodes of CDS are subject to failure. This paper proposed a distributed CDS construction algorithm DACDS, and with DACDS,then proposed a fault tolerant CDS construction algorithm kCDS based on the general fault tolerant rules. Then modified the kCDS algorithm based some local messages, and also simulated the algorithm kCDS and modified kCDS. The results show the modified kCDS has better performance.
出处 《计算机应用研究》 CSCD 北大核心 2010年第1期292-294,313,共4页 Application Research of Computers
基金 国家自然科学基金资助项目(60434030 60374072)
关键词 无线传感器网络 虚拟骨干 极大独立集 连通支配集 容错 wireless sensor network (WSN) virtual backbone maximum independent set connected dominating set (CDS) fault tolerant
  • 相关文献

参考文献12

  • 1NI S Y,TSENG Y C,CHEN Y S,et al. The broadcast storm problem in a mobile Ad hoc network [ C ]//Proc of MOBICOM. 1999:151- 162. 被引量:1
  • 2WAN Peng-jun, ALZOUBI K M, FRIEDER O. Distributed construction of connected dominating set in wireless Ad hoc networks [ J ]. Mobile Networks and Applications ,2004,9 (2) : 141-149. 被引量:1
  • 3LI Y S,THAI M T,WANG F,et al. On greedy construction of connected dominating sets in wireless networks[ J]. Wiley Journal on Wireless Communications and Mobile Computing, 2005,5 ( 8 ) : 927- 932. 被引量:1
  • 4WU W L,DU H W,JIA X H,et al. Minimum connected dominating sets and maximal independent sets in unit disk graphs [ J ]. Theoretical Computer Science ,2006,352 ( 1-3 ) : 1-7. 被引量:1
  • 5LI Y, ZHU S, THAI M T, et al. Localized construction of connected dominating set in wireless networks [ C ]//Proc of NSF International Workshop on Theoretical Aspects of Wireless Ad hoc, Sensor and Peer-to-Peer Networks. 2004. 被引量:1
  • 6DAI F,WU J. On constructing k-connected k-dominating set in wireless networks[ C]//Proc of IEEE International Parallel and Distributed Processing Symposium. Los Alamitos: IEEE Computer Society Press, 2005. 被引量:1
  • 7WANG Feng,THAI M T,DU Ding-zhu. 2-connected virtual backbone in wireless networks [ J ]. IEEE Trans on Wireless Communications ,2009,8 ( 3 ) : 1230-1237. 被引量:1
  • 8SHANG W P, WAN P J, YAO F F, et al. Algorithms for minimum m-connected k-tuple dominating set problem [ J ]. Theoretical Computer Science,2007,381 (1-3) :241-247. 被引量:1
  • 9THAI M T, ZHANG N, TIWARI R, et al. On approximation algorithms of k-connected m-dominating sets in disk graphs [ J ]. Theoretical Computer Science ,2007,385 ( 1 - 3 ) :49- 59. 被引量:1
  • 10WU Y, WANG F,THAI M T,et al. Constructing k-connected m-domi-nating sets in wireless sensor networks[ C]//Proc of Military Communications Conference. 2007:29-31. 被引量:1

同被引文献107

引证文献3

二级引证文献25

相关作者

内容加载中请稍等...

相关机构

内容加载中请稍等...

相关主题

内容加载中请稍等...

浏览历史

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