Multicasting Pinching Antenna Systems With LoS Blockage

TL;DR

This paper introduces an optimized multicasting PASS system using MM-based algorithms, demonstrating superior performance and computational efficiency in non-LoS environments compared to conventional systems.

Contribution

It develops a provably convergent MM-based algorithm for optimal PA placement in PASS for multicasting without requiring LoS, with two methods CSM and BSM.

Findings

BSM yields better computational complexity than CSM as users and PAs increase.

PASS outperforms conventional antenna systems in non-LoS environments.

Execution time with CSM is about 2.5 times that of BSM for 8 PAs and 25 users.

Abstract

Pinching-antenna systems (PASS) represent a promising customizable wireless access mechanism in high-frequency bands, enabled by dielectric waveguides and movable dielectric particles, called pinching antennas (PAs). In this work, we study optimal position allocation of PAs in PASS for multicasting in the downlink when a line-of-sight (LoS) link does not necessarily exist between all users and the PAs. The multicasting problem is solved by leveraging minorization-maximization (MM) principle to yield a provably convergent algorithm. In each run of the MM based procedure, we solve a convex surrogate problem using two methods called the candidate search method (CSM) and the bisection search method (BSM). With both BSM and CSM, we not only report superior performance of the multicasting PASS in non-LoS environments compared to conventional antenna systems (CAS), but also determine that BSM yields better overall computational complexity when the number of users and PAs increases. For example, we report that when we have 8 PAs and 25 users, the execution time with the CSM is approximately 2.5 times that with the BSM.