Sciweavers

11 search results - page 1 / 3
» Greedy Connectivity of Geographically Embedded Graphs
Sort
View
CORR
2010
Springer
55views Education» more  CORR 2010»
13 years 3 months ago
Greedy Connectivity of Geographically Embedded Graphs
Jie Sun, Daniel ben-Avraham
FOCS
2008
IEEE
13 years 11 months ago
Some Results on Greedy Embeddings in Metric Spaces
Geographic Routing is a family of routing algorithms that uses geographic point locations as addresses for the purposes of routing. Such routing algorithms have proven to be both ...
Ankur Moitra, Tom Leighton
INFOCOM
2007
IEEE
13 years 11 months ago
Robust Geo-Routing on Embeddings of Dynamic Wireless Networks
— Wireless routing based on an embedding of the connectivity graph is a very promising technique to overcome shortcomings of geographic routing and topology-based routing. This i...
Dominique Tschopp, Suhas N. Diggavi, Matthias Gros...
ALGOSENSORS
2004
Springer
13 years 10 months ago
On a Conjecture Related to Geometric Routing
We conjecture that any planar 3-connected graph can be embedded in the plane in such a way that for any nodes s and t, there is a path from s to t such that the Euclidean distance ...
Christos H. Papadimitriou, David Ratajczak