3-D Dynamic UAV Base Station Location Problem

We address a dynamic covering location problem of an Unmanned Aerial Vehicle Base Station (UAV-BS), where the location sequence of a single UAV-BS in a wireless communication network is determined to satisfy data demand arising from ground users. This problem is especially relevant in the context of...

Full description

Saved in:
Bibliographic Details
Published in:arXiv.org
Main Authors: Cihan Tugrul Cicek, Zuo-Jun, Max Shen, Gultekin, Hakan, Tavli, Bulent
Format: Paper
Language:English
Published: Ithaca Cornell University Library, arXiv.org 09.12.2020
Subjects:
Algorithms
Computing time
Disaster relief
Exact solutions
Linear programming
Mixed integer
Nonlinear programming
Site selection
Smart grid
Unmanned aerial vehicles
User satisfaction
Vertical motion
Wireless communications
ISSN:2331-8422
Online Access:Get full text
Tags: Add Tag
No Tags, Be the first to tag this record!
Description
Summary:We address a dynamic covering location problem of an Unmanned Aerial Vehicle Base Station (UAV-BS), where the location sequence of a single UAV-BS in a wireless communication network is determined to satisfy data demand arising from ground users. This problem is especially relevant in the context of smart grid and disaster relief. The vertical movement ability of the UAV-BS and non-convex covering functions in wireless communication restrict utilizing classical planar covering location approaches. Therefore, we develop new formulations to this emerging problem for a finite time horizon to maximize the total coverage. In particular, we develop a mixed-integer non-linear programming formulation which is non-convex in nature, and propose a Lagrangean Decomposition Algorithm (LDA) to solve this formulation. Due to high complexity of the problem, the LDA is still unable to find good local solutions to large-scale problems. Therefore, we develop a Continuum Approximation (CA) model and show that CA would be a promising approach in terms of both computational time and solution accuracy. Our numerical study also shows that the CA model can be a remedy to build efficient initial solutions for exact solution algorithms.
Bibliography:SourceType-Working Papers-1
ObjectType-Working Paper/Pre-Print-1
content type line 50
ISSN:2331-8422
DOI:10.48550/arxiv.2012.04909