Table of Contents
Fetching ...

Environment-Aware Network-Level Design of Generalized Pinching-Antenna Systems--Part II: Geometry-Aware Case

Yanqing Xu, Zhiguo Ding, Xiu Yin Zhang, Trung Q. Duong, Tsung-Hui Chang

TL;DR

An environment-aware network-level design framework for generalized pinching-antenna systems to overcome the limitations of conventional link-level optimization, which is tightly coupled to instantaneous user geometry and thus sensitive to user mobility and localization errors is developed.

Abstract

This two-part paper aims to develop an environment-aware network-level design framework for generalized pinching-antenna systems to overcome the limitations of conventional link-level optimization, which is tightly coupled to instantaneous user geometry and thus sensitive to user mobility and localization errors. Part I investigates the traffic-aware case, where user presence is characterized statistically by a spatial traffic map and deployments are optimized using traffic-aware network-level metrics. Part II complements Part I by developing geometry-aware, blockage-aware network optimization for pinching-antenna systems in obstacle-rich environments. We introduce a grid-level average signal-to-noise (SNR) model with a deterministic LoS visibility indicator and a discrete activation architecture, where the geometry-dependent terms are computed offline in advance. Building on this model, we formulate two network-level activation problems: (i) average-SNR-threshold coverage maximization and (ii) fairness-oriented worst-grid average-SNR maximization. On the algorithmic side, we prove the coverage problem is NP-hard and derive an equivalent mix-integer linear programming reformulation through binary coverage variables and linear SNR linking constraints. To achieve scalability, we further develop a structure-exploiting coordinate-ascent method that updates one waveguide at a time using precomputed per-candidate SNR contributions. For the worst-grid objective, we adopt an epigraph reformulation and leverage the resulting monotone feasibility in the target SNR, enabling an efficient bisection-based solver with low-complexity feasibility checks over the discrete candidate set. Simulations results validate the proposed designs and quantify their gains under different environments and system parameters.

Environment-Aware Network-Level Design of Generalized Pinching-Antenna Systems--Part II: Geometry-Aware Case

TL;DR

An environment-aware network-level design framework for generalized pinching-antenna systems to overcome the limitations of conventional link-level optimization, which is tightly coupled to instantaneous user geometry and thus sensitive to user mobility and localization errors is developed.

Abstract

This two-part paper aims to develop an environment-aware network-level design framework for generalized pinching-antenna systems to overcome the limitations of conventional link-level optimization, which is tightly coupled to instantaneous user geometry and thus sensitive to user mobility and localization errors. Part I investigates the traffic-aware case, where user presence is characterized statistically by a spatial traffic map and deployments are optimized using traffic-aware network-level metrics. Part II complements Part I by developing geometry-aware, blockage-aware network optimization for pinching-antenna systems in obstacle-rich environments. We introduce a grid-level average signal-to-noise (SNR) model with a deterministic LoS visibility indicator and a discrete activation architecture, where the geometry-dependent terms are computed offline in advance. Building on this model, we formulate two network-level activation problems: (i) average-SNR-threshold coverage maximization and (ii) fairness-oriented worst-grid average-SNR maximization. On the algorithmic side, we prove the coverage problem is NP-hard and derive an equivalent mix-integer linear programming reformulation through binary coverage variables and linear SNR linking constraints. To achieve scalability, we further develop a structure-exploiting coordinate-ascent method that updates one waveguide at a time using precomputed per-candidate SNR contributions. For the worst-grid objective, we adopt an epigraph reformulation and leverage the resulting monotone feasibility in the target SNR, enabling an efficient bisection-based solver with low-complexity feasibility checks over the discrete candidate set. Simulations results validate the proposed designs and quantify their gains under different environments and system parameters.
Paper Structure (21 sections, 4 theorems, 50 equations, 7 figures, 2 tables)

This paper contains 21 sections, 4 theorems, 50 equations, 7 figures, 2 tables.

Key Result

Lemma 1

Given an activation matrix $\mathbf{A}$, for grid $(u,v)\in\Omega$, the per-grid average received SNR is given by

Figures (7)

  • Figure 1: Illustration of the considered indoor environment and antenna architectures: (a.1) three-dimentional environment geometry with blockages and a fixed BS at the center; (a.2) corresponding top-view received power map for the conventional fixed-antenna system; (b) pinching-antenna system with ceiling waveguides, candidate pinching antenna (PA) positions, and selected active PAs coordinated by a central processing unit (CPU).
  • Figure 2: Top-view of the considered three-dimensional geometry-aware environment with average received SNR maps for two representative pinching-antenna deployments.
  • Figure 3: Average-SNR-threshold coverage probability versus the SNR threshold $\gamma_{\mathrm{th}}$ with $N = 4$ and $M = 10$.
  • Figure 4: Average-SNR-threshold coverage probability versus the SNR threshold $\gamma_{\mathrm{th}}$ with $N = 8$ and $M = 20$.
  • Figure 5: Sensitivity of the average-SNR-threshold coverage probability to the NLoS power parameter $\mu^2$.
  • ...and 2 more figures

Theorems & Definitions (5)

  • Lemma 1
  • Definition 1: SNR-threshold coverage
  • Lemma 2
  • Proposition 1
  • Lemma 3