Graph-theoretical conditions for inscribability and Delaunay realizability
Discrete Mathematics
GeoCast—geographic addressing and routing
MobiCom '97 Proceedings of the 3rd annual ACM/IEEE international conference on Mobile computing and networking
A distance routing effect algorithm for mobility (DREAM)
MobiCom '98 Proceedings of the 4th annual ACM/IEEE international conference on Mobile computing and networking
Geocasting in Mobile Ad Hoc Networks: Location-Based Multicast Algorithms
WMCSA '99 Proceedings of the Second IEEE Workshop on Mobile Computer Systems and Applications
On a conjecture related to geometric routing
Theoretical Computer Science - Algorithmic aspects of wireless sensor networks
On delivery guarantees of face and combined greedy-face routing in ad hoc and sensor networks
Proceedings of the 12th annual international conference on Mobile computing and networking
Distributed computation of virtual coordinates
SCG '07 Proceedings of the twenty-third annual symposium on Computational geometry
A Distributed Geometric Routing Algorithm for Ad HocWireless Networks
ITNG '07 Proceedings of the International Conference on Information Technology
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
Succinct Greedy Graph Drawing in the Hyperbolic Plane
Graph Drawing
Succinct Greedy Geometric Routing in the Euclidean Plane
ISAAC '09 Proceedings of the 20th International Symposium on Algorithms and Computation
On Succinctness of Geometric Greedy Routing in Euclidean Plane
ISPAN '09 Proceedings of the 2009 10th International Symposium on Pervasive Systems, Algorithms, and Networks
Hi-index | 0.00 |
Greedy embedding is the key of geometric greedy routing in p2p networks It embeds a graph (the topological structure of the p2p network) in a metric space such that between any source-destination pair, there is a distance decreasing path for message delivery It is known that any graph can be greedily embedded in the hyperbolic plane with using O(logn) bits for each node's coordinates [7] Interestingly, on greedy embedding in the Euclidean plane, existing embedding algorithms result in coordinates with ${\it \Omega}(n)$ bits It was recently proved that ${\it \Omega}(n)$ is a lower bound of the coordinates' bit length if one uses Cartesian or polar coordinate system and preserves the planar embedding of a planar graph when greedily embedding it in the Euclidean plan [2] In this paper we strengthen this result by further proving that ${\it \Omega}(n)$ is still a lower bound even if the graph is allowed to take free embedding in the plane.