Geometric spanner for routing in mobile networks

Proceedings of the 2001 ACM International Symposium on Mobile Ad Hoc Networking and Computing: MobiHoc 2001

Volumn , Issue , 2001, Pages 45-55

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

^a Stanford University ^*  (United States)

^b MENTOR GRAPHICS CORPORATION   (United States)

^c HEWLETT PACKARD COMPANY   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

ALGORITHMS; GRAPH THEORY; NETWORK PROTOCOLS; PACKET NETWORKS; ROUTERS;

GEOMETRIC SPANNER;

MOBILE TELECOMMUNICATION SYSTEMS;

EID: 0035789242     PISSN: None     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1145/501422.501424     Document Type: Conference Paper

References (23)

1. A. D. Amis, R. Prakash, T. H. P. Vuong, and D. T. Huynh. Max-Min D-cluster formation in wireless ad hoc networks. In 19th IEEE INFOCOM, March 1999.
2. S. Basagni, I. Chlamtac, V. R. Syrotiuk, and B. A. Woodward. A distance routing effect algorithm for mobility (DREAM). In Proc. ACM/IEEE MobiCom, pages 76-84, 1998.
3. P. Bose, L. Devroye, W. Evans, and D. Kirkpatrick. On the spanning ratio of gabriel graphs and β-skeletons, submitted to SIAM Journal on Discrete Mathematics, 2001.
4. P. Bose, P. Morin, I. Stojmenovic, and J. Urrutia. Routing with guaranteed delivery in ad hoc wireless networks. In 3rd Int. Workshop on Discrete Algorithms and methods for mobile computing and communications (DialM '99), 1999.
5. L. P. Chew. There is a planar graph almost as good as the complete graph. In Proc. 2nd Annu. ACM Sympos. Comput. Geom., pages 169-177, 1986.
6. 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 '97, pages 197-211, Apr 1997.
7. B. Das and V. Bharghavan. Routing in ad-hoc networks using minimum connected dominating sets. In IEEE International Conference on Communications (ICC'97), 1997.
8. D. P. Dobkin, S. J. Friedman, and K. J. Supowit. Delaunay graphs are almost as good as complete graphs. In Proc. 28th Annu. IEEE Sympos. Found. Comput. Sci., pages 20-26, 1987.
9. A. Ephremides, J. E. Wieselthier, and D. J. Baker. A design concept for reliable mobile radio networks with frequency hopping signaling. Proc. of IEEE, 75(1):56-73, Jan 1987.
10. D. Eppstein. Spanning trees and spanners. In J.-R. Sack and J. Urrutia, editors, Handbook of Computational Geometry, pages 425-461. Elsevier Science Publishers B.V. North-Holland, Amsterdam, 2000.
11. J. Gao, L. J. Guibas, J. Hershberger, L. Zhang, and A. Zhu. Discrete mobile centers. In Proc. 17th ACM Symp. on Computational Geometry, Jun 2001.
12. M. Gerla and J. Tsai. Multicluster, mobile, multimedia radio network. ACM-Baltzer Journal of Wireless Networks, 1(3), 1995.
13. B. Karp and H. Kung. GPSR: Greedy perimeter stateless routing for wireless networks. In Proc. of the ACM/IEEE International Conference on Mobile Computing and Networking (MobiCom), pages 243-254, 2000.
14. J. M. Keil and C. A. Gutwin. The delaunay triangulation closely approximates the complete euclidean graph. In Proc. International Workshop on Algorithms and Data Structures, volume 382 of Lecture Notes Comput. Sci., pages 47-56, 1989.
15. Y.-B. Ko and N. H. Vaidya. Location-aided routing (LAR) in mobile ad hoc networks. In Proc. ACM/IEEE MobiCom, pages 66-75, 1998.
16. J. Li, J. Jannotti, D. DeCouto, D. Karger, and R. Morris. A scalable location service for geographic ad-hoc routing. In Proc. 6th Annu. ACM/IEEE International Conference on Mobile Computeing and Networking., 2000.
17. V. D. Park and M. S. Corson. A highly adaptive distributed routing algorithm for mobile wireless networks. In Proc. IEEE Infocom, pages 1405-1413, 1997.
18. C. E. Perkins and E. M. Royer. Ad-hoc on-demand distance vector routing. In Proc. of 2nd IEEE Workshop on Mobile Computing Systems and Applications, 1999.
19. F. P. Preparata and M. I. Shamos. Computational Geometry: An Introduction. Springer-Verlag, New York, NY, 1985.
20. V. Rodoplu and T. H. Meng. Minimum energy mobile wireless networks. IEEE J. Selected Areas in Communications, 17(8):1333-1344, August 1999.
21. E. M. Royer and C.-K. Toh. A review of current routing protocols for ad-hoc mobile wireless networks. IEEE Personal Communications, 6(2):46-55, Apr 1999.
22. R. Wattenhofer, L. Li, P. Bahl, and Y. M. Wang. Distributed topology control for power efficient operation in multihop wireless ad hoc networks. In Proc. IEEE Infocom, 2001.
23. J. Wu and H. Li. On calculating connected dominating set for efficient routing in ad hoc wireless networks. In 3rd International Workshop on Discrete Algorithms and Methods for Mobile Computing & Communications, 1999.