Fast Geometric Routing with Concurrent Face Traversal

Authors:
Thomas Clouser;Mark Miyashita;Mikhail Nesterenko
Affiliations:
Department of Computer Science, Kent State University, Kent, USA 44242;Department of Computer Science, Kent State University, Kent, USA 44242;Department of Computer Science, Kent State University, Kent, USA 44242
Venue:
OPODIS '08 Proceedings of the 12th International Conference on Principles of Distributed Systems
Year:
2008

Citing 19
Cited 1

Location-aided routing (LAR) in mobile ad hoc networks

MobiCom '98 Proceedings of the 4th annual ACM/IEEE international conference on Mobile computing and networking
A scalable location service for geographic ad hoc routing

MobiCom '00 Proceedings of the 6th annual 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
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
Location Systems for Ubiquitous Computing

Computer
Worst-Case optimal and average-case efficient geometric ad-hoc routing

Proceedings of the 4th ACM international symposium on Mobile ad hoc networking & computing
Geocasting in Mobile Ad Hoc Networks: Location-Based Multicast Algorithms

WMCSA '99 Proceedings of the Second IEEE Workshop on Mobile Computer Systems and Applications
A Generic Broadcast Protocol in Ad Hoc Networks Based on Self-Pruning

IPDPS '03 Proceedings of the 17th International Symposium on Parallel and Distributed Processing
GeoTORA: a protocol for geocasting in mobile ad hoc networks

ICNP '00 Proceedings of the 2000 International Conference on Network Protocols
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
Self-configuring localization systems: Design and Experimental Evaluation

ACM Transactions on Embedded Computing Systems (TECS)
LLS: a locality aware location service for mobile ad hoc networks

Proceedings of the 2004 joint workshop on Foundations of mobile computing
On the pitfalls of geographic face routing

DIALM-POMC '05 Proceedings of the 2005 joint workshop on Foundations of mobile computing
On delivery guarantees of face and combined greedy-face routing in ad hoc and sensor networks

Proceedings of the 12th annual international conference on Mobile computing and networking
Geographic routing made practical

NSDI'05 Proceedings of the 2nd conference on Symposium on Networked Systems Design & Implementation - Volume 2
Geographic routing without planarization

NSDI'06 Proceedings of the 3rd conference on Networked Systems Design & Implementation - Volume 3

Efficient and accurate sensor network localization

Personal and Ubiquitous Computing

Quantified Score

Hi-index	0.00

Visualization

Abstract

We present a concurrent face routing CFR algorithm. We formally prove that the worst case latency of our algorithm is asymptotically optimal. Our simulation results demonstrate that, on average, CFR significantly outperforms the best known geometric routing algorithms in the path stretch: the speed of message delivery. Its performance approaches the shortest possible path. CFR maintains its advantage over the other algorithms in pure form as well as in combination with greedy routing; on planar as well as on non-planar graphs.