Modeling Optimal Location Distribution for Deployment of Flying Base Stations as On-Demand Connectivity Enablers in Real-World Scenarios

Result code in IS VaVaI

<a href="https://www.isvavai.cz/riv?ss=detail&h=RIV%2F00216305%3A26220%2F21%3APU141418" target="_blank" >RIV/00216305:26220/21:PU141418 - isvavai.cz</a>

Result on the web

<a href="https://www.mdpi.com/1424-8220/21/16/5580" target="_blank" >https://www.mdpi.com/1424-8220/21/16/5580</a>

DOI - Digital Object Identifier

<a href="http://dx.doi.org/10.3390/s21165580" target="_blank" >10.3390/s21165580</a>

Result language

angličtina

Original language name

Modeling Optimal Location Distribution for Deployment of Flying Base Stations as On-Demand Connectivity Enablers in Real-World Scenarios

Original language description

The amount of internet traffic generated during mass public events is significantly growing in a way that requires methods to increase the overall performance of the wireless network service. Recently, legacy methods in form of mobile cell sites, frequently called cells on wheels, were used. However, modern technologies are allowing the use of unmanned aerial vehicles (UAV) as a platform for network service extension instead of ground-based techniques. This results in the development of flying base stations (FBS) where the number of deployed FBSs depends on the demanded network capacity and specific user requirements. Large-scale events, such as outdoor music festivals or sporting competitions, requiring deployment of more than one FBS need a method to optimally distribute these aerial vehicles to achieve high capacity and minimize the cost. In this paper, we present a mathematical model for FBS deployment in large-scale scenarios. The model is based on a location set covering problem and the goal is to minimize the number of FBSs by finding their optimal locations. It is restricted by users’ throughput requirements and FBSs’ available throughput, also, all users that require connectivity must be served. Two meta-heuristic algorithms (cuckoo search and differential evolution) were implemented and verified on a real example of a music festival scenario. The results show that both algorithms are capable of finding a solution. The major difference is in the performance where differential evolution solves the problem six to eight times faster, thus it is more suitable for repetitive calculation. The obtained results can be used in commercial scenarios similar to the one used in this paper where providing sufficient connectivity is crucial for good user experience. The designed algorithms will serve for the network infrastructure design and for assessing the costs and feasibility of the use-case.

Czech name

—

Czech description

—

Type

J_imp - Article in a specialist periodical, which is included in the Web of Science database

CEP classification

—

OECD FORD branch

20202 - Communication engineering and systems

Project

<a href="/en/project/FV40309" target="_blank" >FV40309: Monitoring, search, detection, guidance and tracking using video from drone - vision system for defense systems and public security forces</a><br>

Continuities

P - Projekt vyzkumu a vyvoje financovany z verejnych zdroju (s odkazem do CEP)<br>S - Specificky vyzkum na vysokych skolach

Publication year

2021

Confidentiality

S - Úplné a pravdivé údaje o projektu nepodléhají ochraně podle zvláštních právních předpisů

Name of the periodical

SENSORS

ISSN

1424-8220

e-ISSN

1424-3210

Volume of the periodical

21

Issue of the periodical within the volume

16

Country of publishing house

CH - SWITZERLAND

Number of pages

22

Pages from-to

1-22

UT code for WoS article

000690139300001

EID of the result in the Scopus database

2-s2.0-85113136667