Hierarchical routing algorithm for cluster based multihop mobile ad hoc network
Prabagarane, N.; Ajoy navin, C.; Partibane, B.; Nagarajan, V.; Krishnakiran, R.
Wireless Communications and Networking Conference, 2004. WCNC. 2004 IEEE
Volume 2, Issue , 21-25 March 2004 Page(s): 1116 - 1120 Vol.2
Digital Object Identifier  
Summary: 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.

» View citation and abstract

Log in by entering your IEEE Web Account Username and Password.

IEEE Communications Society members: If you subscribe to the IEEE Electronic Periodicals Package or IEEE Electronic Periodicals Package Plus, you must access your subscription at www.comsoc.org.

Check with your librarian, information professional, or system manager to determine if you need to log in. Please complete the online Technical Support Form if you need assistance.

Select the Purchase History link to access the document. You will have 5 Days after purchase to access the Full Text PDF. Please complete the online Technical Support Form if you need assistance.

• Search and access Abstract records free of charge
• Register for table of contents alerts
• Purchase Full Text PDF documents

» Learn more about subscription options or how to become an IEEE Member.