This Article 
 Bibliographic References 
 Add to: 
Hierarchical Routing Overhead in Mobile Ad Hoc Networks
January 2004 (vol. 3 no. 1)
pp. 46-56
John Sucec, IEEE

Abstract—Hierarchical techniques have long been known to afford scalability in networks. By summarizing topology detail via a hierarchical map of the network topology, network nodes are able to conserve memory and link resources. Extensive analysis of the memory requirements of hierarchical routing was undertaken in the 1970s. However, there has been little published work that assesses analytically the communication overhead incurred in hierarchical routing. This paper assesses the scalability, with respect to increasing node count, of hierarchical routing in mobile ad hoc networks (MANETs). The performance metric of interest is the number of control packet transmissions per second per node (\phi). To derive an expression for \phi, the components of hierarchical routing that incur overhead as a result of hierarchical cluster formation and location management are identified. It is shown here that \phi is only polylogarithmic in the node count.

[1] L. Kleinrock and F. Kamoun, Hierarchical Routing for Large Networks Computer Networks, vol. 1, no. 3, pp. 155-174, 1977.
[2] J. Westcott and G. Lauer, Hierarchical Routing for Very Large Networks Proc. IEEE Military Comm. Conf., pp. 214-218, Oct. 1984.
[3] G.S. Lauer, Hierarchical Routing Design for SURAN Proc. IEEE Int'l Conf. Comm., pp. 93-102, June 1986.
[4] G. Pei, M. Gerla, X. Hong, and C.-C. Chiang, A Wireless Hierarchical Routing Protocol with Group Mobility Proc. IEEE Wireless Comm. Networking Conf., pp. 1538-1542, Sept. 1999.
[5] A. Iwata, C.-C. Chiang, G. Pei, M. Gerla, and T.-W. Chen, “Scalable Routing Strategies for Ad hoc Networks,” IEEE J. Selected Areas in Comm., vol. 17, pp. 1,369–1,379, 1999.
[6] R. Ramanathan and M. Steenstrup, Hierarchically-Organized, Multihop Mobile Wireless Networks for Quality-of-Service Support ACM/Baltzer Mobile Networks and Applications, vol. 3, pp. 101-119, 1998.
[7] C.V. Rammamoorthy and W.-T. Tsai, An Adaptive Hierarchical Routing Algorithm Proc. IEEE CSAC, pp. 93-104, Fall 1983.
[8] J.J. Garcia Luna Aceves and N. Shacham, Analysis of Routing Strategies for Packet Radio Networks Proc. IEEE Infocom, pp. 292-302, 1985.
[9] J. Broch, D.A. Maltz, D.B. Johnson, Y.-C. Hu, and J. Jetcheva, A Performance Comparison of Multi-Hop Wireless Ad Hoc Network Routing Protocols Proc. Mobicom '98, pp. 85-97, 1998.
[10] L. Kleinrock and J. Sylvester, Optimum Transmission Radii for Packet Radio Networks or Why Six Is a Magic Number Proc. IEEE Nat'l Telecomm. Conf., pp. 4.3.1-4.3.5, Dec. 1978.
[11] A.D. Amis, R. Prakash, T.H.P. Vuong, and D.T. Huynh, “Max-MinD-Cluster Formation in Wireless Ad Hoc Networks,” Proc. INFORCOM, pp. 32-41, 2001.
[12] D.J. Baker and A. Ephremides, “The Architectureal Organization of a Mobile Radio Network via a Distributed Algorithm,” IEEE Trans. Comm., vol. 29, no. 11, pp. 1694-1701, Nov. 1981.
[13] D.J. Baker, A. Ephremides, and J.A. Flynn, The Design and Simulation of a Mobile Radio Network with Distributed Control IEEE J. Selected Areas Comm., pp. 226-237, Jan. 1984.
[14] C.R. Lin and M. Gerla, “Adaptive Clustering in Mobile Wireless Networks,” IEEE J. Selected Areas in Communications, vol. 16, pp. 1,265–1,275, 1997.
[15] M. Steenstrup, Cluster-Based Networks Ad Hoc Networking, C.E. Perkins, ed., chapter 4, pp. 75-138, Addison-Wesley, 2001.
[16] J. Li, J. Jannotti, D. De Couto, D. Karger, and R. Morris, A Scalable Location Service for Geographic Ad-Hoc Routing Proc. MobiCom 2000, pp. 120-130, Aug. 2000.
[17] R. Hinden and S. Deering, IP Version 6 Addressing Architecture IETF RFC, no. 2373, July 1998.

Index Terms:
Mobile ad hoc network, routing, hierarchical techniques, scalability, control overhead.
John Sucec, Ivan Marsic, "Hierarchical Routing Overhead in Mobile Ad Hoc Networks," IEEE Transactions on Mobile Computing, vol. 3, no. 1, pp. 46-56, Jan. 2004, doi:10.1109/TMC.2004.1261816
Usage of this product signifies your acceptance of the Terms of Use.