Search arXivSearch

arXiv · 1709.05383

Secrecy Rate of Cooperative MIMO in Presence of a Location Constrained Eavesdropper

Abstract

We propose and study the cooperative MIMO architecture to enable and to improve the secrecy transmissions between clusters of mobile devices in the presence of an eavesdropper with certain location constraint. The cooperative MIMO system in this paper (referred to as Reconfigurable Distributed MIMO) is formed by temporarily activating clusters of nearby trusted mobile devices, with each cluster being centrally coordinated by its corresponding cluster head. We assume that the transmitters apply a practical eigen-direction precoding scheme to transmit the confidential signal and artificial noise, while the eavesdropper can be located in multiple possible locations in the proximity. We first obtain the expression of the secrecy rate, where the required average mutual information between the transmitters and the eavesdropper is characterized by closed-form approximations. The proposed approximations are especially useful in the secrecy rate maximization, where the original non-convex problem can be solved by the successive convex approximations. Numerical results show that the secrecy rate can be significantly improved by leveraging the location constraint of the eavesdropper, compared to the existing result. We also demonstrate that the secrecy rate can be further improved by increasing the cluster size.

Explore related subjects

Keep this discovery

Explore connections, maps & timelines

BibTeXRIS

Zhong Zheng, Zygmunt Haas, Mario Kieburg. 2018-10-15. Secrecy Rate of Cooperative MIMO in Presence of a Location Constrained Eavesdropper. https://doi.org/10.1109/tcomm.2018.2877329

Cite the original work for its findings. Save a collection to share your selection of sources.

KEEP EXPLORING

Related papers

Fundamental Scaling Laws of Covert Communication in the Presence of Block Fading

Covert communication is the undetected transmission of sensitive information over a communication channel. In wireless communication systems, channel impairments such as signal fading present challenges in the effective implementation and analysis of covert communication systems. This paper generalizes early work in the covert communication field by considering asymptotic results for the number of bits that can be covertly transmitted in $n$ channel uses on a block fading channel. Critical to the investigation is characterizing the performance of optimal detectors at the adversary. Matching achievable and converse results are presented.

cs.IT

Sequence Reconstruction over the Deletion Channel

In this paper, we consider the Levenshtein's sequence reconstruction problem in the case where the transmitted codeword is chosen from $\{0,1\}^n$ and the channel can delete up to $t$ symbols from the transmitted codeword. We determine the minimum number of channel outputs (assuming that they are distinct) required to reconstruct a list of size $\ell-1$ of candidate sequences, one of which corresponds to the original transmitted sequence. More specifically, we determine the maximum possible size of the intersection of $\ell \geq 3$ deletion balls of radius $t$ centered at $x_1, x_2, \dots, x_{\ell}$, where $x_i \in \{0,1\}^n$ for all $i \in \{1,2,\dots,\ell\}$ and $x_i \neq x_j$ for $i \neq j$, with $ n \geq t+\ell-1$ and $t \geq 1$.

cs.IT

A generalization of the map $χ$

The mapping $ χ_n:\mathbb{F}_2^n \to \mathbb{F}_2^n$ defined by $y=χ_n(x)$ with $y_i = x_i + x_{i+1}x_{i+2} + x_{i+2}$, where the indices are computed modulo $n$, has been widely studied for its application in lightweight cryptography. In this paper, we generalize this mapping and completely characterize all these shift-invariant permutations of the form $y_i=x_{i+u}+x_{i+v}(x_{i+w}+a_i)$, where $0\le u, v, w<n$ and $a_i\in \mathbb{F}_2$, $1\le i\le n$.

cs.IT