Asymptotically optimal geometric mobile ad-hoc routing

Proceedings of the Discrete Algorithms and Methods for Mobile Computing and Communications

Volumn , Issue , 2002, Pages 24-33

  Kuhn, Fabian ^a   Wattenhofer, Roger ^a   Zollinger, Aaron ^a  

^a ETH ZURICH   (Switzerland)

Author keywords

Ad Hoc Networks; Face Routing; Geometric Routing; Routing; Unit Disk Graphs; Wireless Communication

Indexed keywords

ALGORITHMS; COMPUTATIONAL GEOMETRY; ITERATIVE METHODS; NETWORK PROTOCOLS; ROUTERS;

AD HOC ROUTING;

MOBILE TELECOMMUNICATION SYSTEMS;

EID: 0036987473     PISSN: None     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1145/570810.570814     Document Type: Conference Paper

References (25)

1. P. Bose and P. Morin. Online routing in triangulations. In 10th International Symposium on Algorithms and Computation (ISAAC), volume 1741 of Springer LNCS, pages 113-122, 1999.
2. P. Bose, P. Morin, A. Brodnik, S. Carlsson, E. Demaine, R. Fleischer, J. Munro, and A. Lopez-Ortiz. Online routing in convex subdivisions. In International Symposium on Algorithms and Computation (ISAAC), pages 47-59, 2000.
3. P. Bose, P. Morin, I. Stojmenovic, and J. Urrutia. Routing with guaranteed delivery in ad hoc wireless networks. In Proc. of Discrete Algorithms and Methods for Mobility (DIALM'99), pages 48-55, 1999.
4. J. Broch, D. Maltz, D. Johnson, Y.-C. Hu, and J.Jetcheva. A performance comparison of multi-hop wireless ad hoc network routing protocols. In Mobile Computing and Networking, pages 85-97, 1998.
5. S. Datta, I. Stojmenovic, and J. Wu. Internal node and shortcut based routing with guaranteed delivery in wireless networks. In Proc. IEEE Int. Conf. on Distributed Computing and Systems Workshops; Cluster Computing, to appear, pages 461-466, 2001.
6. D. Dobkin, S. Friedman, and K. Supowit. Delaunay graphs are almost as good as complete graphs. Discrete & Computational Geometry, 5:399-407, 1990.
7. G. Finn. Routing and addressing problems in large metropolitan-scale internetworks. Technical Report ISI/RR-87-180, USC/ISI, March 1987.
8. K. Gabriel and R. Sokal. A new statistical approach to geographic variation analysis. Systematic Zoology, 18:259-278, 1969.
9. S. Giordano, I. Stojmenovic, and L. Blazevic. Position based routing algorithms for ad hoc networks: a taxonomy, July 2001. http://www.site.uottawa.ca/̃ivan/routing-survey.pdf.
10. J. Hightower and G. Borriella. Location systems for ubiquitous computing. IEEE Computer, 34(8):57-66, 2001.
11. T. Hou and V. Li. Transmission range control in multihop packet radio networks. IEEE Transactions on Communications, 34(1):38-44, 1986.
12. T. Imielinski and J. Navas. Gps-based addressing and routing. Technical Report RFC 2009, Computer Science, Rutgers University, November 1996.
13. Y. Ko and N. Vaidya. Geocasting in mobile ad hoc networks: Location-based multicast algorithms. Technical Report TR-98-018, Texas A & M University, September 1998.
14. E. Kranakis, H. Singh, and J. Urrutia. Compass routing on geometric networks. In Proc. 11th Canadian Conference on Computational Geometry, pages 51-54, Vancouver, August 1999.
15. F. Kuhn, R. Wattenhofer, and A. Zollinger. Geometric ad-hoc routing for unit disk graphs and general cost models. Technical Report 373, ETH Zurich, Department of Computer Science, 2002. Submitted. http://www.distcomp.ethz.ch/publications/tr373.ps.
16. J. Li, J. Jannotti, D. De Couto, D. Karger, and R. Morris. A scalable location service for geographic ad-hoc routing. In MobiCom '00, pages 120-130, August 2000.
17. X.-Y. Li, G. Calinescu, and P.-J. Wan. Distributed construction of planar spanner and routing for ad hoc wireless networks. In IEEE INFOCOM, 2002.
18. M. Mauve, J. Widmer, and H. Hartenstein. A survey on position-based routing in mobile ad-hoc networks. IEEE Network Magazine, 15(6):30-39, November 2001.
19. J. Navas and T. Imielinski. Geocast - geographic addressing and routing. In Mobile Computing and Networking, pages 66-76, 1997.
20. S. Ramanathan and M. Steenstrup. A survey of routing techniques for mobile communications networks. Mobile Networks and Applications, 1(2):89-104, 1996.
21. E. Royer and C. Toh. A review of current routing protocols for ad-hoc mobile wireless networks. In IEEE Personal Communications, pages 46-55, April 1999.
22. A. Savvides, C.-C. Han, and M. Srivastava. Dynamic fine-grained localization in ad-hoc networks of sensors. In MOBICOM '01, pages 166-179, July 2001.
23. H. Takagi and L. Kleinrock. Optimal transmission ranges for randomly distributed packet radio terminals. IEEE Transactions on Communications, 32(3):246-257, 1984.
24. G. Toussaint. The relative neighborhood graph of a finite planar set. Pattern Recognition, 12(4):261-268, 1980,
25. J. Urrutia. Routing with guaranteed delivery in geometric and wireless networks. In I. Stojmenovic, editor, Handbook of Wireless Networks and Mobile Computing, chapter 18, pages 393-406. John Wiley & Sons, 2002.