Robust and Secure Blockage-Aware Pinching Antenna-assisted Wireless Communication

Ruotong Zhao, Shaokang Hu, Deepak Mishra, Derrick Wing Kwan NgarXiv 2026 · DOI

TL;DR

This paper introduces a novel "pinching antenna" (PA) system designed for robust and secure wireless communication, especially in challenging environments with blockages. By intelligently positioning PAs and managing their power, the system significantly boosts data rates and enhances security against eavesdroppers, outperforming traditional antenna systems.

What Problem Does This Paper Address?

The next generation of wireless networks (like 6G) demands higher data rates and greater reliability. Flexible antenna architectures, such as pinching antennas (PAs), offer a promising solution by allowing dynamic reconfiguration of the antenna's radiation pattern. However, existing research often makes overly optimistic assumptions, like perfect line-of-sight (LoS) connectivity and ideal channel state information (CSI). In reality, wireless environments are rife with blockages (buildings, trees) that disrupt LoS links and complicate CSI estimation. Furthermore, wireless transmissions are vulnerable to eavesdropping. This paper tackles the challenge of designing a PA system that is not only robust to these real-world blockages and imperfect CSI but also inherently secure against eavesdroppers. It aims to exploit the PA's flexibility to overcome these limitations, rather than being hindered by them.

Methods

The core of this work lies in a robust joint optimization framework. The authors formulate a problem to maximize the system's sum rate while ensuring strict secrecy constraints. This involves simultaneously optimizing:

  • Beamforming and Artificial Noise (AN) Covariance: How the base station (BS) directs signals and injects AN to confuse eavesdroppers.
  • PA Power-Ratio Allocation: How power is distributed among the PAs on each waveguide.
  • Continuous PA Positions: The precise physical locations of the PAs along the waveguides.

To handle the inherent complexity and non-convexity of this problem, they employ a Block Coordinate Descent (BCD) algorithm. This iterative approach breaks down the problem into smaller, manageable subproblems, optimizing different sets of variables in turn. Key techniques used include:

  • S-procedure and Majorization-Minimization (MM): Mathematical tools to handle complex constraints and approximate non-convex functions with convex ones.
  • Geometry-Aware Uncertainty Sets: A novel approach to model CSI errors for eavesdroppers, accounting for their position and orientation uncertainties, which is crucial for accurate performance analysis.
  • Two-Stage PA Positioning: A strategy that first determines coarse PA placements based on large-scale factors like path loss and blockages, and then refines these positions for fine-grained phase alignment.

Datasets

Not discussed in the paper. The evaluation is based on numerical simulations with randomly generated user locations, blockages, and CSI uncertainties.

Key Insights and Ideas

  • Blockages as a Double-Edged Sword: While blockages disrupt communication, they can be strategically exploited to shield legitimate users from eavesdroppers. The PA's flexible positioning allows it to leverage these natural shields.
  • PA Flexibility is Key: The ability to dynamically adjust PA positions and power ratios is crucial for adapting to changing environments and overcoming blockages, leading to significant performance gains over fixed-antenna systems.
  • Geometry Matters for CSI Uncertainty: Traditional CSI uncertainty models are too simplistic for distributed PA systems. A geometry-aware model that considers PA and eavesdropper positions and orientations is essential for accurate performance prediction.
  • Joint Optimization is Crucial: Optimizing beamforming, AN, PA power, and PA positions simultaneously is necessary to achieve robust and secure communication, as these factors are tightly coupled.

Key Results

  • Performance Gain: The proposed algorithm achieves a 4.7 dB improvement in sum rate compared to conventional fixed-antenna systems.
  • Robustness to Blockages: The performance gap between blockage-aware and blockage-free scenarios is significantly smaller for the proposed PA system than for fixed-antenna systems, demonstrating its resilience.
  • Security Enhancement: Adaptive PA positioning helps maintain LoS for legitimate users while disrupting eavesdropper channels, reducing the need for AN and improving secrecy.
  • CSI Uncertainty Impact: The proposed geometry-aware CSI uncertainty bound is shown to be much tighter and more accurate than existing linear bounds, especially under realistic conditions.
  • Scalability: The BCD algorithm demonstrates stable convergence and scalability for larger system configurations.

Limitations and Future Work

  • Theoretical Focus: The paper presents a theoretical framework and simulation-based results. Experimental validation and ray-tracing-based analysis are suggested for future work.
  • Static Blockages: The current model assumes static blockages. Future work could explore dynamic blockage scenarios.
  • Computational Complexity: While the BCD algorithm is efficient, the computational complexity still scales superlinearly with system dimensions, especially for larger systems. Further optimization of solvers and hardware acceleration could be explored.

Summary updated

BibTeX
@misc{zhao2026robust,
  author = {Ruotong Zhao and Shaokang Hu and Deepak Mishra and Derrick Wing Kwan Ng},
  title = {{Robust and Secure Blockage-Aware Pinching Antenna-assisted Wireless Communication}},
  year = {2026},
  eprint = {2601.06430},
  archivePrefix = {arXiv},
  url = {https://arxiv.org/abs/2601.06430},
}
Figure