A Generalization of the Face Routing

Authors:
Sabeel Ansari;Lata Narayanan;Jaroslav Opatrny
Affiliations:
Concordia University;Concordia University;Concordia University
Venue:
MOBIQUITOUS '05 Proceedings of the The Second Annual International Conference on Mobile and Ubiquitous Systems: Networking and Services
Year:
2005

Citing 0
Cited 3

Local solutions for global problems in wireless networks

Journal of Discrete Algorithms
A Pre-Processed Cross Link Detection Protocol for geographic routing in mobile ad hoc and sensor networks under realistic environments with obstacles

Journal of Parallel and Distributed Computing
Randomized AB-Face-AB routing algorithms in mobile ad hoc networks

ADHOC-NOW'05 Proceedings of the 4th international conference on Ad-Hoc, Mobile, and Wireless Networks

Quantified Score

Hi-index	0.00

Visualization

Abstract

We consider the problem of routing with guaranteed delivery in ad-hoc wireless networks using the positions of the mobile hosts. Such networks can be modeled as geometric graphs. FACE ROUTING [4], [9] is a position-based routing algorithm for planar geometric graphs that guarantees delivery of messages without flooding control packets throughout the network. For general ad hoc networks, FACE ROUTING can use a planar sub-graph of the original graph; many local and distributed algorithms have been proposed to extract such a planar sub-graph. However, these planarization algorithms may fail in some situations, such as when the transmission ranges are not the same, for example, due to the presence of obstacles, which in turn may cause a routing failure. In this paper, we describe a generalization of FACE ROUTING that can guarantee delivery in planar graphs with disjoint crossing edges added. Our algorithm needs O