Search arXivSearch

arXiv · 1804.02144

Optimal Placement of a UAV to Maximize the Lifetime of Wireless Devices

Abstract

Unmanned aerial vehicles (UAVs) can be used as aerial wireless base stations when cellular networks go down. Prior studies on UAV-based wireless coverage typically consider downlink scenarios from an aerial base station to ground users. In this paper, we consider an uplink scenario under disaster situations (such as earthquakes or floods), when cellular networks are down. We formulate the problem of optimal UAV placement, where the objective is to determine the placement of a single UAV such that the sum of time durations of uplink transmissions is maximized. We prove that the constraint sets of problem can be represented by the intersection of half spheres and the region formed by this intersection is a convex set in terms of two variables. This proof enables us to transform our problem to an optimization problem with two variables. We also prove that the objective function of the transformed problem is a concave function under a restriction on the minimum altitude of the UAV and propose a gradient projection-based algorithm to find the optimal location of the UAV. We validate the analysis by simulations and demonstrate the effectiveness of the proposed algorithm under different cases.

Explore related subjects

Keep this discovery

Explore connections, maps & timelines

BibTeXRIS

Hazim Shakhatreh, Abdallah Khreishah. 2018-04-06. Optimal Placement of a UAV to Maximize the Lifetime of Wireless Devices. https://arxiv.org/abs/1804.02144

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