Searcharxiv⌕ Search

arXiv subjects

Yunseob Tae

Publications and source records attributed to Yunseob Tae.

4 recordsLinked to original sources

When to Move: Online Repositioning of Movable Antenna Arrays Under a Long-Term Actuation Energy Budget

Movable antenna (MA) arrays improve multiuser throughput by repositioning their elements, but mechanical movement reduces transmission time and consumes actuation energy. Changes in user configurations create nonuniform demand for repositioning over time, while each movement determines which positions are reachable in subsequent slots. Thus, online control must decide when to spend a limited actuation-energy budget, not only where to position the antennas. We formulate causal effective-throughput maximization under displacement-dependent movement delay, inter-slot reachability, and a long-term average actuation-energy constraint. We propose Lyapunov-based online movable-antenna repositioning (LOMA), which adjusts the price of movement through a virtual queue and solves the resulting nonconvex position problem via proximal minorization--maximization, accounting for nonsmooth movement delay and promoting sparse antenna updates. We establish monotone ascent of the smoothed per-slot objective, a finite-horizon sample-path energy bound, almost-sure long-term budget feasibility under a Gaussian fading model with bounded large-scale gains, and a state-matched throughput comparison separating temporal energy allocation from per-slot optimization error. Simulations show that LOMA concentrates actuation after intermittent user changes and improves effective throughput over optimized fixed arrays and a per-slot-budget counterpart, while continuous channel drift favors more frequent incremental repositioning. Additional simulations with pilot-based channel estimates in sparse millimeter-wave channels show that LOMA retains most of the throughput benefits of online repositioning while operating near its prescribed long-term actuation-energy budget.

eess.SP↗

CSI-Free Positioning of Movable Antennas for IoT Networks: A Compositional Kernelized Bandit

Movable antenna (MA) arrays reshape the propagation channel by mechanically changing the element positions, which suits Internet-of-Things access points whose devices cannot adapt on their own. Existing position optimization assumes the channel is known at every candidate configuration. In practice a configuration can be evaluated only after the array has moved there, over several slots limited by the actuator speed, during which the channel changes. We formulate the positioning of M MAs serving K < M devices without channel state information as a nonstationary kernelized bandit over the joint configuration space, driven by a single scalar rate feedback per slot under a reachability constraint and an actuation-energy cost. Since the information gain of a standard kernel grows exponentially with M , and the multiuser sum rate depends on the positions through a sum of per-antenna terms, we design a compositional kernel that retains interactions up to antenna pairs. On this kernel we propose CoMoveUCB, which selects a target configuration over the whole feasible set by coordinate ascent and retains it under a persistence rule. We prove sublinear dynamic regret with a polynomial dependence on M . Simulations show that CoMoveUCB outperforms fixed, measure-then-optimize, and reachability-confined benchmarks across loadings, confirming the value of repositioning an MA array under realistic actuation limits.

eess.SP↗

Positioning a Movable Antenna Without CSI: A Kernelized Bandit Under Costly Movement

Movable antenna (MA) systems reconfigure the wireless channel by repositioning the antenna within a confined region. The position optimization behind this capability has been studied under the premise that the channel at every candidate position is known. However, acquiring that knowledge is costly: a position can be measured only after the antenna has moved there, which takes many slots at the speed of the actuator, and the channel drifts meanwhile. We formulate MA positioning as a non-stationary kernelized bandit with a reachability constraint, in which exploration, tracking, and the reward lost in transit are coupled through a single physical action. We propose MoveUCB, which addresses the reachability constraint through a global target search, a persistence rule that holds the target across slots, and a transit-aware movement cost term. We prove that MoveUCB attains sublinear dynamic regret under the standard variation-budget condition of non-stationary bandits alone, with the physical parameters entering only through constants. Simulations against a dynamic-programming oracle and movement-unaware baselines show that MoveUCB attains the lowest regret with about half the travel of the closest baseline that moves.

eess.SP↗

Online Movable Antenna Repositioning Under Movement Delay and a Long-Term Energy Budget

Movable antenna (MA) systems improve the channel by repositioning antennas, but each repositioning interrupts data transmission for a time set by the largest displacement and consumes actuator energy that accumulates over all displacements. Existing designs optimize the positions within a single transmission block, whereas the movement energy is limited over the long term and the positions chosen in one slot constrain those reachable in the next. We study online throughput maximization under the movement delay and a long-term energy budget. Using the Lyapunov drift-plus-penalty framework, we convert the long-term problem into per-slot problems and solve each by a proximal minorization-maximization algorithm that requires no channel statistics and keeps an antenna stationary whenever its relocation is not worth the energy. We prove that the budget is met for every channel realization and that the algorithm attains, within a controllable penalty, the throughput gain of reallocating the budget over time. Simulations show that this reallocation improves the throughput over imposing the budget slot by slot when the demand for repositioning is concentrated in time, whereas the latter, supported by the same solver, is preferable when the channel varies continuously, at the cost of an order of magnitude more antenna actuation.

eess.SP↗