Fabian Kuhn
ABSTRACT
In this paper we present GOAFR, a new geometric ad-hoc routing algorithm combining greedy and face routing. We evaluate this algorithm by both rigorous analysis and comprehensive simulation. GOAFR is the first ad-hoc algorithm to be both asymptotically optimal and average-case efficient. For our simulations we identify a network density range critical for any routing algorithm. We study a dozen of routing algorithms and show that GOAFR outperforms other prominent algorithms, such as GPSR or AFR.
- K. Alzoubi, P.-J. Wan, and O. Frieder. Message-optimal connected dominating sets in mobile ad hoc networks. In MobiHOC, EPFL Lausanne, Switzerland, 2002.]] Google Scholar
Digital Library
- 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.]] Google ScholarDigital Library
- 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, Taipei, Taiwan, December 2000.]] Google ScholarDigital Library
- 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'99), pages 48--55, Seattle, WA, USA, August 1999.]] Google ScholarDigital Library
- J. Broch, D. A. Maltz, D. B. 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.]] Google ScholarDigital Library
- 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, pages 461--466, Phoenix, AR, USA, April 2001.]] Google ScholarDigital Library
- O. Dousse, P. Thiran, and M. Hasler. Connectivity in ad-hoc and hybrid networks. In Proc. IEEE Infocom, New York, NY, USA, June 2002.]]Google ScholarCross Ref
- G. Finn. Routing and addressing problems in large metropolitan-scale internetworks. Technical Report ISI/RR-87-180, USC/ISI, March 1987.]]Google ScholarCross Ref
- J. Gao, L. Guibas, J. Hershberger, L. Zhang, and A. Zhu. Discrete mobile centers. In Proc. 17th annual symposium on Computational geometry (SCG, pages 188--196. ACM Press, 2001.]] Google ScholarDigital Library
- J. Gao, L. Guibas, J. Hershberger, L. Zhang, and A. Zhu. Geometric spanner for routing in mobile networks. In MobiHOC, Long Beach, CA, USA, October 2001.]] Google ScholarDigital Library
- S. Giordano, I. Stojmenovic, and L. Blazevic. Position based routing algorithms for ad hoc networks: a taxonomy, July 2001.]]Google Scholar
- T. Hou and V. Li. Transmission range control in multihop packet radio networks. IEEE Transactions on Communications, 34(1):38--44, 1986.]]Google ScholarCross Ref
- D. B. Johnson and D. A. Maltz. Dynamic source routing in ad hoc wireless networks. In Imielinski and Korth, editors, Mobile Computing, volume 353. Kluwer Academic Publishers, 1996.]]Google ScholarCross Ref
- B. Karp and H. Kung. GPSR: greedy perimeter stateless routing for wireless networks. In Mobile Computing and Networking, pages 243--254, 2000.]] Google ScholarDigital Library
- 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.]]Google ScholarDigital Library
- E. Kranakis, H. Singh, and J. Urrutia. Compass routing on geometric networks. In Proc. 11th Canadian Conference on Computational Geometry, pages 51--54, Vancouver, Canada, August 1999.]]Google Scholar
- F. Kuhn, R. Wattenhofer, Y. Zhang, and A. Zollinger. Geometric ad-hoc routing: Of theory and practice. In Proc. PODC 2003, Boston, MA, USA, July 2003.]] Google ScholarDigital Library
- F. Kuhn, R. Wattenhofer, and A. Zollinger. Asymptotically optimal geometric mobile ad-hoc routing. In Proc. Dial-M'02, Atlanta, Georgia, USA, September 2002.]] Google ScholarDigital Library
- M. Mauve, J. Widmer, and H. Hartenstein. A survey on position-based routing in mobile ad-hoc networks. In IEEE Network, November 2001.]]Google ScholarDigital Library
- J. Navas and T. Imielinski. Geocast - geographic addressing and routing. In Mobile Computing and Networking, pages 66--76, 1997.]] Google ScholarDigital Library
- S. Ramanathan and M. Steenstrup. A survey of routing techniques for mobile communications networks. Mobile Networks and Applications, 1(2):89--104, 1996.]] Google ScholarDigital Library
- H. Takagi and L. Kleinrock. Optimal transmission ranges for randomly distributed packet radio terminals. IEEE Transactions on Communications, 32(3):246--257, 1984.]]Google ScholarCross Ref
- 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.]] Google ScholarDigital Library
Index Terms
- Worst-Case optimal and average-case efficient geometric ad-hoc routing
Recommendations
Geometric ad-hoc routing: of theory and practice
PODC '03: Proceedings of the twenty-second annual symposium on Principles of distributed computingAll too often a seemingly insurmountable divide between theory and practice can be witnessed. In this paper we try to contribute to narrowing this gap in the field of ad-hoc routing. In particular we consider two aspects: We propose a new geometric ...
Asymptotically optimal geometric mobile ad-hoc routing
DIALM '02: Proceedings of the 6th international workshop on Discrete algorithms and methods for mobile computing and communicationsIn this paper we present AFR, a new geometric mobile ad-hoc routing algorithm. The algorithm is completely distributed; nodes need to communicate only with direct neighbors in their transmission range. We show that if a best route has cost c, AFR finds ...
On Delivery Guarantees and Worst-Case Forwarding Bounds of Elementary Face Routing Components in Ad Hoc and Sensor Networks
In this paper, we provide a thorough theoretical study on delivery guarantees, loop-free operation, and worst-case behavior of face and combined greedy-face routing. We show that under specific planar topology control schemes, recovery from a greedy ...
Comments