期刊文献+

基于极大权的最小连通支配集启发式算法 被引量:24

A Heuristic Algorithm for Minimum Connected Dominating Set with Maximal Weight in Ad Hoc Networks
下载PDF
导出
摘要 Adhoc无线网络中基于最小连通支配集 (MCDS)的路由是一个引人瞩目的方法 ,文中提出了一种基于极大权的MCDS的启发式算法 ,确保了性能强的主机担任网关节点的角色 ,能更好的协调管理网络中其他的节点 ,从而保持MCDS的相对稳固性并为全网中的广播和路由操作提供一个高效的通信基础 .仿真结果表明 ,该算法能在保证生成权和极大的连通支配集的同时也确保它的极小性 。 Routing based on a minimum connected dominating set (MCDS) in ad hoc wireless networks is a promising approach,where the search space for a route is reduced to nodes in the set (also called gateway nodes).This paper introduces MWMCDS,a simple and efficient heuristic algorithm for calculating minimum connected dominating set with maximal weight in the topology graph G of an Ad hoc wireless network.The maximality of the weight-based choice of gateway nodes guarantees that the most suitable nodes have been chosen for the role of gateway nodes so that they can properly coordinate all the other nodes in the network.As a result,it can keep stability of the MCDS and provide a highly effective communication base for broadcast and routing operation in the whole network.Simulation resluts show that the proposed algorithm can ensure the maximality of sum of CDS' weight and the minimality of CDS' size.So the scheme can be potentially used in designing efficient routing algorithms based on a MCDS.
出处 《电子学报》 EI CAS CSCD 北大核心 2004年第11期1774-1777,共4页 Acta Electronica Sinica
基金 教育部博士学科点基金 (No.2 0 0 30 0 560 0 7)
关键词 AD HOC网络 极大权最小连通支配集 网关节点 启发式算法 广播 ad hoc wireless networks MWMCDS gateway nodes heuristic algorithm
  • 相关文献

参考文献11

  • 1Alzoubi K M,et al.New distributed algorithm for connected dominating set in wireless Ad Hoc networks[A].Proc.35th Hawaii Int'l Conf[C].System Sciences,2002.3881-3887.
  • 2Basagni S.Finding a maximal weighted independent set in wireless networks[J].Telecommunication Systems,2001,18:1-3,155-168.
  • 3Guha S,Khuller S.Approximation algorithms for connected dominating sets[J].Algorithmica,1998,20(4):374-387.
  • 4Lim H,Kim C.Flooding in Ad Hoc networks[J].Computer Communications,2001,24:353-363.
  • 5Royer E M,Toh C K.A review of current routing protocols for Ad Hoc mobile wireless networks[J].IEEE Personal Comm,1999,4:46-55.
  • 6Prakash Ravi.A routing algorithm for wireless Ad Hoc networks withunidirectional links[J].Wireless Networks,2001,7:617-625.
  • 7Sivakumar R,et al.Spine routing in Ad Hoc networks[J].Cluster Computing,1998,1:237-248.
  • 8Stojmenovic I,et al.Dominating sets and neighbor elimination-based broadcasting algorithms in wireless networks[J].IEEE Trans.On Parallel and Distributed Systems,2002,13(1):14-25.
  • 9Wu J,Dai F.On locality of dominating set in Ad Hoc networks with switch-on/off operations[A].Proc.Int'l Symp.Parallel Architetures[C].Algorithms and Networks (I-SPAN '02),2002.85-90.
  • 10Wu J.Extended dominating-set-based routing in ad hoc wireless networks with unidirectional links[J].IEEE Trans.On Parallel and Distributed Systems,2002,13(9):866-881.

共引文献1

同被引文献200

引证文献24

二级引证文献66

相关作者

内容加载中请稍等...

相关机构

内容加载中请稍等...

相关主题

内容加载中请稍等...

浏览历史

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