This paper proposes a novel IRS-aided framework for secure sensing, which aims to minimize the worst-case Cram´er-Rao Bound (WC-CRB) within an entire surveillance area by optimizing the IRS reflecting beamforming, enabling reliable and secure localization of arbitrary and unknown targets. Specifically, we first establish a general IRS-aided localization coverage model and derive the closed-form expression for the CRB of an arbitrary point, which reveals the relationship between the localization error bound and the Fisher information of the angle of arrival (AOA), angle of departure (AOD) and delay. To solve this challenging min-max optimization problem, we design efficient algorithms for different area types. For sector area, we first represent the Fisher information as trigonometric polynomials, then construct the WC-CRB coverage constraint as a non-negativity problem of these polynomials, and finally approximate it as an efficiently solvable semidefinite program (SDP). For the more challenging case of arbitrarily shaped area, we propose a two-tiered solution comprising a low-complexity heuristic algorithm based on geometric approximation and a high-performance detailed design that accurately solves the problem by decomposing the irregular boundary into multiple continuous segments. Numerical simulations validate the superiority of the proposed framework, demonstrating that our designs significantly outperform various benchmark schemes in terms of robustness and performance uniformity. The results show that the framework not only effectively reduces the WC-CRB but also achieves a highly uniform performance coverage across the entire area, providing a reliable and efficient solution for practical localization security applications.

This paper investigates a movable antenna (MA)-enabled wireless-powered communication network (WPCN), where multiple wireless devices (WDs) first harvest energy from the downlink signal broadcast by a hybrid access point (HAP) and then transmit information in the uplink using non-orthogonal multiple access. Unlike conventional WPCNs with fixed-position antennas (FPAs), this MA-enabled WPCN allows the MAs at the HAP and the WDs to adjust their positions twice: once before downlink wireless power transfer and once before uplink wireless information transmission. Our goal is to maximize the system sum throughput by jointly optimizing the MA positions, the time allocation, and the uplink power allocation. Considering the characteristics of antenna movement, we explore both continuous and discrete positioning designs, which, after formulation, are found to be non-convex optimization problems. Before tackling these problems, we rigorously prove that using identical MA positions for both downlink and uplink is the optimal strategy in both scenarios, thereby greatly simplifying the problems and enabling easier practical implementation of the system. We then propose alternating optimization-based algorithms to obtain suboptimal solutions for the resulting simplified problems. Simulation results show that: 1) the proposed continuous MA scheme can enhance the sum throughput by up to 395.71% compared to the benchmark with FPAs, even when additional compensation transmission time is provided to the latter; 2) a step size of one-quarter wavelength for the MA motion driver is generally sufficient for the proposed discrete MA scheme to achieve over 80% of the sum throughput performance of the continuous MA scheme; 3) when each moving region is large enough to include multiple optimal positions for the continuous MA scheme, the discrete MA scheme can achieve comparable sum throughput without requiring an excessively small step size.

This paper investigates an intelligent reflecting surface (IRS)-aided movable antenna (MA) system, where multiple IRSs cooperate with a multi-MA base station to extend wireless coverage to multiple target areas. The objective is to maximize the worst-case signal-to-noise ratio (SNR) across all locations within these areas through joint optimization of MA positions, IRS phase shifts, and transmit beamforming. To achieve this while balancing the performance-cost trade-off, we propose three coverage-enhancement schemes: thearea-adaptive MA-IRSscheme, where both the MA positions and IRS phase shifts are adaptively adjusted for each target area; thearea-adaptive MA-staIRSscheme, where only the MA positions are adjusted, while the IRS phase shifts remain unchanged after initial configuration (withstaIRSdenoting static IRSs); and theshared MA-staIRSscheme, where a common MA placement and static IRS configuration are applied across all areas. These schemes lead to challenging non-convex optimization problems with implicit objective functions, which are difficult to solve optimally. To address these problems, we propose a general algorithmic framework that can be applied to solve each problem efficiently albeit suboptimally. Simulation results demonstrate that: 1) the proposed MA-based schemes consistently outperform their fixed-position antenna (FPA)-based counterparts under both area-adaptive and static IRS configurations, with the area-adaptive MA-IRS scheme achieving the highest worst-case SNR; 2) as transmit antennas are typically far fewer than IRS elements, the area-adaptive MA-staIRS scheme may underperform the baseline FPA scheme with area-adaptive IRSs in terms of the worst-case SNR, but a modest increase in antenna number can reverse this trend; 3) under a fixed total cost, the optimal MA-to-IRS-element ratio for the worst-case SNR maximization is empirically found to be proportional to the reciprocal of their unit cost ratio.

Conventional antenna arrays rely primarily on digital beamforming for spatial control. While adding more elements can narrow beamwidth and suppress interference, such scaling incurs prohibitive hardware and power costs. Rotatable antennas (RAs), which allow mechanical or electronic adjustment of element orientations, introduce a new degree of freedom to exploit spatial flexibility without enlarging the array. By dynamically optimizing orientations, RAs can substantially improve desired link alignment and interference suppression. This paper investigates RA-enabled multiple-input single-output (MISO) interference channels under co-channel spectrum sharing and formulates a weighted sum-rate maximization problem that jointly optimizes transmit beamforming and antenna orientations. To tackle this nonconvex problem, we develop an alternating optimization (AO) framework that integrates weighted minimum mean-square error (WMMSE)-based beamforming with Frank-Wolfe-based orientation updates. To reduce complexity, we further study orientation optimization under maximum-ratio transmission (MRT) and zero-forcing (ZF) beamforming schemes. For finite-resolution actuators, we construct spherical Fibonacci codebooks and design a cross-entropy method (CEM)-based algorithm for discrete orientation selection. Simulations show that integrating RAs with conventional beamforming markedly increases weighted sum-rate, with gains rising with element directivity. Under discrete orientation control, the proposed CEM algorithm consistently outperforms the nearest-projection baseline.

In this paper, we model the minimum achievable throughput within a transmission block of restricted duration and aim to maximize it in movable antenna (MA)-enabled multiuser downlink communications. Particularly, we account for the antenna movement delay caused by mechanical movement, which has not been fully considered in previous studies, and reveal the trade-off between the delay and signal-to-interference-plus-noise ratio at users. To this end, we first consider a single-user setup to analyze the necessity of antenna movement. By quantizing the virtual angles of arrival, we derive the requisite region size for antenna moving, design the initial MA position, and elucidate the relationship between quantization resolution and moving region size. Furthermore, an efficient algorithm is developed to optimize MA position via successive convex approximation, which is subsequently extended to the general multiuser setup. Numerical results demonstrate that the proposed algorithms outperform fixed-position antenna schemes and existing ones without consideration of movement delay. Additionally, our algorithms exhibit excellent adaptability and stability across various transmission block durations and moving region sizes, and are robust to different antenna moving speeds. This allows the hardware cost of MA-aided systems to be reduced by employing low rotational speed motors.

Movable antenna (MA) is an emerging technology that utilizes localized antenna movement to achieve better channel conditions for enhancing communication performance. In this paper, we study the MA-enhanced multicast transmission from a base station equipped with multiple MAs to multiple groups of single-MA users. Our goal is to maximize the minimum weighted signal-to-interference-plus-noise ratio (SINR) among all the users by jointly optimizing the position of each transmit/receive MA and the transmit beamforming. To tackle this challenging problem, we first consider the single-group scenario and propose an efficient algorithm based on the techniques of alternating optimization and successive convex approximation. Particularly, when optimizing transmit or receive MA positions, we construct a concave lower bound for the signal-to-noise ratio (SNR) of each user using only the second-order Taylor expansion, which simplifies the problem-solving process compared to the existing two-step approximation method. The proposed design is then extended to the general multi-group scenario. Simulation results show that the proposed algorithm converges faster than the existing two-step approximation method, achieving a 3.4% enhancement in max-min SNR. Moreover, it can improve the max-min SNR/SINR by up to 22.5%, 181.7%, and 343.9% compared to benchmarks employing only receive MAs, only transmit MAs, and both transmit and receive FPAs, respectively.

This paper studies an intelligent reflecting surface (IRS)-aided multi-antenna simultaneous wireless information and power transfer (SWIPT) system where anM-antenna access point (AP) servesKsingle-antenna information users (IUs) andJsingle-antenna energy users (EUs) with the aid of an IRS with phase errors. We explicitly concentrate on overloaded scenarios whereK+J>MandK≥M. Our goal is to maximize the minimum throughput among all the IUs by optimizing the allocation of resources (including time, transmit beamforming at the AP, and reflect beamforming at the IRS), while guaranteeing the minimum amount of harvested energy at each EU. Towards this goal, we propose two user grouping (UG) schemes, namely, the non-overlapping UG scheme and the overlapping UG scheme, where the difference lies in whether identical IUs can exist in multiple groups. Different IU groups are served in orthogonal time dimensions, while the IUs in the same group are served simultaneously with all the EUs via spatial multiplexing. The two problems corresponding to the two UG schemes are mixed-integer non-convex optimization problems and difficult to solve optimally. We first provide a method to check the feasibility of these two problems, and then propose efficient algorithms for them based on the big-M formulation, the penalty method, the block coordinate descent, and the successive convex approximation. Simulation results show that: 1) the non-robust counterparts of the proposed robust designs are unsuitable for practical IRS-aided SWIPT systems with phase errors since the energy harvesting constraints cannot be satisfied; 2) the proposed UG strategies can significantly improve the max-min throughput over the benchmark schemes without UG or adopting random UG; 3) the overlapping UG scheme performs much better than its non-overlapping counterpart when the absolute difference betweenKandMis small and the EH constraints are not stringent.

This paper considers intelligent reflecting surface (IRS)-aided simultaneous wireless information and power transfer (SWIPT) in a multi-user multiple-input single-output (MISO) interference channel (IFC), where multiple transmitters (Txs) serve their corresponding receivers (Rxs) in a shared spectrum with the aid of IRSs. Our goal is to maximize the sum rate of the Rxs by jointly optimizing the transmit covariance matrices at the Txs, the phase shifts at the IRSs, and the resource allocation subject to the individual energy harvesting (EH) constraints at the Rxs. Towards this goal and based on the well-known power splitting (PS) and time switching (TS) receiver structures, we consider three practical transmission schemes, namely the IRS-aided hybrid TS-PS scheme, the IRS-aided time-division multiple access (TDMA) scheme, and the IRS-aided TDMA-D scheme. The latter two schemes differ in whether the Txs employ deterministic energy signals known to all the Rxs. Despite the non-convexity of the three optimization problems corresponding to the three transmission schemes, we develop computationally efficient algorithms to address them suboptimally, respectively, by capitalizing on the techniques of alternating optimization (AO) and successive convex approximation (SCA). Moreover, we conceive feasibility checking methods for these problems, based on which the initial points for the proposed algorithms are constructed. Simulation results demonstrate that our proposed IRS-aided schemes significantly outperform their counterparts without IRSs in terms of sum rate and maximum EH requirements that can be satisfied under various setups. In addition, the IRS-aided hybrid TS-PS scheme generally achieves the best sum rate performance among the three proposed IRS-aided schemes, and if not, increasing the number of IRS elements can always accomplish it.

Active intelligent reflecting surface (IRS) has been recently proposed to alleviate the product path loss attenuation inherent in the IRS-aided cascaded channel. In this paper, we study an active IRS-aided simultaneous wireless information and power transfer (SWIPT) system. Specifically, an active IRS is deployed to assist a multi-antenna access point (AP) to convey information and energy simultaneously to multiple single-antenna information users (IUs) and energy users (EUs). Two joint transmit and reflect beamforming optimization problems are investigated with different practical objectives. The first problem maximizes the weighted sum-power harvested by the EUs subject to individual signal-to-interference-plus-noise ratio (SINR) constraints at the IUs, while the second problem maximizes the weighted sum-rate of the IUs subject to individual energy harvesting (EH) constraints at the EUs. The optimization problems are non-convex and difficult to solve optimally. To tackle these two problems, we first rigorously prove that dedicated energy beams are not required for their corresponding semidefinite relaxation (SDR) reformulations and the SDR is tight for the first problem, thus greatly simplifying the AP precoding design. Then, by capitalizing on the techniques of alternating optimization (AO), SDR, and successive convex approximation (SCA), computationally efficient algorithms are developed to obtain suboptimal solutions of the resulting optimization problems. Simulation results demonstrate that, given the same total system power budget, significant performance gains in terms of operating range of wireless power transfer (WPT), total harvested energy, as well as achievable rate can be obtained by our proposed designs over benchmark schemes (especially the one adopting a passive IRS). Moreover, it is advisable to deploy an active IRS in the proximity of the users for the effective operation of WPT/SWIPT.