Schnyder Greedy Routing Algorithm

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.

[1]  Christos H. Papadimitriou,et al.  On a conjecture related to geometric routing , 2004, Theor. Comput. Sci..

[2]  Stefan Funke,et al.  Topological hole detection in wireless sensor networks and its applications , 2005, DIALM-POMC '05.

[3]  David Eppstein,et al.  Succinct Greedy Graph Drawing in the Hyperbolic Plane , 2008, GD.

[4]  Michael T. Goodrich,et al.  Succinct Greedy Geometric Routing in the Euclidean Plane , 2008, ISAAC.

[5]  Douglas E. Comer,et al.  Internetworking with TCP/IP, Volume 1: Principles, Protocols, and Architectures, Fourth Edition , 2000 .

[6]  Douglas Comer,et al.  Internetworking with TCP/IP , 1988 .

[7]  Douglas Comer.  Internetworking With TCP/IP Principles , 1988 .

[8]  Raghavan Dhandapani,et al.  Greedy Drawings of Triangulations , 2008, SODA '08.

[9]  Rashid Bin Muhammad,et al.  A Distributed Graph Algorithm for Geometric Routing in Ad Hoc Wireless Networks , 2007, J. Networks.

[10]  Frank Thomson Leighton,et al.  Some Results on Greedy Embeddings in Metric Spaces , 2008, FOCS.

[11]  Mirela Ben-Chen,et al.  Distributed computation of virtual coordinates , 2007, SCG '07.

[12]  Stefan Felsner,et al.  Convex Drawings of 3-Connected Plane Graphs , 2004, SODA '05.

[13]  Walter Schnyder,et al.  Embedding planar graphs on the grid , 1990, SODA '90.

[14]  Andrew S. Tanenbaum,et al.  Computer networks, 4th Edition , 2002 .

[15]  Frank Thomson Leighton,et al.  Some Results on Greedy Embeddings in Metric Spaces , 2008, 2008 49th Annual IEEE Symposium on Foundations of Computer Science.

[16]  Sriram V. Pemmaraju,et al.  On the Efficiency of a Local Iterative Algorithm to Compute Delaunay Realizations , 2008, WEA.

[17]  Stefan Felsner,et al.  Schnyder Woods and Orthogonal Surfaces , 2008, Discret. Comput. Geom..

[18]  W. Schnyder.  Planar graphs and poset dimension , 1989 .

[19]  Giuseppe Di Battista,et al.  Succinct greedy drawings do not always exist , 2012, Networks.

[20]  Stefan Felsner,et al.  Convex Drawings of Planar Graphs and the Order Dimension of 3-Polytopes , 2001, Order.

[21]  Roberto Tamassia,et al.  Output-Sensitive Reporting of Disjoint Paths , 1996, Algorithmica.

[22]  Rashid Bin Muhammad.  A Distributed Geometric Routing Algorithm for Ad HocWireless Networks , 2007, ITNG.

[23]  Stefan Felsner,et al.  Convex Drawings of 3-Connected Plane Graphs , 2005, SODA '05.

[24]  Stefan Felsner,et al.  Geodesic Embeddings and Planar Graphs , 2003, Order.

[25]  Douglas E. Comer,et al.  Internetworking with TCP/IP - Principles, Protocols, and Architectures, Fourth Edition , 1988 .

[26]  Scott Shenker,et al.  Geographic routing without location information , 2003, MobiCom '03.