Geographic routing in d-Dimensional Spaces with Guaranteed Delivery and Low Stretch

IEEE/ACM Transactions on Networking

Volumn 21, Issue 2, 2013, Pages 663-677

  Lam, Simon S ^a   Qian, Chen ^a  

^a University of Texas at Austin   (United States)

Author keywords

Distributed Delaunay triangulation; geographic routing; greedy forwarding; protocol design; resilience to churn

Indexed keywords

DELAU-NAY TRIANGULATIONS; GEOGRAPHIC ROUTING; GREEDY FORWARDING; PROTOCOL DESIGN; RESILIENCE TO CHURN;

TRIANGULATION;

ROUTING PROTOCOLS;

EID: 84876284899     PISSN: 10636692     EISSN: None     Source Type: Journal    
DOI: 10.1109/TNET.2012.2214056     Document Type: Article

References (31)

1. S.M.N. Alam and Z. J. Haas, "Coverage and connectivity in three-dimensional networks," inProc ACMMobiCom, 2006, pp. 346-357.
2. P. Bose, A. Brodnik, S. Carlsson, E. Demaine, R. Fleischer, A. Lopez-Ortiz, P. Morin, and J. Munro, "Online routing in convex subdivisions," Int. J. Comput. Geom. Appl., vol. 12, no. 4, pp. 283-295, 2002.
3. P. Bose and P. Morin, "Online routing in triangulations," SIAMJ. Comput.,vol.33,no.4,pp.937-951,2004.
4. P. Bose, P. Morin, I. Stojmenovic, and J. Urrutia, "Routing with Guaranteed delivery in Ad Hoc wireless networks," inProc DIALM, 1999, pp. 48-55.
5. M. Caesar, M. Castro, E. B. Nightingale, G. O'Shea, and A. Rowstron, "Virtual ring routing: Networking routing inspired by DHTs," inProc ACMSIGCOMM,2006,pp.351-362.
6. R. Draves, J. Padhye, and B. Zill, "Routing in multi-radio, multi-hop wireless meshnetworks," inProc ACMMobiCom, 2004, pp. 114-128.
7. S. Durocher, D. Kirkpatrick, and L. Narayanan, "On routing with Guaranteed delivery in three-dimensional ad hoc wireless networks," in Proc.ICDCN, 2008,pp.546-557
8. R. Flury and R. Wattenhofer, "Randomized 3D geographic routing," in Proc.IEEE INFOCOM, 2008,pp. 834-842.
9. S. Fortune, J. E. Goodman and J. O'Rourke, Eds., "Voronoi diagrams and Delaunay triangulations," in Handbook of Discrete and Computa- tional Geometry, 2nd ed. Boca Raton, FL: CRC Press, 2004.
10. K. R. Gabriel and R. R. Sokal, "A new statistical approach to geo- graphic variation analysis," Syst. Zool., vol. 18, no. 3, pp. 259-278, 1969.
11. J. Gao, L. Guibas, J. Hershberger, L. Zhang, and A. Zhu, "Geometric spanner for routing in mobile networks," in Proc. MobiHoc, 2001, pp. 45-55.
12. J. Herzen, C. Westphal, and P. Thiran, "Scalable routing easy as PIE: Apractical isometric embeddingprotocol," inProc. IEEEICNP, 2011, pp. 49-58.
13. B. Karp and H. Kung, "GPSR: Greedy perimeter stateless routing for wireless networks," inProc. ACMMobiCom, 2000, pp. 243-254.
14. Y.-J. Kim, R. Govindan, B. Karp, and S. Shenker, "Geographic routing made practical," inProc USENIXNSDI, 2005, vol. 2, pp. 217-230.
15. S. S. Lam and C. Qian, "Geographic routing in d-dimensional spaces with guaranteed delivery and low stretch," Dept. Comput. Sci., Univ. Texas Austin,, Austin, TX, Tech. Rep. TR-10-03, Jan. 2010, (revised, March 18, 2011).
16. D.-Y. Lee and S. S. Lam, "Protocol design for dynamic Delaunay triangulation," Dept. Comput. Sci., Univ. Texas Austin, Tech. Rep. TR-06-48, Dec. 2006.
17. D.-Y. Lee and S. S. Lam, "Efficient and accurate protocols for dis- tributed Delaunay triangulation under churn," in Proc. IEEE ICNP, Nov. 2008, pp. 124-136.
18. B. Leong, B. Liskov, and R. Morris, "Geographic routing without pla- narization," in Proc. USENIXNSDI, 2006vol. 3, p. 25
19. M. Li and Y. Liu, "Rendered path: Range-free localization in anisotropic sensor networks with holes," in Proc. ACMMobiCom, 2007, pp. 51-62.
20. X.-Y. Li, G. Calinescu, P.-J. Wan, and Y. Wang, "Localized Delaunay triangulation with application in ad hoc wireless networks," IEEE Trans. ParallelDistrib. Syst., vol. 14, no. 10, pp. 1035-1047, Oct. 2003.
21. C. Liu and J. Wu, "Efficient geometric routing in three dimensional ad hoc networks," inProc IEEE INFOCOM, 2009, pp. 2751-2755.
22. D. Pompili, T. Melodia, and I. Akyildiz, "Routing algorithms for delay- insensitive and delay-sensitive applications in underwater sensor net- works,"inProc. 12thMobiCom2006, pp. 298-309.
23. C. QianandS.S. Lam, "Greedy distance vectorrouting," inProc IEEE ICDCS, Jun.2011,pp.857-868.
24. C. Qian and S. S. Lam, "ROME: Routing on metropolitan-scale Ethernet," inProc. IEEEICNP, 2012, to be published.
25. R. Sarkar, X. Yin, J. Gao, F. Luo, and X. D. Gu, "Greedy routing with guaranteed delivery using Ricci flows," in Proc. IPSN, 2009, pp. 121-132.
26. G. Toussaint, "The relative neighborhood graph ofafinite planar set," PatternRecogn., vol. 12, no. 4, pp. 261-268, 1980.
27. P.-J. Wan, C.-W. Yi, L. Wang, F. Yao, and X. Jia, "Asymptotic crit- ical transmission radius for greedy forward routing in wireless ad hoc networks," IEEETrans. Commun.,vol. 57,no. 5,pp. 1433-1443,May 2009.
28. Y. Wang, C.-W. Yi, and F. Li, "Delivery guarantee ofgreedy routing in three dimensional wireless networks," inProc WASA, 2008, pp. 4-16.
29. S. Xia, X. Yin, H. Wu, M. Jin, and X. D. Gu, "Deterministic greedy routing with guaranteed delivery in 3D wireless sensor networks," in Proc.MobiHoc,2011,Articleno. 1.
30. G. Xing, C. Lu, R. Pless, and Q. Huang, "On greedy geographic routing algorithms in sensing-covered networks," in Proc. ACM MobiHoc,2004,pp.31-42.
31. J. Zhou, Y. Chen, B. Leong, and P. Sundaramoorthy, "Practical 3D geographic routing for wireless sensor networks," in Proc. SenSys, Nov. 2010, pp. 337-350.