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

被引:45
作者
Cumanan, Kanapathippillai [1 ]
Krishna, Ranaji
Musavian, Leila
Lambotharan, Sangarapillai [1 ]
机构
[1] Univ Loughborough, Adv Signal Proc Grp, Dept Elect & Elect Engn, Loughborough, Leics, England
基金
英国工程与自然科学研究理事会;
关键词
Cognitive radio networks; user maximization; resource allocation; beamforming; mixed-integer programming; branch and bound method; MULTIPLE-ACCESS CHANNELS; POWER ALLOCATION; CAPACITY;
D O I
10.1109/TWC.2010.072610.090898
中图分类号
TM [电工技术]; TN [电子技术、通信技术];
学科分类号
0808 ; 0809 ;
摘要
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.
引用
收藏
页码:3082 / 3092
页数:11
相关论文
共 35 条
[1]   STRONG DUALITY FOR THE CDT SUBPROBLEM: A NECESSARY AND SUFFICIENT CONDITION [J].
Ai, Wenbao ;
Zhang, Shuzhong .
SIAM JOURNAL ON OPTIMIZATION, 2009, 19 (04) :1735-1756
[2]  
[Anonymous], 1998, INTEGER COMBINATORIA
[3]  
[Anonymous], 2008, P IEEE GLOBECOM GLOB
[4]   Interference-limited resource allocation for cognitive radio in orthogonal frequency-division multiplexing networks [J].
Attar, A. ;
Holland, O. ;
Nakhai, M. R. ;
Aghvami, A. H. .
IET COMMUNICATIONS, 2008, 2 (06) :806-814
[5]  
Bengtsson M., 1999, PROC ANN ALLERTON C
[6]  
Boyd S., 2004, CONVEX OPTIMIZATION, VFirst, DOI DOI 10.1017/CBO9780511804441
[7]  
BOYD S, 2008, LECT NOTES EE364B CO
[8]   Robust Interference Control Techniques for Multiuser Cognitive Radios Using Worst-Case Performance Optimization [J].
Cumanan, K. ;
Krishna, R. ;
Sharma, V. ;
Lambotharan, S. .
2008 42ND ASILOMAR CONFERENCE ON SIGNALS, SYSTEMS AND COMPUTERS, VOLS 1-4, 2008, :378-382
[9]  
CUMANAN K, IET SIGNAL IN PRESS
[10]  
Cumanan K., 2008, P ISITA 2008 AUCKL N, P1