Search arXivSearch

arXiv · 1911.05553

Energy-Efficient UAV Backscatter Communication with Joint Trajectory Design and Resource Optimization

Abstract

Backscatter communication which enables wireless-powered backscatter devices (BDs) to transmit information by reflecting incident signals, is an energy- and cost-efficient communication technology for Internet-of-Things. This paper considers an unmanned aerial vehicle (UAV)-assisted backscatter communication network (UBCN) consisting of multiple BDs and carrier emitters (CEs) on the ground as well as a UAV. A communicate-while-fly scheme is first designed, in which the BDs illuminated by their associated CEs transmit information to the flying UAV in a time-division-multiple-access manner. Considering the critical issue of the UAV's limited on-board energy and the CEs' transmission energy, we maximize the energy efficiency (EE) of the UBCN by jointly optimizing the UAV's trajectory, the BDs' scheduling, and the CEs' transmission power, subject to the BDs' throughput constraints and harvested energy constraints, as well as other practical constraints. Furthermore, we propose an iterative algorithm based on the block coordinated decent method to solve the formulated mixed-integer non-convex problem, in each iteration of which the variables are alternatively optimized by leveraging the cutting-plane technique, the Dinkelbach's method and the successive convex approximation technique. Also, the convergence and complexity of the proposed algorithm are analyzed. Finally, simulation results show that the proposed communicate-while-fly scheme achieves significant EE gains compared with the benchmark hover-and-fly scheme. Useful insights on the optimal trajectory design and resource allocation are also obtained.

Explore related subjects

Keep this discovery

Explore connections, maps & timelines

BibTeXRIS

Gang Yang, Rao Dai, Ying-Chang Liang. 2019-11-13. Energy-Efficient UAV Backscatter Communication with Joint Trajectory Design and Resource Optimization. https://arxiv.org/abs/1911.05553

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