Linear Precoding for Fading Cognitive Multiple-Access Wiretap Channel With Finite-Alphabet Inputs
Reads0
Chats0
TLDR
Numerical results indicate that the proposed precoding algorithm is superior to the conventional Gaussian precoding method in the medium and high signal-to-noise ratio (SNR) regimes.Abstract:
We investigate the fading cognitive multiple-access wiretap channel (CMAC-WT), in which two secondary-user transmitters (STs) send secure messages to a secondary-user receiver (SR) in the presence of an eavesdropper and subject to interference threshold constraints at multiple primary-user receivers (PRs). We design linear precoders to maximize the average secrecy sum rate for a multiple-input–multiple-output (MIMO) fading CMAC-WT under finite-alphabet inputs and statistical channel state information at STs. For this nondeterministic polynomial-time NP-hard problem, we utilize an accurate approximation of the average secrecy sum rate to reduce the computational complexity and then present a two-layer algorithm by embedding the convex–concave procedure into an outer-approximation framework. The idea behind this algorithm is to reformulate the approximated average secrecy sum rate as a difference of convex functions and then generate a sequence of simpler relaxed sets to approach the nonconvex feasible set. Subsequently, we maximize the approximated average secrecy sum rate over the sequence of relaxed sets by using the convex–concave procedure. Numerical results indicate that our proposed precoding algorithm is superior to the conventional Gaussian precoding method in the medium and high signal-to-noise ratio (SNR) regimes.read more
Citations
More filters
Journal ArticleDOI
Hybrid Precoding for Millimeter Wave MIMO Systems: A Matrix Factorization Approach
TL;DR: A Broyden-Fletcher-Goldfarb-Shanno-based algorithm is proposed to solve the matrix factorization problem using gradient and Hessian information and several numerical results are provided to show that the proposed algorithm outperforms existing hybrid precoding algorithms.
Journal ArticleDOI
An LDPC Code Based Physical Layer Message Authentication Scheme With Prefect Security
TL;DR: An efficient and feasible authentication scheme based on low-density parity-check (LDPC) codes andinline-formula and lightweight hash functions over binary-input wiretap channel is proposed and theoretically proves that, the proposed schemes are perfect secure if the number of attacks from Eve is upper bounded by a polynomial times.
Journal ArticleDOI
Channel-Statistics-Based Hybrid Precoding for Millimeter-Wave MIMO Systems With Dynamic Subarrays
TL;DR: In this article, the design of analog and digital precoders utilizing statistical and/or mixed channel state information (CSI) was investigated for mmWave MIMO systems with finite-alphabet inputs.
Journal ArticleDOI
Physically Securing Energy-Based Massive MIMO MAC via Joint Alignment of Multi-User Constellations and Artificial Noise
TL;DR: This paper investigates the artificial noise (AN) aided physical layer security (PLS) for energy-based massive multi-input multi-output multi-access channels with finite-alphabet data inputs, where both the legitimate base station and the passive eavesdropper (Eve) are equipped with large antenna arrays and each user has multiple antennas.
Journal ArticleDOI
Transmit Antenna Selection and Beamformer Design for Secure Spatial Modulation With Rough CSI of Eve
TL;DR: The joint optimization problem of maximizing the secrecy rate (Max-SR) over the transmit antenna selection and ANP in the context of secure SM-aided networks is formulated and a significant computational complexity reduction can be achieved.
References
More filters
Journal ArticleDOI
Communication theory of secrecy systems
TL;DR: A theory of secrecy systems is developed on a theoretical level and is intended to complement the treatment found in standard works on cryptography.
Journal ArticleDOI
The wire-tap channel
TL;DR: This paper finds the trade-off curve between R and d, assuming essentially perfect (“error-free”) transmission, and implies that there exists a Cs > 0, such that reliable transmission at rates up to Cs is possible in approximately perfect secrecy.
Journal ArticleDOI
Broadcast channels with confidential messages
Imre Csiszár,János Körner +1 more
TL;DR: Given two discrete memoryless channels (DMC's) with a common input, a single-letter characterization is given of the achievable triples where R_{e} is the equivocation rate and the related source-channel matching problem is settled.
Proceedings ArticleDOI
Random key predistribution schemes for sensor networks
TL;DR: The random-pairwise keys scheme is presented, which perfectly preserves the secrecy of the rest of the network when any node is captured, and also enables node-to-node authentication and quorum-based revocation.
Journal ArticleDOI
Semidefinite Relaxation of Quadratic Optimization Problems
TL;DR: This article has provided general, comprehensive coverage of the SDR technique, from its practical deployments and scope of applicability to key theoretical results, and showcased several representative applications, namely MIMO detection, B¿ shimming in MRI, and sensor network localization.