Energy saving in fixed wireless broadband networks

Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)

Volumn 6701 LNCS, Issue , 2011, Pages 484-489

  Coudert, David ^a   Nepomuceno, Napoleão ^b   Tahiri, Issam ^a  

^a INRIA   (France)

^b UNIVERSITY OF SOUTHERN DENMARK   (Denmark)

Author keywords

[No Author keywords available]

Indexed keywords

BROADBAND WIRELESS NETWORK; CAPACITATED NETWORK DESIGN; COMMUNICATION DEVICE; FEASIBLE SOLUTION; FIXED CHARGES; MATHEMATICAL FORMULATION; SAVING ENERGY; WIRELESS BROADBAND NETWORKS; FIXED BROADBANDS; FIXED WIRELESS;

BROADBAND NETWORKS; OPTIMIZATION; TELECOMMUNICATION SYSTEMS; ENERGY CONSERVATION; HEURISTIC ALGORITHMS;

HEURISTIC ALGORITHMS; BROADBAND NETWORKS;

EID: 80053006054     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/978-3-642-21527-8_53     Document Type: Conference Paper

References (11)

1. Anderson, H.: Fixed Broadband Wireless System Design. John Wiley & Sons, Chichester (2003)
2. Arora, S., Rao, S., Vazirani, U.: Geometry, flows, and graph-partitioning algorithms. Commun. ACM 51, 96-105 (2008)
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)
4. Chiaraviglio, L., Mellia, M., Neri, F.: Reducing power consumption in backbone networks. In: IEEE International Conference on Communications, pp. 1-6 (2009)
5. Coudert, D., Nepomuceno, N., Rivano, H.: Power-efficient radio configuration in fixed broadband wireless networks. Computer Communications 33(8), 898-906 (2010)
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)
7. Idzikowski, F., Orlowski, S., Raack, C., Woesner, H., Wolisz, A.: Saving energy in ip-overwdm 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)
8. Khandekar, R., Rao, S., Vazirani, U.: Graph partitioning using single commodity flows. In: STOC 2006: Proceedings of the Thirty-Eighth Annual ACMSymposium on Theory of Computing, pp. 385-390. ACM, New York (2006)
9. Kirkpatrick, S., Gelatt, C.D., Vecchi, M.P.: Optimization by simulated annealing. Science 220(4598), 671-680 (1983)
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)
11. Shmoys, D.B.: Cut problems and their application to divide-and-conquer (1996)