一种Ad hoc网络中分布式无环路由算法设计  

A Novel Distributed Loop-free Routing Algorithm in the Ad hoc Networks

作　　者：康凯[1] 郭伟[1] 吴诗其[1] 

机构地区：[1]电子科技大学通信抗干扰国防重点实验室,成都610054

出　　处：《计算机科学》2003年第4期40-42,共3页Computer Science

摘　　要：The routing algorithm is one of the important problems in the Ad hoc networks. The performances of the networks are heavily depended on the property of the routing algorithm. In this paper, we present a new loop-free routing algorithm in the Ad hoc networks. By virtue of the correlation of routing information among neighbor nodes, the formation of the temporary loops during the topological changes can be prohibited. The new algorithm can avoid the waste of the wireless bandwidth, and accelerate the convergence of the routing during the network transitions.The routing algorithm is one of the important problems in the Ad hoc networks. The performances of the networks are heavily depended on the property of the routing algorithm. In this paper, we present a new loop-free routing algorithm in the Ad hoc networks. By virtue of the correlation of routing information among neighbor nodes, the formation of the temporary loops during the topological changes can be prohibited. The new algorithm can avoid the waste of the wireless bandwidth, and accelerate the convergence of the routing during the network transitions.

关 键 词：ADHOC网络 分布式无环路由算法 设计 网络管理 网络设施 计算机网络 

分 类 号：TP393[自动化与计算机技术—计算机应用技术]