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

A Trust Value-Based Spectrum Allocation Algorithm in CWSNs

Author

Listed:
  • Qing-Qi Pei
  • Zi Li
  • Li-Chuan Ma

Abstract

With the increase of congestible frequency spectrums and the rapid development of wireless sensor networks (WSNs) applications, the new technology—combing cogitative radio technology with WSNs—called CWSNs will bring broad prospects to the field of radio and sensor networks. CWSN devotes itself to the solution of spectrum sharing in forms of networks, such as IEEE 802.11 and Bluetooth. A new algorithm is proposed for allocating the idle spectrum to secondary users (SUs). This algorithm uses “the last diminisher†algorithm, which appears in fair division models. It can help solve complicated problems in a simple fashion. This article combines the trust value and the method of spectrum allocation. The concept of trust value in reputation management is introduced. All the factors are applied to solve the realistic problems of spectrum allocation. With the growing number of sensor nodes, the stable throughput is of vital importance.

Suggested Citation

  • Qing-Qi Pei & Zi Li & Li-Chuan Ma, 2013. "A Trust Value-Based Spectrum Allocation Algorithm in CWSNs," International Journal of Distributed Sensor Networks, , vol. 9(5), pages 261264-2612, May.
    • Handle: RePEc:sae:intdis:v:9:y:2013:i:5:p:261264
    DOI: 10.1155/2013/261264
    as

    Download full text from publisher

    File URL: https://journals.sagepub.com/doi/10.1155/2013/261264
    Download Restriction: no
    File URL: https://libkey.io/10.1155/2013/261264?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:9:y:2013:i:5:p:261264. 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.