作者投稿和查稿 主编审稿 专家审稿 编委审稿 远程编辑

›› 2005, Vol. 31 ›› Issue (14): 73-75.

• 论文 • 上一篇    下一篇

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

金伟民,程胜,武穆清,丁炜   

  1. 北京邮电大学北邮-Intel互联网交换架构实验室,北京邮电大学北邮-Intel互联网交换架构实验室,北京邮电大学北邮-Intel互联网交换架构实验室,北京邮电大学北邮-Intel互联网交换架构实验室 北京 100876
  • 发布日期:2005-07-25

An Improved Algorithm for Computing CDS Based on AVBR

JIN Weimin, CHENG Sheng, WU Muqing, DING Wei   

  1. (Intel eXchange Architecture Laboratory, Beijing University of Posts and Telecommunication, Beijing 100876)
  • Published:2005-07-25

摘要: 在WuandLi算法的基础上,提出了一种有限状态机模型。利用有限状态机的状态转移、节点的颜色标记和消息的发送和接收机制,建立了可靠的并行模型,实现节点的颜色标记过程与冗余节点的删除过程的融合。算法使用新的缩减规则,减少生成的主节点数,提高了算法的性能。

关键词: AdHoc, 无线网络, 虚拟骨干, 连接主节点集

Abstract: 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.

中图分类号: