Abstract
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 table for the given waypoint graph. An entry in the duration prediction table contains the guaranteed worst-case duration of the corresponding wireless link. We then present an efficient algorithm which computes a minimum cost duration-bounded path, using the information provided in the duration prediction table. We also present a heuristic algorithm for the DCP routing problem. In addition, we show that the proposed prediction and routing schemes can be easily applied for designing reliable ad hoc routing protocols. Simulation results show that our mobility prediction based routing algorithms lead to higher network throughput and longer average path duration, compared with the shortest path routing.
Similar content being viewed by others
References
Bai F, Sadagopan N, Helmy A (2003) IMPORTANT: A framework to systematically analyze the impact of mobility on performance of routing protocols for ad hoc networks. In: Proceedings of IEEE INFOCOM, pp. 825–835
Broch J, Maltz DA, Johnson DB, Hu YC, Jetcheva J (1998) A performance comparison of multi-hop wireless ad hoc network routing protocols. In: Proceedings of ACM MobiCom, pp. 85–97
Clausen T, Jacquet P, Laouiti A, Muhlethaler P, Qayyum A, Viennot L (2001) Optimized link state routing protocol for ad hoc networks. In: Proceedings of IEEE INMIC, pp. 62–68
Hong X, Gerla M, Pei G, Chiang CC (1999) A group mobility model for ad hoc wireless networks. In: Proceedings of ACM/IEEE MSWiM, pp. 53–60
Jiang S, He D, Rao J (2001) A prediction-based link availability estimation for mobile ad hoc networks. In: Proceedings of INFOCOM, pp. 1745–1752
Johnson DB, Maltz DA, Hu YC (2003) The dynamic source routing protocol for mobile ad hoc networks (DSR). IETF Draft
Lee SJ, Su W, Gerlaw M (2001) Wireless ad hoc multicast routing with mobility prediction. Mobile Networks and Applications 6:351–360
Lim G, Shin K, Lee S, Yoon H, Ma JS (2002) Link stability and route lifetime in ad hoc wireless networks. In: Proceedings of IEEE ICPPW, pp. 116–123
Lou W, Liu W, Fang Y (2004) SPREAD: Enhancing data confidentiality in mobile ad hoc networks, In: Proceedings of IEEE INFOCOM, pp. 2404–2413
Papadimitratos P, Haas J, Sirer EG (2002) Path set selection in mobile ad hoc networks. In: Proceedings of IEEE MobiHoc, pp. 1–11
Pearlman MR, Haas ZJ (1999) Improving the performance of query-based routing protocols through diversity injection. In: Proceedings of IEEE WCNC, pp. 1548–1552
Pei G, Gerla M, Hong X (2000) LANMAR: Landmark routing for large scale wireless ad hoc networks with group mobility. In: Proceedings of ACM MobiHoc, pp. 11–18
Perkins CE (2001) Ad hoc networking, Addison-Wesley
Perkins CE, Royer EM Ad-hoc on-demand distance vector routing. In: Proceedings of IEEE WMCSA, pp. 90–100
Sadagopan N, Bai F, Krishnamachari B, Helmy A (2003) PATHS: Analysis of PATH duration statistics and their impact on reactive MANET routing protocols. In: Proceedings of ACM MobiCom, pp. 245–256
Stojmenovic I, Russell M, Vukojevic B (2000) Depth first search and location based localized routing and QoS routing in wireless networks. In: Proceedings of IEEE ICPP, pp. 173–180
Su W, Lee SJ, Gerla M (2001) Mobility prediction and routing in ad hoc wireless networks. Iternational Journal of Network Management 11:3–30
Toh CK (1999) Long-lived ad hoc routing based on the concept of associativity. IETF Draft
Wang L, Zhang L, Yang O, Shu Y, Dong M (2000) Multipath source routing in wireless ad hoc networks. In: Proceedings of IEEE CCECE, pp. 479–483
Wu K, Harms J (2002) Multipath routing for mobile ad hoc networks. IEEE Journal of Communications and Networks, Special Issue on Innovations in Ad Hoc Mobile Pervasive Networks 4:48–58
Author information
Authors and Affiliations
Corresponding author
Additional information
This research was supported in part by ARO grant W911NF-04-1-0385 and NSF grant CCF-0431167. The information reported here does not reflect the position or the policy of the federal government.
Rights and permissions
About this article
Cite this article
Tang, J., Xue, G. & Zhang, W. Reliable Ad Hoc Routing Based on Mobility Prediction. J Comb Optim 11, 71–85 (2006). https://doi.org/10.1007/s10878-006-5978-7
Accepted:
Issue Date:
DOI: https://doi.org/10.1007/s10878-006-5978-7