期刊文献+

基于拓扑特性的分布式虚拟骨干网算法 被引量:10

Distributed Virtue Backbone Network Algorithm Based on Topology Characteristic
下载PDF
导出
摘要 由于在任意连通网络中搜索最小连通支配集(minimum connected domination set,简称MCDS)是NP完全问题,提出了一种拓扑感知的MCDS启发式算法--TACDS(topology-aware connected domination set),并证明了其正确性.通过利用节点的拓扑特性,减小了支配节点选择的盲目性.该算法能够根据2跳内的局部拓扑信息构造出较小的CDS(connected domination set),从而得到基于该支配集的虚拟骨干网.仿真结果表明,该算法优于其他分布式CDS算法,可以更好地近似MCDS. Because finding a minimum connected domination set (MCDS) for a general connected network is NP-complete,a topology-aware heuristic algorithm is proposed in this paper whose correctness is proved.By taking advantage of the topology characteristic of nodes,the algorithm can reduce the blindness in the process of selecting dominating nodes,and form a smaller CDS (connected domination set) based on 2-hop local information,consequently obtain a virtue backbone network with the CDS.The simulation results show that the algorithm is superior to other distributed CDS algorithms,and closer to minimum CDS.
出处 《软件学报》 EI CSCD 北大核心 2010年第6期1416-1425,共10页 Journal of Software
关键词 无线网络 虚拟骨干网 连通支配集 分布式算法 拓扑特性 wireless network virtue backbone network connected dominating set distributed algorithm topology characteristic
  • 相关文献

参考文献1

二级参考文献31

  • 1Akyildiz IF,Su W,Sankarasubramaniam Y,Cayirci E.Wireless sensor networks:A survey.Computer Networks,2002,38(4):393-422.
  • 2Ren FY,Huang HN,Lin C.Wireless sensor networks.Journal of Software,2003,14(7):1282-1291.http://www.jos.org.cn/1000-9825/14/1282.htm
  • 3Stojmenovic I.Position based routing in ad hoc networks.IEEE Communications Magazine,2002,40(7):128-134.
  • 4Wan PJ,Alzoubi KM,Frieder O.Distributed construction of connected dominating set in wireless ad hoc networks.In:Kermani P,ed.Proc.of the IEEE Infocom.New York:IEEE Press,2002.1597-1604.
  • 5Das B,Sivakumar R,Bhargavan V.Routing in ad hoc networks using a spine.In:Makki K,ed.Proc.of the Int'l Conf.on Computer Communications and Networks (ICCCN).Los Alamitos:IEEE Press,1997.34-41.
  • 6Qayyum A,Viennot L,Laouiti L.Multipoint relaying:An efficient technique for flooding in mobile wireless networks.Technical Report,3898,INRIA-Rapport de Recherché,2000.
  • 7Alzoubi KM,Wan PJ,Frieder O.Message-Optimal connected dominating sets in mobile ad hoc networks.In:Hubaux JP,ed.Proc.of the ACM Int'l Symp.on Mobile Ad Hoc Networking and Computing (MobiHoc).New York:ACM Press,2002.157-164.
  • 8Chen Y,Liestman A.Approximating minimum size weakly-connected dominating sets for clustering mobile ad hoc networks.In:Hubaux JP,ed.Proc.of the ACM Int'l Symp.on Mobile Ad Hoc Networking and Computing (MobiHoc).New York:ACM Press,2002.165-172.
  • 9Wu J,Dai F.Broadcasting in ad hoc networks based on self-pruning.In:Bauer F,ed.Proc.of the IEEE Infocom.San Fransisco:IEEE Press,2003.2240-2250.
  • 10Dai F,Wu J.An extended localized algorithm for connected dominating set formation in ad hoc wireless networks.IEEE Trans.on Parallel and Distributed Systems,2004,15(10):908-920.

共引文献17

同被引文献83

引证文献10

二级引证文献54

相关作者

内容加载中请稍等...

相关机构

内容加载中请稍等...

相关主题

内容加载中请稍等...

浏览历史

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