Abstract
Ad hoc networks have the notable capability of enabling spontaneous networks. These networks are self-initializing, self-configuring, and self-maintaining, even though the underlying topology is often continually changing. Because research has only begun to scratch the surface of the potential applications of this technology, it is important to prepare for the widespread use of these networks. In anticipation of their ubiquity, the protocols designed for these networks must be scalable. This includes scaling to both networks with many nodes, and networks with rapidly changing topologies. This paper presents two hierarchical clustering protocols that improve the scalability of ad hoc routing protocols. The Adaptive Routing using Clusters (ARC) protocol creates a one-level clustered hierarchy across an ad hoc network, while the Adaptive Routing using Clustered Hierarchies (ARCH) protocol creates a multi-level hierarchy which is able to dynamically adjust the depth of the hierarchy in response to the changing network topology. It is experimentally shown that these protocols, when coupled with an ad hoc routing protocol, produce throughput improvements of up to 80% over the ad hoc routing protocol alone.
Similar content being viewed by others
References
L. Bajaj, M. Takai, R. Ahuja, K. Tang, R. Bagrodia and M. Gerla, GlomoSim: a scalable network simulation environment, Technical Report, CSD Technical Report, #990027, UCLA (1997).
D.J. Baker and A. Ephremides, The architectural organization of a mobile radio network via a distributed algorithm, IEEE Transactions on Communications 29(11) (1981) 1694–1701.
S. Basagni, Distributed clustering for ad hoc networks, in: Proceedings of the 1999 International Symposium on Parallel Architectures, Algorithms, and Networks, Australia (June 1999) pp. 310–315.
E.M. Belding-Royer, Hierarchical routing in ad hoc mobile networks, to appear in the Wireless Communications and Mobile Computing (2002).
C. Bettstetter and R. Krausser, Scenario-based stability analysis of the Distributed Mobility-Adaptive Clustering (DMAC) algorithm, in: Proceedings of the 2nd Annual Symposium on Mobile Ad Hoc Networking and Computing, Long Beach, CA (October 2001).
L. Briesemeister and G. Hommel, Role-based multicast in highly mobile but sparsely connected ad hoc networks, in: Proceedings of the 1st Annual Workshop on Mobile and Ad Hoc Networking and Computer (MobiHOC), Boston, MA (August 2000) pp. 45–50.
J. Broch, D.A. Maltz, D. Johnson, Y.-C. Hu and J. Jetcheva, A performance comparison of multi-hop wireless ad hoc network routing protocols, in: Proceedings of the 4th Annual ACM/IEEE International Conference on Mobile Computing and Networking (MobiCom), Dallas, TX (October 1998) pp. 85–97.
C.-C. Chiang, H.-K. Wu, W. Liu and M. Gerla, Routing in clustered multihop, mobile wireless networks with fading channel, in: Proceedings of IEEE Singapore International Conference on Networks (SICON) (April 1997) pp. 197–211.
IEEE Standards Department, Wireless LAN Medium Access Control (MAC) and Physical Layer (PHY) Specifications, IEEE Standard 802.11-1997 (1994).
J.J. Garcia-Luna-Aceves and M. Spohn, Source-tree routing in wireless networks, in: Proceedings of the 7th International Conference on Network Protocols (ICNP), Toronto, Canada (November 1999).
M. Gerla, T.J. Kwon and G. Pei, On demand routing in large ad hoc wireless networks with passive clustering, in: Proceedings of the IEEE Wireless Communications and Networking Conference (WCNC) (September 2000).
M. Gerla and J.T-C. Tsai, Multicluster, mobile, multimedia radio network, Wireless Networks 1(3) (1995) 255–265.
M. Jiang, J. Li and Y.C. Tay, Cluster Based Routing Protocol (CBRP) functional specification, IETF Internet Draft, draft-ietf-manetcbrp-spec-00.txt (August 1998), work in progress.
D.B. Johnson and D.A. Maltz, Dynamic source routing in ad hoc wireless networks, in: Mobile Computing, eds. T. Imielinski and H. Korth (Kluwer Academic, Dordrecht, 1996) pp. 153–181.
L. Kleinrock and F. Kamoun, Hierarchical routing for large networks, Computer Networks 1(1) (1977) 155–174.
L. Kleinrock and F. Kamoun, Optimal clustering structures for hierarchical topological design of large computer networks, Networks 10(3) (1980) 221–248.
D.E. Knuth, The Art of Computer Programming, Vol. 1 (Addison-Wesley, Reading, MA, 1969).
Y.-B. Ko and N.H. Vaidya, Location-Aided Routing (LAR) in mobile ad hoc networks, in: Proceedings of the 4th ACM/IEEE International Conference on Mobile Computing and Networking (MobiCom), Dallas, TX (October 1998) pp. 66–75.
S.-J. Lee, E.M. Royer and C.E. Perkins, Ad hoc routing protocol scalability, to appear in the International Journal on Network Management (2002).
C. R. Lin and M. Gerla, Adaptive clustering for mobile wireless networks, IEEE Journal on Selected Areas in Communications 15(7) (1997) 1265–1275.
S. Murthy and J.J. Garcia-Luna-Aceves, An efficient routing protocol for wireless networks, ACM/Baltzer Mobile Networks and Applications 1(2) (1996) 183–197.
V.D. Park and M.S. Corson, A highly adaptive distributed routing algorithm for mobile wireless networks, in: Proceedings of the IEEE Conference on Computer Communications (INFOCOM), Kobe, Japan (April 1997) pp. 1405–1413.
G. Pei, M. Gerla, X. Hong and C.-C. Chiang, A wireless hierarchical routing protocol with group mobility, in: Proceedings of IEEE Wireless Communications and Networking Conference (WCNC), New Orleans, LA (September 1999) pp. 1538–1542.
C.E. Perkins, E.M. Belding-Royer and S.R. Das, Ad hoc On-Demand Distance Vector (AODV) routing, IETF Internet Draft, draft-ietfmanet-aodv-10.txt (March 2002), work in progress.
C.E. Perkins and P. Bhagwat, Highly dynamic Destination-Sequenced Distance-Vector routing (DSDV) for mobile computers, in: SIGCOMM' 94, Computer Communications Review 24(4) (1994) 234–244.
C.E. Perkins and E.M. Royer, The ad hoc on-demand distance vector protocol, in: Ad hoc Networking, ed. C.E. Perkins (Addison-Wesley, Reading, MA, 2000) pp. 173–219.
R. Ramanathan and M. Steenstrup, Hierarchically-organized, multihop mobile wireless networks for Quality-of-Service support, ACM/Baltzer Mobile Networks and Applications 3(1) (1998) 101–118.
E.M. Royer, P.M. Melliar-Smith and L.E. Moser, An analysis of the optimum node density for ad hoc mobile networks, in: Proceedings of the IEEE International Conference on Communications, Helsinki, Finland (June 2001).
E.M. Royer and C.-K. Toh, A review of current routing protocols for ad-hoc mobile networks, IEEE Personal Communications 6(2) (1999) 46–55.
N. Shacham, Organization of dynamic radio networks by overlapping clusters: architecture considerations and optimization, in: Performance' 84 (December 1984) pp. 435–447.
P. Sinha, R. Sivakumar and V. Bharghavan, CEDAR: a core-extraction distributed ad hoc routing algorithm, in: Proceedings of the IEEE Conference on Computer Communications (INFOCOM), New York, NY (March 1999) pp. 202–209.
M. Steenstrup, Cluster-based networks, in: Ad Hoc Networking, ed. C.E. Perkins (Addison-Wesley, Reading, MA, 2000) chapter 4.
P.F. Tsuchiya, The landmark hierarchy: A new hierarchy for routing in very large networks, Computer Communication Review (August 1988) pp. 35–42.
Author information
Authors and Affiliations
Rights and permissions
About this article
Cite this article
Belding-Royer, E.M. Multi-Level Hierarchies for Scalable Ad hoc Routing. Wireless Networks 9, 461–478 (2003). https://doi.org/10.1023/A:1024688116418
Issue Date:
DOI: https://doi.org/10.1023/A:1024688116418