• DocumentCode
    2148418
  • Title

    A distributed relay selection algorithm for cognitive radio ad-hoc networks

  • Author

    Li, Yun ; Zhang, Ruifeng ; Wang, Chonggang ; Daneshmand, Ali ; You, Xiaohu

  • Author_Institution
    Special Res. Center for Opt. Internet & Wireless Inf. Networks, Chongqing Univ. of Post & Telecommun., Chongqing, China
  • fYear
    2010
  • fDate
    25-29 Oct. 2010
  • Firstpage
    439
  • Lastpage
    442
  • Abstract
    Cognitive radio has been proposed as the means for secondary users to promote the efficient utilization of spectrum. Meanwhile, Cooperative relay is well known as a powerful technology to combat signal fading in a wireless medium. In this paper, we discuss a new relay selection algorithm for cognitive radio ad-hoc networks by utilizing cooperative relay to improve spectrum diversity and transmission rate. We define a cooperation-table which considers several aspects including channel gain, channel available probability and spectrum heterogeneity of secondary nodes. Based on this cooperation-table, a new distributed relay selection algorithm is proposed that choose a relay node to maximize the transmission rate of the source node. Simulation results demonstrate the effectiveness of the relay selection algorithm.
  • Keywords
    ad hoc networks; cognitive radio; cooperative communication; fading channels; telecommunication network routing; ad hoc networks; channel available probability; channel gain; cognitive radio; cooperative relay; distributed relay selection; secondary users; signal fading; spectrum diversity; spectrum heterogeneity; transmission rate; Ad hoc networks; Algorithm design and analysis; Cognitive radio; Peer to peer computing; Relays; Strontium; Throughput; Cognitive radio; cooperation-table; cooperative communications; relay selection;
  • fLanguage
    English
  • Publisher
    ieee
  • Conference_Titel
    Network and Service Management (CNSM), 2010 International Conference on
  • Conference_Location
    Niagara Falls, ON
  • Print_ISBN
    978-1-4244-8910-7
  • Electronic_ISBN
    978-1-4244-8908-4
  • Type

    conf

  • DOI
    10.1109/CNSM.2010.5691264
  • Filename
    5691264