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