Welcome to the InfoSci Platform
Reference Hub7
Asymmetric Geographic Forwarding: Exploiting Link Asymmetry in Location Aware Routing

Asymmetric Geographic Forwarding: Exploiting Link Asymmetry in Location Aware Routing

Pramita Mitra, Christian Poellabauer
Copyright: © 2011 |Volume: 2 |Issue: 4 |Pages: 25
ISSN: 1947-3176|EISSN: 1947-3184|EISBN13: 9781613506929|DOI: 10.4018/jertcs.2011100104
Cite Article Cite Article

MLA

Mitra, Pramita, and Christian Poellabauer. "Asymmetric Geographic Forwarding: Exploiting Link Asymmetry in Location Aware Routing." IJERTCS vol.2, no.4 2011: pp.46-70. http://doi.org/10.4018/jertcs.2011100104

APA

Mitra, P. & Poellabauer, C. (2011). Asymmetric Geographic Forwarding: Exploiting Link Asymmetry in Location Aware Routing. International Journal of Embedded and Real-Time Communication Systems (IJERTCS), 2(4), 46-70. http://doi.org/10.4018/jertcs.2011100104

Chicago

Mitra, Pramita, and Christian Poellabauer. "Asymmetric Geographic Forwarding: Exploiting Link Asymmetry in Location Aware Routing," International Journal of Embedded and Real-Time Communication Systems (IJERTCS) 2, no.4: 46-70. http://doi.org/10.4018/jertcs.2011100104

Export Reference

Mendeley
Favorite Full-Issue Download

Abstract

Geographic Forwarding (GF) algorithms typically employ a neighbor discovery method to maintain a neighborhood table that works well only if all wireless links are symmetric. Recent experimental research has revealed that the link conditions in realistic wireless networks vary significantly from the ideal disk model and a substantial percentage of links are asymmetric. Existing GF algorithms fail to consider asymmetric links in neighbor discovery and thus discount a significant number of potentially stable routes with good one-way reliability. This paper introduces Asymmetric Geographic Forwarding (A-GF), which discovers asymmetric links in the network, evaluates them for stability (e.g., based on mobility), and uses them to obtain more efficient and shorter routes. A-GF also successfully identifies transient asymmetric links and ignores them to further improve the routing efficiency. Comparisons of A-GF to the original GF algorithm and another related symmetric routing algorithm indicate a decrease in hop count (and therefore latency) and an increase in successful route establishments, with only a small increase in overhead.

Request Access

You do not own this content. Please login to recommend this title to your institution's librarian or purchase it from the IGI Global bookstore.