IDEAS home Printed from https://ideas.repec.org/a/sae/intdis/v10y2014i11p262137.html
   My bibliography  Save this article

Distributed Spectrum Sharing in Cognitive Radio Networks: A Pricing-Based Decomposition Approach

Author

Listed:
  • Yanmin Zhu
  • Wei Sun
  • Jiadi Yu
  • Tong Liu
  • Bo Li

Abstract

The limited radio spectrum has become a bottleneck for various wireless communications. To better utilize the scare radio spectrum, cognitive radios have recently attracted increasing attention, which makes spectrum sharing more viable. Sharing radio spectrum from primary users to secondary users is of great importance. A licensed primary user (PU) can lease its spectrum to secondary users (SUs) for wireless communications. This paper studies the problem of social welfare maximization of distributed spectrum sharing among a PU and SUs. We first formulate the problem of social welfare maximization which takes into account both the cost of the PU and the utility gained by each SU. The social welfare maximization is a convex optimization problem and thus can be solved by a centralized algorithm. However, the utility function of each SU may contain the private information. To avoid privacy leakage of SUs, we propose an iterative distributed algorithm based on a pricing-based decomposition framework. It is theoretically proved that our algorithm converges to the optimal solution. Simulation results are presented to show that our algorithm achieves the optimal social welfare and converges quickly in a practical setting.

Suggested Citation

  • Yanmin Zhu & Wei Sun & Jiadi Yu & Tong Liu & Bo Li, 2014. "Distributed Spectrum Sharing in Cognitive Radio Networks: A Pricing-Based Decomposition Approach," International Journal of Distributed Sensor Networks, , vol. 10(11), pages 262137-2621, November.
  • Handle: RePEc:sae:intdis:v:10:y:2014:i:11:p:262137
    DOI: 10.1155/2014/262137
    as

    Download full text from publisher

    File URL: https://journals.sagepub.com/doi/10.1155/2014/262137
    Download Restriction: no

    File URL: https://libkey.io/10.1155/2014/262137?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:sae:intdis:v:10:y:2014:i:11:p:262137. 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: SAGE Publications (email available below). General contact details of provider: .

    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.