Personal and Ubiquitous Computing

, Volume 15, Issue 8, pp 799–810

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

Original Paper


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.


MANETS Constrained-based routing Quality of service routing Stability constraint NP-hard problems Polynomial algorithms 

Copyright information

© Springer-Verlag London Limited 2011

Authors and Affiliations

  1. 1.HANA Research GroupUniversity of ManoubaManoubaTunisia

Personalised recommendations