Loughborough University
Leicestershire, UK
LE11 3TU
+44 (0)1509 263171
Loughborough University

Loughborough University Institutional Repository

Please use this identifier to cite or link to this item: https://dspace.lboro.ac.uk/2134/8900

Title: Joint beamforming and user maximization techniques for cognitive radio networks based on branch and bound method
Authors: Cumanan, Kanapathippillai
Krishna, Ranaji
Musavian, Leila
Lambotharan, Sangarapillai
Keywords: Cognitive radio networks
Branch and bound method
Mixed-integer programming
Resource allocation
User maximization
Issue Date: 2010
Publisher: © IEEE
Citation: CUMANAN, K., KRISHNA, R., MUSAVIAN, L. and LAMBOTHARAN, S., 2010. Joint beamforming and user maximization techniques for cognitive radio networks based on branch and bound method. IEEE Transactions on Wireless Communications, 9 (10), pp. 3082 - 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.
Description: This item is Closed Access. This article was published in the journal, IEEE Transactions on Wireless Communications [© IEEE] and the definitive version is available at: http://dx.doi.org/10.1109/TWC.2010.072610.090898
Version: Published
DOI: 10.1109/TWC.2010.072610.090898
URI: https://dspace.lboro.ac.uk/2134/8900
Publisher Link: http://dx.doi.org/10.1109/TWC.2010.072610.090898
ISSN: 1536-1276
Appears in Collections:Closed Access (Mechanical, Electrical and Manufacturing Engineering)

Files associated with this item:

File Description SizeFormat
2010JournalsIEEE_TransWC_Cumanan[1].pdf646.39 kBAdobe PDFView/Open


SFX Query

Items in DSpace are protected by copyright, with all rights reserved, unless otherwise indicated.