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

Sensor Clustering and Sensing Technology for Optimal Throughput of Sensor-Aided Cognitive Radio Networks Supporting Multiple Licensed Channels

Author

Listed:
  • Thanh-Tung Nguyen
  • Insoo Koo

Abstract

In cognitive radio networks, secondary users may not sense licensed channels efficiently due to problems of fading channel, shadowing, unfamiliar environment, and so forth. To cope with the limitation, a pervasive sensor network can cooperate with cognitive radio network, which is called sensor-aided cognitive radio network. In the paper, we investigate sensor clustering and sensing time of each sensor cluster with aiming at achieving optimal throughput of sensor-aided cognitive radio network supporting multiple licensed channels. Moreover, the minimum throughput requirement of cognitive radio user is also guaranteed in the sensor clustering problem. To do this, we formulate the throughput maximization problem as a mixed-integer nonlinear programming and utilize the Branch and Bound algorithm to solve it. We also propose an heuristic algorithm which can provide similar performance to that of the Branch and Bound algorithm while reducing computation complexity significantly.

Suggested Citation

  • Thanh-Tung Nguyen & Insoo Koo, 2015. "Sensor Clustering and Sensing Technology for Optimal Throughput of Sensor-Aided Cognitive Radio Networks Supporting Multiple Licensed Channels," International Journal of Distributed Sensor Networks, , vol. 11(10), pages 123982-1239, October.
  • Handle: RePEc:sae:intdis:v:11:y:2015:i:10:p:123982
    DOI: 10.1155/2015/123982
    as

    Download full text from publisher

    File URL: https://journals.sagepub.com/doi/10.1155/2015/123982
    Download Restriction: no

    File URL: https://libkey.io/10.1155/2015/123982?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:11:y:2015:i:10:p:123982. 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.