Abstract
Transmission over wireless ad hoc networks is a challenging problem, because the wireless channel is characterized by limited bandwidth, multi-hop connectivity, mobility of nodes, and dynamically varying network topology. Current unipath routing protocols result in performance degradation in mobile networks due to unreliability of the wireless infrastructure and mobility of nodes. Multipath routing is an attractive alternative for scalable and multiple sub-streamable multimedia traffic under highly error-prone and resourcedepleted network environments. However, existing multipath-capable routing protocols cannot split a single data flow into several sub-flows over a multipath, because these routing protocols use, mostly, an alternate path scheme that provides a secondary path in the event of link failure of the primary path. The Split Multipath Routing (SMR) protocol, which is a major multipath routing protocol based on Dynamic Source Routing (DSR) and uses decentralized transmission over multipath. In enhanced performance, Split Equal-cost Multipath Routing (SEMR) based on SMR is proposed, by introducing ‘congestion path metric’ as a novel metric, which can identify whether the path contains a bottleneck node and guide the selection of other non-congested paths in the path-selecting process. In using proposed concept, superior performance in comparison with SMR and DSR, can be achieved.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
References
Pham, P.P., Perreau, S.: Performance Analysis of Reactive Shortest Path and Multi-path Routing Mechanism with Load Balance. IEEE INFOCOM (2003)
Johnson, D., Maltz, D.: Dynamic Source Routing in Ad Hoc Wireless Networks. In: Imielinski, T., Korth, H. (eds.) Mobile Computing, Kluwer, Norwell (1996)
Perkins, C.E., Royer, E.M.: Ad-hoc On-demand Distance Vector Routing. IEEE WCNC, 90–100 (2000)
Park, V.D., Corson, M.S.: A Highly Adaptive Distributed Routing Algorithm for Mobile Wireless Networks. IEEE INFOCOM, 1405–1413 (1999)
Raju, J., Garcia-Luna-Aceves, J.J.: A New Approach to On-demand Loop-free Multipath Routing. IEEE ICCCN, 522–527 (1999)
Lee, S.J., Gerla, M.: AODV-BR: Backup Routing in Ad Hoc Networks. IEEE WCNC, 1311–1316 (2000)
Marina, M.K., Das, S.R.: On-demand Multipath Distance Vector Routing in Ad Hoc Networks. In: Proceedings of the International Conference for Network Protocols (2001)
Wang, L., Zhang, L., Shu, Y., Dong, M.: Multipath Source Routing in Wireless Ad Hoc Networks. In: IEEE Electrical and Computer Engineering 2000 Canadian Conference, vol. 1, pp. 479–483 (2000)
Nasipuri, A., Das, S.R.: On-demand Multipath Routing for Mobile Ad Hoc Networks. IEEE Computer Communications and Networks, 64–70 (1999)
Lee, S.J., Gerla, M.: Split Multipath Routing with Maximally Disjoint Paths in Ad Hoc Networks. In: IEEE ICC 2001, vol. 10 (2001)
UCLA Parallel Computing Laboratory and Wireless Adaptive Mobility Laboratory: GloMoSim: A Scalable Simulation Environment for Wireless and Wired Network Systems, http://pcl.cs.ucla.edu/projects/domains/glomosim.html
Rappaport, T.S.: Wireless Communications: Principles and Practice. Prentice Hall, Englewood Cliffs (1995)
IEEE Computer Society LAN MAN Standards Committee, Wireless LAN Medium Access Protocol (MAC) and Physical Layer (PHY) Specification, IEEE Std 802.11 (1997)
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2006 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Ahn, C., Shin, J., Huh, EN. (2006). Enhanced Multipath Routing Protocol Using Congestion Metric in Wireless Ad Hoc Networks. In: Sha, E., Han, SK., Xu, CZ., Kim, MH., Yang, L.T., Xiao, B. (eds) Embedded and Ubiquitous Computing. EUC 2006. Lecture Notes in Computer Science, vol 4096. Springer, Berlin, Heidelberg. https://doi.org/10.1007/11802167_109
Download citation
DOI: https://doi.org/10.1007/11802167_109
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-36679-9
Online ISBN: 978-3-540-36681-2
eBook Packages: Computer ScienceComputer Science (R0)