Advanced Search

Journal Navigation

Journal Home

Subscriptions

Archive

Contact Us

Table of Contents

Sign In to gain access to subscriptions and/or personal tools.
SIMULATION
This Article
Right arrow Full Text (PDF)
Right arrow References
Right arrow Alert me when this article is cited
Right arrow Alert me if a correction is posted
Services
Right arrow Email this article to a friend
Right arrow Similar articles in this journal
Right arrow Similar articles in Web of Science
Right arrow Alert me to new issues of the journal
Right arrow Add to Saved Citations
Right arrow Download to citation manager
Right arrowRequest Permissions
Right arrow Request Reprints
Right arrow Add to My Marked Citations
Citing Articles
Right arrow Citing Articles via Google Scholar
Right arrow Citing Articles via Scopus
Google Scholar
Right arrow Articles by Li, Y.
Right arrow Articles by Yang, J.
Right arrow Search for Related Content
Social Bookmarking
Add to CiteULike   Add to Complore   Add to Connotea   Add to Del.icio.us   Add to Digg   Add to Reddit   Add to Technorati   Add to Twitter  
What's this?

DTGR: Disruption-Tolerant Geographic Routing for Wireless Ad Hoc Networks

Yingjie Li

Statistical Analysis & Forecasting IBM T. J. Watson Research Center Room 33-240, 1101 Kitchawan Road, Route 134 Yorktown Heights, NY 10598, yingjie{at}us.ibm.com

Ten H. Lai

Department of Computer Science and Engineering The Ohio State University, Columbus, OH 43210

Ming T. Liu

Department of Computer Science and Engineering The Ohio State University, Columbus, OH 43210

Min-Te Sun

Department of Computer Science and Software Engineering Auburn University, Auburn, Alabama 36849

Junmo Yang

Department of Computer Science and Software Engineering Auburn University, Auburn, Alabama 36849

In wireless ad hoc networks, temporary link disruptions can frequently occur due to the presence of obstacles, node mobility, and so on. These disruptions can result in a node’s incorrect perception of its neighbor set when the neighbor set is constructed via beacon sampling (e.g., beacon collisions may result in the removal of a node j from the neighbor set of a node i, although j is within the transmission range of i). Such a behavior can adversely affect the performance of position-based routing algorithms as it may lead to inefficient routing or packet dropping. To address this, the authors propose a scheme that allows node i to associate each of its neighbor j with a reachability value that is a measure of the stability of the link between i and j. They then apply their scheme to greedy perimeter stateless routing (GPSR) and design two new routing algorithms: disruption-tolerant geographic routing—simple forwarding (DTGR-SF) and disruption-tolerant geographic routing—waiting before forwarding (DTGR-WF), in which nodes use reachability values to make forwarding decisions. The authors compare the performances of DTGR-SF and DTGR-WF with that of GPSR in various simulation settings. Their simulation results show that proposed algorithms perform better in settings where disruptions are present. In networks with few occurrences of disruptions, their schemes achieve the same high performance as that of GPSR.

Key Words: Disruption tolerant routing • wireless networks • ad hoc routing • geographic routing • GPRS

SIMULATION, Vol. 82, No. 6, 399-411 (2006)
DOI: 10.1177/0037549706070394
Add to CiteULike CiteULike   Add to Complore Complore   Add to Connotea Connotea   Add to Del.icio.us Del.icio.us   Add to Digg Digg   Add to Reddit Reddit   Add to Technorati Technorati   Add to Twitter Twitter    What's this?