Highly dynamic Destination-Sequenced Distance-Vector routing (DSDV) for mobile computers
SIGCOMM '94 Proceedings of the conference on Communications architectures, protocols and applications
Analysis of TCP performance over mobile ad hoc networks
MobiCom '99 Proceedings of the 5th annual ACM/IEEE international conference on Mobile computing and networking
Preemptive routing in Ad Hoc networks
Proceedings of the 7th annual international conference on Mobile computing and networking
Associativity-Based Routing for Ad Hoc Mobile Networks
Wireless Personal Communications: An International Journal
Link Stability in Mobile Wireless Ad Hoc Networks
LCN '02 Proceedings of the 27th Annual IEEE Conference on Local Computer Networks
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
Fuzzy metric approach for route lifetime determination in wireless ad hoc networks
International Journal of Ad Hoc and Ubiquitous Computing
Discovering long lifetime routes in mobile ad hoc networks
Ad Hoc Networks
Adaptive and fuzzy approaches for nodes affinity management in wireless ad-hoc networks
Mobile Information Systems
Enhanced next hop selection scheme for QoS support in multi-hop wireless networks
Proceedings of the 2009 International Conference on Hybrid Information Technology
A smooth-turn mobility model for airborne networks
Proceedings of the first ACM MobiHoc workshop on Airborne Networks and Communications
Airborne network: a cyber-physical system perspective
Proceedings of the first ACM MobiHoc workshop on Airborne Networks and Communications
Analysis of link lifetime in wireless mobile networks
Ad Hoc Networks
Hi-index | 0.00 |
In mobile ad hoc networks, node mobility causes links between nodes to break frequently, thus terminating the lifetime of the routes containing those links. An alternative route has to be discovered once a link is detected as broken, incurring extra route discovery overhead and packet latency. A simple solution to reduce the frequency of this costly discovery procedure is to choose a long lifetime route carefully during the route discovery phase rather than a simple random shortest-path route scheme. This simple solution, although straightforward, requires investigation of several questions before it can be implemented. Specifically, how much effect does node mobility have on the link lifetime? Correspondingly, how much effect does it have on the route lifetime? How much lifetime extension can we achieve by using a long lifetime route compared to a randomly chosen shortest-path route? How much benefit can we obtain by using these longer lifetime routes, and what is the tradeoff of using them? By answering these questions, we gain enough insight to determine under what circumstances long lifetime routes are worth being discovered and implemented. In this paper, we first formulate the distribution of a link lifetime and correspondingly the distribution of a route lifetime. Then we present an algorithm to determine the longest lifetime routes at different route lengths. We experimentally compare these long lifetime routes with traditional random shortest-path routes and reveal the tradeoff of using long lifetime routes of different lengths. All the fundamental results will serve as the guideline for our future implementation of a distributed long lifetime routing protocol.