IDEAS home Printed from https://ideas.repec.org/a/hin/jnlmpe/6875090.html
   My bibliography  Save this article

Lagrangian Dual Decomposition for Joint Resource Allocation Optimization Problem in OFDMA Downlink Networks

Author

Listed:
  • Li-Jun Jia
  • Yu-Cheng He
  • Dong-Hua Chen
  • Lin Zhou

Abstract

This paper proposes an efficient method for joint power and subcarrier allocation in a multicell multiuser OFDMA downlink network. The joint optimization problem is formulated with the objective of maximizing the energy efficiency subject to the constraints on the quality of service in sum transmission rates for each cell and the total transmit power for the network. Due to intercell cochannel interferences and multiple variable coupling, the problem is intractable in its original form. To relax the difficulties in coordinating cochannel interferences, we introduce the tolerable interferences constraints for interference channels. To cope with the multiple variable coupling, we decompose the joint optimization problem into two iterative processes of user scheduling and a parametric convex optimization problem, where the energy efficiency is treated as the parameter and approached by bisection search. Then, by double dual decomposition, the parametric convex problem is transformed into Lagrangian dual problems at two levels of cells and subcarriers, and a decentralized solution is obtained in closed form. Based on the reformulations, an iterative subgradient algorithm is presented for approaching the joint optimization problem with acceptable complexity. Computer simulations are conducted to validate the proposed algorithm and examine the effects of various system parameters.

Suggested Citation

  • Li-Jun Jia & Yu-Cheng He & Dong-Hua Chen & Lin Zhou, 2018. "Lagrangian Dual Decomposition for Joint Resource Allocation Optimization Problem in OFDMA Downlink Networks," Mathematical Problems in Engineering, Hindawi, vol. 2018, pages 1-10, October.
  • Handle: RePEc:hin:jnlmpe:6875090
    DOI: 10.1155/2018/6875090
    as

    Download full text from publisher

    File URL: http://downloads.hindawi.com/journals/MPE/2018/6875090.pdf
    Download Restriction: no

    File URL: http://downloads.hindawi.com/journals/MPE/2018/6875090.xml
    Download Restriction: no

    File URL: https://libkey.io/10.1155/2018/6875090?utm_source=ideas
    LibKey link: if access is restricted and if your library uses this service, LibKey will redirect you to where you can use your library subscription to access this item
    ---><---

    More about this item

    Statistics

    Access and download statistics

    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:hin:jnlmpe:6875090. 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.

    We have no bibliographic references for this item. You can help adding them by using 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: Mohamed Abdelhakeem (email available below). General contact details of provider: https://www.hindawi.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.