Abstract
Numerous routing protocols have recently been developed for ad hoc mobile networks. Routing protocols to date can be categorized as either ‘table-driven’ or ‘on-demand’. Many of the proposed routing protocols take the on-demand approach because this does not require keeping lots of routing information. However, these kinds of protocols are not able to react fast enough to maintain routing. In this paper, we propose a new protocol to improve existing on-demand routing protocols by constructing multiple backup routes; when the network topology changed, the proposed protocol could transmit data packets dynamically through backup routes. We then developed an analytic model to estimate the reconnection probability of the proposed algorithm. We also examined the performance by simulating the protocol using ns2. The experimental results showed that the protocol had fewer control packages, lower routing packet overhead, and a higher receiving ratio than others.
Similar content being viewed by others
References
Bettstetter, C. (2002). On the minimum node degree and connectivity of a wireless multi-hop network. ACM MobiHoc 80–91.
Bondy J. A., Murty U.S .R. (1976) Graph theory with applications. Macmillan Press, New York
Broch, J., Johnson, D. B., & Malt, D. A. (March 1998). The dynamic source routing protocol for mobile ad hoc networks. IETF, Internet Draft, draft-ietf-manet-dsr-00.txt.
Chiang, C.-C., Wu, H.-K., Liu, W., & Gerla, M. (1997). Routing in clustered multi-hop, mobile wireless networks with fading channel. Proceedings of IEEE SICON, 197–211.
Chung, C. M., Wang, Y.-H., & Chang, C.-C. (2001). Ad hoc on-demand backup node setup routing protocol. 15th International conference on information networking, 933–937.
Corson, M. S., & Park V. D. (1997). A highly adaptive distributed routing protocol for mobile ad hoc networks. Proceeding INFOCOM, 1405–1413.
Corson, M. S., & Park, V. D. (Nov. 1997). Temporally ordered routing algorithm (TORA) version 1: Functional specification. Internet-Draft.
Corson, M. S., & Park, V. D. (1998). A performance comparison of TORA and ideal link state routing. IEEE Symposium on Computers and Communication, 592–598.
Das, S. R., Perkins, C. E., & Royer, E. M. (2000). Performance comparison of two on-demand routing protocols for ad hoc networks. Proceedings of INFOCOM, 3–12.
Dube R., Rais C.D., Wang K.Y., Tripathi S.K. (1997) Signal stability based adaptive routing for ad hoc mobile networks. IEEE Personal Communications 4: 36–45
Fall, K., & Varadhan, K. (Nov. 1999). ns notes and documentation, The VINT Project, UC Berkeley, LBL, USC/ISI, and Xerox PARC.
Gerla M., Lee S.-J., Toh C.-K. (1999) A simulation study of table-driven and on-demand routing protocols for mobile ad hoc networks. IEEE Network 13: 48–54
Haas, Z. J. (Nov. 1997). The zone routing protocol (ZRP) for ad-hoc networks. IETF Internet Draft, draft-zone-routing-protocol-00.txt.
Haas Z. J., & Pearlman M. R. (1998). The performance of a new routing protocol for the reconfigurable wireless networks. IEEE International Conference on Communications, 156–160.
Hall P. (1988) Introduction to the Theory of Coverage Process. John Wiley and Sons, New York
Johnson, D. B., Hu, Y-C., Broch J., Maltz D. A., & Jetcheva J. (1998). A performance comparison of multi-hop wireless ad hoc network routing protocols. ACM MOBICOM, 85–97.
Lee, S-J, & Gerla, M. (2000). AODV-BR: Backup routing in ad hoc networks. Wireless communications and networking conference, 1311–1316.
Mathew D. (2003) Penrose, random geometric graphs. Oxford University Press, Oxford
Murthy S., Garcia-Luna-Aceves J. J. (1995). A routing protocol for packet radio networks. ACM MOBICOM, 86–94.
Nasipuri A., & Das S. R. (1999). On-demand multipath routing for mobile ad hoc networks. International conference on computer communications and networks, 64–70.
Ni, S. Y., Tseng, Y.-C. Chen Y.-S., & Sheu J.-P. (1999). The broadcast storm problem in a mobile ad hoc network. ACM MOBICOM, 151–162.
Perkins, C. E. (Nov. 1997). Ad hoc on demand distance vector (AODV) routing. IETF, Internet-Draft, draft-ietf-manet-aodv-00.txt.
Perkins C. E., & Bhagwat P. (1994). Highly dynamic destination-sequenced distance-vector routing (DSDV) for mobile computers. ACM SIGCOMM, 234–244.
Perkins C. E., & Royer E. M. (1999). Ad-hoc on-demand distance vector routing. Proceedings of the 2nd IEEE workshop on mobile computing systems and applications, 99–100.
Royer E.M., Toh C.-K. (1999) A review of current routing protocols for ad hoc mobile wireless networks. IEEE Personal Communication 6: 46–55
Sinha P., Sivakumar R., Bharghavan V. (1999) CEDAR: a core-extraction distributed ad hoc routing algorithm. IEEE Communications 17: 1454–1465
Toh C. K. (1997) Associativity based routing for ad-hoc mobile networks. Wireless Personal Communication 4(2): 103–139
Yu, C. W., Yen, L. H., & Cheng, Y. M. Computing subgraph probability of random geometric graphs with applications in wireless ad hoc networks. Tech. Rep., CHU-CSIE-TR-2004-005, Chung Hua University, ROC.
Author information
Authors and Affiliations
Corresponding author
Rights and permissions
About this article
Cite this article
Yu, KM., Yu, C.W. & Yan, SF. An Ad Hoc Routing Protocol with Multiple Backup Routes. Wireless Pers Commun 57, 533–551 (2011). https://doi.org/10.1007/s11277-009-9860-7
Published:
Issue Date:
DOI: https://doi.org/10.1007/s11277-009-9860-7