期刊文献+

一种基于AVBR的计算CDS的改进算法

An Improved Algorithm for Computing CDS Based on AVBR
下载PDF
导出
摘要 在WuandLi算法的基础上,提出了一种有限状态机模型。利用有限状态机的状态转移、节点的颜色标记和消息的发送和接收机制,建立了可靠的并行模型,实现节点的颜色标记过程与冗余节点的删除过程的融合。算法使用新的缩减规则,减少生成的主节点数,提高了算法的性能。 This article presents a finite state machine based on Wu and Li’s algorithms. With the node color labeling and messagesending-receiving mechanism,it constructs a distributed and parallel model, and realizes the amalgamation of the marking process and the reducingprocess. With the new rules of reducing node,the amount of nodes in CDS is decreased and the approximation factor of the algorithm is improved.
出处 《计算机工程》 CAS CSCD 北大核心 2005年第14期64-66,共3页 Computer Engineering
基金 国家自然科学基金资助项目(60372101)
关键词 AD HOC 无线网络 虚拟骨干 连接主节点集 Ad Hoc Wireless networks Virtual backbone CDS
  • 相关文献

参考文献5

  • 1Das B, Sivakumar R, Bharghavan V. Routing in Ad-Hoc Networks Using a Spine. International Confer on Computers and Communications Networks'97, Las Vegas, 1997-09
  • 2Wu J, Li H. On Calculating Connected Dominating Set for Efficient Routing in Ad Hoc Wireless Networks[A]. Proc. of the 3^rd International Workshorp on Discrete Algothrithms and Methods for Mobile Computing and Communications, Seattle, WA, USA, 1999: 7-14
  • 3Cheng X, Du D Z. Virtual Backbone-based Routing in Ad Hoc Wireless Networks. Submitted to IEEE Transactions on Parallel and Distributed Systems, 2003
  • 4Clark B N, Colbourn C J, Johnson D S. Unit Disk Graphs. Discrete Mathematics, 1990, 86: 165-177
  • 5Wan P J, Alzoubi M, Frieder O. Distributed Construction of Connected Dominating Set in Wireless Ad Hoc Networks. IEEE INFOCOM, 2002

相关作者

内容加载中请稍等...

相关机构

内容加载中请稍等...

相关主题

内容加载中请稍等...

浏览历史

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