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

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.

[1]  Charles E. Perkins,et al.  Ad-hoc on-demand distance vector routing , 1999, Proceedings WMCSA'99. Second IEEE Workshop on Mobile Computing Systems and Applications.

[2]  Jeffrey M. Jaffe,et al.  Algorithms for finding paths with multiple constraints , 1984, Networks.

[3]  Roberto Beraldi,et al.  A hint-based probabilistic protocol for unicast communications in MANETs , 2005, 11th International Conference on Parallel and Distributed Systems (ICPADS'05).

[4]  Refael Hassin,et al.  Approximation Schemes for the Restricted Shortest Path Problem , 1992, Math. Oper. Res..

[5]  Xingming Liu,et al.  Heuristic algorithms for multi-constrained quality of service routing , 2001, Proceedings IEEE INFOCOM 2001. Conference on Computer Communications. Twentieth Annual Joint Conference of the IEEE Computer and Communications Society (Cat. No.01CH37213).

[6]  Hui Li,et al.  Path availability in ad hoc network , 2003, 10th International Conference on Telecommunications, 2003. ICT 2003..

[7]  Gang Liu,et al.  A*Prune: an algorithm for finding K shortest paths subject to multiple constraints , 2001, Proceedings IEEE INFOCOM 2001. Conference on Computer Communications. Twentieth Annual Joint Conference of the IEEE Computer and Communications Society (Cat. No.01CH37213).

[8]  Ivan Stojmenovic,et al.  Position-based ad hoc routes in ad hoc networks , 2003 .

[9]  Abdelfettah Belghith,et al.  Suitability Analysis of Probabilistic Proactive Routing for Dynamic Multi-hop Ad Hoc Networks , 2009, 2009 IEEE International Conference on Wireless and Mobile Computing, Networking and Communications.

[10]  Abdelfettah Belghith,et al.  Asynchronous locally self adjusted routing protocol for mobile multi hop ad hoc networks , 2010, ACS/IEEE International Conference on Computer Systems and Applications - AICCSA 2010.

[11]  Xin Yuan.  On the extended Bellman-Ford algorithm to solve two-constrained quality of service routing problems , 1999, Proceedings Eight International Conference on Computer Communications and Networks (Cat. No.99EX370).

[12]  Philippe Jacquet,et al.  Optimized Link State Routing Protocol (OLSR) , 2003, RFC.

[13]  Douglas S. Reeves,et al.  A distributed algorithm for delay-constrained unicast routing , 1997, Proceedings of INFOCOM '97.

[14]  Hui Zhang,et al.  A Novel Path Stability Computation Model for Wireless Ad Hoc Networks , 2007, IEEE Signal Processing Letters.

[15]  Matthias Grossglauser,et al.  Age matters: efficient route discovery in mobile ad hoc networks using encounter ages , 2003, MobiHoc '03.

[16]  Xin Yuan.  Heuristic algorithms for multiconstrained quality-of-service routing , 2002, IEEE/ACM Trans. Netw..

[17]  Tracy Camp,et al.  A survey of mobility models for ad hoc network research , 2002, Wirel. Commun. Mob. Comput..

[18]  Wei-Ho Chung.  Probabilistic analysis of routes on mobile ad hoc networks , 2004, IEEE Communications Letters.

[19]  Pierre A. Humblet,et al.  Routing subject to quality of service constraints in integrated communication networks , 1995, IEEE Netw..

[20]  Roberto Beraldi,et al.  A hint-based probabilistic protocol for unicast communications in MANETs , 2006, Ad Hoc Networks.

[21]  Chai-Keong Toh,et al.  Associativity-Based Routing for Ad Hoc Mobile Networks , 1997, Wirel. Pers. Commun..

[22]  Michele Garetto,et al.  Analysis of Route Stability in MANETs , 2006 .

[23]  Michele Garetto,et al.  Route Stability in MANETs under the Random Direction Mobility Model , 2009, IEEE Transactions on Mobile Computing.

[24]  Piet Van Mieghem,et al.  Concepts of exact QoS routing algorithms , 2004, IEEE/ACM Transactions on Networking.

[25]  G. Feng.  Fast algorithms for delay-constrained least-cost unicast routing , 2001 .

[26]  Ron Widyono.  The Design and Evaluation of Routing Algorithms for Real-time Channels , 1994 .

[27]  Gérard Lachapelle.  Pedestrian navigation with high sensitivity GPS receivers and MEMS , 2006, Personal and Ubiquitous Computing.

[28]  Satish K. Tripathi,et al.  Signal stability-based adaptive routing (SSA) for ad hoc mobile networks , 1997, IEEE Wirel. Commun..

[29]  Klara Nahrstedt,et al.  On finding multi-constrained paths , 1998, ICC '98. 1998 IEEE International Conference on Communications. Conference Record. Affiliated with SUPERCOMM'98 (Cat. No.98CH36220).

[30]  Bal Azs.  Lagrange Relaxation Based Method for the QoS Routing Problem , 2001 .

[31]  Yu-Chee Tseng,et al.  On Route Lifetime in Multihop Mobile Ad Hoc Networks , 2003, IEEE Trans. Mob. Comput..

[32]  Gang Feng,et al.  An Efficient Approximate Algorithm for Finding Paths with Two Additive Constraints , 2002 .

[33]  Quan Sun,et al.  A new distributed routing algorithm for supporting delay-sensitive applications , 1998, Comput. Commun..

[34]  Gregory A. Hansen,et al.  The Optimized Link State Routing Protocol , 2003 .