Skip to main content
SpringerLink
Log in

Dual paths node-disjoint routing for data salvation in mobile ad hoc

  • Published:
The Journal of Supercomputing Aims and scope Submit manuscript

Abstract

The operational patterns of multifarious backup strategies on AODV-based (Ad-hoc On-Demand Vector) routing protocols are elaborated in this article. To have a broader picture on relevant routing protocols together, variants of AODV-based backup routing protocols are formulated by corresponding algorithms, and also each of them are simulated to obtain the necessary performance metrics for comparisons in terms of packet delivery ratio, average latency delay, and the normalized routing load. Then to make the process of data salvation more efficiently in case of link failure, we explore the possibility of combining the AODV backup routing strategy and on-demand node-disjoint multipath routing protocols. This article proposes an improved approach named DPNR (Dual Paths Node-disjoint Routing) for data salvation, a routing protocol that maintains the only two shortest backup paths in the source and destination nodes. The DPNR scheme can alleviate the redundancy-frames overhead during the process of data salvation by the neighboring intermediate nodes. Our simulation results have demonstrated that DPNR scheme delivers good data delivery performance while restricting the impacts of transmission collision and channel contention. The mathematical rationale for our proposed approach is stated as well.

This is a preview of subscription content, log in via an institution to check access.

Access this article

Log in via an institution

Price excludes VAT (USA)
Tax calculation will be finalised during checkout.

Instant access to the full article PDF.

Institutional subscriptions

Similar content being viewed by others

References

  1. Corson S, Macker J (1999) Mobile ad hoc networking (MANET): routing protocol performance issues and evaluation considerations. IETF RFC 2501, January 1999. URL: ftp://ftp.rfc-editor.org/in-notes/rfc2501.txt

  2. Perkins CE (2001) Ad hoc networking. Addison-Wesley, Reading

    Google Scholar 

  3. Royer EM, Toh CK (1999) A review of current routing protocols for ad hoc mobile wireless networks. IEEE Pers Commun Mag 6(2):46–55

    Article  Google Scholar 

  4. Chen C-W, Weng C-C (2009) Bandwidth-based routing protocols in mobile ad hoc networks. J Supercomput. doi:10.1007/s11227-008-0260-7

    Google Scholar 

  5. Perkins CE, Royer EM (1999) Ad hoc on-demand distance vector routing. In: The 2nd IEEE workshop on mobile computing systems and applications (WMCSA’99), New Orleans, LA, 25–26 Feb 1999, pp 90–100

  6. Perkins CE, Royer EM, Das SR (2003) Ad hoc on-demand distance vector (AODV) routing. IETF Experimental RFC 3561, July 2003. URL: ftp://ftp.rfc-editor.org/in-notes/rfc3561.txt

  7. Johnson DB, Maltz DA (1996) Dynamic source routing in ad hoc wireless network. In: Imielinski T, Korth H (eds) Mobile computing. Kluwer Academic, Dordrecht, pp 153–181

    Chapter  Google Scholar 

  8. Johnson DB, Hu Y, Maltz DA (2007) The dynamic source routing protocol (DSR) for mobile ad hoc networks for IPv4. IETF Experimental RFC 4728, February 2007. URL: ftp://ftp.rfc-editor.org/in-notes/rfc4728.txt

  9. Lee S-J, Gerla M (2000) AODV-BR: backup routing in ad hoc networks. In: Proceedings of IEEE wireless communications and networking conference (WCNS 2000), vol 3, Chicago, IL, 23–28 Sept 2000, pp 1311–1316

  10. Chen H-L, Lee C-H (2005) Two hops backup routing protocol in mobile ad hoc networks. In: Proceedings of the 11th IEEE international conference on parallel and distributed systems (ICPADS 2005), vol 2, Fukuoka, Japan, 20–22 July 2005, pp 600–604

  11. Chen W-T, Lee W-T (2004) Dynamic AODV backup routing in dense mobile ad hoc networks. In: IFIP international conference on wireless on-demand network systems (WONS 2004), Trento, Italy, 21–23 Jan 2004, LNCS, vol 2928. Springer, Berlin, pp 158–170

    Google Scholar 

  12. Perkins CE, Royer EM, Das SR, Marina MK (2001) Performance comparison of two on-demand routing protocols for ad hoc networks. IEEE Pers Commun Mag 8(1):16–28

    Article  Google Scholar 

  13. Nasipuri A, Castañeda R, Das SR (2001) Performance of multipath routing for on-demand protocols in mobile ad hoc networks. ACM/J Mobile Netw Appl (MONET) 6(4):339–349

    Article  MATH  Google Scholar 

  14. Abbas AM, Khandpur P, Jain BN (2003) NDMA: a node disjoint multipath ad hoc routing protocol. In: Proceedings of 5th world wireless congress (WWC), 2003, pp 334–339

  15. Ye Z, Krishnamurthy SR, Tripathi SK (2003) A framework for reliable routing in mobile ad hoc networks. In: The 22nd annual joint conference of the IEEE computer communications societies (INFOCOM 2003), San Francisco, California, March/April 2003, pp 270–280

  16. Pham P, Perreau S (2003) Performance analysis of reactive shortest path and multi-path routing mechanism with load balance. In: Proceedings of IEEE conference on computer and communication (INFOCOM), April 2003, pp 251–259

  17. Abbas AM, Jain BN (2005) Analysis of disjoint multipath routing for mobile ad hoc networks. In: Proceedings of 7th IEEE international conference on personal wireless communications (ICPWC 2005), New Delhi, India, 23–25 Jan 2005, pp 42–46

  18. Xu W, Yan P, Xia D (2005) Similar node-disjoint multi-paths routing in wireless ad hoc networks. In: Proceedings of 2005 IEEE international conference on wireless communications, networking and mobile computing (WCNM 2005), vol 2, Wuhan, China, 23–26 Sept 2005, pp 731–734

  19. Fall K, Varadhan K (eds) (1999) Ns notes and documentation. http://www-mash/cs.berkeley.edu/ns/

  20. Lin C-H, Jiang F-C, Chang J-C, Sandnes FE (2008) Node-disjoint alternative dual-path routing for data salvation in mobile ad hoc networks. In: Proceedings of the ninth international conference on parallel and distributed computing, applications, and technologies (PDCAT 2008), December 1–4, 2008, Dunedin, Otago, New Zealand

  21. Li X, Cuthbert L (2004) On-demand node-disjoint multipath routing in wireless ad hoc networks. In: Proceedings of the 29th annual IEEE international conference on local computer network (LCN’04), Tampa, FL, 16–18 Nov 2004, pp 419–420

  22. Bettstetter C (2002) On the minimum node degree and connectivity of a wireless multihop network. In: Proc of ACM mobile ad hoc networking and computing (MobiHoc), 2002, pp 80–91

  23. Shooman ML (1990) Probabilistic reliability: an engineering approach, 2nd edn. Krieger, Melbourne

    MATH  Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Department of Computer Science and Engineering, National Chung-Hsing University, 250 Kuo-Kuang Rd., Taichung, 40204, Taiwan

    Fuu-Cheng Jiang & Der-Chen Huang

  2. Department of Computer Science, Tunghai University, 181 Section 3, Taichung Port Rd., Taichung, 40704, Taiwan

    Chu-Hsing Lin & Chao-Tung Yang

Authors
  1. Fuu-Cheng Jiang
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Chu-Hsing Lin
    View author publications

    You can also search for this author in PubMed Google Scholar

  3. Der-Chen Huang
    View author publications

    You can also search for this author in PubMed Google Scholar

  4. Chao-Tung Yang
    View author publications

    You can also search for this author in PubMed Google Scholar

Corresponding author

Correspondence to Chao-Tung Yang.

Rights and permissions

Reprints and permissions

About this article

Cite this article

Jiang, FC., Lin, CH., Huang, DC. et al. Dual paths node-disjoint routing for data salvation in mobile ad hoc. J Supercomput 59, 268–296 (2012). https://doi.org/10.1007/s11227-010-0437-8

Download citation

  • Published:

  • Issue Date:

  • DOI: https://doi.org/10.1007/s11227-010-0437-8

Keywords

Search

Navigation