Search arXiv⌕ Search
Home/Archive/arXiv

arXiv · 2609.08042

Movable Antennas Enabled Wireless Powered Networks: Principles and Technologies

Zhendong Li·Yiran Zheng·Tianyu Li·Zhou Su·Wen Chen·Ying Wang
View original source ↗Read source document ↗Export metadata ↓

Abstract

As an emerging framework, movable antenna (MA)-enabled wireless powered networks (WPNs) have attracted growing attention. WPNs integrate wireless communication and energy transfer. MA can dynamically adjust the position of antenna units by introducing additional spatial degrees of freedom, so as to make full use of channel gain, optimize the effect of energy beamforming, and further improve the performance of WPNs. In this article, we first classify the implementations of MA, and review the fundamental principles of WPNs. We then highlight the key advantages of MA-enabled WPNs in enhancing wireless power transfer efficiency, realizing flexible and adaptive beamforming, and improving system robustness and interference resilience. Furthermore, four representative application scenarios and three key enabling technologies are discussed. A case study is also presented to show the improvement of energy harvesting performance brought by MA for WPNs. Finally, we discuss the challenges and future directions of MA-enabled WPNs, aiming to provide reference for future research and practice.

Explore related subjects

cs.NI

Keep this discovery

BibTeXRIS

Zhendong Li, Yiran Zheng, Tianyu Li, Zhou Su, Wen Chen, Ying Wang. 2026-09-07. Movable Antennas Enabled Wireless Powered Networks: Principles and Technologies. https://arxiv.org/abs/2609.08042

Cite the original work for its findings. Save a collection to share your selection of sources.

Discover connections

cs.NI subject

Connections use source metadata and explicit phrase matches, not verified experimental comparisons.

KEEP EXPLORING

Related papers

arXiv2026

AEGIS: Risk-Budgeted Online Scheduling for Resilient Continuous Edge Inference

Continuous edge inference requires sustained wireless and computing support across successive service instances. Under recurring channel degradation, transient edge overload, and multi-user contention, isolated deadline misses may accumulate into persistent service degradation. Existing schedulers mainly optimize instantaneous latency or per-timeslot utility and provide limited control over such cross-time effects. To address this issue, we propose AEGIS (Adaptive Exposure-Governed Inference Scheduling), a risk-budgeted online framework for service-level operational resilience. AEGIS regulates predicted deadline-risk exposure through dynamically replenished per-user risk budgets and establishes an explicit finite-horizon bound on cumulative admitted-risk exposure. One-step state estimation supports anticipatory delay and risk assessment, while the centralized bandwidth--computing allocation is transformed into an exact-potential formulation and solved through asynchronous coordinate updates. Simulation results demonstrate that AEGIS enhances timely-service continuity, contains persistent deadline violations, and improves post-stress recovery through adaptive cross-time risk regulation. Meanwhile, it effectively controls predicted-risk exposure while preserving competitive service performance, achieving a favorable balance between service resilience and risk control.

cs.NI↗
arXiv2026

Enhancing Network Resilience via Graph-Based Anomaly Detection in Sovereign Functions

Sovereign network functions, e.g., routing protocols, are becoming increasingly complex and susceptible to failures arising from protocol configuration anomalies and anomalous configurations. This paper interprets the protocol configuration anomaly detection problem as detection of structural inconsistencies of connected nodes and edges in a bipartite graph that captures both physical network entities and logical protocol states. This graph structural inconsistency detector (GSID) model is proposed to solve the problem efficiently. To handle the heterogeneous nature of protocol configuration parameters, GSID employs an adaptive configuration encoder (ACE) that dynamically selects encoding strategies per parameter to preserve fine-grained numerical discrepancies. To expose the subtle inconsistencies of connected nodes and edges in the bipartite graph, GSID uses an inconsistency dynamic attention (IDA) mechanism that scores edges by drawing asymmetric attentions from both ends, rule compliance from one end and route connectivity from the other. It is demonstrated experimentally that GSID outperforms state-of-the-art baselines by threefold in F1 score and by 23.2% in accuracy. Ablation studies validate the effectiveness of both the ACE and IDA modules. Tests on unseen network scales and real-world network topologies show the superior adaptability of our GSID, compared to the baselines.

cs.NI↗