Geometric ad-hoc routing
From MaRDI portal
Publication:2943747
DOI10.1145/872035.872044zbMath1321.68052OpenAlexW2085463780MaRDI QIDQ2943747
Roger Wattenhofer, Yan Zhang, Fabian Kuhn, Aaron Zollinger
Publication date: 4 September 2015
Published in: Proceedings of the twenty-second annual symposium on Principles of distributed computing (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1145/872035.872044
performancemobile computingwireless communicationgeometric routingad-hoc networkscost metricsface routing
Related Items (23)
How to use spanning trees to navigate in graphs ⋮ Greedy drawings of triangulations ⋮ How to Use Spanning Trees to Navigate in Graphs ⋮ Compact and Low Delay Routing Labeling Scheme for Unit Disk Graphs ⋮ Directional Geometric Routing on Mobile Ad Hoc Networks ⋮ A generalized greedy routing algorithm for 2-connected graphs ⋮ Category-based routing in social networks: membership dimension and the small-world phenomenon ⋮ The homogeneous broadcast problem in narrow and wide strips. I: Algorithms ⋮ The homogeneous broadcast problem in narrow and wide strips. II: Lower bounds ⋮ Routing schemes for hybrid communication networks ⋮ Compact and low delay routing labeling scheme for unit disk graphs ⋮ A Pre-Processed Cross Link Detection Protocol for geographic routing in mobile ad hoc and sensor networks under realistic environments with obstacles ⋮ Routing of single-source and multiple-source queries in static sensor networks ⋮ Routing in unit disk graphs ⋮ Local solutions for global problems in wireless networks ⋮ Approximating minimum independent dominating sets in wireless networks ⋮ On Routing with Guaranteed Delivery in Three-Dimensional Ad Hoc Wireless Networks ⋮ Succinct Greedy Graph Drawing in the Hyperbolic Plane ⋮ Constant memory routing in quasi-planar and quasi-polyhedral graphs ⋮ Route discovery with constant memory in oriented planar geometric networks ⋮ Collective Tree Spanners for Unit Disk Graphs with Applications ⋮ On a conjecture related to geometric routing ⋮ Theoretical aspects of connectivity-based multi-hop positioning
Cites Work
This page was built for publication: Geometric ad-hoc routing
