Title: Alternative forwarding strategies for geographic routing in wireless networks

Authors: Jung-Tsung Tsai; Yunghsiang S. Han

Addresses: Department of Computer Science and Information Engineering, National Taiwan Normal University, Taipei 11677, Taiwan ' Department of Electrical Engineering, National Taiwan University of Science and Technology, Taipei 10607, Taiwan

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: geographic routing; greedy forwarding; refraction routing; Snell's law; Fermat's principle; wireless network.

DOI: 10.1504/IJAHUC.2018.090600

International Journal of Ad Hoc and Ubiquitous Computing, 2018 Vol.27 No.4, pp.295 - 307

Received: 07 Dec 2015
Accepted: 01 Feb 2016
Published online: 23 Mar 2018 *

Full-text access for editors Full-text access for subscribers Purchase this article Comment on this article