• DocumentCode
    2491050
  • Title

    Truth reveling opportunistic scheduling in cognitive radio systems

  • Author

    Huang, Jane W. ; Krishnamurthy, Vikram

  • Author_Institution
    Dept. of Electr. & Comput. Eng., Univ. of British Columbia, Vancouver, BC, Canada
  • fYear
    2009
  • fDate
    21-24 June 2009
  • Firstpage
    91
  • Lastpage
    95
  • Abstract
    The conventional opportunistic scheduling algorithm in cognitive radio networks among secondary users is based on the reported state values to the central controller. However, with the increasing programmability of network users, a malicious user can strategically declare a false state in order to gain an unfair share of resources. How to ensure all the users revel their true information becomes an important issue in the system design. In this paper, we proposed a pricing mechanism which combines the mechanism design with the opportunistic scheduling algorithm and ensures that each rational selfish user maximizes his own utility function, at the same time optimizing the overall system utility. The proposed pricing mechanism is based on the classic Vickrey-Clark-Groves (VCG) mechanism and had several desirable economic properties. A mechanism learning algorithm is then provided for users to learn the mechanism and to obtain the Nash equilibrium. A numerical example shows the Nash equilibrium of such algorithm achieves system optimality.
  • Keywords
    cognitive radio; mobile communication; multimedia communication; scheduling; Vickrey-Clark-Groves mechanism; cognitive radio systems; truth reveling opportunistic scheduling; Cognitive radio; Convergence of numerical methods; Mechanical factors; Nash equilibrium; Power generation economics; Pricing; Processor scheduling; Resource management; Scheduling algorithm; System performance;
  • fLanguage
    English
  • Publisher
    ieee
  • Conference_Titel
    Signal Processing Advances in Wireless Communications, 2009. SPAWC '09. IEEE 10th Workshop on
  • Conference_Location
    Perugia
  • Print_ISBN
    978-1-4244-3695-8
  • Electronic_ISBN
    978-1-4244-3696-5
  • Type

    conf

  • DOI
    10.1109/SPAWC.2009.5161753
  • Filename
    5161753