Search arXivSearch

arXiv · 2001.00481

Joint 3D Maneuver and Power Adaptation for Secure UAV Communication with CoMP Reception

Abstract

This paper studies a secrecy unmanned aerial vehicle (UAV) communication system with coordinated multi-point (CoMP) reception, in which one UAV sends confidential messages to a set of cooperative ground receivers (GRs), in the presence of several suspicious eavesdroppers. In particular, we consider two types of eavesdroppers that are non-colluding and colluding, respectively. Under this setup, we exploit the UAV's maneuver in three dimensional (3D) space together with transmit power adaptation for optimizing the secrecy communication performance. First, we consider the quasi-stationary UAV scenario, where we jointly optimize the UAV's 3D placement and transmit power control to maximize the secrecy rate. Under both non-colluding and colluding eavesdroppers, we obtain the optimal solutions to the joint 3D placement and transmit power control problems in well structures. Next, we consider the mobile UAV scenario, where we jointly optimize the UAV's 3D trajectory and transmit power allocation to maximize the average secrecy rate during the whole communication period. To deal with the difficult joint 3D trajectory and transmit power allocation problems, we present alternating-optimization-based approaches to obtain high-quality solutions. Finally, we provide numerical results to validate the performance of our proposed designs. It is shown that due to the consideration of CoMP reception, our proposed design with 3D maneuver significantly outperforms the conventional design with two dimensional (2D) (horizontal) maneuver only, by exploiting the additional degrees of freedom in altitudes. It is also shown that the non-colluding and colluding eavesdroppers lead to distinct 3D UAV maneuver behaviors.

Explore related subjects

Keep this discovery

Explore connections, maps & timelines

BibTeXRIS

Jianping Yao, Jie Xu. 2019-12-30. Joint 3D Maneuver and Power Adaptation for Secure UAV Communication with CoMP Reception. https://arxiv.org/abs/2001.00481

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