Alternative forwarding strategies for geographic routing in wireless networks

Jung-Tsung Tsai, Yunghsiang S. Han

Research output: Contribution to journalArticle

Abstract

Greedy forwarding (GF), the fundamental geographic routing scheme, is locally optimal on advancement distance per hop. Instead, we propose a forwarding scheme outperforming GF on total advancement distance to destination through routing decision made from neighbour positions with one-step forward expectation. We then consider that a wireless network topology consists of two subareas of different node densities and that a packet originated in one subarea is destined for the other. Routing over a least hop count path in such a network reflects the Fermat's principle. Like refraction of light at the interface between two media of different refractive indices, we derive our Snell's laws and propose geographic refraction routing (GRR) schemes. Results show that when network settings and source-destination pairs provide for obvious refraction, refraction operation can slightly shorten mean path hop counts for reliable routing but significantly improve routing success probabilities for best-effort one.

LanguageEnglish
Pages295-307
Number of pages13
JournalInternational Journal of Ad Hoc and Ubiquitous Computing
Volume27
Issue number4
DOIs
Publication statusPublished - 2018 Jan 1

Fingerprint

Refraction
Wireless networks
Refractive index
Topology

Keywords

  • Fermat's principle
  • Geographic routing
  • Greedy forwarding
  • Refraction routing
  • Snell's law
  • Wireless network

ASJC Scopus subject areas

  • Software
  • Hardware and Architecture
  • Computer Networks and Communications

Cite this

Alternative forwarding strategies for geographic routing in wireless networks. / Tsai, Jung-Tsung; Han, Yunghsiang S.

In: International Journal of Ad Hoc and Ubiquitous Computing, Vol. 27, No. 4, 01.01.2018, p. 295-307.

Research output: Contribution to journalArticle

@article{209363a242744a93a34ed0e44cb561b9,
title = "Alternative forwarding strategies for geographic routing in wireless networks",
abstract = "Greedy forwarding (GF), the fundamental geographic routing scheme, is locally optimal on advancement distance per hop. Instead, we propose a forwarding scheme outperforming GF on total advancement distance to destination through routing decision made from neighbour positions with one-step forward expectation. We then consider that a wireless network topology consists of two subareas of different node densities and that a packet originated in one subarea is destined for the other. Routing over a least hop count path in such a network reflects the Fermat's principle. Like refraction of light at the interface between two media of different refractive indices, we derive our Snell's laws and propose geographic refraction routing (GRR) schemes. Results show that when network settings and source-destination pairs provide for obvious refraction, refraction operation can slightly shorten mean path hop counts for reliable routing but significantly improve routing success probabilities for best-effort one.",
keywords = "Fermat's principle, Geographic routing, Greedy forwarding, Refraction routing, Snell's law, Wireless network",
author = "Jung-Tsung Tsai and Han, {Yunghsiang S.}",
year = "2018",
month = "1",
day = "1",
doi = "10.1504/IJAHUC.2018.090600",
language = "English",
volume = "27",
pages = "295--307",
journal = "International Journal of Ad Hoc and Ubiquitous Computing",
issn = "1743-8225",
publisher = "Inderscience Enterprises Ltd",
number = "4",

}

TY - JOUR

T1 - Alternative forwarding strategies for geographic routing in wireless networks

AU - Tsai, Jung-Tsung

AU - Han, Yunghsiang S.

PY - 2018/1/1

Y1 - 2018/1/1

N2 - Greedy forwarding (GF), the fundamental geographic routing scheme, is locally optimal on advancement distance per hop. Instead, we propose a forwarding scheme outperforming GF on total advancement distance to destination through routing decision made from neighbour positions with one-step forward expectation. We then consider that a wireless network topology consists of two subareas of different node densities and that a packet originated in one subarea is destined for the other. Routing over a least hop count path in such a network reflects the Fermat's principle. Like refraction of light at the interface between two media of different refractive indices, we derive our Snell's laws and propose geographic refraction routing (GRR) schemes. Results show that when network settings and source-destination pairs provide for obvious refraction, refraction operation can slightly shorten mean path hop counts for reliable routing but significantly improve routing success probabilities for best-effort one.

AB - Greedy forwarding (GF), the fundamental geographic routing scheme, is locally optimal on advancement distance per hop. Instead, we propose a forwarding scheme outperforming GF on total advancement distance to destination through routing decision made from neighbour positions with one-step forward expectation. We then consider that a wireless network topology consists of two subareas of different node densities and that a packet originated in one subarea is destined for the other. Routing over a least hop count path in such a network reflects the Fermat's principle. Like refraction of light at the interface between two media of different refractive indices, we derive our Snell's laws and propose geographic refraction routing (GRR) schemes. Results show that when network settings and source-destination pairs provide for obvious refraction, refraction operation can slightly shorten mean path hop counts for reliable routing but significantly improve routing success probabilities for best-effort one.

KW - Fermat's principle

KW - Geographic routing

KW - Greedy forwarding

KW - Refraction routing

KW - Snell's law

KW - Wireless network

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

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

U2 - 10.1504/IJAHUC.2018.090600

DO - 10.1504/IJAHUC.2018.090600

M3 - Article

VL - 27

SP - 295

EP - 307

JO - International Journal of Ad Hoc and Ubiquitous Computing

T2 - International Journal of Ad Hoc and Ubiquitous Computing

JF - International Journal of Ad Hoc and Ubiquitous Computing

SN - 1743-8225

IS - 4

ER -