Geographic routing on virtual raw anchor coordinate systems
From MaRDI portal
Publication:5964018
DOI10.1016/j.tcs.2015.12.029zbMath1335.68184OpenAlexW2208133103MaRDI QIDQ5964018
Kasun Samarasinghe, Pierre Leone
Publication date: 26 February 2016
Published in: Theoretical Computer Science (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.tcs.2015.12.029
Graph theory (including graph drawing) in computer science (68R10) Computer graphics; computational geometry (digital and algorithmic aspects) (68U05) Graph algorithms (graph-theoretic aspects) (05C85) Graph representations (geometric and intersection representations, etc.) (05C62)
Related Items (3)
Greedy rectilinear drawings ⋮ Greedy rectilinear drawings ⋮ Every Schnyder drawing is a greedy embedding
Cites Work
- A simple routing algorithm based on Schnyder coordinates
- On the efficiency of routing in sensor networks
- Virtual raw anchor coordinates: a new localization paradigm
- Planar graphs and poset dimension
- On Delivery Guarantees and Worst-Case Forwarding Bounds of Elementary Face Routing Components in Ad Hoc and Sensor Networks
- Routing with guaranteed delivery in ad hoc wireless networks
This page was built for publication: Geographic routing on virtual raw anchor coordinate systems
