{"ID":2898062,"CreatedAt":"2026-06-01T04:54:23.091178241Z","UpdatedAt":"2026-06-01T04:54:23.091178241Z","DeletedAt":null,"paper_url":"https://arxiv.org/abs/2507.03918","arxiv_id":"2507.03918","title":"FollowSpot: Enhancing Wireless Communications via Movable Ceiling-Mounted Metasurfaces","abstract":"This paper studies the optimal placement of ceiling-mounted metasurfaces (MTSs) to help focus the wireless signal beam onto the target receiver, as inspired by the theatre spotlight. We assume that a total of $M$ MTSs are deployed, and that there are $L$ possible positions for each MTS. The resulting signal-to-noise (SNR) maximization problem is difficult to tackle directly because of the coupling between the placement decisions of the different MTSs. Mathematically, we are faced with a nonlinear discrete optimization problem with $L^M$ possible solutions. A remarkable result shown in this paper is that the above challenging problem can be efficiently solved within $O(ML^2\\log(ML))$ time. There are two key steps in developing the proposed algorithm. First, we successfully decouple the placement variables of different MTSs by introducing a continuous auxiliary variable $μ$; the discrete primal variables are now easy to optimize when $μ$ is held fixed, but the optimization problem of $μ$ is nonconvex. Second, we show that the optimization of continuous $μ$ can be recast into a discrete optimization problem with only $LM$ possible solutions, so the optimal $μ$ can now be readily obtained. Numerical results show that the proposed algorithm can not only guarantee a global optimum but also reach the optimal solution efficiently.","short_abstract":"This paper studies the optimal placement of ceiling-mounted metasurfaces (MTSs) to help focus the wireless signal beam onto the target receiver, as inspired by the theatre spotlight. We assume that a total of $M$ MTSs are deployed, and that there are $L$ possible positions for each MTS. The resulting signal-to-noise (S...","url_abs":"https://arxiv.org/abs/2507.03918","url_pdf":"https://arxiv.org/pdf/2507.03918v2","authors":"[\"Wenhai Lai\",\"Kaiming Shen\",\"Rui Zhang\"]","published":"2025-07-05T06:55:27Z","proceeding":"cs.IT","tasks":"[\"cs.IT\",\"eess.SP\"]","methods":"[]","has_code":false}