期刊文献+

无线传感器网络中2-连通2-支配集的分布式构造算法 被引量:2

Distributed Construction of 2-Connected 2-Dominating Set in Wireless Sensor Networks
下载PDF
导出
摘要 在无线传感器网络中,通常采用连通支配集来构成一个虚拟骨干网以进行分层路由。本文提出一个2-连通2-支配集的分布式构造算法,由2-连通2-支配集构成的虚拟骨干网在任意1个支配点发生故障时仍能生存。算法的主要思路是从任一节点开始,在局部形成一个由支配点组成的回路,以此回路为基础,不断地形成由支配点组成的回路直到不在回路中的节点是2-支配为止。模拟实验表明,该算法构造的连通支配集的尺寸明显优于现有算法。 set is a p struet a 2 In wireless sensor romising approach networks, for layered a virtual backbone network constructed routing. In this paper we propose a dis by tri a connected dominating buted algorithm to conconnected 2-dominating set. The virtual backbone network constructed by the 2-connected 2 dominating set still exists when any node in the network is failure. It starts from any node, and forms a lo- calized loop made by the dominating nodes. Based on this loop, we continue to construct other loops formed by the dominating nodes until the nodes outside loops are 2-dominated. Simulation results show that the size of the connected dominating set is better than those of the previous works.
出处 《青岛大学学报(工程技术版)》 CAS 2008年第2期22-26,共5页 Journal of Qingdao University(Engineering & Technology Edition)
基金 青岛大学青年科研基金项目资助(QDDX-06-69)
关键词 无线传感器网络 连通支配集 分布式算法 2-点连通 wireless sensor networks connected dominating set distributed algorithm 2-vertex connected
  • 相关文献

参考文献7

  • 1Garey M R, Johnson D S. Computers and Intractability: A Guide to the Theory of NP-Completeness [M]. San Francisco: Freeman, 1978.
  • 2Guha S, Khuller S. Approximation Algorithms for Connected Dominating Sets [J]. Algorithmica, 1998, 20(4) : 374 - 387.
  • 3Wu J. Extended Dominating-Set-Based Routing in Ad Hoc Wirelesss Networks with Unidirectional Links [J]. IEEE Trans on Parallel and Distributed Systems, 2002, 9(3): 189 -200.
  • 4Dai Fei, Wu Jie. An Extended Localized Algorithm for Connected Dominating Set Formation in Ad Hoc Wireless Networks [J]. IEEE Trans on Parallel and Distributed Systems, 2004, 15(10) : 908 - 920.
  • 5Han Bo, Fu Haohuan, Lin Lidong, et al. Efficient Construction of Connected Dominating Set in Wireless Ad Hoc Networks [C]// 2004 IEEE International Conference on Mobile Ad-hoc and Sensor Systems, 2004: 570- 572.
  • 6Basu P, Redi J. Movement Control Algorithms for Realization of Fault Tolerant Ad Hoc Robot Networks [J]. IEEE Networks, 2004, 18(4): 36-44.
  • 7Dai Fei, Wu Jie. On Constructing k-Connected k-Dominating Set in Wireless Networks [C]//Proceedings of the International Parallel and Distributed Processing Symposium, 2005.

同被引文献11

  • 1Dai Fei,Wu Jie.On Constructing k-Connected k-Dominating Set in Wireless ad hoc and Sensor Networks[J].Journal of Parallel and Distributed Computing,2006,66(7):947-958.
  • 2Shang Weiping,Yao F,Wan Pengjun,et al.Algorithms for Minimum m-Connected k-Dominating Set Problem[C] //COCOA 2007.[s.l.] :[s.n.] ,2007:182-190.
  • 3Wu Yiwei,Wang Feng,Thai M T,et al.Constructing k-Connected m-Dominating Sets in Wireless Sensor Networks[C] //Military Communications Conference.Orlando,FL:[s.n.] ,2007:29-31.
  • 4Wu Yiwei,Li Yingshu.Construction Algorithms for k-Connected m-Dominating Sets in Wireless Sensor Networks[C] //Proceedings of the 9th ACM international symposium on Mobile ad hoc networking and computing.Hong Kong,China:[s.n.] ,2008:83-90.
  • 5施伟.移动Ad Hoc网络中连通支配集若干关键问题的研究[D].杭州:浙江大学,2007.
  • 6West D B.Introduction to Graph Theory[M].2nd ed.[s.l.] :Prentice-Hall,Inc,2001.
  • 7Kim D,Wu Yiwei,Li Yingshu,et al.Constructing Minimum Connected Dominating Sets with Bounded Diameters in Wireless Networks[J].IEEE Transactions on Parallel and Distributed Systems,2009,20(2):147-157.
  • 8凤旺森,屈婉玲,王捍贫,张立昂.无线自组织网络中构造2-连通k-支配虚拟主干网的近似算法[J].计算机工程与科学,2008,30(10):21-23. 被引量:2
  • 9孙立山,张瑞宏,武文斌.2-连通2-支配集的集中式构造[J].计算机工程与应用,2009,45(15):107-110. 被引量:3
  • 10凌飞,吴振华.能量均衡的最小连通支配集分布式算法[J].传感技术学报,2012,25(9):1316-1321. 被引量:15

引证文献2

二级引证文献1

相关作者

内容加载中请稍等...

相关机构

内容加载中请稍等...

相关主题

内容加载中请稍等...

浏览历史

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