Delaunay graphs are almost as good as complete graphs
Discrete & Computational Geometry
GeoCast—geographic addressing and routing
MobiCom '97 Proceedings of the 3rd annual ACM/IEEE international conference on Mobile computing and networking
A survey of routing techniques for mobile communications networks
Mobile Networks and Applications - Special issue: routing in mobile communications networks
A performance comparison of multi-hop wireless ad hoc network routing protocols
MobiCom '98 Proceedings of the 4th annual ACM/IEEE international conference on Mobile computing and networking
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
A scalable location service for geographic ad hoc routing
MobiCom '00 Proceedings of the 6th annual international conference on Mobile computing and networking
Dynamic fine-grained localization in Ad-Hoc networks of sensors
Proceedings of the 7th annual international conference on Mobile computing and networking
Routing with guaranteed delivery in geometric and wireless networks
Handbook of wireless networks and mobile computing
Internal Node and Shortcut Based Routing with Guaranteed Delivery in Wireless Networks
ICDCSW '01 Proceedings of the 21st International Conference on Distributed Computing Systems
Location-Aided Routing (LAR) in Mobile Ad Hoc Networks
Location-Aided Routing (LAR) in Mobile Ad Hoc Networks
A survey on position-based routing in mobile ad hoc networks
IEEE Network: The Magazine of Global Internetworking
Worst-Case optimal and average-case efficient geometric ad-hoc routing
Proceedings of the 4th ACM international symposium on Mobile ad hoc networking & computing
Geometric ad-hoc routing: of theory and practice
Proceedings of the twenty-second annual symposium on Principles of distributed computing
Localized construction of bounded degree and planar spanner for wireless ad hoc networks
DIALM-POMC '03 Proceedings of the 2003 joint workshop on Foundations of mobile computing
Ad-hoc networks beyond unit disk graphs
DIALM-POMC '03 Proceedings of the 2003 joint workshop on Foundations of mobile computing
Localized algorithms for energy efficient topology in wireless ad hoc networks
Proceedings of the 5th ACM international symposium on Mobile ad hoc networking and computing
Compact routing on euclidian metrics
Proceedings of the twenty-third annual ACM symposium on Principles of distributed computing
Geometrically aware communication in random wireless networks
Proceedings of the twenty-third annual ACM symposium on Principles of distributed computing
Integrating heterogeneous wireless technologies: a cellular aided mobile Ad Hoc network (CAMA)
Mobile Networks and Applications
LLS: a locality aware location service for mobile ad hoc networks
Proceedings of the 2004 joint workshop on Foundations of mobile computing
Routing via Single-Source and Multiple-Source Queries in Static Sensor Networks
IPDPS '05 Proceedings of the 19th IEEE International Parallel and Distributed Processing Symposium (IPDPS'05) - Workshop 12 - Volume 13
Competitive Time and Traffic Analysis of Position-Based Routing using a Cell Structure
IPDPS '05 Proceedings of the 19th IEEE International Parallel and Distributed Processing Symposium (IPDPS'05) - Workshop 12 - Volume 13
On the pitfalls of geographic face routing
DIALM-POMC '05 Proceedings of the 2005 joint workshop on Foundations of mobile computing
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 unified energy-efficient topology for unicast and broadcast
Proceedings of the 11th annual international conference on Mobile computing and networking
Localized Topology Control for Unicast and Broadcast in Wireless Ad Hoc Networks
IEEE Transactions on Parallel and Distributed Systems
Minimizing recovery state In geographic ad-hoc routing
Proceedings of the 7th ACM international symposium on Mobile ad hoc networking and computing
MLS: an efficient location service for mobile ad hoc networks
Proceedings of the 7th ACM international symposium on Mobile ad hoc networking and computing
Wireless ad hoc lattice computers (WAdL)
Journal of Parallel and Distributed Computing - Special issue: Algorithms for wireless and ad-hoc networks
Localized construction of bounded degree and planar spanner for wireless ad hoc networks
Mobile Networks and Applications
Locating and bypassing holes in sensor networks
Mobile Networks and Applications
Geographical Cluster-Based Routing in Sensing-Covered Networks
IEEE Transactions on Parallel and Distributed Systems
Localized algorithms for energy efficient topology in wireless ad hoc networks
Mobile Networks and Applications
Routing of single-source and multiple-source queries in static sensor networks
Journal of Discrete Algorithms
GLR: a novel geographic routing scheme for large wireless ad hoc networks
Computer Networks: The International Journal of Computer and Telecommunications Networking
Local solutions for global problems in wireless networks
Journal of Discrete Algorithms
Boundary Mapping and Boundary-State Routing (BSR) in Ad Hoc Networks
IEEE Transactions on Mobile Computing
Connectionless protocol: a localised approach to wireless ad hoc networks
International Journal of Ad Hoc and Ubiquitous Computing
An algorithmic approach to geographic routing in ad hoc and sensor networks
IEEE/ACM Transactions on Networking (TON)
Proceedings of the 9th ACM international symposium on Mobile ad hoc networking and computing
Energy-efficient geographic routing with virtual anchors based on projection distance
Computer Communications
Skipping technique in face routing for wireless ad hoc and sensor networks
International Journal of Sensor Networks
Ad hoc networks beyond unit disk graphs
Wireless Networks
Di-GAFR: Directed Greedy Adaptive Face-Based Routing
ATC '08 Proceedings of the 5th international conference on Autonomic and Trusted Computing
Constrained Delaunay triangulation for ad hoc networks
Journal of Computer Systems, Networks, and Communications
Fast Geometric Routing with Concurrent Face Traversal
OPODIS '08 Proceedings of the 12th International Conference on Principles of Distributed Systems
On the optimality of field-line routing in massively dense wireless multi-hop networks
Performance Evaluation
Succinct Greedy Graph Drawing in the Hyperbolic Plane
Graph Drawing
Virtual surrounding face geocasting in wireless ad hoc and sensor networks
IEEE/ACM Transactions on Networking (TON)
Scoped Bellman-Ford geographic routing for large dynamic wireless sensor networks
Journal of Computer Science and Technology
Directional Geometric Routing on Mobile Ad Hoc Networks
COCOON '09 Proceedings of the 15th Annual International Conference on Computing and Combinatorics
Robust position-based routing for wireless ad hoc networks
Ad Hoc Networks
Algorithms for ad hoc and sensor networks
Computer Communications
Single-step creation of localized Delaunay triangulations
Wireless Networks
Self-stabilizing routing algorithms for wireless ad-hoc networks
ICDCIT'07 Proceedings of the 4th international conference on Distributed computing and internet technology
Self-stabilization and virtual node layer emulations
SSS'07 Proceedings of the 9h international conference on Stabilization, safety, and security of distributed systems
On routing with guaranteed delivery in three-dimensional ad hoc wireless networks
ICDCN'08 Proceedings of the 9th international conference on Distributed computing and networking
Virtual position based geographic routing for wireless sensor networks
Computer Communications
Minimizing recovery overhead in geographic ad hoc routing
Computer Communications
Algorithms for sensor and ad hoc networks: advanced lectures
Algorithms for sensor and ad hoc networks: advanced lectures
TAP: an adjustable planar structure for adaptive topology control in wireless ad hoc networks
ICC'09 Proceedings of the 2009 IEEE international conference on Communications
Greedy geographic routing in large-scale sensor networks: a minimum network decomposition approach
Proceedings of the eleventh ACM international symposium on Mobile ad hoc networking and computing
A generalized greedy routing algorithm for 2-connected graphs
Theoretical Computer Science
S4: small state and small stretch compact routing protocol for large static wireless networks
IEEE/ACM Transactions on Networking (TON)
S4: small state and small stretch routing protocol for large wireless sensor networks
NSDI'07 Proceedings of the 4th USENIX conference on Networked systems design & implementation
Journal of Parallel and Distributed Computing
Exact algorithms to minimize interference in wireless sensor networks
Theoretical Computer Science
Analysis of GHT in mobile ad hoc networks
ISPA'05 Proceedings of the 2005 international conference on Parallel and Distributed Processing and Applications
Self-stabilizing mobile node location management and message routing
SSS'05 Proceedings of the 7th international conference on Self-Stabilizing Systems
Distance-Sensitive information brokerage in sensor networks
DCOSS'06 Proceedings of the Second IEEE international conference on Distributed Computing in Sensor Systems
Online routing in faulty meshes with sub-linear comparative time and traffic ratio
ESA'05 Proceedings of the 13th annual European conference on Algorithms
Maximum lifetime routing and data aggregation for wireless sensor networks
NETWORKING'06 Proceedings of the 5th international IFIP-TC6 conference on Networking Technologies, Services, and Protocols; Performance of Computer and Communication Networks; Mobile and Wireless Communications Systems
Fast localized delaunay triangulation
OPODIS'04 Proceedings of the 8th international conference on Principles of Distributed Systems
Wireless networking: graph theory unplugged
WG'04 Proceedings of the 30th international conference on Graph-Theoretic Concepts in Computer Science
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
Half-space proximal: a new local test for extracting a bounded dilation spanner of a unit disk graph
OPODIS'05 Proceedings of the 9th international conference on Principles of Distributed Systems
Online multi-path routing in a maze
ISAAC'06 Proceedings of the 17th international conference on Algorithms and Computation
Local construction of planar spanners in unit disk graphs with irregular transmission ranges
LATIN'06 Proceedings of the 7th Latin American conference on Theoretical Informatics
Concurrent face traversal for efficient geometric routing
Journal of Parallel and Distributed Computing
Almost optimal distributed M2M multicasting in wireless mesh networks
Theoretical Computer Science
On the impact of transmission radius on routing efficiency
Proceedings of the first ACM MobiHoc workshop on Airborne Networks and Communications
BLR: beacon-less routing algorithm for mobile ad hoc networks
Computer Communications
Fault-tolerant spanners for ad hoc networks
International Journal of Network Management
Greedy geographic routing in large-scale sensor networks: a minimum network decomposition approach
IEEE/ACM Transactions on Networking (TON)
A qualitative comparison evaluation of the greedy forwarding strategies in Mobile Ad Hoc Network
Journal of Network and Computer Applications
Trap array: a unified model for scalability evaluation of geometric routing
Proceedings of the ACM SIGMETRICS/international conference on Measurement and modeling of computer systems
Category-based routing in social networks: Membership dimension and the small-world phenomenon
Theoretical Computer Science
| Hi-index | 0.00 |
In this paper we present AFR, a new geometric mobile ad-hoc routing algorithm. The algorithm is completely distributed; nodes need to communicate only with direct neighbors in their transmission range. We show that if a best route has cost c, AFR finds a route and terminates with cost &Ogr;(c2) in the worst case. AFR is the first algorithm with cost bounded by a function of the optimal route. We also give a tight lower bound by showing that any geometric routing algorithm has worst-case cost $Ogr;(c2). Thus AFR is asymptotically optimal. We give a non-geometric algorithm that also matches the lower bound, but needs some memory at each node. This establishes an intriguing trade-off between geometry and memory.