Geometric spanners for routing in mobile networks

IEEE Journal on Selected Areas in Communications

Volumn 23, Issue 1, 2005, Pages 174-185

  Gao, Jie ^a,b   Guibas, Leonidas J ^a   Hershberger, John ^c   Zhang, Li ^d,e   Zhu, An ^a  

^a Stanford University   (United States)

^b CALIFORNIA INSTITUTE OF TECHNOLOGY   (United States)

^c MENTOR GRAPHICS CORPORATION   (United States)

^d HEWLETT PACKARD COMPANY   (United States)

^e HEWLETT PACKARD LABORATORIES   (United States)

Author keywords

Geographical routing; Spanners; Wireless ad hoc networks

Indexed keywords

EUCLIDEAN DISTANCE; GEOGRAPHICAL ROUTING; SPANNERS; WIRELESS AD HOC NETWORKS;

ALGORITHMS; COMPUTER SIMULATION; GRAPH THEORY; MOBILE TELECOMMUNICATION SYSTEMS; NETWORK PROTOCOLS; ROUTERS;

TELECOMMUNICATION NETWORKS;

EID: 11844255728     PISSN: 07338716     EISSN: None     Source Type: Journal    
DOI: 10.1109/JSAC.2004.837364     Document Type: Conference Paper

References (26)

1. E. M. Royer and C.-K. Toh, "A review of current routing protocols for ad-hoc mobile wireless networks," IEEE Pers. Commun., vol. 6, no. 2, pp. 46-55, Apr. 1999.
2. A. Savvides, C.-C. Han, and M. B. Strivastava, "Dynamic fine-grained localization in ad hoc networks of sensors," in Proc. 7th Annu. Int. Conf. Mobile Comput. Netw. (MobiCom 2001), Rome, Italy, Jul. 2001, pp. 166-179.
3. A. Savvides and M. B. Strivastava, "Distributed fine-grained localization in ad-hoc networks," IEEE Trans. Mobile Comput., submitted for publication.
4. J. Li, J. Jannotti, D. Decouto, D. Karger, and R. Morris, "A scalable location service for geographic ad-hoc routing," in Proc. 6th ACM/IEEE Int. Conf. Mobile Comput. Netw., 2000, pp. 120-130.
5. R. Jain, A. Puri, and R. Sengupta, "Geographical routing using partial information for wireless ad hoc networks," IEEE Pers. Commun., vol. 8, no. 1, pp. 48-57, Feb. 2001.
6. B. Karp and H. Kung, "GPSR: Greedy perimeter stateless routing for wireless networks," in Proc. o ACM/IEEE Int. Conf. Mobile Comput. Netw., 2000, pp. 243-254.
7. P. Bose, P. Morin, I. Stojmenovic, and J. Urrutia, "Routing with guaranteed delivery in ad hoc wireless networks," Wireless Netw., vol. 7, no. 6, pp. 609-616, 2001.
8. Handbook of Computational Geometry, J.-R. Sack and J. Urrutia, Eds., North-Holland, Amsterdam, The Netherlands, 2000, pp. 425-461. D. Eppstein, "Spanning trees and spanners".
9. J. Gao, L. Guibas, J. Hershberger, L. Zhang, and A. Zhu, "Discrete mobile centers," Discrete Comput. Geometry, vol. 30, no. 1, pp. 45-65, 2003.
10. A. D. Amis, R. Prakash, T. H. P. Vuong, and D. T. Huynh, "Max-min D-cluster formation in wireless ad hoc networks," in Proc. 19th IEEE INFOCOM, Tel-Aviv, Israel, Mar. 1999, pp. 32-41.
11. C.-C. Chiang, H.-K. Wu, W. Liu, and M. Gerla, "Routing in clustered multihop, mobile wireless networks with fading channel," in Proc. IEEE SICON, Apr. 1997, pp. 197-211.
12. A. Ephremides, I. E. Wieselthier, and D. I. Baker, "A design concept for reliable mobile radio networks with frequency hopping signaling," in Proc. IEEE, vol. 75, Jan. 1987, pp. 56-73.
13. M. Gerla and J. Tsai, "Multicluster, mobile, multimedia radio network," ACM-Baltzer J. Wireless Netw., vol. 1, no. 3, pp. 255-265, 1995.
14. B. Das and V. Bharghavan, "Routing in ad-hoc networks using minimum connected dominating sets," in Proc. IEEE Int. Conf. Commun. (ICC'97), Jun. 1997, pp. 376-380.
15. J. Wu and H. Li, "On calculating connected dominating set for efficient routing in ad hoc wireless networks," in Proc. 3rd Int. Workshop Discrete Algorithms Methods Mobile Comput. Commun., Aug. 1999, pp. 7-14.
16. J. Hershberger, "Smooth kinetic maintenance of clusters," in Proc. ACM Symp. Comput. Geometry, Jun. 2003, pp. 48-57.
17. L. P. Chew, "There is a planar graph almost as good as the complete graph," in Proc. 2nd Annu. ACM Symp. Comput. Geometry, Jun. 1986, pp. 169-177.
18. D. P. Dobkin, S. J. Friedman, and K. J. Supowit, "Delaunay graphs are almost as good as complete graphs," Discrete Comput. Geometry, vol. 5, no. 4, pp. 399-407, 1990.
19. J. M. Keil and C. A. Gutwin, "The Delaunay triangulation closely approximates the complete Euclidean graph," in Lecture Notes in Computer Science, ser., 1989, vol. 382, Proc. Int. Workshop Algorithms Data Structures, pp. 47-56.
20. J. Gao, L. J. Guibas, J. Hershberger, L. Zhang, and A. Zhu, "Geometric spanner for routing in mobile networks," in Proc. 2nd ACM Symp. Mobile Ad Hoc Netw. Compu., Oct. 2001, pp. 45-55.
21. X.-Y. Li, G. Calinescu, and P.-J. Wan, "Distributed construction of planar spanner and routing for ad hoc networks," in Proc. IEEE INFOCOM, Jun. 2002, pp. 1268-1277.
22. K. Alzoubi, X.-Y. Li, Y. Wang, P.-J. Wan, and O. Fieder, "Geometric spanners for wireless ad hoc networks," IEEE Trans. Parallel Distrib. Syst., vol. 14, no. 5, May 2003.
23. F. P. Preparata and M. I. Shamos, Computational Geometry: An Introduction. New York: Springer-Verlag, 1985.
24. P. Bose, L. Devroye, W. Evans, and D. Kirkpatrick, "On the spanning ratio of Gabriel graphs and β-skeletons," in Proc. 5th Latin Amer. Symp. Theoretical Inf., Apr. 2002, pp. 479-493, submitted for publication.
25. F. Kuhn, R. Wattenhofer, and A. Zollinger, "Asymptotically optimal geometric mobile ad-hoc routing," in Proc. 6th Int. Workshop Discrete Algorithms Methods Mobile Comput. Commun., Sep. 2002, pp. 24-33.
26. J. Gao and L. Zhang, "Well-separated pair decomposition for the unit-disk graph metric and its applications," in Proc. 35th ACM Symp. Theory Comput., Jun. 2003, pp. 483-492.