Call for Paper - November 2023 Edition
IJCA solicits original research papers for the November 2023 Edition. Last date of manuscript submission is October 20, 2023. Read More

On Demand Temporary Parallel Route Recovery for Frequent Link Failure in Adhoc Networks

International Journal of Computer Applications
© 2010 by IJCA Journal
Number 11 - Article 1
Year of Publication: 2010
Amit D. Kothari
Dr. Ashok R. Patel

Amit D Kothari and Dr. Ashok R Patel. Article:On Demand Temporary Parallel Route Recovery for Frequent Link Failure in Adhoc Networks. International Journal of Computer Applications 11(11):1–6, December 2010. Published By Foundation of Computer Science. BibTeX

	author = {Amit D. Kothari and Dr. Ashok R. Patel},
	title = {Article:On Demand Temporary Parallel Route Recovery for Frequent Link Failure in Adhoc Networks},
	journal = {International Journal of Computer Applications},
	year = {2010},
	volume = {11},
	number = {11},
	pages = {1--6},
	month = {December},
	note = {Published By Foundation of Computer Science}


Adhoc network is collection of wireless mobile nodes dynamically forming a temporary network without the use of existing network infrastructure of centralized administration. Each node acts as a router by itself and forwards all the packets which it receives.

This concept is basically useful when there is a very high link failure due to migration of nodes from the available network region. There is a frequent link failure in adhoc networks, which causes packet to be lost or packets doubts to reach destination. In this scenario a different mechanism and scheme is proposed and implemented to make the important time critical data like real time or voice data to reach the destination without any loss. The mechanism used is a special propagation which propagates a unique kind of parallel route discovery for real time application scenario to send the time critical data safely. The scheme used is temporary parallel route recovery builds a temporary parallel path between the nodes during link failure. The important node then forwards the buffered packets to the destination without any loss which is on-demand based on type of information a node forwards. Special buffer is allocated and simulated by using a simulation tool NS-2. This extensive mode is compared with standard models performance metrics such as packet delivery ration, routing overheads and average delay are analyzed.


  • Andrew S. Tanenbaum: Computer Networks, Third Edition, Prentice Hall of India Private Limited, 2000.
  • Charles E. Perkins, Elizabeth M. BeldingRoyer, and Samir Das. “Ad Hoc On Demand Distance Vector (AODV) Routing” IETF internet draft, draft-ietfmanet-aodv-10.txt, March 2002 (work in progress)
  • C. Perkins, E. Belding-Royer, and S. Das, “Ad hoc On-Demand Distance Vector routing,” RFC 3561, July 2003.
  • C. E. Perkins and P. Bhagwat, “Highly dynamic destination-sequenced distance-vector routing (dsdv) for mobile computers,” in ACM Sigcomm, London, UK, 31 August - 2 September 1994.
  • D. Johnson, Y. Hu, and D. Maltz, “The Dynamic Source Routing Protocol (DSR) for Mobile Ad Hoc Networks for IPv4,” RFC 4728, February 2007
  • Levente Buttyan, Jeen-Pierre Hubaux “Simulating Cooperation in Adhoc Wireless Network Mobile Network and Applications” October 2003 Volume 8.
  • L. Buttyan and J.P.Hubaux, “Stimulating Cooperation in Self-Organizing Mobile AdHOc Networks” Technical Report No.DSC/2001/046, August 2001.
  • NS-2 manuals -
  • Shih-Lin Wu, Sze-yaoNi,Yu-Chee Tseng, and Jang-Ping Sheu “Route Maintenance in a Wireless Mobile Ad Hoc Network” Proceeding of the 33rd Hawaii International Conference on System Sciences-2000.