Routing with guaranteed delivery on virtual coordinates

Proceedings of the 18th Annual Canadian Conference on Computational Geometry, CCCG 2006

Volumn , Issue , 2006, Pages

  Ben Chen, Mirela ^a   Gotsman, Craig ^a   Gortler, Steven J ^b  

^a TECHNION ISRAEL INSTITUTE OF TECHNOLOGY   (Israel)

^b HARVARD UNIVERSITY   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

GUARANTEED DELIVERY; PLANAR GRAPH; SIMPLE ALGORITHM; VIRTUAL COORDINATES;

COMPUTATIONAL GEOMETRY;

EID: 85084013425     PISSN: None     EISSN: None     Source Type: Conference Proceeding    
DOI: None     Document Type: Conference Paper

References (17)

1. d+1, Disc. Comp. Geom., 2(1):49-64, 1987
2. I. Bobenko and B. A. Springborn. Variational principles for circle patterns and Koebe's theorem. Trans. Amer. Math. Soc. 356:659-689, 2004
3. P. Bose, P. Morin, I. Stojmenovic, and J. Urrutia. Routing with guaranteed delivery in ad hoc wireless networks. Wireless Networks, 7(6):609-616, 2001.
4. P. Morin. Online Routing in Geometric Graphs. PhD thesis, Computer Science, Carleton University, 2001.
5. P. Bose, A. Brodnik, S. Carlsson, E. D. Demaine, R. Fleischer, A. Lopez-Ortiz, P. Morin, and J. I. Munro. Online routing in convex subdivisions. Int. J. Com. Geom. andAppl., 12(4):283-296, 2002
6. P. Bose and P. Morin. Online routing in triangulations. SIAMJ. Comp., 33(4):937-951, 2004
7. P. Bose and P. Morin. Competitive online routing in geometric graphs. Theor. Comput. Sci. 324(2-3):273-288, 2004
8. O. Devillers, S. Pion, and M. Teillaud. Walking in a triangulation. Proc. Symp. on Comp. Geom, 2001
9. M. B. Dillencourt and W. D. Smith. Graph-theoretical conditions for inscribability and Delaunay realizability,Disc. Math., 161(1-3):63-77, 1996
10. E. Fusy. Quadratic exact-size and linear approximate-size random generation of planar graphs. Proc. Conf. onAnalysis ofAlg, 2005
11. F. Kuhn, R. Wattenhofer, Y. Zhang and A. Zollinger. Geometric ad-hoc routing: of theory and practice. Proc. PODC, 2003
12. B. Karp and H. T. Kung. GPSR: greedy perimeter stateless routing for wireless networks. Proc. MobiCom, 2000
13. H. Papadimitriou and D. Ratabczak. On a conbecture related to geometric routing. Proc. Algosensors, 2004
14. Rao, C. Papadimitriou, S. Shenker and I. Stoica. Geographic routing without location information. Proc. MobiCom, 2003
15. J. Richter-Gebert. Realization Spaces of Polytopes, Lecture Notes in Math. #1643, Springer, 1996
16. W. Thurston. Three-dimensional Geometry and Topology. Princeton Math. Ser. #35, 1997
17. W.T. Tutte. Convex representations of graphs. Proc. Lond. Math. Soc. 10, 304-320, 1960