An efficient routing algorithm called Hierarchical Routing is presented in this paper. The algorithm assumes that the network is divided into logical clusters. In each cluster a so-called Central Controller stores the routing information and exchanges it with its neighboring Central Controllers. Each routing entry contains a time index which is used to react to dynamic topology changes and to minimize the amount of exchanged routing information. The presented algorithm is best suited for mobile ad hoc networks. The algorithm has been especially designed for a centralized ad hoc network HEE based on the HIPERLAN/2 standard standardized by ETSI but may be used in any ad hoc network configuration. The performance of the algorithm is analytically compared to the performance of the Dynamic Source Routing algorithm.
展开▼
