Please use this identifier to cite or link to this item:
|Title:||Greedy virtual coordinates for geographic routing|
|Authors:||Leong, B. |
|Source:||Leong, B., Liskov, B., Morris, R. (2007). Greedy virtual coordinates for geographic routing. Proceedings - International Conference on Network Protocols, ICNP : 71-80. ScholarBank@NUS Repository. https://doi.org/10.1109/ICNP.2007.4375838|
|Abstract:||We present a new approach for generating virtual coordinates that produces usable coordinates quickly and improves the routing performance of existing geographic routing algorithms. Starting from a set of initial coordinates derived from a set of elected perimeter nodes, Greedy Embedding Spring Coordinates (GSpring) detects possible dead ends and uses a modified spring relaxation algorithm to incrementally adjust virtual coordinates to increase the convexity of voids in the virtual routing topology. This reduces the probability that packets will end up in dead ends during greedy forwarding. The coordinates derived by GSpring achieve routing stretch that is up to 50% lower than that for NoGeo, the best existing algorithm for deriving virtual Euclidean coordinates for geographic routing. For realistic network topologies with obstacles, GSpring coordinates achieves from between 10 to 15% better routing stretch than actual physical coordinates. ©2007 IEEE.|
|Source Title:||Proceedings - International Conference on Network Protocols, ICNP|
|Appears in Collections:||Staff Publications|
Show full item record
Files in This Item:
There are no files associated with this item.
checked on Mar 8, 2018
WEB OF SCIENCETM
checked on Feb 12, 2018
checked on Mar 12, 2018
Items in DSpace are protected by copyright, with all rights reserved, unless otherwise indicated.