Energy Saving in Fixed Wireless Broadband Networks

  • David Coudert
  • Napoleão Nepomuceno
  • Issam Tahiri
Part of the Lecture Notes in Computer Science book series (LNCS, volume 6701)


In this paper, we present a mathematical formulation for saving energy in fixed broadband wireless networks by selectively turning off idle communication devices in low-demand scenarios. This problem relies on a fixed-charge capacitated network design (FCCND), which is very hard to optimize. We then propose heuristic algorithms to produce feasible solutions in a short time.


Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.


  1. 1.
    Anderson, H.: Fixed Broadband Wireless System Design. John Wiley & Sons, Chichester (2003)CrossRefGoogle Scholar
  2. 2.
    Arora, S., Rao, S., Vazirani, U.: Geometry, flows, and graph-partitioning algorithms. Commun. ACM 51, 96–105 (2008)CrossRefGoogle Scholar
  3. 3.
    Chawla, S., Gupta, A., Racke, H.: Embeddings of negative-type metrics and an improved approximation to generalized sparsest cut. In: 16th Annual ACM-SIAM Symposium on Discrete Algorithms (SODA), pp. 102–111 (2005)Google Scholar
  4. 4.
    Chiaraviglio, L., Mellia, M., Neri, F.: Reducing power consumption in backbone networks. In: IEEE International Conference on Communications, pp. 1–6 (2009)Google Scholar
  5. 5.
    Coudert, D., Nepomuceno, N., Rivano, H.: Power-efficient radio configuration in fixed broadband wireless networks. Computer Communications 33(8), 898–906 (2010)CrossRefGoogle Scholar
  6. 6.
    Giroire, F., Mazauric, D., Moulierac, J., Onfroy, B.: Minimizing routing energy consumption: from theoretical to practical results. In: International Conference on Green Computing and Communications (GreenCom 2010), Hangzhou, China, p. 8 (2010)Google Scholar
  7. 7.
    Idzikowski, F., Orlowski, S., Raack, C., Woesner, H., Wolisz, A.: Saving energy in ip-over-wdm networks by switching off line cards in low-demand scenarios. In: Proceedings of the 14th Conference on Optical Network Design and Modeling, ONDM 2010, pp. 42–47 (2010)Google Scholar
  8. 8.
    Khandekar, R., Rao, S., Vazirani, U.: Graph partitioning using single commodity flows. In: STOC 2006: Proceedings of the Thirty-Eighth Annual ACM Symposium on Theory of Computing, pp. 385–390. ACM, New York (2006)CrossRefGoogle Scholar
  9. 9.
    Kirkpatrick, S., Gelatt, C.D., Vecchi, M.P.: Optimization by simulated annealing. Science 220(4598), 671–680 (1983)MathSciNetCrossRefMATHGoogle Scholar
  10. 10.
    Leighton, T., Rao, S.: Multicommodity max-flow min-cut theorems and their use in designing approximation algorithms. J. ACM 46(6), 787–832 (1999)MathSciNetCrossRefMATHGoogle Scholar
  11. 11.
    Shmoys, D.B.: Cut problems and their application to divide-and-conquer (1996)Google Scholar

Copyright information

© Springer-Verlag Berlin Heidelberg 2011

Authors and Affiliations

  • David Coudert
    • 1
  • Napoleão Nepomuceno
    • 2
  • Issam Tahiri
    • 1
  2. 2.IMADA, Syddansk UniversitetDenmark

Personalised recommendations