Beamforming for MISO Cognitive Radio Networks Based on Successive Convex Approximation

0Citations
Citations of this article
1Readers
Mendeley users who have this article in their library.
Get full text

Abstract

This paper presents a novel beamforming optimization method for downlink underlying multiple-input single-output (MISO) cognitive radio (CR) networks. We formulate a beamforming optimization problem to maximize the sum rate of a CR network with one primary user (PU) pair and multiple secondary user (SU) pairs, subject to the quality of service requirement of the PU given the transmit power budgets at the base stations (BSs). To find the solution of the nonconvex problem, an iterative solving algorithm is proposed based on successive convex approximation (SCA). In developing the algorithm, we first reformulate the original nonconvex objective function as the difference of two concave functions. A concave substitute function is then derived using the one-order Taylor expansion. Based on this concave substitute, a convex semidefinite programming (SDP) is derived and solved. The new solution is then utilized to construct a new substitute. This process is repeated until a smooth point is reached. Simulation results show the effectiveness of the proposed SCA-based beamforming algorithm to achieve spectrum sharing.

Cite

CITATION STYLE

APA

Mao, R., Dong, A., & Yu, J. (2020). Beamforming for MISO Cognitive Radio Networks Based on Successive Convex Approximation. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 12384 LNCS, pp. 370–380). Springer Science and Business Media Deutschland GmbH. https://doi.org/10.1007/978-3-030-59016-1_31

Register to see more suggestions

Mendeley helps you to discover research relevant for your work.

Already have an account?

Save time finding and organizing research with Mendeley

Sign up for free