MANET Routing with Provably Low Complexity Through Constant Density Clustering and Route Request Broadcast
- 108 Downloads
As mobile ad hoc networks (MANETs) are emerging as important components in critical and large-scale applications, it is crucial to develop MANET routing mechanisms with provably low complexity. In this paper, we give a tutorial overview of the efficient use of elementary node clustering and route request broadcast mechanisms for low-complexity MANET routing. We explain these mechanisms with illustrative examples and discuss their theoretical performance characteristics. We demonstrate that node clustering with constant density and route request broadcasting with a doubling radius technique over the network of cluster leaders can be employed for MANET routing with theoretically proven low complexity. Moreover, we contrast these efficient elementary clustering and route request broadcast mechanisms with clustering and route information accumulation mechanisms in the widely studied AODV and DSR routing protocols and discuss the implications of these various mechanisms for scalable MANET routing.
Keywords1-hop clustering algorithm/protocol design and analysis message complexity routing protocol scalability time complexity wireless mobile ad hoc network
Unable to display preview. Download preview PDF.
- 4.Sankar A., Liu Z., (2004) “Maximum Lifetime Routing in Wireless Ad-hoc Networks”, in Proc. of IEEE Infocom, Hong KongGoogle Scholar
- 5.Santivanez C.A., McDonald B., Stavrakakis I., Ramanathan R., (2002) “On the Scalability of Ad Hoc Routing Protocols”, in Proc. of IEEE Infocom, New York, NY 1688–1697Google Scholar
- 6.A. Srinivas and E. Modiano, “Minimum Energy Disjoint Path Routing in Wireless Ad-hoc Networks”, in Proc. of ACM MobiCom, San Diego, CA pp. 122–133, 2003.Google Scholar
- 14.C.-C. Chiang, H.-K. Wu, W. Liu, and M. Gerla, “Routing in Clustered Multihop, Mobile Wireless Networks with Fading Channel,” in Proc. IEEE Singapore Int. Conf. on Networks, Singapore pp. 197–211, 1997Google Scholar
- 16.Liang O., Sekercioglu A., Mani N. (2006) “A Survey of Multipoint Relay based Broadcast Schemes in Wireless Ad Hoc Networks”. IEEE Communications Surveys and Tutorials 8(4):30–46Google Scholar
- 22.K. Xu and M. Gerla, “A Heterogeneous Routing Protocol based on a New Stable Clustering Scheme”, in Proc. of IEEE Milcom, Anaheim, CA pp. 838–843, 2002.Google Scholar
- 24.D.B. Johnson, D.A. Malts, and J. Broch, “DSR: The Dynamic Source Routing Protocol for Multi-hop Wireless Ad Hoc Networks”, in Ad Hoc Networking, Chapter 5, C.E. Perkins, Ed. Reading, MA: Addison–Wesley, pp. 139–172, 2001Google Scholar
- 25.Y. Qin and J. He, “The Impact on Throughput of Hierarchical Routing in Ad Hoc Wireless Networks”, in Proc. of IEEE ICC, Seoul, Korea pp. 3010–3014, 2005Google Scholar
- 27.X. Yu and Z. Kedem, “A Distributed Adaptive Cache Update Algorithm for the Dynamic Source Routing Protocol”, in Proc. of IEEE Infocom, Miami, FL, 2005, pp. 730–739.Google Scholar