Skip to main content
SpringerLink
Log in

Stability routing with constrained path length for improved routability in dynamic MANETs

  • Original Paper
  • Published:
Personal and Ubiquitous Computing Aims and scope Submit manuscript

Abstract

Quality of service (QoS) routing is known to be an NP-hard problem in case of two or more additive constraints, and several exact algorithms and heuristics have been proposed to address this issue. In this paper, we consider a particular two-constrained quality of service routing problem maximizing path stability with a limited path length in the quest of improving routability in dynamic multi-hop mobile wireless ad hoc networks. First, we propose a novel exact algorithm to solve the optimal weight-constrained path problem. We instantiate our algorithm to solve the most stable path not exceeding a certain number of hops, in polynomial time. This algorithm is then applied to the practical case of proactive routing in dynamic multi-hop wireless ad hoc networks. In these networks, an adequate compromise between route stability and its length in hops is essential for appropriately mitigating the impact of the network dynamics on the validity of established routes. Secondly, we set up a common framework for the comparison between three families of proactive routing: the shortest path-based routing, the most stable path-based routing and our proposed most stable constrained path routing. We show then through extensive simulations that routing based on our proposed algorithm selects appropriate stable paths yielding a very high routability with an average path length just above that of the shortest paths.

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

Fig. 1
Fig. 2
Fig. 3
Fig. 4
Fig. 5

Similar content being viewed by others

References

  1. Carofiglio G, Chiasserini C, Garetto M, Leonardi E (2009) Techical report analysis of route stability in MANETs. IEEE Trans Mob Comput 8(9):1167–1179

    Article  Google Scholar 

  2. Van Mieghem P, Kuipers FA (2004) Concepts of exact QoS routing algorithms. IEEE/ACM Trans Netw 12(5):851–864

    Google Scholar 

  3. Wang Z, Crowcroft Jon (1996) Qos routing for supporting resource reservation. IEEE JSAC 14:1228–1234

    Google Scholar 

  4. Jaffe JM (1984) Algorithms for finding paths with multiple constraints. Networks 14:95–116

    Article  MathSciNet  MATH  Google Scholar 

  5. Salama HF, Reeves DS, Viniotis Y (1997) A distributed algorithm for delay-constrained unicast routing. IEEE INFOCOM, vol 1, pp 84–91, Japan

  6. Feng G, Doulgeris C (2001) Fast algorithms for delay constrained leastcost unicast routing. INFORMS’2001, Miami Beach

  7. Hassin R (1992) Approximation scheme for the restricted shortest path problem. Math Oper Res 17(1):36–42

    Article  MathSciNet  MATH  Google Scholar 

  8. Juttner A, Szviatovszki B, Mecs I, Rajko Z (2001) Lagrange relaxation based method for the QoS routing problem. Proc IEEE INFOCOM 2:859–868

    Google Scholar 

  9. Sun Q, Langendorfer H (1998) A new distributed algorithm for supporting delay-sensitive applications. Comput Commun 21:572–578

    Article  Google Scholar 

  10. Widyono R (1994) The design and evaluation of routing algorithms for realtime channels. Tenet Group, Dept. EECS, Univ. California, Berkeley, CA, Tech. Rep. TR-94-024

  11. Chen S, Nahrstedt K (1998) On finding multi-constrained paths. ICC’98, pp 874–879, Atlanta, GA

  12. Feng G, Doulgeris C (2002) An efficient approximate algorithm for finding paths with two additive constraints. IEICE Trans Comm E85-B(6):1143–1151

    Google Scholar 

  13. Yuan X (1999) On the extended Bellman-Ford algorithm to solve two constrained quality of service routing problems. In: Proceedings of the eighth international conference on computer communications and networks (IC3N 99). Boston, USA

  14. Yuan X, Liu X (2001) Heuristic algorithms for multi-constrained quality of service routing. IEEE INFOCOM 2:844–853 Alsaka

    Google Scholar 

  15. Chung WH (2004) Probabilistic analysis of routes on mobile ad hoc networks. IEEE Commun Lett 8(8):506–508

    Article  Google Scholar 

  16. Dube R, Rais CD, Wang KY, Tripathi SK (1997) Signal stability-based adaptive routing (SSA) for ad hoc mobile networks. IEEE Pers Commun Mag 4(1):36–45

    Article  Google Scholar 

  17. Toh C-K (1997) Associativity-based routing for ad hoc mobile networks. Int J Wirel Pers Commun 4(2):103–139

    Article  Google Scholar 

  18. Beraldi R, Querzoni L, Baldoni R (2006) A hint-based probabilistic protocol for unicast communications in MANETs. Ad Hoc Networks 4:547–566. Elsevier

    Google Scholar 

  19. Dubois-Ferriere H, Grossglauser M, Vetterli M (2003) Age matters: efficient route discovery in mobile ad hoc networks using encounter ages. In: Proceedings of the ACM MobiHoc’03, pp 1–3, Annapolis, MD, USA

  20. Roth M, Wicker S (2003) Termite: emergent ad-hoc networking. In: Proceedings of the second Mediterranean workshop on ad-hoc networks, Mehdia, Tunisia

  21. Yu D, Li H, Gruber I (2003) Path availability in ad hoc network. In: Proceedings of the 10th international conference on telecommunications (ICT03), vol 1, pp 383–387

  22. Zhang Hui, Dong Yu-Ning (2007) A novel path stability computation model for wireless ad hoc networks. IEEE Signal Process Lett 14(12):928–931

    Google Scholar 

  23. Camp T, Boleng J, Davies V (2002) A survey of mobility models for ad hoc network research. Wireless Communication and Mobile Computing (WCMC): Special issue on Mobile Ad Hoc Networking: Research Trends and Applications 2(5):483–502

  24. Tseng Y, Li YF, Chang Y (2003) On route life time in multihop mobile ad hoc networks. IEEE TOC 2(4):366–376

    Google Scholar 

  25. Belghith A, Abid MA, Ben Mnaouer A (2009) Suitability analysis of probabilistic routing for dynamic ad-hoc networks. In: The 5th IEEE international conference on wireless and mobile computing, networking and communications (IEEE WiMob 2009), Marrakech, Morocco, 12–14 Oct

  26. Liu G, Ramakrishnan KG (2001) A*Prune: an algorithm for finding K shortest paths subject to multiple constraints. IEEE INFOCOM 2:743–749, Alaska

    Google Scholar 

  27. Lee WC, Hluchyj MG, Humblet PA (1995) Routing subject to quality of service constraints in integrated communication networks. IEEE Netw 9(4):14–16

    Article  Google Scholar 

  28. Perkins CE, Royer EM, Chakeres ID (2003) Ad hoc on demand distance vector routing protocol. Internet Draft, MANET Working Group

  29. Clausen T, Jacquet P (2003) Optimized link state routing protocol (OLSR). minus 0.4emRequest for Comment 3626, MANET Working Group

  30. Giordano S, Stojmenovic I (2003) Position-based ad hoc routes in ad hoc networks. CRC Press, Inc., Boca Raton, pp 287–300

  31. Lachapelle G (2007) Pedestrian navigation with high sensitivity GPS receivers and MEMS. Springer J Pers Ubiquitous Comput 11(6):481–488

    Article  Google Scholar 

  32. Abid MA, Belghith A (2010) Asynchronous locally self-adjusted routing protocol for mobile multi hop ad hoc networks. In: The 8th ACS/IEEE international conference ACS/IEEE AICCSA’10, Hammamet, Tunisia

Download references

Author information

Authors and Affiliations

  1. HANA Research Group, University of Manouba, Manouba, Tunisia

    Mohamed Amine Abid & Abdelfettah Belghith

Authors
  1. Mohamed Amine Abid
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Abdelfettah Belghith
    View author publications

    You can also search for this author in PubMed Google Scholar

Corresponding author

Correspondence to Mohamed Amine Abid.

Rights and permissions

Reprints and permissions

About this article

Cite this article

Abid, M.A., Belghith, A. Stability routing with constrained path length for improved routability in dynamic MANETs. Pers Ubiquit Comput 15, 799–810 (2011). https://doi.org/10.1007/s00779-011-0366-4

Download citation

  • Received:

  • Accepted:

  • Published:

  • Issue Date:

  • DOI: https://doi.org/10.1007/s00779-011-0366-4

Keywords

Search

Navigation