Wireless Networks

, Volume 12, Issue 3, pp 287–299 | Cite as

Power Efficient Range Assignment for Symmetric Connectivity in Static Ad Hoc Wireless Networks

  • E. Althaus
  • G. Călinescu
  • I. I. Măndoiu
  • S. Prasad
  • N. Tchervenski
  • A. Zelikovsky


In this paper we study the problem of assigning transmission ranges to the nodes of a static ad hoc wireless network so as to minimize the total power consumed under the constraint that enough power is provided to the nodes to ensure that the network is connected. We focus on the Min-Power Symmetric Connectivity problem, in which the bidirectional links established by the transmission ranges are required to form a connected graph.

Implicit in previous work on transmission range assignment under asymmetric connectivity requirements is the proof that Min-Power Symmetric Connectivity is NP-hard and that the MST algorithm has a performance ratio of 2. In this paper we make the following contributions: (1) we show that the related Min-Power Symmetric Unicast problem can be solved efficiently by a shortest-path computation in an appropriately constructed auxiliary graph; (2) we give an exact branch and cut algorithm based on a new integer linear program formulation solving instances with up to 35–40 nodes in 1 hour; (3) we establish the similarity between Min-Power Symmetric Connectivity and the classic Steiner Tree problem in graphs, and use this similarity to give a polynomial-time approximation scheme with performance ratio approaching 5/3 as well as a more practical approximation algorithm with approximation factor 11/6; and (4) we give the results of a comprehensive experimental study comparing new and previously proposed heuristics with the above exact and approximation algorithms.


ad hoc wireless networks power range assignment symmetric connectivity algorithms 


Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.


  1. [1]
    E. Althaus, G. Călinescu, I.I. Măndoiu, S. Prasad, N. Tchervenski and A.Z. Zelikovsky, Power efficient range assignment in ad-hoc wireless networks, in: Proc. IEEE Wireless Communications and Networking Conference (WCNC) (2003) pp. 1889–1894.Google Scholar
  2. [2]
    P. Berman and V. Ramaiyer, Improved approximations for the Steiner tree problem, Journal of Algorithms 17 (1994) 381–408.Google Scholar
  3. [3]
    D.M. Blough, M. Leoncini, G. Resta and P. Santi, On the symmetric range assignment problem in wireless ad hoc networks, in: 2nd IFIP International Conference on Theoretical Computer Science (TCS 2002), (Kluwer Academic Publishers, 2002) pp. 71–82.Google Scholar
  4. [4]
    A. Borchers and D.-Z. Du, The k-Steiner ratio in graphs, SIAM Journal on Computing 26 (1997) 857–869.Google Scholar
  5. [5]
    P.M. Camerini, G. Galbiati and F. Maffioli, Random pseudo-polynomial algorithms for exact matroid problems, Journal of Algorithms 13 (1992) 258–273.Google Scholar
  6. [6]
    E.-A. Choukhmane, Une heuristique pour le probleme de l’arbre de Steiner, RAIRO Rech. Oper 12 (1978) 207–212.Google Scholar
  7. [7]
    T. Chu and I. Nikolaidis, Energy efficient broadcast in mobile ad hoc networks, in: Proc. AD-HOC Networks and Wireless (2002).Google Scholar
  8. [8]
    A.E.F. Clementi, P. Crescenzi, P. Penna, G. Rossi and P. Vocca, On the complexity of computing minimum energy consumption broadcast subgraphs, in: Symposium on Theoretical Aspects of Computer Science, (2001) pp. 121–131.Google Scholar
  9. [9]
    A.E.F. Clementi, P. Penna and R. Silvestri, On the power assignment problem in radio networks, Electronic Colloquium on Computational Complexity (ECCC) (054), 2000.Google Scholar
  10. [10]
    T.H. Cormen, C.E. Leiserson and R.L. Rivest, Introduction to Algorithms, 2nd ed. (MIT Press, Cambridge, Massachusetts, 2001).Google Scholar
  11. [11]
    G. Călinescu, I.I. Măndoiu and A.Z. Zelikovsky, Symmetric connectivity with minimum power consumption in radio networks. in: 2nd IFIP International Conference on Theoretical Computer Science (TCS 2002), Kluwer Academic Publishers, 2002, pp. 119–130.Google Scholar
  12. [12]
    M. de Berg, M. van Kreveld, M. Overmars and O. Schwarzkopf, Computational Geometry — Algorithms and Applications (Springer Verlag, Berlin, 1997).Google Scholar
  13. [13]
    D.-Z. Du, Y.-J. Zhang and Q. Feng, On better heuristic for Euclidean Steiner minimum trees, in: Proc. 32nd Annual IEEE Symposium on Foundations of Computer Science (1991) pp. 431–439.Google Scholar
  14. [14]
    S. Guha and S. Khuller, Approximation algorithms for connected dominating sets, Algorithmica 20 (1998) 374–387.Google Scholar
  15. [15]
    A. B. Kahng and G. Robins, A new class of iterative Steiner tree heuristics with good performance, IEEE Transactions on Computer-Aided Design 11 (1992) 893–902.Google Scholar
  16. [16]
    L.M. Kirousis, E. Kranakis, D. Krizanc and A. Pelc, Power consumption in packet radio networks, Theoretical Computer Science 243 (2000) 289–305.Google Scholar
  17. [17]
    L. Kou, G. Markowsky and L. Berman, A fast algorithm for Steiner trees, Acta Informatica 15 (1981) 141–145.Google Scholar
  18. [18]
    E. Lloyd, R. Liu, M. Marathe, R. Ramanathan and S.S. Ravi, Algorithmic aspects of topology control problems for ad hoc networks, in: Proc. ACM MobiHoc (2002) pp. 123–134.Google Scholar
  19. [19]
    L. Lovász and M.D. Plummer, Matching Theory. (North-Holland, Amsterdam–New York, 1986).Google Scholar
  20. [20]
    M. Padberg and L. Wolsey, Trees and cuts, Anals of Discrete Mathematics 17 (1983) 511–517.Google Scholar
  21. [21]
    H.J. Promel and A. Steger, A new approximation algorithm for the Steiner tree problem with performance ratio 5/3, Journal of Algorithms 36 (2000) 89–101.Google Scholar
  22. [22]
    R. Ramanathan and R. Hain, Topology control of multihop wireless networks using transmit power adjustment, in: Proc. IEEE INFOCOM (2000) pp. 404–413.Google Scholar
  23. [23]
    T.S. Rappaport, Wireless Communications: Principles and Practices (Prentice Hall, 1996).Google Scholar
  24. [24]
    G. Robins and A. Zelikovsky, Improved Steiner tree approximation in graphs, in: Proceedings of the 11th ACM-SIAM Annual Symposium on Discrete Algorithms (2000) pp. 770–779.Google Scholar
  25. [25]
    SCIL–Symbolic Constraints for Integer Linear programming.
  26. [26]
    S. Singh, C.S. Raghavendra and J. Stepanek, Power-aware broadcasting in mobile ad hoc networks, in: Proceedings of IEEE PIMRC, 1999.Google Scholar
  27. [27]
    A.S. Tanembaum, Computer Networks, 3rd ed. (Prentice Hall, 1996).Google Scholar
  28. [28]
    Mikkel Thorup, Undirected single-source shortest paths with positive integer weights in linear time, Journal of the ACM 46 (1999) 362–394.Google Scholar
  29. [29]
    P.-J. Wan, G. Calinescu, X.-Y. Li and O. Frieder, Minimum energy broadcast routing in static ad hoc wireless networks, in: Proc. IEEE INFOCOM (2001) pp. 1162–1171.Google Scholar
  30. [30]
    J.E. Wieselthier, G.D. Nguyen and A. Ephremides, On the construction of energy-efficient broadcast and multicast trees in wireless networks, in: Proc. IEEE INFOCOM (2000) pp. 585–594.Google Scholar
  31. [31]
    A. Zelikovsky, An 11/6-approximation algorithm for the network Steiner problem, Algorithmica 9 (1993) 463–470.Google Scholar
  32. [32]
    A. Zelikovsky, Better approximation bounds for the network and Euclidean Steiner tree problems, Technical Report CS-96-06, Department of Computer Science, University of Virginia, 1996.Google Scholar

Copyright information

© Springer Science + Business Media, LLC 2005

Authors and Affiliations

  • E. Althaus
    • 1
  • G. Călinescu
    • 2
  • I. I. Măndoiu
    • 3
  • S. Prasad
    • 4
  • N. Tchervenski
    • 2
  • A. Zelikovsky
    • 4
  1. 1.Max-Planck-Institut für InformatikSaarbrückenGermany
  2. 2.Department of Computer ScienceIllinois Institute of TechnologyChicago
  3. 3.Computer Science and Engineering DepartmentUniversity of ConnecticutStorrs
  4. 4.Department of Computer ScienceGeorgia State UniversityAtlanta

Personalised recommendations