Cart (Loading....) | Create Account
Close category search window
 

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

Sign In

Cookies must be enabled to login.After enabling cookies , please use refresh or reload or ctrl+f5 on the browser for the login options.

Formats Non-Member Member
$31 $13
Learn how you can qualify for the best price for this item!
Become an IEEE Member or Subscribe to
IEEE Xplore for exclusive pricing!
close button

puzzle piece

IEEE membership options for an individual and IEEE Xplore subscriptions for an organization offer the most affordable access to essential journal articles, conference papers, standards, eBooks, and eLearning courses.

Learn more about:

IEEE membership

IEEE Xplore subscriptions

4 Author(s)
Cumanan, K. ; Adv. Signal Process. Group, Loughborough Univ., Loughborough, UK ; Krishna, R. ; Musavian, L. ; Lambotharan, S.

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.

Published in:

Wireless Communications, IEEE Transactions on  (Volume:9 ,  Issue: 10 )

Date of Publication:

October 2010

Need Help?


IEEE Advancing Technology for Humanity About IEEE Xplore | Contact | Help | Terms of Use | Nondiscrimination Policy | Site Map | Privacy & Opting Out of Cookies

A not-for-profit organization, IEEE is the world's largest professional association for the advancement of technology.
© Copyright 2014 IEEE - All rights reserved. Use of this web site signifies your agreement to the terms and conditions.