Minimum Power Symmetric Connectivity Problem in Wireless Networks: A New Approach

  • Roberto Montemanni
  • Luca Maria Gambardella
Part of the IFIP International Federation for Information Processing book series (IFIPAICT, volume 162)

Abstract

We consider the problem of assigning transmission powers to the nodes of a wireless network in such a way that all the nodes of the network are connected by bidirectional links and the total power consumption is minimized.

A new exact algorithm, based on a new integer programming model, is described in this paper together with a new preprocessing technique.

Keywords

Wireless networks minimum power topology exact algorithms 

References

  1. Althaus, E., Călinescu, G., Măndoiu, I.I., Prasad, S., Tchervenski, N., and Zelikovsky, A. (2003). Power efficient range assignment in ad-hoc wireless networks. In Proceedings of the IEEE WCNC 2003 Conference, pages 1889–1894.Google Scholar
  2. Clementi, A., Penna, P., and Silvestri, R. (1999). Hardness results for the power range assignment problem in packet radio networks. LNCS, 1671:195–208.Google Scholar
  3. Dongarra, J.J. (2003). Performance of various computers using standard linear algebra software in a fortran environment. Technical Report CS-89-85, University of Tennessee.Google Scholar
  4. Huang, Z., Shen, C.-C, Srisathapornphat, C, and Jaikaeo, C. (2002). Topology control for ad hoc networks with directional antennas. In Proceedings of the ICCCN 2002 Conference.Google Scholar
  5. Kruskal, J.B. (1956). On the shortest spanning subtree of a graph and the travelling salesman problem. Proceedings of AMS, 7:48–50.MATHMathSciNetCrossRefGoogle Scholar
  6. Lloyd, E., Liu, R., Marathe, M., Ramanathan, R., and Ravi, S. (2002). Algorithmic aspects of topology control problems for ad hoc networks. In Proceedings of the ACS MobiHoc 2002 Conference, pages 123–134.Google Scholar
  7. Montemanni, R. and Gambardella, L.M. (2003). An exact algorithm for the min-power symmetric connectivity problem in wireless networks. Technical report, Istituto Dalle Molle di Studi sull’Intelligenza Artificiale (IDSIA).Google Scholar
  8. Montemanni, R., Gambardella, L.M., and Das, A.K. (2004). The minimum power broadcast tree problem in wireless networks: a simulated annealing approach. Submitted for publication.Google Scholar
  9. Prim, R.C. (1957). Shortest connection networks and some generalizations. Bell System Technical Journal, 36:1389–1401.Google Scholar
  10. Ramanathan, R. and Rosales-Hain, R. (2000). Topology control of multihop wireless networks using transmit power adjustment. In Proceedings of the IEEE INFOCOM 2000 Conference, pages 404–413.Google Scholar
  11. Rappaport, T. (1996). Wireless Communications: Principles and Practices. Prentice Hall.Google Scholar
  12. Singh, S., Raghavendra, C., and Stepanek, J. (1999). Power-aware broadcasting in mobile ad hoc networks. In Proceedings of the IEEE PIMRC 1999 Conference.Google Scholar
  13. Wan, P.-J., Călinescu, G., Li, X.-Y., and Frieder, O. (2001). Minimum energy broadcast routing in static ad hoc wireless networks. In Proceedings of the IEEE INFOCOM 2001 Conference, pages 1162–1171.Google Scholar
  14. Wattenhofer, R., Li, L., Bahl, P., and Wang, Y.M. (2001). Distributed topology control for power efficient operation in multihop wireless ad hoc networks. In Proceedings of the INFOCOM 2001 Conference.Google Scholar
  15. Wieselthier, J., Nguyen, G., and Ephremides, A. (2000). On the construction of energy-efficient broadcast and multicast trees in wireless networks. In Proceedings of the IEEE INFOCOM 2000 Conference, pages 585–594.Google Scholar

Copyright information

© International Federation for Information Processing 2005

Authors and Affiliations

  • Roberto Montemanni
    • 1
  • Luca Maria Gambardella
    • 1
  1. 1.Istituto Dalle Molle di Studi sull’Intelligenza Artificiale (IDSIA)Manno-LuganoSwitzerland

Personalised recommendations