Papers › Non-cooperative Aerial Base Station Placement via Stochastic Optimization
Non-cooperative Aerial Base Station Placement via Stochastic Optimization
Autonomous unmanned aerial vehicles (UAVs) with on-board base station equipment can potentially provide connectivity in areas where the terrestrial infrastructure is overloaded, damaged, or absent. Use cases comprise emergency response, wildfire suppression, surveillance, and cellular communications in crowded events to name a few. A central problem to enable this technology is to place such aerial base stations (AirBSs) in locations that approximately optimize the relevant communication metrics. To alleviate the limitations of existing algorithms, which require intensive and reliable communications among AirBSs or between the AirBSs and a central controller, this paper leverages stochastic optimization and machine learning techniques to put forth an adaptive and decentralized algorithm for AirBS placement without inter-AirBS cooperation or communication. The approach relies on a smart design of the network utility function and on a stochastic gradient ascent iteration that can be evaluated with information available in practical scenarios. To complement the theoretical convergence properties, a simulation study corroborates the effectiveness of the proposed scheme.
Code
Repository list and official/mentioned flags are the archive's, frozen 2025-07-28. Reachability, where shown, is from one Syntology probe window (2026-09-16 to 2026-09-18); repositories not probed show nothing. GitHub stars are not tracked.
Code Syntology ran Syntology
Not run by Syntology. Nothing on this page verifies that the listed code works.
Tasks
Results from the paper archive 2025-07-28
No leaderboard rows for this paper in the archive.
Report a problem or propose a change · a person checks every report against the paper or source before anything changes; decisions are listed on /corrections