Energy Saving in Fixed Wireless Broadband Networks

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.

[1]  Harry R. Anderson,et al.  Fixed Broadband Wireless System Design , 2003 .

[2]  Satish Rao,et al.  Geometry, flows, and graph-partitioning algorithms , 2008, Commun. ACM.

[3]  A. Wolisz,et al.  Saving energy in IP-over-WDM networks by switching off line cards in low-demand scenarios , 2010, 2010 14th Conference on Optical Network Design and Modeling (ONDM).

[4]  C. D. Gelatt,et al.  Optimization by Simulated Annealing , 1983, Science.

[5]  Satish Rao,et al.  Graph partitioning using single commodity flows , 2006, STOC '06.

[6]  Harry R. Anderson,et al.  Fixed Broadband Wireless System Design: Anderson/Fixed , 2003 .

[7]  Anupam Gupta,et al.  Embeddings of negative-type metrics and an improved approximation to generalized sparsest cut , 2005, SODA '05.

[8]  Harry R. Anderson,et al.  Fixed Broadband Wireless System Design: The Creation of Global Mobile Communications , 2003 .

[9]  David B. Shmoys,et al.  Cut problems and their application to divide-and-conquer , 1996 .

[10]  Marco Mellia,et al.  Reducing Power Consumption in Backbone Networks , 2009, 2009 IEEE International Conference on Communications.

[11]  Frank Thomson Leighton,et al.  Multicommodity max-flow min-cut theorems and their use in designing approximation algorithms , 1999, JACM.

[12]  Hervé Rivano,et al.  Power-efficient radio configuration in fixed broadband wireless networks , 2010, Comput. Commun..

[13]  Dorian Mazauric,et al.  Minimizing Routing Energy Consumption: From Theoretical to Practical Results , 2010, 2010 IEEE/ACM Int'l Conference on Green Computing and Communications & Int'l Conference on Cyber, Physical and Social Computing.