Radio-Map-Based Uav Placement Design For Uav-Assisted Relaying Networks
2021 (engelsk)Inngår i: 2021 IEEE Statistical Signal Processing Workshop (Ssp), Institute of Electrical and Electronics Engineers (IEEE) , 2021, s. 286-290Konferansepaper, Publicerat paper (Fagfellevurdert)
Abstract [en]
This paper studies a network with multiple unmanned aerial vehicle (UAV) relays assisting the wireless communication between a base station (BS) and ground users (GUs). All the UAV relays hover at a fixed altitude and each provides connections to a group of GUs. For the first time, the radio-map-based design is considered in UAV-assisted relaying networks, where the radio maps are based on the geographic layout in reality and presenting the realistic channel pathloss. By jointly designing the UAV placement and user assignment, we aim at maximizing the minimum throughput among all GUs in the network. As the radio maps rely on the real layout in the environment, the pathloss is neither convex nor continuous in the location (coordinates), which makes the related designs be highly difficult to analyze. Thus, we propose a particle swarm optimization (PSO)-based design for the problem. We first derive the optimal user assignment scheme and then derive an equivalent reformulation of the problem. Finally, the UAV placement is optimized by deploying PSO technologies, providing an efficient system performance. Via simulation, the performance advantages of the proposed design are confirmed.
sted, utgiver, år, opplag, sider
Institute of Electrical and Electronics Engineers (IEEE) , 2021. s. 286-290
Emneord [en]
radio map, UAV placement design, relaying networks, user assignment, particle swarm optimization (PSO)
HSV kategori
Identifikatorer
URN: urn:nbn:se:kth:diva-306807DOI: 10.1109/SSP49050.2021.9513834ISI: 000722246500058Scopus ID: 2-s2.0-85113420823OAI: oai:DiVA.org:kth-306807DiVA, id: diva2:1623724
Konferanse
IEEE Statistical Signal Processing Workshop (SSP), JUL 11-14, 2021, ELECTR NETWORK
Merknad
Part of proceedings: ISBN 978-1-7281-5767-2, QC 20230118
2021-12-302021-12-302023-01-18bibliografisk kontrollert