806 research outputs found
Secrecy Outage and Diversity Analysis of Cognitive Radio Systems
In this paper, we investigate the physical-layer security of a multi-user
multi-eavesdropper cognitive radio system, which is composed of multiple
cognitive users (CUs) transmitting to a common cognitive base station (CBS),
while multiple eavesdroppers may collaborate with each other or perform
independently in intercepting the CUs-CBS transmissions, which are called the
coordinated and uncoordinated eavesdroppers, respectively. Considering multiple
CUs available, we propose the round-robin scheduling as well as the optimal and
suboptimal user scheduling schemes for improving the security of CUs-CBS
transmissions against eavesdropping attacks. Specifically, the optimal user
scheduling is designed by assuming that the channel state information (CSI) of
all links from CUs to CBS, to primary user (PU) and to eavesdroppers are
available. By contrast, the suboptimal user scheduling only requires the CSI of
CUs-CBS links without the PU's and eavesdroppers' CSI. We derive closed-form
expressions of the secrecy outage probability of these three scheduling schemes
in the presence of the coordinated and uncoordinated eavesdroppers. We also
carry out the secrecy diversity analysis and show that the round-robin
scheduling achieves the diversity order of only one, whereas the optimal and
suboptimal scheduling schemes obtain the full secrecy diversity, no matter
whether the eavesdroppers collaborate or not. In addition, numerical secrecy
outage results demonstrate that for both the coordinated and uncoordinated
eavesdroppers, the optimal user scheduling achieves the best security
performance and the round-robin scheduling performs the worst. Finally, upon
increasing the number of CUs, the secrecy outage probabilities of the optimal
and suboptimal user scheduling schemes both improve significantly.Comment: 16 pages, 5 figures, accepted to appear, IEEE Journal on Selected
Areas in Communications, 201
Exploiting Full-duplex Receivers for Achieving Secret Communications in Multiuser MISO Networks
We consider a broadcast channel, in which a multi-antenna transmitter (Alice)
sends confidential information signals to legitimate users (Bobs) in
the presence of eavesdroppers (Eves). Alice uses MIMO precoding to generate
the information signals along with her own (Tx-based) friendly jamming.
Interference at each Bob is removed by MIMO zero-forcing. This, however, leaves
a "vulnerability region" around each Bob, which can be exploited by a nearby
Eve. We address this problem by augmenting Tx-based friendly jamming (TxFJ)
with Rx-based friendly jamming (RxFJ), generated by each Bob. Specifically,
each Bob uses self-interference suppression (SIS) to transmit a friendly
jamming signal while simultaneously receiving an information signal over the
same channel. We minimize the powers allocated to the information, TxFJ, and
RxFJ signals under given guarantees on the individual secrecy rate for each
Bob. The problem is solved for the cases when the eavesdropper's channel state
information is known/unknown. Simulations show the effectiveness of the
proposed solution. Furthermore, we discuss how to schedule transmissions when
the rate requirements need to be satisfied on average rather than
instantaneously. Under special cases, a scheduling algorithm that serves only
the strongest receivers is shown to outperform the one that schedules all
receivers.Comment: IEEE Transactions on Communication
- …