Distributed computation of virtual coordinates for greedy routing in sensor networks

DOI10.1016/j.dam.2010.10.016zbMath1213.05048OpenAlexW2088279402MaRDI QIDQ531593

Mirela Ben Chen, Camille Wormser, Steven J. Gortler, Craig Gotsman

Publication date: 19 April 2011

Published in: Discrete Applied Mathematics (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.dam.2010.10.016

zbMATH Keywords

routinggraph embeddingsensor network

Mathematics Subject Classification ID

Applications of graph theory (05C90) Graph theory (including graph drawing) in computer science (68R10) Planar graphs; geometric and topological aspects of graph theory (05C10) Graph algorithms (graph-theoretic aspects) (05C85) Connectivity (05C40)

Related Items

A simple routing algorithm based on Schnyder coordinates ⋮ On succinct greedy drawings of plane triangulations and 3-connected plane graphs

Uses Software

• CirclePack
• ABF++

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Some results on greedy embeddings in metric spaces
• Combinatorial Ricci flows on surfaces.
• A circle packing algorithm
• Distributed computation of virtual coordinates
• Variational principles for circle patterns and Koebe’s theorem
• Power Diagrams: Properties, Algorithms and Applications
• Empilements de cercles: Convergence d’une méthode de point fixe
• Algorithmic Aspects of Wireless Sensor Networks
• An Algorithm to Construct Greedy Drawings of Triangulations
• Routing with guaranteed delivery in ad hoc wireless networks