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

Power Control for Full-Duplex Device-to-Device Underlaid Cellular Networks: A Stackelberg Game Approach

Author

Listed:
  • Zhen Yang
  • Titi Liu
  • Guobin Chen

Abstract

In spectrum sharing cognitive radio networks, unauthorized users (secondary users) are allowed to use the spectrum of authorized users (primary users) to improve spectrum utilization. Due to limited spectrum resources, how to formulate a reasonable spectrum allocation scheme is very important. As a mathematical analysis tool, game theory can solve the problem of resource allocation well. In recent years, it has been applied to the research of resource allocation in spectrum sharing networks by some literatures. In a cellular network consisting of multiple cellular users and full-duplex end-to-end communication users D2D (device-to-device), the self-interference caused by full-duplex communication and the interference caused by the D2D users to the cellular users will significantly reduce system throughput. In order to reduce the interference in the network, this paper introduces a power control algorithm based on Stackelberg game, which sets the cellular users and D2D users as the leaders and followers, respectively. The cellular users and the D2D users compete with each other to minimize the cost, and we propose new utility functions. We build an optimization problem under the outage probability constraint and power constraint and the transmission power of the users is obtained by using the Lagrangian dual decomposition method. The simulation results show that the proposed game algorithm improves network performance compared with other existing schemes.

Suggested Citation

  • Zhen Yang & Titi Liu & Guobin Chen, 2020. "Power Control for Full-Duplex Device-to-Device Underlaid Cellular Networks: A Stackelberg Game Approach," Complexity, Hindawi, vol. 2020, pages 1-12, November.
  • Handle: RePEc:hin:complx:1786349
    DOI: 10.1155/2020/1786349
    as

    Download full text from publisher

    File URL: http://downloads.hindawi.com/journals/8503/2020/1786349.pdf
    Download Restriction: no

    File URL: http://downloads.hindawi.com/journals/8503/2020/1786349.xml
    Download Restriction: no

    File URL: https://libkey.io/10.1155/2020/1786349?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:complx:1786349. 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.