Simulating uav’s movement for servicing user groups with a reference point in wireless networks
Khayrov, Emil M.; Polyakov, Nikita A.; Medvedeva, Ekaterina G.; Pokorny, Jiri; Gaidamaka, Yuliya V.; Hosek, Jiri (2020)
Khayrov, Emil M.
Polyakov, Nikita A.
Medvedeva, Ekaterina G.
Pokorny, Jiri
Gaidamaka, Yuliya V.
Hosek, Jiri
Teoksen toimittaja(t)
Galinina, Olga
Andreev, Sergey
Balandin, Sergey
Koucheryavy, Yevgeni
Springer
2020
This publication is copyrighted. You may download, display and print it for Your own personal use. Commercial use is prohibited
Julkaisun pysyvä osoite on
https://urn.fi/URN:NBN:fi:tuni-202308147577
https://urn.fi/URN:NBN:fi:tuni-202308147577
Kuvaus
Peer reviewed
Tiivistelmä
Current cellular networks face outbreaks of an extremely high demand for communication capacity and coverage during the mass events. This article discusses a scenario with events in remote areas. It is expected that the unmanned aerial vehicles (UAVs) equipped with the directional antennas will become one of the key components of these networks and provide the solution. It attracts considerable attention in basic and applied research and commerce for its rapid deployment and flexible extension of the users coverage, mobility of UAV access points (APs) and a higher probability of line-of-sight channels. However, it also creates new issues to be addressed. The critical task is to maximize coverage area with the required quality of service to provide the connection for the maximum number of users. At the same time, analysis of the performance indicators of such networks, taking into account the mobility of both access points and users, is challenging. One of the key quality indicators is the probability of coverage. The aim of this work is to consider two drones’ mobility models to cover users with small cells, and to solve the problem of maximizing coverage probability using the simulation. With a given threshold signal-to-noise ratio, it is shown that using the particle swarm method as an adaptive navigation algorithm allows achieving higher coverage probability values as opposed to k-means algorithm. A comparative analysis of adaptive navigation is presented.
Kokoelmat
- TUNICRIS-julkaisut [19676]