Asset Details
MbrlCatalogueTitleDetail
Do you wish to reserve the book?
Modeling Optimal Location Distribution for Deployment of Flying Base Stations as On-Demand Connectivity Enablers in Real-World Scenarios
by
Seda, Milos
, Hosek, Jiri
, Pokorny, Jiri
, Seda, Pavel
in
Control algorithms
/ Efficiency
/ FBS
/ flying base station
/ Heuristic
/ Infrastructure
/ Internet
/ location optimization
/ network coverage capacity
/ on-demand
/ Optimization
/ UAV base station
/ Unmanned aerial vehicles
2021
Hey, we have placed the reservation for you!
By the way, why not check out events that you can attend while you pick your title.
You are currently in the queue to collect this book. You will be notified once it is your turn to collect the book.
Oops! Something went wrong.
Looks like we were not able to place the reservation. Kindly try again later.
Are you sure you want to remove the book from the shelf?
Modeling Optimal Location Distribution for Deployment of Flying Base Stations as On-Demand Connectivity Enablers in Real-World Scenarios
by
Seda, Milos
, Hosek, Jiri
, Pokorny, Jiri
, Seda, Pavel
in
Control algorithms
/ Efficiency
/ FBS
/ flying base station
/ Heuristic
/ Infrastructure
/ Internet
/ location optimization
/ network coverage capacity
/ on-demand
/ Optimization
/ UAV base station
/ Unmanned aerial vehicles
2021
Oops! Something went wrong.
While trying to remove the title from your shelf something went wrong :( Kindly try again later!
Do you wish to request the book?
Modeling Optimal Location Distribution for Deployment of Flying Base Stations as On-Demand Connectivity Enablers in Real-World Scenarios
by
Seda, Milos
, Hosek, Jiri
, Pokorny, Jiri
, Seda, Pavel
in
Control algorithms
/ Efficiency
/ FBS
/ flying base station
/ Heuristic
/ Infrastructure
/ Internet
/ location optimization
/ network coverage capacity
/ on-demand
/ Optimization
/ UAV base station
/ Unmanned aerial vehicles
2021
Please be aware that the book you have requested cannot be checked out. If you would like to checkout this book, you can reserve another copy
We have requested the book for you!
Your request is successful and it will be processed during the Library working hours. Please check the status of your request in My Requests.
Oops! Something went wrong.
Looks like we were not able to place your request. Kindly try again later.
Modeling Optimal Location Distribution for Deployment of Flying Base Stations as On-Demand Connectivity Enablers in Real-World Scenarios
Journal Article
Modeling Optimal Location Distribution for Deployment of Flying Base Stations as On-Demand Connectivity Enablers in Real-World Scenarios
2021
Request Book From Autostore
and Choose the Collection Method
Overview
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.
Publisher
MDPI AG,MDPI
This website uses cookies to ensure you get the best experience on our website.