Reliable routing in mobile ad hoc networks based on mobility prediction

Jian Tang, Guoliang Xue, Weiyi Zhang

Research output: Chapter in Book/Report/Conference proceedingConference contribution

19 Citations (Scopus)

Abstract

Reliability is a major issue in mobile ad hoc routing. Shortest paths are usually used to route packets in Mobile Ad hoc NETworks (MANETs). However, a shortest path may fail quickly, because some of the wireless links on the shortest path may be broken shortly after the path is established due to mobility of mobile nodes. Rediscovering routes can result in substantial data loss and communication overheads. In this paper, we consider a MANET in the urban environment. We formulate and study two optimization problems related to reliable routing in MANETs. In the Minimum Cost Duration-Bounded Path (MCDBP) 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 (MDCBP) routing problem, we seek a maximum duration source to destination path with cost no greater than a given constraint. 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 MDCBP routing problem. Our simulation results show that our mobility prediction based routing algorithms lead to better network throughput and longer average path duration, compared with the shortest path algorithm.

Original languageEnglish (US)
Title of host publication2004 IEEE International Conference on Mobile Ad-Hoc and Sensor Systems
Pages466-474
Number of pages9
StatePublished - 2004
Event2004 IEEE International Conference on Mobile Ad-Hoc and Sensor Systems - Fort Lauderdale, FL, United States
Duration: Oct 25 2004Oct 27 2004

Other

Other2004 IEEE International Conference on Mobile Ad-Hoc and Sensor Systems
CountryUnited States
CityFort Lauderdale, FL
Period10/25/0410/27/04

Fingerprint

Mobile ad hoc networks
Costs
Telecommunication links
Routing algorithms
Heuristic algorithms
Throughput
Communication

ASJC Scopus subject areas

  • Engineering(all)

Cite this

Tang, J., Xue, G., & Zhang, W. (2004). Reliable routing in mobile ad hoc networks based on mobility prediction. In 2004 IEEE International Conference on Mobile Ad-Hoc and Sensor Systems (pp. 466-474)

Reliable routing in mobile ad hoc networks based on mobility prediction. / Tang, Jian; Xue, Guoliang; Zhang, Weiyi.

2004 IEEE International Conference on Mobile Ad-Hoc and Sensor Systems. 2004. p. 466-474.

Research output: Chapter in Book/Report/Conference proceedingConference contribution

Tang, J, Xue, G & Zhang, W 2004, Reliable routing in mobile ad hoc networks based on mobility prediction. in 2004 IEEE International Conference on Mobile Ad-Hoc and Sensor Systems. pp. 466-474, 2004 IEEE International Conference on Mobile Ad-Hoc and Sensor Systems, Fort Lauderdale, FL, United States, 10/25/04.
Tang J, Xue G, Zhang W. Reliable routing in mobile ad hoc networks based on mobility prediction. In 2004 IEEE International Conference on Mobile Ad-Hoc and Sensor Systems. 2004. p. 466-474
Tang, Jian ; Xue, Guoliang ; Zhang, Weiyi. / Reliable routing in mobile ad hoc networks based on mobility prediction. 2004 IEEE International Conference on Mobile Ad-Hoc and Sensor Systems. 2004. pp. 466-474
@inproceedings{dcd9e7a36cc84837a9e6474725581c3f,
title = "Reliable routing in mobile ad hoc networks based on mobility prediction",
abstract = "Reliability is a major issue in mobile ad hoc routing. Shortest paths are usually used to route packets in Mobile Ad hoc NETworks (MANETs). However, a shortest path may fail quickly, because some of the wireless links on the shortest path may be broken shortly after the path is established due to mobility of mobile nodes. Rediscovering routes can result in substantial data loss and communication overheads. In this paper, we consider a MANET in the urban environment. We formulate and study two optimization problems related to reliable routing in MANETs. In the Minimum Cost Duration-Bounded Path (MCDBP) 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 (MDCBP) routing problem, we seek a maximum duration source to destination path with cost no greater than a given constraint. 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 MDCBP routing problem. Our simulation results show that our mobility prediction based routing algorithms lead to better network throughput and longer average path duration, compared with the shortest path algorithm.",
author = "Jian Tang and Guoliang Xue and Weiyi Zhang",
year = "2004",
language = "English (US)",
isbn = "0780388151",
pages = "466--474",
booktitle = "2004 IEEE International Conference on Mobile Ad-Hoc and Sensor Systems",

}

TY - GEN

T1 - Reliable routing in mobile ad hoc networks based on mobility prediction

AU - Tang, Jian

AU - Xue, Guoliang

AU - Zhang, Weiyi

PY - 2004

Y1 - 2004

N2 - Reliability is a major issue in mobile ad hoc routing. Shortest paths are usually used to route packets in Mobile Ad hoc NETworks (MANETs). However, a shortest path may fail quickly, because some of the wireless links on the shortest path may be broken shortly after the path is established due to mobility of mobile nodes. Rediscovering routes can result in substantial data loss and communication overheads. In this paper, we consider a MANET in the urban environment. We formulate and study two optimization problems related to reliable routing in MANETs. In the Minimum Cost Duration-Bounded Path (MCDBP) 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 (MDCBP) routing problem, we seek a maximum duration source to destination path with cost no greater than a given constraint. 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 MDCBP routing problem. Our simulation results show that our mobility prediction based routing algorithms lead to better network throughput and longer average path duration, compared with the shortest path algorithm.

AB - Reliability is a major issue in mobile ad hoc routing. Shortest paths are usually used to route packets in Mobile Ad hoc NETworks (MANETs). However, a shortest path may fail quickly, because some of the wireless links on the shortest path may be broken shortly after the path is established due to mobility of mobile nodes. Rediscovering routes can result in substantial data loss and communication overheads. In this paper, we consider a MANET in the urban environment. We formulate and study two optimization problems related to reliable routing in MANETs. In the Minimum Cost Duration-Bounded Path (MCDBP) 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 (MDCBP) routing problem, we seek a maximum duration source to destination path with cost no greater than a given constraint. 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 MDCBP routing problem. Our simulation results show that our mobility prediction based routing algorithms lead to better network throughput and longer average path duration, compared with the shortest path algorithm.

UR - http://www.scopus.com/inward/record.url?scp=20344390014&partnerID=8YFLogxK

UR - http://www.scopus.com/inward/citedby.url?scp=20344390014&partnerID=8YFLogxK

M3 - Conference contribution

AN - SCOPUS:20344390014

SN - 0780388151

SN - 9780780388154

SP - 466

EP - 474

BT - 2004 IEEE International Conference on Mobile Ad-Hoc and Sensor Systems

ER -