Energy Optimal Routing in Radio Networks Using Geometric Data Structures

  • René Beier
  • Peter Sanders
  • Naveen Sivadasan
Conference paper
Part of the Lecture Notes in Computer Science book series (LNCS, volume 2380)


Given the current position of n sites in a radio network, we discuss the problem of finding routes between pairs of sites such that the energy consumption for this communication is minimized. Though this can be done using Dijkstra’s algorithm on the complete graph in quadratic time, it is less clear how to do it in near linear time. We present such algorithms for the important case where the transmission cost between two sites is the square of their Euclidean distance plus a constant offset. We give an \( \mathcal{O}\left( {kn log n} \right) \) time algorithm that finds an optimal path with at most k hops, and an \( \mathcal{O}\left( {n^{1 + \varepsilon } } \right) \) time algorithm for the case of an unrestricted number of hops. The algorithms are based on geometric data structures ranging from simple 2-dimensional Delau-nay triangulations to more sophisticated proximity data structures that exploit the special structure of the problem.


Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.


  1. 1.
    P. D. Agarwal and J. Matousek. Ray shooting and parametric search. In N. Alon, editor, Proceedings of the 24th Annual ACM Symposium on the Theory of Computing, pages 517–526, Victoria, B.C., Canada, May 1992. ACM Press.Google Scholar
  2. 2.
    J. Bentley, B. W. Weide, and A. C. Yao. Optimal expected-time algorithms for closest point problems. ACM Transactions on Mathematical Software, 6(4):563–580, December 1980.Google Scholar
  3. 3.
    T. Chan. Approximate nearest neighbor queries revisited. In Proceedings of the 13th International Annual Symposium on Computational Geometry (SCG-97), pages 352–358, New York, June 4–6 1997. ACM Press.Google Scholar
  4. 4.
    T. Chan and A. Efrat. Fly cheaply: On the minimum fuel consumption problem. Journal of Algorithms, 41(2):330–337, November 2001.Google Scholar
  5. 5.
    M. de Berg, M. van Kreveld, M. Overmars, and O. Schwarzkopf. Computational Geometry Algorithms and Applications. Springer-Verlag, Berlin Heidelberg, 2., rev. ed. edition, 2000.Google Scholar
  6. 6.
    A. Efrat and S. Har-Peled. Fly cheaply: On the minimum fuel-consumption problem. In Proceedings of the Fourteenth Annual Symposium on Computational Geometry (SCG’98), pages 143–145, New York, June 1998. Association for Computing Machinery.Google Scholar
  7. 7.
    D. Eppstein. Dynamic euclidean minimum spanning trees and extrema of binary functions. Disc. Comp. Geom., 13:111–122, 1995.MATHCrossRefMathSciNetGoogle Scholar
  8. 8.
    J. M. Rabaey et al. Picoradio supports ad hoc ultra-low power wireless networking. IEEE Computer Magazine, pages 42–48, July 2000.Google Scholar
  9. 9.
    K. Nakano, S. Olariu, and A. Y. Zomaya. Energy-efficient permutation routing in radio networks. IEEE Transactions on Parallel and Distributed Systems, 12(6):544–557, 2001.CrossRefGoogle Scholar
  10. 10.
    D. Patel. Energy in ad-hoc networking for the picoradio. Master’s thesis, UC Berkeley, 2000.Google Scholar
  11. 11.
    F. P. Preparata and M. I. Shamos. Computational Geometry. Springer, 1985.Google Scholar
  12. 12.
    T. S. Rappaport. Wireless Communication. Prentice Hall, 1996.Google Scholar
  13. 13.
    K. R. Varadarajan and P. K. Agarwal. Approximation algorithms for bipartite and non-bipartite matching in the plane. In SODA, pages 805–814, 1999.Google Scholar
  14. 14.
    Peng-Jun Wan, G. Calinescu, Xiang-Yang Li, and Ophir Frieder. Minimum-energy broadcast routing in static ad hoc wireless networks. In IEEE Infocom, 2001.Google Scholar
  15. 15.
    J. E. Wieselthier, G. D. Nguyen, and A. Ephremides. On the construction of energy-efficient broadcast and multicast trees in wireless networks. In IEEE Infocom, volume 2, pages 585–594. IEEE, 2000.Google Scholar

Copyright information

© Springer-Verlag Berlin Heidelberg 2002

Authors and Affiliations

  • René Beier
    • 1
  • Peter Sanders
    • 1
  • Naveen Sivadasan
    • 1
  1. 1.Max Planck Insitut für InformatikSaarbrückenGermany

Personalised recommendations