On succinct convex greedy drawing of 3-connected plane graphs
Proceedings of the twenty-second annual ACM-SIAM symposium on Discrete Algorithms
A lower bound on greedy embedding in euclidean plane
GPC'10 Proceedings of the 5th international conference on Advances in Grid and Pervasive Computing
Succinct strictly convex greedy drawing of 3-connected plane graphs
FAW-AAIM'12 Proceedings of the 6th international Frontiers in Algorithmics, and Proceedings of the 8th international conference on Algorithmic Aspects in Information and Management
| Hi-index | 0.00 |
Geometric greedy routing uses (virtual) geographic point locations as addresses for the purposes of routing, while routing decisions are made by each node individually based only on local information. It requires that the network topology is greedily embedded in a metric space through assigning virtual coordinates to the nodes in the network. Recent research pointed out that such scheme is significantly more efficient than other traditional routing schemes only if the virtual coordinates are succinctly represented (i.e., using $O(poly(\log n))$ bits per coordinate) in the greedy embedding, an issue that has been overlooked for a long time. In this paper we prove that such succinctness is not achievable in Euclidean plane, assuming that Cartesian or polar coordinate system is used, the network topology is a planar graph, and the planar embedding is preserved during the process of greedy embedding. Indeed, we provide a counter example to show that in this situation, some coordinates must take $\Omega(n)$ bits to represent.