TART: Traffic-Aware Routing Tree for geographic routing

Lei Zhang, Tae Hyun Kim, Chunlei Liu, Min Te Sun, Alvin Lim

Research output: Chapter in Book/Report/Conference proceedingConference contributionpeer-review

Abstract

Tree routing is one of the detouring strategies employed in geographic routing to help find a detour for a packet to leave a local minimum. The effectiveness of tree routing depends on the quality of the pre-constructed routing trees. Existing tree construction methods build trees in a top-down and centralized fashion and do not consider the traffic load in the network, and therefore is likely to create trees with poor routing performance. In this paper, we propose a novel routing tree, namely Traffic-Aware Routing Tree, which is constructed completely in a bottom-up fashion and with the traffic load in mind. Simulation results show that such traffic-aware routing trees have very few conflicting hulls and much higher path throughput than other routing trees, leading to a better routing performance.

Original languageEnglish
Title of host publicationWCNC 2008 - IEEE Wireless Communications and Networking Conference, Conference Proceedings
PublisherInstitute of Electrical and Electronics Engineers Inc.
Pages2609-2614
Number of pages6
ISBN (Print)9781424419968
DOIs
StatePublished - 2008
EventIEEE Wireless Communications and Networking Conference, WCNC 2008 - Las Vegas, NV, United States
Duration: 31 Mar 20083 Apr 2008

Publication series

NameIEEE Wireless Communications and Networking Conference, WCNC
ISSN (Print)1525-3511

Conference

ConferenceIEEE Wireless Communications and Networking Conference, WCNC 2008
Country/TerritoryUnited States
CityLas Vegas, NV
Period31/03/083/04/08

Fingerprint

Dive into the research topics of 'TART: Traffic-Aware Routing Tree for geographic routing'. Together they form a unique fingerprint.

Cite this