IDEAS home Printed from https://ideas.repec.org/a/gam/jeners/v10y2017i6p802-d101344.html
   My bibliography  Save this article

Transmission Power and Antenna Allocation for Energy-Efficient RF Energy Harvesting Networks with Massive MIMO

Author

Listed:
  • Yu Min Hwang

    (Department of Wireless Communications Engineering, Kwangwoon University, Seoul 01897, Korea)

  • Ji Ho Park

    (Flight Control Group, Korean Air R&D Center, Daejeon 461, Korea)

  • Yoan Shin

    (School of Electronic Engineering, Soongsil University, Seoul 06978, Korea)

  • Jin Young Kim

    (Department of Wireless Communications Engineering, Kwangwoon University, Seoul 01897, Korea)

  • Dong In Kim

    (School of Information and Communication Engineering, Sungkyunkwan University, Suwon 440-746, Korea)

Abstract

The optimum transmission strategy for maximizing energy efficiency (EE) of a multi-user massive multiple-input multiple-output (MIMO) system in radio frequency energy harvesting networks is investigated. We focus on dynamic time-switching (TS) antennas, to avoid the practical problems of power-splitting antennas, such as complex architectures, power loss and signal distortion when splitting the power of the received signal into power for information decoding (ID) and energy harvesting (EH). However, since a single TS antenna cannot serve ID and EH simultaneously, the MIMO system is considered in this paper. We thus formulate an EE optimization problem and propose an iterative algorithm as a tractable solution, including an antenna selection strategy to optimally switch each TS antenna between ID mode and EH mode using nonlinear fractional programming and the Lagrange dual method. Further, the problem is solved under practical constraints of maximum transmission power and outage probabilities for a minimum amount of harvested power and rate capacity for each user. Simulation results show that the proposed algorithm is more energy-efficient than that of baseline schemes, and demonstrates the trade-off between the required amount of harvested power and energy efficiency.

Suggested Citation

  • Yu Min Hwang & Ji Ho Park & Yoan Shin & Jin Young Kim & Dong In Kim, 2017. "Transmission Power and Antenna Allocation for Energy-Efficient RF Energy Harvesting Networks with Massive MIMO," Energies, MDPI, vol. 10(6), pages 1-18, June.
    • Handle: RePEc:gam:jeners:v:10:y:2017:i:6:p:802-:d:101344
    as

    Download full text from publisher

    File URL: https://www.mdpi.com/1996-1073/10/6/802/pdf
    Download Restriction: no
    File URL: https://www.mdpi.com/1996-1073/10/6/802/
    Download Restriction: no
    ---><---

    References listed on IDEAS

    as
    1. Werner Dinkelbach, 1967. "On Nonlinear Fractional Programming," Management Science, INFORMS, vol. 13(7), pages 492-498, March.
    Full references (including those not matched with items on IDEAS)

    Citations

    Citations are extracted by the CitEc Project, subscribe to its RSS feed for this item.
    as


    Cited by:

    1. Guangyue Lu & Chan Lei & Yinghui Ye & Liqin Shi & Tianci Wang, 2019. "Energy Efficiency Optimization for AF Relaying with TS-SWIPT," Energies, MDPI, vol. 12(6), pages 1-13, March.

    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. Tunjo Perić & Josip Matejaš & Zoran Babić, 2023. "Advantages, sensitivity and application efficiency of the new iterative method to solve multi-objective linear fractional programming problem," Central European Journal of Operations Research, Springer;Slovak Society for Operations Research;Hungarian Operational Research Society;Czech Society for Operations Research;Österr. Gesellschaft für Operations Research (ÖGOR);Slovenian Society Informatika - Section for Operational Research;Croatian Operational Research Society, vol. 31(3), pages 751-767, September.
    2. Tien Mai & Arunesh Sinha, 2022. "Safe Delivery of Critical Services in Areas with Volatile Security Situation via a Stackelberg Game Approach," Papers 2204.11451, arXiv.org.
    3. Park, Chong Hyun & Lim, Heejong, 2021. "A parametric approach to integer linear fractional programming: Newton’s and Hybrid-Newton methods for an optimal road maintenance problem," European Journal of Operational Research, Elsevier, vol. 289(3), pages 1030-1039.
    4. Yong Xia & Longfei Wang & Xiaohui Wang, 2020. "Globally minimizing the sum of a convex–concave fraction and a convex function based on wave-curve bounds," Journal of Global Optimization, Springer, vol. 77(2), pages 301-318, June.
    5. H. Konno & K. Tsuchiya & R. Yamamoto, 2007. "Minimization of the Ratio of Functions Defined as Sums of the Absolute Values," Journal of Optimization Theory and Applications, Springer, vol. 135(3), pages 399-410, December.
    6. Henk Kiers, 1995. "Maximization of sums of quotients of quadratic forms and some generalizations," Psychometrika, Springer;The Psychometric Society, vol. 60(2), pages 221-245, June.
    7. Luca Consolini & Marco Locatelli & Jiulin Wang & Yong Xia, 2020. "Efficient local search procedures for quadratic fractional programming problems," Computational Optimization and Applications, Springer, vol. 76(1), pages 201-232, May.
    8. Harald Dyckhoff & Katrin Allen, 1999. "Theoretische Begründung einer Effizienzanalyse mittels Data Envelopment Analysis (DEA)," Schmalenbach Journal of Business Research, Springer, vol. 51(5), pages 411-436, May.
    9. Smail Addoune & Karima Boufi & Ahmed Roubi, 2018. "Proximal Bundle Algorithms for Nonlinearly Constrained Convex Minimax Fractional Programs," Journal of Optimization Theory and Applications, Springer, vol. 179(1), pages 212-239, October.
    10. Feng Guo & Liguo Jiao, 2023. "A new scheme for approximating the weakly efficient solution set of vector rational optimization problems," Journal of Global Optimization, Springer, vol. 86(4), pages 905-930, August.
    11. Birbil, S.I. & Frenk, J.B.G. & Zhang, S., 2004. "Generalized Fractional Programming With User Interaction," ERIM Report Series Research in Management ERS-2004-033-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.
    12. Maziar Sahamkhadam, 2021. "Dynamic copula-based expectile portfolios," Journal of Asset Management, Palgrave Macmillan, vol. 22(3), pages 209-223, May.
    13. Cook, Wade D. & Zhu, Joe, 2007. "Within-group common weights in DEA: An analysis of power plant efficiency," European Journal of Operational Research, Elsevier, vol. 178(1), pages 207-216, April.
    14. Wassila Drici & Fatma Zohra Ouail & Mustapha Moulaï, 2018. "Optimizing a linear fractional function over the integer efficient set," Annals of Operations Research, Springer, vol. 267(1), pages 135-151, August.
    15. Meena K. Bector & I. Husain & S. Chandra & C. R. Bector, 1988. "A duality model for a generalized minmax program," Naval Research Logistics (NRL), John Wiley & Sons, vol. 35(5), pages 493-501, October.
    16. Vaithilingam Jeyakumar & Gue Myung Lee & Jae Hyoung Lee & Yingkun Huang, 2024. "Sum-of-Squares Relaxations in Robust DC Optimization and Feature Selection," Journal of Optimization Theory and Applications, Springer, vol. 200(1), pages 308-343, January.
    17. Laurent Alfandari & Alborz Hassanzadeh & Ivana Ljubić, 2021. "An Exact Method for Assortment Optimization under the Nested Logit Model," Working Papers hal-02463159, HAL.
    18. Víctor Adame-García & Fernando Fernández-Rodríguez & Simón Sosvilla-Rivero, 2017. "“Resolution of optimization problems and construction of efficient portfolios: An application to the Euro Stoxx 50 index"," IREA Working Papers 201702, University of Barcelona, Research Institute of Applied Economics, revised Feb 2017.
    19. A. Roubi, 2000. "Method of Centers for Generalized Fractional Programming," Journal of Optimization Theory and Applications, Springer, vol. 107(1), pages 123-143, October.
    20. Andrés Gómez & Oleg A. Prokopyev, 2021. "A Mixed-Integer Fractional Optimization Approach to Best Subset Selection," INFORMS Journal on Computing, INFORMS, vol. 33(2), pages 551-565, May.

    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:jeners:v:10:y:2017:i:6:p:802-:d:101344. 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.