Robust beamforming for secrecy rate in cooperative cognitive radio multicast communications

Van-Dinh Nguyen, Trung Q. Duong, Oh-Soon Shin, Arumugam Nallanathan, George K. Karagiannidis

Research output: Chapter in Book/Report/Conference proceedingConference paperpeer-review

9 Citations (Scopus)

Abstract

In this paper, we propose a cooperative approach
to improve the security of both primary and secondary systems
in cognitive radio multicast communications. During their access
to the frequency spectrum licensed to the primary users, the
secondary unlicensed users assist the primary system in fortifying
security by sending a jamming noise to the eavesdroppers,
while simultaneously protect themselves from eavesdropping. The main objective of this work is to maximize the secrecy rate of the secondary system, while adhering to all individual primary users’ secrecy rate constraints. In the case of passive eavesdroppers and imperfect channel state information
knowledge at the transceivers, the utility function of interest is nonconcave and involved constraints are nonconvex, and thus, the optimal solutions are troublesome. To address this problem, we propose an iterative algorithm to arrive at a local optimum of the considered problem. The proposed iterative algorithm is guaranteed to achieve a Karush-Kuhn-Tucker solution.
Original languageEnglish
Title of host publicationIEEE Proceeding of ICC'2017
PublisherIEEE
Number of pages6
DOIs
Publication statusE-pub ahead of print - 31 Jul 2017
Event2017 IEEE International Conference on Communications, ICC 2017 - Paris, France
Duration: 21 May 201725 May 2017

Publication series

Name
ISSN (Electronic)1938-1883

Conference

Conference2017 IEEE International Conference on Communications, ICC 2017
Country/TerritoryFrance
CityParis
Period21/05/201725/05/2017

Fingerprint

Dive into the research topics of 'Robust beamforming for secrecy rate in cooperative cognitive radio multicast communications'. Together they form a unique fingerprint.

Cite this