• DocumentCode
    1285751
  • Title

    Joint Beamforming and User Maximization Techniques for Cognitive Radio Networks Based on Branch and Bound Method

  • Author

    Cumanan, Kanapathippillai ; Krishna, Ranaji ; Musavian, Leila ; Lambotharan, Sangarapillai

  • Author_Institution
    Adv. Signal Process. Group, Loughborough Univ., Loughborough, UK
  • Volume
    9
  • Issue
    10
  • fYear
    2010
  • fDate
    10/1/2010 12:00:00 AM
  • Firstpage
    3082
  • Lastpage
    3092
  • Abstract
    We consider a network of cognitive users (also referred to as secondary users (SUs)) coexisting and sharing the spectrum with primary users (PUs) in an underlay cognitive radio network (CRN). Specifically, we consider a CRN wherein the number of SUs requesting channel access exceeds the number of available frequency bands and spatial modes. In such a setting, we propose a joint fast optimal resource allocation and beamforming algorithm to accommodate maximum possible number of SUs while satisfying quality of service (QoS) requirement for each admitted SU, transmit power limitation at the secondary network basestation (SNBS) and interference constraints imposed by the PUs. Recognizing that the original user maximization problem is a nondeterministic polynomial-time hard (NP), we use a mixed-integer programming framework to formulate the joint user maximization and beamforming problem. Subsequently, an optimal algorithm based on branch and bound (BnB) method has been proposed. In addition, we propose a suboptimal algorithm based on BnB method to reduce the complexity of the proposed algorithm. Specifically, the suboptimal algorithm has been developed based on the first feasible solution it achieves in the fast optimal BnB method. Simulation results have been provided to compare the performance of the optimal and suboptimal algorithms.
  • Keywords
    array signal processing; channel allocation; cognitive radio; computational complexity; integer programming; interference (signal); quality of service; resource allocation; tree searching; CRN; QoS requirement; SNBS; beamforming algorithm; branch and bound method; channel access; cognitive radio networks; cognitive users; frequency bands; interference constraints; joint beamforming; joint fast optimal resource allocation; joint user maximization; mixed-integer programming framework; nondeterministic polynomial-time hard; optimal algorithm; quality of service requirement; secondary network basestation; spatial modes; underlay cognitive radio network; user maximization techniques; AWGN; Array signal processing; Chromium; Cognitive radio; Frequency; Interference; Interference constraints; Joints; NP-hard problem; Programming; Quality of service; Radio spectrum management; Resource management; Signal processing algorithms; Signal to noise ratio; Cognitive radio networks; beamforming; branch and bound method; mixed-integer programming; resource allocation; user maximization;
  • fLanguage
    English
  • Journal_Title
    Wireless Communications, IEEE Transactions on
  • Publisher
    ieee
  • ISSN
    1536-1276
  • Type

    jour

  • DOI
    10.1109/TWC.2010.072610.090898
  • Filename
    5539719