An algorithmic approach to geographic routing in ad hoc and sensor networks

IEEE/ACM Transactions on Networking

Volumn 16, Issue 1, 2008, Pages 51-62

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

^a MICROSOFT RESEARCH   (United States)

^b ETH ZURICH   (Switzerland)

^c UNIVERSITY OF CALIFORNIA   (United States)

Author keywords

Algorithmic analysis; Routing; Stretch; Wireless networks

Indexed keywords

AD HOC NETWORKS; WIRELESS SENSOR NETWORKS;

ALGORITHMIC ANALYSIS; FACE ROUTING; GEOGRAPHIC ROUTING; GREEDY FORWARDING;

ROUTING ALGORITHMS;

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

References (54)

1. 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 Proc. ACM MobiCom, 1998, pp. 85-97 [Online]. Available: Citeseer.nj.nec.com/broch98performance.html
2. J. Li, J. Jannotti, D. De Couto, D. Karger, and R. Morris, "A scalable location service for geographic ad hoc routing," in Proc. ACM MobiCom, Aug. 2000, pp. 120-130.
3. I. Abraham, D. Dolev, and D. Malkhi, "LLS: A locality aware location service for mobile ad hoc networks," in DIALM-POMC '04: Proc. 2004 Joint Workshop on Foundations of Mobile Computing, 2004, pp. 75-84. 4
4. M. Grossglauser and M. Vetterli, "Locating nodes with EASE: Mobility diffusion of last encounters in ad hoc networks," in Proc. 22nd Annu. Joint Conf. IEEE Computer and Communications Societies (INFOCOM 2003.
5. R. Flury and R. Wattenhofer, 'MLS: An efficient location service for mobile ad hoc networks," in Proc. 7th ACM MobiHoc, Florence, Italy, May 2006.
6. A. Zollinger, "Networking unleashed: Geographic routing and topology control in ad hoc and sensor networks," Ph.D. dissertation, ETH Zurich, Switzerland, 2005, diss. ETH 16025.
7. C. Perkins and P. Bhagwat, "Highly dynamic Destination-Sequenced Distance-Vector Routing (DSDV) for mobile computers," in Proc. ACM SIGCOMM'94, 1994, pp. 234-244.
8. R. Ogier, F. Templin, and M. Lewis, "Topology Dissemination Based on Reverse-Path Forwarding (TBRPF)," IETF RFC 3684, Feb. 2004.
9. T. Clausen and P. Jacquet, "Optimized Link State Routing Protocol (OLSR)," IETF RFC 3626, Oct. 2003.
10. C. Perkins and E. Royer, "Ad-hoc on-demand distance vector routing," in Proc. 2nd IEEE Workshop on Mobile Computing Systems and Applications, 1999, pp. 90-100.
11. D. Johnson and D. Maltz, "Dynamic source routing in ad hoc wireless networks," in Mobile Computing, Imielinski and Korth, Eds. Boston, MA: Kluwer Academic, 1996, vol. 353 [Online]. Available: citeseer.nj. nec.com/johnson96dynamic.html
12. V. Park and M. Corson, "A highly adaptive distributed routing algorithm for mobile wireless networks," in Proc. 16th Annu. Joint Conf. IEEE Computer and Communications Societies (INFOCOM), 1997, pp. 1405-1413 [Online]. Available: Citeseer.ist.psu.edu/article/park97highly.html
13. M. Joa-Ng and I.-T. Lu, "A peer-to-peer zone-based two-level link state routing for mobile ad hoc networks," IEEE J. Sel. Areas Commun., vol. 17, no. 8, pp. 1415-1425, Aug. 1999.
14. N. Nikaein, C. Bonnet, and N. Nikaein, "HARP - Hybrid Ad Hoc Routing protocol," in Int. Symp. Telecommunications (IST 2001), Tehran, Iran, Sep. 2001.
15. V. Ramasubramanian, Z. Haas, and E. Sirer, "SHARP: A hybrid adaptive routing protocol for mobile ad hoc networks," in Proc. ACM MobiHoc 2003.
16. E. Royer and C. Toh, "A review of current routing protocols for ad hoc mobile wireless networks," IEEE Personal Commun., vol. 6, no. 2, pp. 46-55, Apr. 1999.
17. C. Busch, S. Surapaneni, and S. Tirthapura, "Analysis of link reversal routing algorithms for mobile ad hoc networks," in Proc. 15th Annu. ACM Symp. Parallel Algorithms and Architectures (SPAA), San Diego, CA, Jun. 2003.
18. E. Gafni and D. Bertsekas, "Distributed algorithms for generating loop-free routes in networks with frequently changing topology," IEEE Trans. Commun., vol. 29, no. 1, pp. 11-18, Jan. 1981.
19. R. Prakash, "Unidirectional links prove costly in wireless ad hoc networks," in Proc. 3rd Int. Workshop on Discrete Algorithms and Methods for Mobile Computing and Communications (DIAL-M), 1999.
20. G. Finn, "Routing and addressing problems in large metropolitan-scale internetworks," USC/ISI, Tech. Rep. ISI/RR-87-180, Mar. 1987.
21. T. Hou and V. Li, "Transmission range control in multihop packet radio networks," IEEE Trans. Commun., vol. 34, no. 1, pp. 38-44, Jan. 1986.
22. H. Takagi and L. Kleinrock, "Optimal transmission ranges for randomly distributed packet radio terminals," IEEE Trans. Commun., vol. 32, no. 3, pp. 246-257, Mar. 1984.
23. E. Kranakis, H. Singh, and J. Urrutia, "Compass routing on geometric networks," in Proc. 11th Canadian Conf. Computational Geometry, Vancouver, BC, Canada, Aug. 1999, pp. 51-54 [Online]. Available: citeseer.nj.nec.com/kranakis99compass.html
24. P. Bose, P. Morin, I. Stojmenovic, and J. Urrutia, "Routing with guaranteed delivery in ad hoc wireless networks," in Proc. 3rd Int. Workshop on Discrete Algorithms and Methods for Mobile Computing and Communications (DIAL-M), 1999, pp. 48-55 [Online]. Available: Cite- seer.nj.nec.com/bose00routing.html
25. S. Datta, I. Stojmenovic, and J. Wu, "Internal node and shortcut based routing with guaranteed delivery in wireless networks," in Cluster Computing 5. Boston, MA: Kluwer Academic, 2002, pp. 169-178.
26. P. Bose, A. Brodnik, S. Carlsson, E. Demaine, R. Fleischer, A. López-Ortiz, P. Morin, and J. Munro, "Online routing in convex subdivisions," in Int. Symp. Algorithms and Computation (ISAAC), 2000, vol. 1969, Lecture Notes in Computer Science, pp. 47-59 [Online]. Available: Citeseer.nj.nec.com/bose00online.html, Springer
27. P. Bose and P. Morin, "Online routing in triangulations," in Proc. 10th Int. Symp. Algorithms and Computation (ISAAC), 1999, vol. 1741, Springer LNCS, pp. 113-122 [Online]. Available: Cite-seer.nj.nec.com/article/bose99online.html
28. J. Gao, L. Guibas, J. Hershberger, L. Zhang, and A. Zhu, "Geometric spanner for routing in mobile networks," in Proc. ACM MobiHoc, Long Beach, CA, Oct. 2001.
29. J. Urrutia, "Routing with guaranteed delivery in geometric and wireless networks," in Handbook of Wireless Networks and Mobile Computing, I. Stejmenovic, Ed. New York: Wiley, 2002, ch. 18, pp. 393-406.
30. F. Kuhn, R. Wattenhofer, and A. Zollinger, "Asymptotically optimal geometric mobile ad hoc routing," in Proc. 6th Int. Workshop on Discrete Algorithms and Methods for Mobile Computing and Communications (DIAL-M), 2002, pp. 24-33.
31. B. Karp and H. Kung, "GPSR: Greedy perimeter stateless routing for wireless networks," in Proc. ACM MobiCom, 2000, pp. 243-254 [Online]. Available: Citeseer.nj.nec.com/karp00gpsr.html
32. F. Kuhn, R. Wattenhofer, and A. Zollinger, "Worst-case optimal and average-case efficient geometric ad hoc routing," in Proc. ACM MobiHoc, 2003.
33. F. Kuhn, R. Wattenhofer, Y. Zhang, and A. Zollinger, "Geometric routing: Of theory and practice," in Proc. 22nd ACM Symp. Principles of Distributed Computing (PODC), 2003.
34. Y.-J. Kim, R. Govindan, B. Karp, and S. Shenker, "Geographic routing made practical," in Proc. Second USENIX/ACM Symp. Networked System Design and Implementation (NSDI 2005), Boston, MA, May 2005.
35. Y.-J. Kim, R. Govindan, B. Karp, and S. Shenker, "On the pitfalls of geographic face routing," in Proc. ACM Joint Workshop on Foundations of Mobile Computing (DIALM-POMC), Cologne, Germany, Sep. 2005.
36. B. Leong, S. Mitra, and B. Liskov, "Path vector face routing: Geographic routing with local face information," in 13th IEEE Int. Conf. Network Protocols (ICNP), Boston, MA, Nov. 2005.
37. B. Leong, B. Liskov, and R. Morris, "Geographic routing without planarization," in 3rd Symp. Networked Systems Design & Implementation (NSDI), San Jose, CA, May 2006.
38. H. Frey and I. Stojmenovic, "On delivery guarantees of face and combined greedy-face routing in ad hoc and sensor networks," in Proc. ACM MobiCom, Los Angeles, CA, Sep. 2006.
39. C. Chiang, H. Wu, W. Liu, and M. Gerla, "Routing in clustered multihop, mobile wireless networks," in Proc. IEEE Singapore Int. Conf. Networks, 1997, pp. 197-211.
40. P. Krishna, M. Chatterjee, N. H. Vaidya, and D. K. Pradhan, "A cluster-based approach for routing in ad hoc networks," in Proc. 2nd USENIX Symp. Mobile and Location-Independent Computing, 1995, pp. 1-10.
41. F. Kuhn, T. Moscibroda, and R. Wattenhofer, "Initializing newly deployed ad hoc and sensor networks," in Proc. ACM MobiCom, Philadelphia, PA, Oct. 2004.
42. B. Blum, T. He, S. Son, and J. Stankovic, "IGF: A state-free robust communication protocol for wireless sensor networks," Univ. of Virginia, Charlottesville, VA, Tech. Rep. CS-2003-11, 2003.
43. H. Füßler, J. Widmer, M. Käsemann, M. Mauve, and H. Hartenstein, "Contention-based forwarding for mobile ad hoc networks," Elsevier's Ad Hoc Networks, vol. 1, no. 4, pp. 351-369, Nov. 2003.
44. M. Zorzi and R. R. Rao, "Geographic Random Forwarding (GeRaF) for ad hoc and sensor networks: Multihop performance," IEEE Trans. Mobile Computing, vol. 2, no. 4, pp. 337-348, Oct.-Dec. 2003.
45. M. Heissenbüttel, "Routing and broadcasting in ad hoc networks," Ph.D. dissertation, Univ. of Bern, Bern, Switzerland, 2005.
46. F. Kuhn, T. Moscibroda, and R. Wattenhofer, "Unit disk graph approximation," in Proc. ACM Joint Workshop on Foundations of Mobile Computing (DIALM-POMC), Philadelphia, PA, Oct. 2005.
47. T. Moscibroda, R. O'Dell, M. Wattenhofer, and R. Wattenhofer, "Virtual coordinates for ad hoc and sensor networks," in Proc. ACM Joint Workshop on Foundations of Mobile Computing (DIALM-POMC), Philadelphia, PA, Oct. 2005.
48. M. Wattenhofer, R. Wattenhofer, and P. Widmayer, "Geometric routing without geometry," in 12th Colloquium on Structural Information and Communication Complexity (SIROCCO), Le Mont Saint-Michel, France, May 2005.
49. R. Fonseca, S. Ratnasamy, J. Zhao, C.-T. Ee, D. Culler, S. Shenker, and I. Stoica, "Beacon vector routing: Scalable point-to-point routing in wireless sensornets," in Proc. 2nd Symp. Networked Systems Design and Implementation (NSDI), Boston, MA, May 2005.
50. B. N. Clark, C. J. Colbourn, and D. S. Johnson, "Unit disk graphs," Discrete Mathematics, vol. 86, pp. 165-177, 1990.
51. L. Barrière, P. Fraigniaud, and L. Narayanan, "Robust position-based routing in wireless ad hoc networks with unstable transmission ranges," in Proc. 5th ACM Int. Workshop on Discrete Algorithms and Methods for Mobile Computing and Communications (DIAL-M ), 2001, pp. 19-27.
52. F. Kuhn, R. Wattenhofer, and A. Zollinger, "Ad-hoc networks beyond unit disk graphs," in Proc. 1st ACM Joint Workshop on Foundations of Mobile Computing (DIALM-POMC), San Diego, CA, Sep. 2003.
53. P. Doyle and J. Snell, Random Walks and Electric Networks, ser. The Carus Mathematical Monographs. Washington DC: The Mathematical Association of America, 1984.
54. H. Hunt, III, M. Marathe, V. Radhakrishnan, S. Ravi, D. Rosenkrantz, and R. Stearns, "NC-approximation schemes for NP- and PSPACE-hard problems for geometric graphs," J. Algorithms, vol. 26, no. 2, pp. 238-274, 1998.