3,391 research outputs found
Secure Massive MIMO Communication with Low-resolution DACs
In this paper, we investigate secure transmission in a massive multiple-input
multiple-output (MIMO) system adopting low-resolution digital-to-analog
converters (DACs). Artificial noise (AN) is deliberately transmitted
simultaneously with the confidential signals to degrade the eavesdropper's
channel quality. By applying the Bussgang theorem, a DAC quantization model is
developed which facilitates the analysis of the asymptotic achievable secrecy
rate. Interestingly, for a fixed power allocation factor , low-resolution
DACs typically result in a secrecy rate loss, but in certain cases they provide
superior performance, e.g., at low signal-to-noise ratio (SNR). Specifically,
we derive a closed-form SNR threshold which determines whether low-resolution
or high-resolution DACs are preferable for improving the secrecy rate.
Furthermore, a closed-form expression for the optimal is derived. With
AN generated in the null-space of the user channel and the optimal ,
low-resolution DACs inevitably cause secrecy rate loss. On the other hand, for
random AN with the optimal , the secrecy rate is hardly affected by the
DAC resolution because the negative impact of the quantization noise can be
compensated for by reducing the AN power. All the derived analytical results
are verified by numerical simulations.Comment: 14 pages, 10 figure
Cooperative Jamming for Secure Communications in MIMO Relay Networks
Secure communications can be impeded by eavesdroppers in conventional relay
systems. This paper proposes cooperative jamming strategies for two-hop relay
networks where the eavesdropper can wiretap the relay channels in both hops. In
these approaches, the normally inactive nodes in the relay network can be used
as cooperative jamming sources to confuse the eavesdropper. Linear precoding
schemes are investigated for two scenarios where single or multiple data
streams are transmitted via a decode-and-forward (DF) relay, under the
assumption that global channel state information (CSI) is available. For the
case of single data stream transmission, we derive closed-form jamming
beamformers and the corresponding optimal power allocation. Generalized
singular value decomposition (GSVD)-based secure relaying schemes are proposed
for the transmission of multiple data streams. The optimal power allocation is
found for the GSVD relaying scheme via geometric programming. Based on this
result, a GSVD-based cooperative jamming scheme is proposed that shows
significant improvement in terms of secrecy rate compared to the approach
without jamming. Furthermore, the case involving an eavesdropper with unknown
CSI is also investigated in this paper. Simulation results show that the
secrecy rate is dramatically increased when inactive nodes in the relay network
participate in cooperative jamming.Comment: 30 pages, 7 figures, to appear in IEEE Transactions on Signal
Processin
Joint Relay Selection and Power Allocation in Large-Scale MIMO Systems with Untrusted Relays and Passive Eavesdroppers
In this paper, a joint relay selection and power allocation (JRP) scheme is
proposed to enhance the physical layer security of a cooperative network, where
a multiple antennas source communicates with a single-antenna destination in
presence of untrusted relays and passive eavesdroppers (Eves). The objective is
to protect the data confidentially while concurrently relying on the untrusted
relays as potential Eves to improve both the security and reliability of the
network. To realize this objective, we consider cooperative jamming performed
by the destination while JRP scheme is implemented. With the aim of maximizing
the instantaneous secrecy rate, we derive a new closed-form solution for the
optimal power allocation and propose a simple relay selection criterion under
two scenarios of non-colluding Eves (NCE) and colluding Eves (CE). For the
proposed scheme, a new closed-form expression is derived for the ergodic
secrecy rate (ESR) and the secrecy outage probability as security metrics, and
a new closed-form expression is presented for the average symbol error rate
(SER) as a reliability measure over Rayleigh fading channels. We further
explicitly characterize the high signal-to-noise ratio slope and power offset
of the ESR to highlight the impacts of system parameters on the ESR. In
addition, we examine the diversity order of the proposed scheme to reveal the
achievable secrecy performance advantage. Finally, the secrecy and reliability
diversity-multiplexing tradeoff of the optimized network are provided.
Numerical results highlight that the ESR performance of the proposed JRP scheme
for NCE and CE cases is increased with respect to the number of untrustworthy
relays.Comment: 18 pages, 10 figures, IEEE Transactions on Information Forensics and
Security (In press
Directional Modulation via Symbol-Level Precoding: A Way to Enhance Security
Wireless communication provides a wide coverage at the cost of exposing
information to unintended users. As an information-theoretic paradigm, secrecy
rate derives bounds for secure transmission when the channel to the
eavesdropper is known. However, such bounds are shown to be restrictive in
practice and may require exploitation of specialized coding schemes. In this
paper, we employ the concept of directional modulation and follow a signal
processing approach to enhance the security of multi-user MIMO communication
systems when a multi-antenna eavesdropper is present. Enhancing the security is
accomplished by increasing the symbol error rate at the eavesdropper. Unlike
the information-theoretic secrecy rate paradigm, we assume that the legitimate
transmitter is not aware of its channel to the eavesdropper, which is a more
realistic assumption. We examine the applicability of MIMO receiving algorithms
at the eavesdropper. Using the channel knowledge and the intended symbols for
the users, we design security enhancing symbol-level precoders for different
transmitter and eavesdropper antenna configurations. We transform each design
problem to a linearly constrained quadratic program and propose two solutions,
namely the iterative algorithm and one based on non-negative least squares, at
each scenario for a computationally-efficient modulation. Simulation results
verify the analysis and show that the designed precoders outperform the
benchmark scheme in terms of both power efficiency and security enhancement.Comment: This manuscript is submitted to IEEE Journal of Selected Topics in
Signal Processin
Weak Secrecy in the Multi-Way Untrusted Relay Channel with Compute-and-Forward
We investigate the problem of secure communications in a Gaussian multi-way
relay channel applying the compute-and-forward scheme using nested lattice
codes. All nodes employ half-duplex operation and can exchange confidential
messages only via an untrusted relay. The relay is assumed to be honest but
curious, i.e., an eavesdropper that conforms to the system rules and applies
the intended relaying scheme. We start with the general case of the
single-input multiple-output (SIMO) L-user multi-way relay channel and provide
an achievable secrecy rate region under a weak secrecy criterion. We show that
the securely achievable sum rate is equivalent to the difference between the
computation rate and the multiple access channel (MAC) capacity. Particularly,
we show that all nodes must encode their messages such that the common
computation rate tuple falls outside the MAC capacity region of the relay. We
provide results for the single-input single-output (SISO) and the
multiple-input single-input (MISO) L-user multi-way relay channel as well as
the two-way relay channel. We discuss these results and show the dependency
between channel realization and achievable secrecy rate. We further compare our
result to available results in the literature for different schemes and show
that the proposed scheme operates close to the compute-and-forward rate without
secrecy.Comment: submitted to JSAC Special Issue on Fundamental Approaches to Network
Coding in Wireless Communication System
- …