• DocumentCode
    1979576
  • Title

    Energy-efficient cooperative sensing scheduling for heterogeneous channel access in Cognitive Radio

  • Author

    Sun, Xiangxia ; Chen, Li ; Tsang, Danny H K

  • Author_Institution
    Dept. of Electron. & Comput. Eng., Hong Kong Univ. of Sci. & Technol., Hong Kong, China
  • fYear
    2012
  • fDate
    25-30 March 2012
  • Firstpage
    145
  • Lastpage
    150
  • Abstract
    As a promising technology to implement Dynamic Spectrum Access (DSA), Cognitive Radio (CR) is envisioned to evolve to be Green. In this paper, the Cooperative Sensing Scheduling (CSS) problem for Cognitive Radio Network (CRN) is analyzed by taking both the performance and energy consumption of spectrum sensing into consideration. We model the CSS problem under a practical scenario where primary user (PU) channels are heterogeneous in terms of channel protection criteria, idling probabilities and channel capacities. With the objective to find an optimal and efficient secondary users (SUs) assignment scheme, we formulate the CSS problem into a nonlinear integer programming problem. The intricate two-dimensional trade-off among energy efficiency, sensing performance and spectrum opportunity exploration is presented and properly tackled. We explore the inherent property of this problem by adopting a two-step approach. In the first step, by fixing the number of SUs participating in sensing, the problem is converted to an M-concave problem and an efficient algorithm for optimal SU assignment is proposed. With this scheme, we then investigate the appropriate number of SUs participating in sensing in the second step. Based on these two steps, the final SU assignment scheme is proposed. The optimality of this assignment scheme is proved theoretically and verified numerically.
  • Keywords
    channel allocation; channel capacity; cognitive radio; concave programming; cooperative communication; integer programming; nonlinear programming; radio spectrum management; scheduling; CRN; CSS problem; DSA; M-concave problem; PU channels; SU assignment scheme; channel capacity; channel protection criteria; cognitive radio network; dynamic spectrum access; energy consumption; energy-efficient cooperative sensing scheduling; heterogeneous channel access; nonlinear integer programming problem; optimal SU assignment; optimality; primary user channels; promising technology; secondary users assignment scheme; spectrum opportunity exploration; spectrum sensing; two-dimensional trade-off; Accuracy; Algorithm design and analysis; Cascading style sheets; Cognitive radio; Energy consumption; Linear programming; Sensors; M-convex; cognitive radio; cooperative sensing scheduling; energy-efficient; nonlinear integer programming;
  • fLanguage
    English
  • Publisher
    ieee
  • Conference_Titel
    Computer Communications Workshops (INFOCOM WKSHPS), 2012 IEEE Conference on
  • Conference_Location
    Orlando, FL
  • Print_ISBN
    978-1-4673-1016-1
  • Type

    conf

  • DOI
    10.1109/INFCOMW.2012.6193477
  • Filename
    6193477