Minimum cost solar power systems for LTE macro base stations

This paper proposes an algorithm for the identification of the minimum cost solution over a 10 year time horizon to power an LTE (Long-Term Evolution) macro base station, using a photovoltaic solar panel, a set of batteries, and optionally also a secondary power source, which can be a connection to...

Descripción completa

Detalles Bibliográficos
Autores: Zhang, Yi, Meo, Michela, Gerboni, Raffaella, Ajmone Marsan, Marco|||0000-0002-9560-7053
Tipo de recurso: artículo
Fecha de publicación:2017
País:España
Institución:IMDEA Networks Institute
Repositorio:IMDEA Networks Institute Digital Repository
Idioma:inglés
OAI Identifier:oai:dspace.networks.imdea.org:20.500.12761/278
Acceso en línea:http://hdl.handle.net/20.500.12761/278
https://dx.doi.org/http://dx.doi.org/10.1016/j.comnet.2016.10.008
Access Level:acceso abierto
Palabra clave:Cellular networks
Green networking
Renewable energy
Optimization
Descripción
Sumario:This paper proposes an algorithm for the identification of the minimum cost solution over a 10 year time horizon to power an LTE (Long-Term Evolution) macro base station, using a photovoltaic solar panel, a set of batteries, and optionally also a secondary power source, which can be a connection to a (possibly unreliable) power grid, or a small Diesel generator. The optimization is formalised as an Mixed Integer Programming (MIP) problem, which, after linearization, can be solved with CPLEX. A heuristic algorithm is also proposed, with the objective of decreasing the computational complexity of the optimization. Numerical results show that a hybrid solar-grid (or solar-diesel) power system saves a significant fraction of the total cost, compared to a pure solar system, and to the traditional power-grid system, over the investigated 10-year period, in a south European city, like Torino in Italy, as well as in a location close to the tropic, like Aswan in Egypt. Our proposed heuristic algorithm can be used to obtain a solution within 10–20% of the optimum, at a computational speed 200 times faster than the MIP solution.