Sciweavers

Share
JCO
2006

Reliable Ad Hoc Routing Based on Mobility Prediction

8 years 10 months ago
Reliable Ad Hoc Routing Based on Mobility Prediction
Reliability is a very important issue in Mobile Ad hoc NETworks (MANETs). Shortest paths are usually used to route packets in MANETs. However, a shortest path may fail quickly, because some of the wireless links along a shortest path may be broken shortly after the path is established due to mobility of mobile nodes. Rediscovering routes may result in substantial data loss and message exchange overhead. In this paper, we study reliable ad hoc routing in the urban environment. Specifically, we formulate and study two optimization problems. In the minimum Cost Duration-bounded Path (CDP) routing problem, we seek a minimum cost source to destination path with duration no less than a given threshold. In the maximum Duration Cost-bounded Path (DCP) routing problem, we seek a maximum duration source to destination path with cost no greater than a given threshold. We use a waypoint graph to model the working area of a MANET and present an offline algorithm to compute a duration prediction tab...
Jian Tang, Guoliang Xue, Weiyi Zhang
Added 13 Dec 2010
Updated 13 Dec 2010
Type Journal
Year 2006
Where JCO
Authors Jian Tang, Guoliang Xue, Weiyi Zhang
Comments (0)
books