Abstract
The widespread use of Mobile Ad Hoc Networks (MANETs) in many fields of applications has led to the continuous development of routing protocols which can perform well when deployed under different scenarios, as well as offer better Quality of Service (QoS) support. In this paper, we focus on how link stability is utilized as a metric to provide accurate feedback on the network. We then introduce two mechanisms – L-REQ (Limited forwarding of Route Requests) and L-REP (Limited initiation of Route Replies by intermediate nodes) – which make use of link stability to dynamically adapt the characteristic behaviour of existing protocols to achieve better network performance. The two adaptive schemes are then applied to the Ad Hoc On Demand Distance Vector (AODV) routing protocol as proof of concept.
This is a preview of subscription content, log in via an institution to check access.
Preview
Unable to display preview. Download preview PDF.
Similar content being viewed by others
References
Tan, H.X., Seah, W.K.G.: Dynamically Adapting Mobile Ad Hoc Routing Protocols to Improve Scalability. In: Proceedings of the IASTED International Conference on Communication Systems and Networks (CSN 2004), Marbella, Spain, September 1-3 (2004)
Boleng, J., Navidi, W., Camp, T.: Metrics to Enable Adaptive Protocols for Mobile Ad Hoc Networks. In: Proceedings of the International Conference on Wireless Networks (ICWN 2002), Las Vegas, Nevada, USA, June 24-27 (2002)
Dube, R., Rais, C.D., Wang, K.Y., Tripathi, S.K.: Signal Stability-Based Adaptive Routing (SSA) for Ad-Hoc Mobile Networks. IEEE Personal Communications 4(1), 36–45 (1997)
Krco, S., Dupcinov, M.: Improved Neighbour Detection Algorithm for AODV Routing Protocol. IEEE Communications Letters 7(12) (December 2003)
Abolhasan, M., Wysocki, T.A.: Displacement-based Route Update Strategies for Proactive Routing Protocols in Mobile Ad Hoc Networks. In: Workshop on the Internet, Telecommunications and Signal Processing (WITSP 2003), Coolangatta, Gold Coast, Australia, December 8-11 (2003)
Boleng, J., Camp, T.: Adaptive Location Aided Mobile Ad Hoc Network Routing. In: Proceedings of the 23rd IEEE International Performance, Computing and Communications Conference (IPCCC 2004), Phoenix, Arizona, USA, April 15-17 (2004)
Tickoo, O., Raghunath, S., Kalyanaraman, S.: Route Fragility: A Novel Metric for Route Selection in Mobile Ad Hoc Networks. In: Proceedings of the IEEE International Conference On Networks (ICON 2003), Sydney, Australia (2003)
Basu, P., Khan, N., Little, T.D.C.: A Mobility Based Metric for Clustering in Mobile Ad Hoc Networks. In: Workshop on Wireless Networks and Mobile Computing (in IEEE ICDCS 2001), Phoenix, Arizona, USA (April 2001)
Lee, S.J., Belding-Royer, E.M., Perkins, C.E.: Scalability Study of the Ad Hoc On-Demand Distance-Vector Routing Protocol. International Journal of Network Management 13(2) (March 2003)
Bajaj, L., Takai, M., Ahuja, R., Tang, K., Bagrodia, R., Gerla, M.: GloMoSim: A Scalable Network Simulation Environment, UCLA Computer Science Department Technical Report 990027 (1999)
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2005 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Tan, H.X., Seah, W.K.G. (2005). Limiting Control Overheads Based on Link Stability for Improved Performance in Mobile Ad Hoc Networks. In: Braun, T., Carle, G., Koucheryavy, Y., Tsaoussidis, V. (eds) Wired/Wireless Internet Communications. WWIC 2005. Lecture Notes in Computer Science, vol 3510. Springer, Berlin, Heidelberg. https://doi.org/10.1007/11424505_25
Download citation
DOI: https://doi.org/10.1007/11424505_25
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-25899-5
Online ISBN: 978-3-540-32104-0
eBook Packages: Computer ScienceComputer Science (R0)Springer Nature Proceedings Computer Science
Keywords
These keywords were added by machine and not by the authors. This process is experimental and the keywords may be updated as the learning algorithm improves.