Abstract
We propose an algorithm to compute zone-disjoint multi-paths for mobile ad hoc networks and compare its performance with that of the single-path minimum-hop routing algorithm as well as with the node-disjoint multi-path routing algorithm proposed in our earlier work. Simulation results indicate that the number of zone-disjoint paths per multi-path set can be at most 2, which is far lower than the number of node-disjoint paths per multi-path set. Also, the time between zone-disjoint multi-path discoveries is far lower than the time between node-disjoint multi-path route discoveries and can be at most 10% more than the time between single minimum-hop path route discoveries. However, there is no appreciable difference in the average hop counts per zone-disjoint multi-path set and node-disjoint multi-path set and they can be only at most 12% more than the average minimum hop count determined using single-path routing.
This is a preview of subscription content, log in via an institution to check access.
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
Bettstetter, C., Hartenstein, H., Perez-Costa, X.: Stochastic Properties of the random Way Point Mobility Model. Wireless Networks 10(5), 555–567 (2004)
Broch, J., Maltz, D.A., Johnson, D.B., Hu, Y.C., Jetcheva, J.: A Performance of Comparison of Multi-hop Wireless Ad hoc Network Routing Protocols. In: 4th International Conference on Mobile Computing and Networking, pp. 85–97. ACM, Dallas (1998)
Cormen, T.H., Leiserson, C.E., Rivest, R.L., Stein, C.: Introduction to Algorithms, 2nd edn. MIT Press/ McGraw Hill, New York (2001)
Meghanathan, N.: Stability and Hop Count of Node-Disjoint and Link-Disjoint Multipath Routes in Ad hoc Networks. In: 3rd International Conference on Wireless and Mobile Computing, Networking and Communications (WiMob). IEEE, New York (2007)
Meghanathan, N.: Impact of Range of Simulation Time and Network Shape on the Hop Count and Stability of Routes in Mobile Ad hoc Networks. IAENG International Journal of Computer Science, 36(1) (2009)
Mueller, S., Tsang, R.P., Ghosal, D.: Multipath Routing in Mobile Ad hoc Networks: Issues and Challenges. In: Calzarossa, M.C., Gelenbe, E. (eds.) MASCOTS 2003. LNCS, vol. 2965, pp. 209–234. Springer, Heidelberg (2004)
Pearlman, M.R., Haas, Z.J., Sholander, P., Tabrizi, S.S.: On the Impact of Alternate Path Routing for Load Balancing in Mobile Ad hoc Networks. In: 1st Annual Workshop on Mobile Ad hoc Networking and Computing (MobiHoc), pp. 3–10. ACM, Boston (2000)
Roy, S., Saha, D., Bandyopadhyay, S., Ueda, T., Tanaka, S.: Improving End-to-End Delay through Load Balancing with Multipath Routing in Ad hoc Networks using Directional Antenna. In: Das, S.R., Das, S.K. (eds.) IWDC 2003. LNCS, vol. 2918, pp. 225–234. Springer, Heidelberg (2003)
Saha, D., Roy, S., Bandyopadhyay, S., Ueda, T., Tanaka, S.: An Adaptive Framework for Multipath Routing via Maximally Zone-Disjoint Shortest Paths in Ad hoc Wireless Networks with Directional Antenna. In: Global Telecommunications Conference (GLOBECOM), pp. 226–230. IEEE, San Francisco (2003)
Waharte, S., Boutaba, R.: Totally Disjoint Multipath Routing in Multihop Wireless Networks. In: International Conference on Communications (ICC), vol. 12, pp. 5576–5581. IEEE, Istanbul (2006)
Wu, K., Harms, J.: On-demand Multipath Routing for Mobile Ad hoc Networks. In: 4th European Personal Mobile Communications Conference (EPMCC), Vienna, Austria (2001)
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2010 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Meghanathan, N. (2010). On the Time between Successive Multi-path Discoveries and Hop Count Per Multi-path for Zone-Disjoint Routing in Mobile Ad Hoc Networks. In: Özcan, A., Chaki, N., Nagamalai, D. (eds) Recent Trends in Wireless and Mobile Networks. WiMo 2010. Communications in Computer and Information Science, vol 84. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-642-14171-3_21
Download citation
DOI: https://doi.org/10.1007/978-3-642-14171-3_21
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-642-14170-6
Online ISBN: 978-3-642-14171-3
eBook Packages: Computer ScienceComputer Science (R0)