Efficient greedy geographical non-planar routing with reactive deflection

Authors:
Fabrice Theoleyre;Eryk Schiller;Andrzej Duda
Affiliations:
Grenoble Informatics Laboratory, CNRS and Grenoble-INP, France;Grenoble Informatics Laboratory, CNRS and Grenoble-INP, France;Grenoble Informatics Laboratory, CNRS and Grenoble-INP, France
Venue:
ICC'09 Proceedings of the 2009 IEEE international conference on Communications
Year:
2009

Citing 11
Cited 1

Unit disk graphs

Discrete Mathematics - Topics on domination
Routing with guaranteed delivery in ad hoc wireless networks

DIALM '99 Proceedings of the 3rd international workshop on Discrete algorithms and methods for mobile computing and communications
GPSR: greedy perimeter stateless routing for wireless networks

MobiCom '00 Proceedings of the 6th annual international conference on Mobile computing and networking
Loop-Free Hybrid Single-Path/Flooding Routing Algorithms with Guaranteed Delivery for Wireless Networks

IEEE Transactions on Parallel and Distributed Systems
GPS-free Positioning in Mobile Ad Hoc Networks

Cluster Computing
Adaptive Beacon Placement

ICDCS '01 Proceedings of the The 21st International Conference on Distributed Computing Systems
Geographic routing without location information

Proceedings of the 9th annual international conference on Mobile computing and networking
Topological hole detection in wireless sensor networks and its applications

DIALM-POMC '05 Proceedings of the 2005 joint workshop on Foundations of mobile computing
A Novel Geographic Routing Algorithm for Ad Hoc Networks Based on Localized Delaunay Triangulation

AINA '06 Proceedings of the 20th International Conference on Advanced Information Networking and Applications - Volume 01
Lazy cross-link removal for geographic routing

Proceedings of the 4th international conference on Embedded networked sensor systems
Non-Euclidian geographic routing in wireless networks

Ad Hoc Networks

Improving routing in networks of Unmanned Aerial Vehicles: Reactive-Greedy-Reactive

Wireless Communications & Mobile Computing

Quantified Score

Hi-index	0.00

Visualization

Abstract

We present a novel geographical routing scheme for spontaneous wireless mesh networks. Greedy geographical routing has many advantages, but suffers from packet losses occurring at the border of voids. In this paper, we propose a flexible greedy routing scheme that can be adapted to any variant of geographical routing and works for any connectivity graph, not necessarily Unit Disk Graphs. The idea is to reactively detect voids, backtrack packets, and propagate information on blocked sectors to reduce packet loss. We also propose an extrapolating algorithm to reduce the latency of void discovery and to limit route stretch. Performance evaluation via simulation shows that our modified greedy routing avoids most of packet losses.