Optimized Energy Procurement for Cellular Networks with Uncertain Renewable Energy Generation

Nadhir B. Rached, Hakim Ghazzai, Abdullah Kadri, Mohamed-Slim Alouini

Research output: Chapter in Book/Report/Conference proceedingConference contribution

1 Scopus citations

Abstract

Renewable energy (RE) is an emerging solution for reducing carbon dioxide (CO2) emissions from cellular networks. One of the challenges of using RE sources is to handle its inherent uncertainty. In this paper, a RE powered cellular network is investigated. For a one-day operation cycle, the cellular network aims to reduce energy procurement costs from the smart grid by optimizing the amounts of energy procured from their locally deployed RE sources as well as from the smart grid. In addition to that, it aims to determine the extra amount of energy to be sold to the electrical grid at each time period. Chance constrained optimization is first proposed to deal with the randomness in the RE generation. Then, to make the optimization problem tractable, two well- know convex approximation methods, namely; Chernoff and Chebyshev based-approaches, are analyzed in details. Numerical results investigate the optimized energy procurement for various daily scenarios and compare between the performances of the employed convex approximation approaches.
Original languageEnglish (US)
Title of host publication2016 IEEE Global Communications Conference (GLOBECOM)
PublisherInstitute of Electrical and Electronics Engineers (IEEE)
ISBN (Print)9781509013289
DOIs
StatePublished - Feb 7 2017

Bibliographical note

KAUST Repository Item: Exported on 2020-10-01
Acknowledgements: This work was made possible by NPRP grant # 6-001-2-001 from the Qatar National Research Fund (A member of The Qatar Foundation). The statements made herein are solely the responsibility of the authors.

Fingerprint

Dive into the research topics of 'Optimized Energy Procurement for Cellular Networks with Uncertain Renewable Energy Generation'. Together they form a unique fingerprint.

Cite this