Signal stability based adaptive routing (SSA) for ad-hoc mobile networks
Signal stability based adaptive routing (SSA) for ad-hoc mobile networks
A performance comparison of multi-hop wireless ad hoc network routing protocols
MobiCom '98 Proceedings of the 4th annual ACM/IEEE international conference on Mobile computing and networking
Simulation-based performance evaluation of routing protocols for mobile ad hoc networks
Mobile Networks and Applications
Associativity-Based Routing for Ad Hoc Mobile Networks
Wireless Personal Communications: An International Journal
Ad-hoc On-Demand Distance Vector Routing
WMCSA '99 Proceedings of the Second IEEE Workshop on Mobile Computer Systems and Applications
A Highly Adaptive Distributed Routing Algorithm for Mobile Wireless Networks
INFOCOM '97 Proceedings of the INFOCOM '97. Sixteenth Annual Joint Conference of the IEEE Computer and Communications Societies. Driving the Information Revolution
Link Stability and Route Lifetime in Ad-hoc Wireless Networks
ICPPW '02 Proceedings of the 2002 International Conference on Parallel Processing Workshops
MERIT: a scalable approach for protocol assessment
Mobile Networks and Applications
Strategies for Finding Stable Paths in Mobile Wireless Ad Hoc Networks
LCN '03 Proceedings of the 28th Annual IEEE International Conference on Local Computer Networks
Hi-index | 0.00 |
Path stability is a very critical issue in resource-constrained environments as frequent route discoveries can easily congest the network and also unnecessarily exhaust the battery power of nodes. We quantify path stability in terms of the number of route transitions a routing protocol incurs to continue the data exchange between a particular source-destination (s-t) pair. End-to-end delay of an s-t session is another equally important performance metric, particularly for real-time applications. Aiming for optimum end-to-end delay can lead to unnecessary route transitions and vice-versa. In this paper, we introduce the idea of Stability-Delay Tradeoff (SDT) - as a measure of the efficiency of a MANET routing protocol. In a two-dimensional space of stability and delay, SDT refers to the proximity of the routing protocol's actual stability and delay with respect to the optimal stability and delay under the same history of network topology changes. We show that the theoretical optimum for path stability i.e., the number of route transitions is efficiently computable in polynomial time. We also propose a (distance, weight)-based assessment technique to quantify the SDT of a routing protocol.