Advertisement

Wireless Personal Communications

, Volume 43, Issue 2, pp 605–621 | Cite as

MANET Routing with Provably Low Complexity Through Constant Density Clustering and Route Request Broadcast

  • Hyo-Sik Yang
  • Luke Ritchie
  • Andréa W. Richa
  • Martin Reisslein
Article

Abstract

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.

Keywords

1-hop clustering algorithm/protocol design and analysis message complexity routing protocol scalability time complexity wireless mobile ad hoc network 

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. 1.
    Abolhasan M., Wysocki T., Dutkiewicz E. (2004) “A Review of Routing Protocols for Mobile Ad Hoc Networks”. Ad Hoc Networks, 2(1): 1–22CrossRefGoogle Scholar
  2. 2.
    Hong X., Xu K., Gerla M., (2002) “Scalable Routing Protocols for Mobile Ad Hoc Networks”. IEEE Network, 16(4): 11–21CrossRefGoogle Scholar
  3. 3.
    Rajamaran R., (2002) “Topology Control and Routing in Ad Hoc Networks: A survey”. SIGACT News, 33:60–73CrossRefGoogle Scholar
  4. 4.
    Sankar A., Liu Z., (2004) “Maximum Lifetime Routing in Wireless Ad-hoc Networks”, in Proc. of IEEE Infocom, Hong KongGoogle Scholar
  5. 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. 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
  7. 7.
    Sucec J., Marsic I., (2004) “Hierarchical Routing Overhead in Mobile Ad Hoc Networks”. IEEE Transactions on Mobile Computing, 3(1):46–56CrossRefGoogle Scholar
  8. 8.
    Huang H., Richa A.W., Segal M., (2004) “Approximation Algorithms for the Mobile Piercing Set Problem with Applications to Clustering in Ad Hoc Networks”. Mobile Networks and Applications (MONET) 9(2):151–161CrossRefGoogle Scholar
  9. 9.
    L. Ritchie, H.-S. Yang, A.W. Richa, and M. Reisslein, “Cluster Overlay Broadcast (COB): MANET Routing with Complexity Polynominal in Source-Destination Distance”, IEEE Transactions on Mobile Computing, Vol. 5, No. 6, pp. 653–667, 2006.CrossRefGoogle Scholar
  10. 10.
    E.M. Belding-Royer, “Multi-level Hierarchies for Scalable Ad Hoc Routing” Wireless Networks, Vol. 9, No. 5, pp. 461–478, 2003.CrossRefGoogle Scholar
  11. 11.
    Belding-Royer E.M., Perkins C.E., (2003) “Evolution and Future Directions of the Ad Hoc On-demand Distance-vector Routing Protocol”. Ad Hoc Networks 1(1):125–150CrossRefGoogle Scholar
  12. 12.
    Ephremides A., Wieselthier J.E., Baker D.J. (1987) “A Design Concept for Reliable Mobile Radio Networks with Frequency Hopping Signalling”. Proceedings of the IEEE 75(1): 56–73CrossRefGoogle Scholar
  13. 13.
    Gerla M., Tsai J.T.C. (1995) “Multicluster Mobile Multimedia Radio Networks”. ACM-Baltzer Journal of Wireless Networks, 1(3):255–256CrossRefGoogle Scholar
  14. 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
  15. 15.
    Yu J.Y., Chong P.H.J., (2005) “A survey of Clustering Schemes for Mobile Ad Hoc Networks”. IEEE Communications Surveys and Tutorials 7(1):32–48CrossRefGoogle Scholar
  16. 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
  17. 17.
    Viswanath K., Obraczka K., Tsudik G. (2006) “Exploring Mesh and Tree-based Multicast Routing Protocols for MANETs”. IEEE Transactions on Mobile Computing 5(1):28–42CrossRefGoogle Scholar
  18. 18.
    Tseng Y.-C., Ni S.-Y., Chen Y.-S., Sheu J.-P. (2002) “The Broadcast Storm Problem in a Mobile Ad Hoc Network”. Wireless Networks 8(2–3):153–167MATHCrossRefGoogle Scholar
  19. 19.
    Williams B., Metha D., Camp T., Navidi W. (2004) “Predictive Models to Rebroadcast in Mobile Ad Hoc Networks”. IEEE Transactions on Mobile Computing 3(3):295–303CrossRefGoogle Scholar
  20. 20.
    Wu J., Dai F., (2005) “Efficient Broadcasting with Guaranteed Coverage in Mobile Ad Hoc Networks”. IEEE Transactions on Mobile Computing 4(3):259–270CrossRefGoogle Scholar
  21. 21.
    Lee S.-J., Belding-Royer E.M., Perkins C.E. (2003) “Scalability Study of the Ad Hoc On-demand Distance Vector Routing Protocol”. International Journal of Network Management, 13(2):97–114CrossRefGoogle Scholar
  22. 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
  23. 23.
    Wu J., Dai F., (2006) “Virtual Backbone Construction in MANETs using Adjustable Transmission Ranges”. IEEE Transactions on Mobile Computing, 5(9):1188–1200CrossRefGoogle Scholar
  24. 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. 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
  26. 26.
    Perkins C.E., Belding-Royer E.M., Das S.R., Marina M.K. (2001) “Performance Comparison of Two On-demand Routing Protocols for Ad Hoc Networks”, IEEE Personal Communications, 8(1):16–28CrossRefGoogle Scholar
  27. 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

Copyright information

© Springer Science+Business Media, LLC 2007

Authors and Affiliations

  • Hyo-Sik Yang
    • 1
  • Luke Ritchie
    • 2
  • Andréa W. Richa
    • 3
  • Martin Reisslein
    • 2
  1. 1.Department of Computer EngineeringSejong UniversitySeoulKorea
  2. 2.Department of Electrical EngineeringArizona State UniversityTempeUSA
  3. 3.Department of Computer Science and EngineeringArizona State UniversityTempeUSA

Personalised recommendations