Geometric Ad-Hoc Routing: Of Theory and Practice

Proceedings of the Annual ACM Symposium on Principles of Distributed Computing

Volumn 22, Issue , 2003, Pages 63-72

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

^a ETH ZURICH   (Switzerland)

Author keywords

Ad Hoc Networks; Cost Metrics; Face Routing; Geometric Routing; Mobile Computing; Performance; Routing; Wireless Communication

Indexed keywords

ALGORITHMS; APPROXIMATION THEORY; COMPUTER SIMULATION; COSTS; GRAPH THEORY; MATHEMATICAL MODELS; MOBILE COMPUTING; NETWORK PROTOCOLS; ROUTERS; TELECOMMUNICATION NETWORKS;

AD HOC NETWORKS; COST METRICS; FACE ROUTING; GEOMETRIC ROUTING;

WIRELESS TELECOMMUNICATION SYSTEMS;

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

References (27)

1. K. Alzoubi, P.-J. Wan, and O. Frieder. Message-Optimal Connected Dominating Sets in Mobile Ad Hoc Networks. In Proc. ACM Int. Symposium on Mobile ad hoc networking & computing (MobiHoc), 2002.
2. P. Bose, A. Brodnik, S. Carlsson, E.D. Demaine, R. Fleischer, A. López-Ortiz, P. Morin, and J.I. Munro. Online Routing in Convex Subdivisions. In International Symposium on Algorithms and Computation (ISAAC), volume 1969 of Lecture Notes in Computer Science, pages 47-59. Springer, 2000.
3. th Int. Symposium on Algorithms and Computation (ISAAC), volume 1741 of Springer LNCS, pages 113-122, 1999.
4. P. Bose, P. Morin, I. Stojmenovic, and J. Urrutia. Routing with guaranteed delivery in ad hoc wireless networks. In Proc. Discrete Algorithms and Methods for Mobility (Dial-M), pages 48-55, 1999.
5. C. Chiang, H. Wu, W. Liu, and M. Gerla. Routing in Clustered Multihop, Mobile Wireless Networks. In Proc. IEEE Singapore Int. Conf. on Networks, pages 197-211, 1997.
6. S. Datta, I. Stojmenovic, and J. Wu. Internal Node and Shortcut Based Routing with Guaranteed Delivery in Wireless Networks. In Cluster Computing 5, pages 169-178. Kluwer Academic Publishers, 2002.
7. P.G. Doyle and J.L. Snell. Random Walks and Electric Networks. The Carus Mathematical Monographs. The Mathematical Association of America, 1984.
8. G.G. Finn. Routing and Addressing Problems in Large Metropolitan-scale Internetworks. Technical Report ISI/RR-87-180, USC/ISI, March 1987.
9. th Annual Symposium on Computational Geometry (SCG), pages 188-196. ACM Press, 2001.
10. J. Gao, L. Guibas, J. Hershberger, L. Zhang, and A. Zhu. Geometric Spanner for Routing in Mobile Networks. In Proc. ACM Int. Symposium on Mobile ad hoc networking & computing (MobiHoc), 2001.
11. S. Guha and S. Khuller. Approximation Algorithms for Connected Dominating Sets. In J. Díaz and M. Serna, editors. Algorithms - ESA '96, Fourth Annual European Symposium, volume 1136 of Lecture Notes in Computer Science, pages 179-193. Springer, 1996.
12. T.C. Hou and V.O.K. Li. Transmission Range Control in Multihop Packet Radio Networks. IEEE Transactions on Communications, 34(1):38-44, 1986.
13. H.B. Hunt III, M.V. Marathe, V. Radhakrishnan, S.S. Ravi, D.J. Rosenkrantz, and R.E. Stearns. NC-Approximation Schemes for NP- and PSPACE-Hard Problems for Geometric Graphs. J. Algorithms, 26(2):238-274, 1998.
14. D.B. Johnson and D.A. Maltz. Dynamic Source Routing in Ad Hoc Wireless Networks. In T. Imielinski and H. Korth, editors, Mobile Computing, chapter 5, pages 153-181. Kluwer Academic Publishers, 1996.
15. th Annual Int. Conf. on Mobile Computing and Networking (MobiCom), pages 243-254, 2000.
16. nd IEEE Workshop on Mobile Computing Systems and Applications (WMCSA), 1999.
17. th Canadian Conference on Computational Geometry, pages 51-54, 1999.
18. nd USENIX Symposium on Mobile and Location-Independent Computing, pages 1-10, 1995.
19. th Int. Workshop on Discrete Algorithms and Methods for Mobile Computing and Communications (Dial-M), pages 24-33. ACM Press, 2002.
20. th ACM Int. Symposium on Mobile Ad-Hoc Networking and Computing (MobiHoc), 2003.
21. M. Mauve, J. Widmer, and H. Hartenstein, A Survey on Position-Based Routing in Mobile Ad-Hoc Networks. IEEE Network, 15(6), 2001.
22. J.C. Navas and T. Imielinski. GeoCast - Geographic Addressing and Routing. In Proc. Int. Conf. on Mobile Computing and Networking (MobiCom), pages 66-76, 1997.
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. 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.
25. nd International Conference on Distributed Computing Systems (ICDCS), 2002.
26. J. Wu. Dominating-Set-Based Routing in Ad Hoc Wireless Networks. In I. Stojmenovic, editor, Handbook of Wireless Networks and Mobile Computing, chapter 20, pages 425-450. John Wiley & Sons, 2002.
27. Y. Xue, B. Li, and K. Nahrstedt. A Scalable Location Management Scheme in Mobile Ad-hoc Networks. In Proc. IEEE Conference on Local Computer Networks (LCN), 2001.