IDEAS home Printed from https://ideas.repec.org/a/gam/jftint/v12y2020i10p171-d427681.html
   My bibliography  Save this article

NFV-Enabled Efficient Renewable and Non-Renewable Energy Management: Requirements and Algorithms

Author

Listed:
  • Christian Tipantuña

    (Department of Network Engineering, Universitat Politècnica de Catalunya (UPC), Jordi Girona 1-3, E-08034 Barcelona, Spain
    Department of Electronics, Telecommunications and Information Networks, Escuela Politécnica Nacional, Ladrón de Guevara, E11-253 Quito, Ecuador)

  • Xavier Hesselbach

    (Department of Network Engineering, Universitat Politècnica de Catalunya (UPC), Jordi Girona 1-3, E-08034 Barcelona, Spain)

Abstract

The increasing worldwide energy demand, the CO 2 emissions generated due to the production and use of energy, climate change, and the depletion of natural resources are important concerns that require new solutions for energy generation and management. In order to ensure energy sustainability, measures, including the use of renewable energy sources, the deployment of adaptive energy consumption schemes, and consumer participation, are currently envisioned as feasible alternatives. Accordingly, this paper presents the requirements and algorithmic solutions for efficient management of energy consumption, which aims to optimize the use of available energy, whether or not it is 100% renewable, by minimizing the waste of energy. The proposal works within a Demand-Response environment, uses Network Functions Virtualization as an enabling technology, and leverages the massive connectivity of the Internet of Things provided by modern communications technologies. The energy consumption optimization problem is formulated as an Integer Linear Program. It is optimally solved while using a brute-force search strategy, defined as O pt T s , to detect all concerns that are related to the problem. Given the NP -hard nature of the problem and the non-polynomial complexity of O pt T s , some heuristic solutions are analyzed. Subsequently, a heuristic strategy, described as F ast T s based on a pre-partitioning method, is implemented. The simulation results validate our proposed energy management solution. Exact and heuristic strategies, when deployed in the Network Functions Virtualization domain, demonstrate improvements in the way that energy is consumed, thereby offering an increase in service processing. The evaluation results also show that F ast T s produces high-quality solutions that are close to those of O pt T s while executing 230×–5000× faster.

Suggested Citation

  • Christian Tipantuña & Xavier Hesselbach, 2020. "NFV-Enabled Efficient Renewable and Non-Renewable Energy Management: Requirements and Algorithms," Future Internet, MDPI, vol. 12(10), pages 1-31, October.
  • Handle: RePEc:gam:jftint:v:12:y:2020:i:10:p:171-:d:427681
    as

    Download full text from publisher

    File URL: https://www.mdpi.com/1999-5903/12/10/171/pdf
    Download Restriction: no

    File URL: https://www.mdpi.com/1999-5903/12/10/171/
    Download Restriction: no
    ---><---

    References listed on IDEAS

    as
    1. Wei, Min & Hong, Seung Ho & Alam, Musharraf, 2016. "An IoT-based energy-management platform for industrial facilities," Applied Energy, Elsevier, vol. 164(C), pages 607-619.
    2. Pisinger, David, 1995. "An expanding-core algorithm for the exact 0-1 knapsack problem," European Journal of Operational Research, Elsevier, vol. 87(1), pages 175-187, November.
    3. Pisinger, David, 1995. "A minimal algorithm for the multiple-choice knapsack problem," European Journal of Operational Research, Elsevier, vol. 83(2), pages 394-410, June.
    4. Zhou, Kaile & Yang, Shanlin & Shao, Zhen, 2016. "Energy Internet: The business perspective," Applied Energy, Elsevier, vol. 178(C), pages 212-222.
    5. Bahram Shakerighadi & Amjad Anvari-Moghaddam & Juan C. Vasquez & Josep M. Guerrero, 2018. "Internet of Things for Modern Energy Systems: State-of-the-Art, Challenges, and Open Issues," Energies, MDPI, vol. 11(5), pages 1-23, May.
    Full references (including those not matched with items on IDEAS)

    Most related items

    These are the items that most often cite the same works as this one and are cited by the same works as this one.
    1. Naser Hossein Motlagh & Mahsa Mohammadrezaei & Julian Hunt & Behnam Zakeri, 2020. "Internet of Things (IoT) and the Energy Sector," Energies, MDPI, vol. 13(2), pages 1-27, January.
    2. Akhil Joseph & Patil Balachandra, 2020. "Energy Internet, the Future Electricity System: Overview, Concept, Model Structure, and Mechanism," Energies, MDPI, vol. 13(16), pages 1-26, August.
    3. Wishon, Christopher & Villalobos, J. Rene, 2016. "Robust efficiency measures for linear knapsack problem variants," European Journal of Operational Research, Elsevier, vol. 254(2), pages 398-409.
    4. Higgins Michael J. & Rivest Ronald L. & Stark Philip B., 2011. "Sharper p-Values for Stratified Election Audits," Statistics, Politics and Policy, De Gruyter, vol. 2(1), pages 1-37, October.
    5. Mir Hamid Taghavi & Peyman Akhavan & Rouhollah Ahmadi & Ali Bonyadi Naeini, 2022. "Identifying Key Components in Implementation of Internet of Energy (IoE) in Iran with a Combined Approach of Meta-Synthesis and Structural Analysis: A Systematic Review," Sustainability, MDPI, vol. 14(20), pages 1-23, October.
    6. Kateryna Czerniachowska, 2022. "A genetic algorithm for the retail shelf space allocation problem with virtual segments," OPSEARCH, Springer;Operational Research Society of India, vol. 59(1), pages 364-412, March.
    7. Kyungmin Kim & Minseok Song, 2022. "Energy-Saving SSD Cache Management for Video Servers with Heterogeneous HDDs," Energies, MDPI, vol. 15(10), pages 1-16, May.
    8. Hoto, Robinson & Arenales, Marcos & Maculan, Nelson, 2007. "The one dimensional Compartmentalised Knapsack Problem: A case study," European Journal of Operational Research, Elsevier, vol. 183(3), pages 1183-1195, December.
    9. Mavrotas, George & Figueira, José Rui & Florios, Kostas, 2009. "Solving the bi-objective multidimensional knapsack problem exploiting the concept of core," MPRA Paper 105087, University Library of Munich, Germany.
    10. Haahr, J.T. & Lusby, R.M. & Wagenaar, J.C., 2015. "A Comparison of Optimization Methods for Solving the Depot Matching and Parking Problem," ERIM Report Series Research in Management ERS-2015-013-LIS, Erasmus Research Institute of Management (ERIM), ERIM is the joint research institute of the Rotterdam School of Management, Erasmus University and the Erasmus School of Economics (ESE) at Erasmus University Rotterdam.
    11. Subhash C. Sarin & Hanif D. Sherali & Seon Ki Kim, 2014. "A branch‐and‐price approach for the stochastic generalized assignment problem," Naval Research Logistics (NRL), John Wiley & Sons, vol. 61(2), pages 131-143, March.
    12. Li, Xin & Qian, Zhuzhong & You, Ilsun & Lu, Sanglu, 2014. "Towards cost efficient mobile service and information management in ubiquitous environment with cloud resource scheduling," International Journal of Information Management, Elsevier, vol. 34(3), pages 319-328.
    13. David Pisinger, 2000. "A Minimal Algorithm for the Bounded Knapsack Problem," INFORMS Journal on Computing, INFORMS, vol. 12(1), pages 75-82, February.
    14. Wu, Ying & Wu, Yanpeng & Guerrero, Josep M. & Vasquez, Juan C., 2021. "A comprehensive overview of framework for developing sustainable energy internet: From things-based energy network to services-based management system," Renewable and Sustainable Energy Reviews, Elsevier, vol. 150(C).
    15. Yanasse, Horacio Hideki & Pinto Lamosa, Maria Jose, 2007. "An integrated cutting stock and sequencing problem," European Journal of Operational Research, Elsevier, vol. 183(3), pages 1353-1370, December.
    16. Kateryna Czerniachowska & Marcin Hernes, 2021. "Shelf Space Allocation for Specific Products on Shelves Selected in Advance," European Research Studies Journal, European Research Studies Journal, vol. 0(3), pages 316-334.
    17. Aleksander Jakimowicz, 2022. "The Energy Transition as a Super Wicked Problem: The Energy Sector in the Era of Prosumer Capitalism," Energies, MDPI, vol. 15(23), pages 1-31, December.
    18. Martello, Silvano & Pisinger, David & Toth, Paolo, 2000. "New trends in exact algorithms for the 0-1 knapsack problem," European Journal of Operational Research, Elsevier, vol. 123(2), pages 325-332, June.
    19. Christensen, Tue R.L. & Labbé, Martine, 2015. "A branch-cut-and-price algorithm for the piecewise linear transportation problem," European Journal of Operational Research, Elsevier, vol. 245(3), pages 645-655.
    20. Shuaian Wang & Dan Zhuge & Lu Zhen & Chung-Yee Lee, 2021. "Liner Shipping Service Planning Under Sulfur Emission Regulations," Transportation Science, INFORMS, vol. 55(2), pages 491-509, March.

    Corrections

    All material on this site has been provided by the respective publishers and authors. You can help correct errors and omissions. When requesting a correction, please mention this item's handle: RePEc:gam:jftint:v:12:y:2020:i:10:p:171-:d:427681. See general information about how to correct material in RePEc.

    If you have authored this item and are not yet registered with RePEc, we encourage you to do it here. This allows to link your profile to this item. It also allows you to accept potential citations to this item that we are uncertain about.

    If CitEc recognized a bibliographic reference but did not link an item in RePEc to it, you can help with this form .

    If you know of missing items citing this one, you can help us creating those links by adding the relevant references in the same way as above, for each refering item. If you are a registered author of this item, you may also want to check the "citations" tab in your RePEc Author Service profile, as there may be some citations waiting for confirmation.

    For technical questions regarding this item, or to correct its authors, title, abstract, bibliographic or download information, contact: MDPI Indexing Manager (email available below). General contact details of provider: https://www.mdpi.com .

    Please note that corrections may take a couple of weeks to filter through the various RePEc services.

    IDEAS is a RePEc service. RePEc uses bibliographic data supplied by the respective publishers.