MARio: mobility-adaptive routing using route lifetime abstractions in mobile ad hoc networks

Authors:
Yong Wang;Margaret Martonosi;Li-Shiuan Peh
Affiliations:
Princeton University, NJ;Princeton University, NJ;Princeton University, NJ
Venue:
ACM SIGMOBILE Mobile Computing and Communications Review
Year:
2004

Citing 6
Cited 0

Energy-efficient computing for wildlife tracking: design tradeoffs and early experiences with ZebraNet

Proceedings of the 10th international conference on Architectural support for programming languages and operating systems
PATHS: analysis of PATH duration statistics and their impact on reactive MANET routing protocols

Proceedings of the 4th ACM international symposium on Mobile ad hoc networking & computing
Towards mobility as a network control primitive

Proceedings of the 5th ACM international symposium on Mobile ad hoc networking and computing
A message ferrying approach for data delivery in sparse mobile ad hoc networks

Proceedings of the 5th ACM international symposium on Mobile ad hoc networking and computing
Intelligent fluid infrastructure for embedded networks

Proceedings of the 2nd international conference on Mobile systems, applications, and services
Routing in a delay tolerant network

Proceedings of the 2004 conference on Applications, technologies, architectures, and protocols for computer communications

Quantified Score

Hi-index	0.00

Visualization

Abstract

Mobile Ad hoc NETworks (MANETs) often have fast-changing and unpredictable mobility. This is especially true for recently emerging mobile sensor networks [7] and delay tolerant networks [2], where extreme network conditions are prevalent. To better adjust to such network conditions, we propose to deconstruct the underlying node mobility into a set of abstractions that can be readily leveraged for driving dynamic routing decisions. In particular, we investigate the feasibility of using route lifetime to abstract mobility. Through extensive simulations on DSR, we demonstrate up to 31% improvement in packet delivery rate and 53% improvement in average end-to-end packet latency, using our proposed route prefetch and decay techniques that leverage knowledge of route lifetimes.