By Topic

On Succinctness of Geometric Greedy Routing in Euclidean Plane

Sign In

Cookies must be enabled to login.After enabling cookies , please use refresh or reload or ctrl+f5 on the browser for the login options.

Formats Non-Member Member
$33 $13
Learn how you can qualify for the best price for this item!
Become an IEEE Member or Subscribe to
IEEE Xplore for exclusive pricing!
close button

puzzle piece

IEEE membership options for an individual and IEEE Xplore subscriptions for an organization offer the most affordable access to essential journal articles, conference papers, standards, eBooks, and eLearning courses.

Learn more about:

IEEE membership

IEEE Xplore subscriptions

3 Author(s)
Lei Cao ; Dept. of Electr. Eng., Univ. of Mississippi, Oxford, MS, USA ; Strelzoff, A. ; Sun, J.Z.

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 ¿(n) bits to represent.

Published in:

Pervasive Systems, Algorithms, and Networks (ISPAN), 2009 10th International Symposium on

Date of Conference:

14-16 Dec. 2009