Approximation schemes for the restricted shortest path problem
Mathematics of Operations Research
Associativity-Based Routing for Ad Hoc Mobile Networks
Wireless Personal Communications: An International Journal
Age matters: efficient route discovery in mobile ad hoc networks using encounter ages
Proceedings of the 4th ACM international symposium on Mobile ad hoc networking & computing
A Distributed Algorithm for Delay-Constrained Unicast Routing
INFOCOM '97 Proceedings of the INFOCOM '97. Sixteenth Annual Joint Conference of the IEEE Computer and Communications Societies. Driving the Information Revolution
Position-based ad hoc routes in ad hoc networks
The handbook of ad hoc wireless networks
Concepts of exact QoS routing algorithms
IEEE/ACM Transactions on Networking (TON)
Pedestrian navigation with high sensitivity GPS receivers and MEMS
Personal and Ubiquitous Computing
On Route Lifetime in Multihop Mobile Ad Hoc Networks
IEEE Transactions on Mobile Computing
Route Stability in MANETs under the Random Direction Mobility Model
IEEE Transactions on Mobile Computing
Suitability Analysis of Probabilistic Proactive Routing for Dynamic Multi-hop Ad Hoc Networks
WIMOB '09 Proceedings of the 2009 IEEE International Conference on Wireless and Mobile Computing, Networking and Communications
Asynchronous locally self adjusted routing protocol for mobile multi hop ad hoc networks
AICCSA '10 Proceedings of the ACS/IEEE International Conference on Computer Systems and Applications - AICCSA 2010
Research: A new distributed routing algorithm for supporting delay-sensitive applications
Computer Communications
Routing subject to quality of service constraints in integrated communication networks
IEEE Network: The Magazine of Global Internetworking
| Hi-index | 0.00 |
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.