Computational geometry: an introduction
Computational geometry: an introduction
Spatial tessellations: concepts and applications of Voronoi diagrams
Spatial tessellations: concepts and applications of Voronoi diagrams
Walking an unknown street with bounded detour
Computational Geometry: Theory and Applications
Information and Computation
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
Graph Theory With Applications
Graph Theory With Applications
Delaunay graphs are almost as good as complete graphs
SFCS '87 Proceedings of the 28th Annual Symposium on Foundations of Computer Science
Online Routing in Convex Subdivisions
ISAAC '00 Proceedings of the 11th International Conference on Algorithms and Computation
Constructing Plane Spanners of Bounded Degree and Low Weight
ESA '02 Proceedings of the 10th Annual European Symposium on Algorithms
Position-Based Routing for Heterogeneous Wireless Ad Hoc Networks
ICDCSW '04 Proceedings of the 24th International Conference on Distributed Computing Systems Workshops - W7: EC (ICDCSW'04) - Volume 7
Localized Spanner Construction for Ad Hoc Networks with Variable Transmission Range
ADHOC-NOW '08 Proceedings of the 7th international conference on Ad-hoc, Mobile and Wireless Networks
Localized spanner construction for ad hoc networks with variable transmission range
ACM Transactions on Sensor Networks (TOSN)
A distributed routing algorithm for sensor networks derived from macroscopic models
Computer Networks: The International Journal of Computer and Telecommunications Networking
Improved Compact Routing Tables for Planar Networks via Orderly Spanning Trees
SIAM Journal on Discrete Mathematics
Dynamic delaunay triangulation for wireless ad hoc network
APPT'05 Proceedings of the 6th international conference on Advanced Parallel Processing Technologies
Streaming multimedia over WMSNs: an online multipath routing protocol
International Journal of Sensor Networks
Fast localized delaunay triangulation
OPODIS'04 Proceedings of the 8th international conference on Principles of Distributed Systems
A flexible connectivity architecture for avatar management in P2P virtual environments
Proceedings of the 10th Annual Workshop on Network and Systems Support for Games
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
Transactions on Computational Science XIV
SC'04 Proceedings of the 4th international conference on Spatial Cognition: reasoning, Action, Interaction
BLR: beacon-less routing algorithm for mobile ad hoc networks
Computer Communications
Fault-tolerant spanners for ad hoc networks
International Journal of Network Management
| Hi-index | 0.00 |
We consider online routing strategies for routing between the vertices of embedded planar straight line graphs. Our results include (1) two deterministic memoryless routing strategies, one that works for all Delaunay triangulations and the other that works for all regular triangulations, (2) a randomized memoryless strategy that works for all triangulations, (3) an O(1) memory strategy that works for all convex subdivisions, (4) an O(1) memory strategy that approximates the shortest path in Delaunay triangulations, and (5) theoretical and experimental results on the competitiveness of these strategies.