UAV-Mounted Mobile Base Station Placement via Sparse Recovery

In order to deploy minimum number of unmanned aerial vehicle (UAV)-mounted mobile base stations (MBSs) to service all given ground terminals, this paper proposes an MBS placement based on sparse recovery (MBS-PBSR) algorithm. By exploiting the sparsity inherent in the differences between any two dedicated MBSs, the problem of UAV-mounted MBS placement could be formulated as an <inline-formula> <tex-math notation="LaTeX">$\ell _{0}$ </tex-math></inline-formula>-norm constrained optimization problem, which is then be solved by the reweighted <inline-formula> <tex-math notation="LaTeX">$\ell _{1}$ </tex-math></inline-formula>-norm method. Subsequently, the resulted solutions to the MBS placement are adjusted by the iterative redundant circle deletion algorithm, eventually leading to the redundant MBSs removal as much as possible. Simulation results demonstrate that our proposed MBS-PBSR algorithm works well with affordable computational complexity, and is nearly optimum in the sense of the number of deployed UAV-mounted MBSs.