Embedding planar graphs on the grid
SODA '90 Proceedings of the first annual ACM-SIAM symposium on Discrete algorithms
Internetworking with TCP/IP, Volume 1: Principles, Protocols, and Architectures, Fourth Edition
Internetworking with TCP/IP, Volume 1: Principles, Protocols, and Architectures, Fourth Edition
Computer Networks
Geographic routing without location information
Proceedings of the 9th annual international conference on Mobile computing and networking
Topological hole detection in wireless sensor networks and its applications
DIALM-POMC '05 Proceedings of the 2005 joint workshop on Foundations of mobile computing
On a conjecture related to geometric routing
Theoretical Computer Science - Algorithmic aspects of wireless sensor networks
Convex Drawings of 3-Connected Plane Graphs
Algorithmica
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
Schnyder Woods and Orthogonal Surfaces
Discrete & Computational Geometry
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 the efficiency of a local iterative algorithm to compute Delaunay realizations
WEA'08 Proceedings of the 7th international conference on Experimental algorithms
Succinct greedy drawings do not always exist
GD'09 Proceedings of the 17th international conference on Graph Drawing
Greedy routing via embedding graphs onto semi-metric spaces
FAW-AAIM'11 Proceedings of the 5th joint international frontiers in algorithmics, and 7th international conference on Algorithmic aspects in information and management
Competitive routing in the half-θ6-graph
Proceedings of the twenty-third annual ACM-SIAM symposium on Discrete Algorithms
On succinct convex greedy drawing of 3-connected plane graphs
Proceedings of the twenty-second annual ACM-SIAM symposium on Discrete Algorithms
Greedy routing via embedding graphs onto semi-metric spaces
Theoretical Computer Science
| Hi-index | 0.01 |
Geometric routing by using virtual locations is an elegant way for solving network routing problem In its simplest form, greedy routing, a message is forwarded to a neighbor that is closer to the destination One major drawback of this approach is that the virtual coordinates requires Ω(nlogn) bits to represent, which makes this scheme infeasible in some applications. In this paper, we introduce a modified version of greedy routing which we call generalized greedy routing algorithm Instead of relying on decreasing distance for routing decision, our routing algorithms use other criterion to determine routing path, solely based on local information We present simple generalized greedy routing algorithms based on Schnyder coordinates (consisting of three integers between 0 and 2n), which are derived from Schnyder realizer for plane triangulations and Schnyder wood for 3-connected plane graphs The algorithms are simple and can be easily implemented in linear time.