Quasi-greedy geographic routing in wireless networks

Jung Tsung Tsai, Yen Cheng Li

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

1 Citation (Scopus)

Abstract

Greedy forwarding combined with planar graph routing exploits minimal local position information to achieve reliable packet delivery in wireless networks. However, it is at the expense of path hop counts and traffic loads converging on links dictated by a chosen planar graph traversal scheme to bypass network holes. To mitigate these negative factors for delay-sensitive traffic service, our forwarding scheme further utilizes a simple hypothesis test based on local information to partition the set of candidate neighborhood nodes for packet relay into two subsets. One is a preferable subset containing nodes more likely located in a dense area of nodes and less likely to be a local minimum for greedy forwarding while the other contains the rest. The preferable subset has priority over the other one in the process of greedy forwarding. Consequently, our geographic routing scheme even embodies the feature of quasi greedy for forwarding packets but does achieve the goal of reducing routing hop counts. It only requires an extra complexity at each node to compute a representative angle that characterizes the node and to interchange with neighborhood nodes the angle information in addition to the location information needed normally.

Original languageEnglish
Title of host publication2012 IEEE Global Communications Conference, GLOBECOM 2012
Pages8-13
Number of pages6
DOIs
Publication statusPublished - 2012 Dec 1
Event2012 IEEE Global Communications Conference, GLOBECOM 2012 - Anaheim, CA, United States
Duration: 2012 Dec 32012 Dec 7

Publication series

NameGLOBECOM - IEEE Global Telecommunications Conference

Other

Other2012 IEEE Global Communications Conference, GLOBECOM 2012
CountryUnited States
CityAnaheim, CA
Period12/12/312/12/7

Fingerprint

Interchanges
Wireless networks

ASJC Scopus subject areas

  • Electrical and Electronic Engineering

Cite this

Tsai, J. T., & Li, Y. C. (2012). Quasi-greedy geographic routing in wireless networks. In 2012 IEEE Global Communications Conference, GLOBECOM 2012 (pp. 8-13). [6503082] (GLOBECOM - IEEE Global Telecommunications Conference). https://doi.org/10.1109/GLOCOM.2012.6503082

Quasi-greedy geographic routing in wireless networks. / Tsai, Jung Tsung; Li, Yen Cheng.

2012 IEEE Global Communications Conference, GLOBECOM 2012. 2012. p. 8-13 6503082 (GLOBECOM - IEEE Global Telecommunications Conference).

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

Tsai, JT & Li, YC 2012, Quasi-greedy geographic routing in wireless networks. in 2012 IEEE Global Communications Conference, GLOBECOM 2012., 6503082, GLOBECOM - IEEE Global Telecommunications Conference, pp. 8-13, 2012 IEEE Global Communications Conference, GLOBECOM 2012, Anaheim, CA, United States, 12/12/3. https://doi.org/10.1109/GLOCOM.2012.6503082
Tsai JT, Li YC. Quasi-greedy geographic routing in wireless networks. In 2012 IEEE Global Communications Conference, GLOBECOM 2012. 2012. p. 8-13. 6503082. (GLOBECOM - IEEE Global Telecommunications Conference). https://doi.org/10.1109/GLOCOM.2012.6503082
Tsai, Jung Tsung ; Li, Yen Cheng. / Quasi-greedy geographic routing in wireless networks. 2012 IEEE Global Communications Conference, GLOBECOM 2012. 2012. pp. 8-13 (GLOBECOM - IEEE Global Telecommunications Conference).
@inproceedings{9b23bb84a49248b08473a2e2926f9dbb,
title = "Quasi-greedy geographic routing in wireless networks",
abstract = "Greedy forwarding combined with planar graph routing exploits minimal local position information to achieve reliable packet delivery in wireless networks. However, it is at the expense of path hop counts and traffic loads converging on links dictated by a chosen planar graph traversal scheme to bypass network holes. To mitigate these negative factors for delay-sensitive traffic service, our forwarding scheme further utilizes a simple hypothesis test based on local information to partition the set of candidate neighborhood nodes for packet relay into two subsets. One is a preferable subset containing nodes more likely located in a dense area of nodes and less likely to be a local minimum for greedy forwarding while the other contains the rest. The preferable subset has priority over the other one in the process of greedy forwarding. Consequently, our geographic routing scheme even embodies the feature of quasi greedy for forwarding packets but does achieve the goal of reducing routing hop counts. It only requires an extra complexity at each node to compute a representative angle that characterizes the node and to interchange with neighborhood nodes the angle information in addition to the location information needed normally.",
author = "Tsai, {Jung Tsung} and Li, {Yen Cheng}",
year = "2012",
month = "12",
day = "1",
doi = "10.1109/GLOCOM.2012.6503082",
language = "English",
isbn = "9781467309219",
series = "GLOBECOM - IEEE Global Telecommunications Conference",
pages = "8--13",
booktitle = "2012 IEEE Global Communications Conference, GLOBECOM 2012",

}

TY - GEN

T1 - Quasi-greedy geographic routing in wireless networks

AU - Tsai, Jung Tsung

AU - Li, Yen Cheng

PY - 2012/12/1

Y1 - 2012/12/1

N2 - Greedy forwarding combined with planar graph routing exploits minimal local position information to achieve reliable packet delivery in wireless networks. However, it is at the expense of path hop counts and traffic loads converging on links dictated by a chosen planar graph traversal scheme to bypass network holes. To mitigate these negative factors for delay-sensitive traffic service, our forwarding scheme further utilizes a simple hypothesis test based on local information to partition the set of candidate neighborhood nodes for packet relay into two subsets. One is a preferable subset containing nodes more likely located in a dense area of nodes and less likely to be a local minimum for greedy forwarding while the other contains the rest. The preferable subset has priority over the other one in the process of greedy forwarding. Consequently, our geographic routing scheme even embodies the feature of quasi greedy for forwarding packets but does achieve the goal of reducing routing hop counts. It only requires an extra complexity at each node to compute a representative angle that characterizes the node and to interchange with neighborhood nodes the angle information in addition to the location information needed normally.

AB - Greedy forwarding combined with planar graph routing exploits minimal local position information to achieve reliable packet delivery in wireless networks. However, it is at the expense of path hop counts and traffic loads converging on links dictated by a chosen planar graph traversal scheme to bypass network holes. To mitigate these negative factors for delay-sensitive traffic service, our forwarding scheme further utilizes a simple hypothesis test based on local information to partition the set of candidate neighborhood nodes for packet relay into two subsets. One is a preferable subset containing nodes more likely located in a dense area of nodes and less likely to be a local minimum for greedy forwarding while the other contains the rest. The preferable subset has priority over the other one in the process of greedy forwarding. Consequently, our geographic routing scheme even embodies the feature of quasi greedy for forwarding packets but does achieve the goal of reducing routing hop counts. It only requires an extra complexity at each node to compute a representative angle that characterizes the node and to interchange with neighborhood nodes the angle information in addition to the location information needed normally.

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

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

U2 - 10.1109/GLOCOM.2012.6503082

DO - 10.1109/GLOCOM.2012.6503082

M3 - Conference contribution

AN - SCOPUS:84877682437

SN - 9781467309219

T3 - GLOBECOM - IEEE Global Telecommunications Conference

SP - 8

EP - 13

BT - 2012 IEEE Global Communications Conference, GLOBECOM 2012

ER -