Multicommodity max-flow min-cut theorems and their use in designing approximation algorithms
Journal of the ACM (JACM)
Fixed Broadband Wireless System Design: The Creation of Global Mobile Communications
Fixed Broadband Wireless System Design: The Creation of Global Mobile Communications
Embeddings of negative-type metrics and an improved approximation to generalized sparsest cut
SODA '05 Proceedings of the sixteenth annual ACM-SIAM symposium on Discrete algorithms
Graph partitioning using single commodity flows
Proceedings of the thirty-eighth annual ACM symposium on Theory of computing
Geometry, flows, and graph-partitioning algorithms
Communications of the ACM
Power-efficient radio configuration in fixed broadband wireless networks
Computer Communications
Reducing power consumption in backbone networks
ICC'09 Proceedings of the 2009 IEEE international conference on Communications
Saving energy in IP-over-WDM networks by switching off line cards in low-demand scenarios
ONDM'10 Proceedings of the 14th conference on Optical network design and modeling
Minimizing Routing Energy Consumption: From Theoretical to Practical Results
GREENCOM-CPSCOM '10 Proceedings of the 2010 IEEE/ACM Int'l Conference on Green Computing and Communications & Int'l Conference on Cyber, Physical and Social Computing
Multiflows in symmetric digraphs
Discrete Applied Mathematics
| Hi-index | 0.00 |
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.