2016
DOI: 10.1109/tvt.2015.2412152
|View full text |Cite
|
Sign up to set email alerts
|

Improving Physical-Layer Security for CRNs Using SINR-Based Cooperative Beamforming

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
1
1
1
1

Citation Types

0
57
0

Year Published

2016
2016
2023
2023

Publication Types

Select...
8
1

Relationship

0
9

Authors

Journals

citations
Cited by 86 publications
(57 citation statements)
references
References 19 publications
0
57
0
Order By: Relevance
“…This model has been well justified in the secure resource allocation literature [29], [38], [39]. As a result, the interference outage constraint to the PU can be neglected in the sequel, as we focus on the requirement of secure communication relying on the constraints (18b)-(18d).…”
Section: Problem Formulationmentioning
confidence: 99%
“…This model has been well justified in the secure resource allocation literature [29], [38], [39]. As a result, the interference outage constraint to the PU can be neglected in the sequel, as we focus on the requirement of secure communication relying on the constraints (18b)-(18d).…”
Section: Problem Formulationmentioning
confidence: 99%
“…Additionally, the physical layer security in satellite communication is considered in [170] where the beamforming and power allocation under the individual secrecy rate constraints are designed for minimizing the overall transmission power used by all beams. In a new cognitive radio network as described in [228], a cooperative beamforming scheme is proposed to minimize the transmission power of a secondary transmitter while providing different SINR for an eavesdropper, a primary receiver, and multiple secondary receivers. The problems of power minimization by beamforming/precoding are also raised in simultaneous wireless information and power transfer systems considering multifarious settings.…”
Section: )mentioning
confidence: 99%
“…In (30), O(·) represents for the big-O notation. On the other hand, the computational complexity upper bound of suboptimal scheme 1 is given by 2 × ∆ SDP complexity (31) since two SDPs have to be solved in this case. Suboptimal algorithm 2 adopts a similar approach to solve the problem as suboptimal scheme 1.…”
Section: Computational Complexitymentioning
confidence: 99%
“…In [29], the authors investigated the secrecy outage probability of CR systems in the presence of a passive eavesdropper. In [30] and [31], precoding and beamforming schemes were designed to ensure communication security for MIMO multiple eavesdropper (MIMOME) CR networks and cooperative CR networks, respectively. The authors in [32] studied robust transmitter designs for secure CR networks.…”
mentioning
confidence: 99%