Randomized AB-Face-AB routing algorithms in mobile ad hoc networks

Authors:
Thomas Fevens;Alaa Eddien Abdallah;Badr Naciri Bennani
Affiliations:
Department of Computer Science and Software Engineering, Concordia University, Montréal, Québec, Canada;Department of Computer Science and Software Engineering, Concordia University, Montréal, Québec, Canada;Department of Computer Science and Software Engineering, Concordia University, Montréal, Québec, Canada
Venue:
ADHOC-NOW'05 Proceedings of the 4th international conference on Ad-Hoc, Mobile, and Wireless Networks
Year:
2005

Citing 15
Cited 2

A distance routing effect algorithm for mobility (DREAM)

MobiCom '98 Proceedings of the 4th annual ACM/IEEE international conference on Mobile computing and networking
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
Routing with guaranteed delivery in ad hoc wireless networks

Wireless Networks
Asymptotically optimal geometric mobile ad-hoc routing

DIALM '02 Proceedings of the 6th international workshop on Discrete algorithms and methods for mobile computing and communications
Internal Node and Shortcut Based Routing with Guaranteed Delivery in Wireless Networks

Cluster Computing
Online Routing in Triangulations

ISAAC '99 Proceedings of the 10th International Symposium on Algorithms and Computation
On the Spanning Ratio of Gabriel Graphs and beta-skeletons

LATIN '02 Proceedings of the 5th Latin American Symposium on Theoretical Informatics
Power and Cost Aware Localized Routing with Guaranteed Delivery in Wireless Networks

ISCC '02 Proceedings of the Seventh International Symposium on Computers and Communications (ISCC'02)
Geometric ad-hoc routing: of theory and practice

Proceedings of the twenty-second annual symposium on Principles of distributed computing
Ad-hoc networks beyond unit disk graphs

DIALM-POMC '03 Proceedings of the 2003 joint workshop on Foundations of mobile computing
Ordered theta graphs

Computational Geometry: Theory and Applications - Special issue on the 14th Canadian conference on computational geometry — CCCG02
Approximating geometric bottleneck shortest paths

Computational Geometry: Theory and Applications
A Generalization of the Face Routing

MOBIQUITOUS '05 Proceedings of the The Second Annual International Conference on Mobile and Ubiquitous Systems: Networking and Services
A survey on position-based routing in mobile ad hoc networks

IEEE Network: The Magazine of Global Internetworking

Local solutions for global problems in wireless networks

Journal of Discrete Algorithms
High delivery rate position-based routing algorithms for 3D ad hoc networks

Computer Communications

Quantified Score

Hi-index	0.00

Visualization

Abstract

One common design for routing protocols in mobile ad hoc networks is to use positioning information. We combine the class of randomized position-based routing strategies called AB (Above-Below) algorithms with face routing to form AB:Face2:AB routing algorithms, a new class of hybrid routing algorithms in mobile ad hoc networks. Our experiments on unit disk graphs, and their associated Yao sub-graphs and Gabriel sub-graphs, show that the delivery rates of the AB:Face2:AB algorithms are significantly better than either class of routing algorithms alone when routing is subject to a threshold count beyond which the packet is dropped. The best delivery rates were obtained on the Yao sub-graph. With the appropriate choice of threshold, on non-planar graphs, the delivery rates are equivalent to those of face routing (with no threshold) while, on average, discovering paths to their destinations that are several times shorter.