Distributed computation of virtual coordinates for greedy routing in sensor networks

Authors:
Mirela Ben Chen;Steven J. Gortler;Craig Gotsman;Camille Wormser
Affiliations:
Technion, Haifa, Israel;Harvard University, United States;Technion, Haifa, Israel;INRIA, France
Venue:
Discrete Applied Mathematics
Year:
2011

Citing 11
Cited 1

Power diagrams: properties, algorithms and applications

SIAM Journal on Computing
Routing with guaranteed delivery in ad hoc wireless networks

Wireless Networks
A circle packing algorithm

Computational Geometry: Theory and Applications
ABF++: fast and robust angle based flattening

ACM Transactions on Graphics (TOG)
Discrete conformal mappings via circle patterns

ACM Transactions on Graphics (TOG)
Distributed computation of virtual coordinates

SCG '07 Proceedings of the twenty-third annual symposium on Computational geometry
Network sketching or: "How Much Geometry Hides in Connectivity?--Part II"

SODA '07 Proceedings of the eighteenth annual ACM-SIAM symposium on Discrete algorithms
Greedy drawings of triangulations

Proceedings of the nineteenth annual ACM-SIAM symposium on Discrete algorithms
Some Results on Greedy Embeddings in Metric Spaces

FOCS '08 Proceedings of the 2008 49th Annual IEEE Symposium on Foundations of Computer Science
An Algorithm to Construct Greedy Drawings of Triangulations

Graph Drawing
Greedy routing with guaranteed delivery using Ricci flows

IPSN '09 Proceedings of the 2009 International Conference on Information Processing in Sensor Networks

A simple routing algorithm based on Schnyder coordinates

Theoretical Computer Science

Quantified Score

Hi-index	0.05

Visualization

Abstract

Sensor networks are emerging as a paradigm for future computing, but pose a number of challenges in the fields of networking and distributed computation. One challenge is to devise a greedy routing protocol-one that routes messages through the network using only information available at a node or its neighbors. Modeling the connectivity graph of a sensor network as a 3-connected planar graph, we describe how to compute on the network in a distributed and local manner a special geometric embedding of the graph. This embedding supports a geometric routing protocol called ''greedy routing'' based on the ''virtual'' coordinates of the nodes derived from the embedding.