Pinching-Antenna Systems: From Antenna Placement to Antenna Roaming

Daniel K. C. So; Kaidi Wang; Zhiguo Ding

REVIEW 3 major objections 4 minor 36 references

Pinching-Antenna Systems: From Antenna Placement to Antenna Roaming

T0 review · 3 major / 4 minor · reviewed 2026-08-14 · deepseek-v4-flash

Challenge this review Re-run · record.json Download PDF Read on arXiv ↗ Review JSON

Pith's one-line read A pinching antenna that serves users while continuously moving can outperform conventional stop-and-serve placement under finite movement speed.

desk verdict Useful, mostly sound pinching-antenna paper whose headline roaming-vs-placement claim is skewed by unequal time allocation; needs a symmetric benchmark before the central comparison is credible. read the letter →

arxiv 2608.10136 v1 pith:GRTVERVV submitted 2026-08-10 eess.SP

Kaidi Wang , Daniel K. C. So , Zhiguo Ding This is my paper · ORCID

classification eess.SP

keywords pinching-antennasystemsantennaroamingplacementfinitemovementspeedsumratemaximizationdynamicprogrammingservice-intervalpartitionsingle-crossingproperty

verification ladder T0 review T1 audit T2 compute T3 formal

The pith

A machine-rendered reading of the paper's core claim, the machinery that carries it, and where it could break.

The reading

This paper asks what happens to a pinching-antenna system—a radiating point formed by attaching a dielectric particle to a waveguide—when repositioning the antenna takes real time. Conventional antenna placement assumes the antenna can jump instantly between optimized service points; under a finite movement speed, every stop eats into the transmission slot. The paper proposes antenna roaming, in which the antenna glides continuously along the waveguide and serves each user over a spatial interval instead of at a point, and it builds a common cycle-duration model to compare the two fairly. The central result is an exact decomposition of the sum-rate difference between the two modes into a gain from transmission time and a loss from spatially averaged channel quality. A sympathetic reader cares because the decomposition turns a hardware timing nuisance into a design variable: roaming avoids positioning overhead and, in the paper's simulations, approaches or even beats ideal infinite-speed placement when repositioning overhead is large or channel-rate curves are flat.

What carries the argument

The central object is the unified cycle-duration comparison embodied in Proposition 1's decomposition (Eq. (17)), which rewrites the sum-rate difference between roaming and placement so that the first term captures uninterrupted transmission time and the second captures the channel-quality loss from spatial averaging. The supporting mechanism is the free-space channel power gain $|h_n(x)|^2 = \eta^2/((x-x_n)^2+y_n^2+d^2)$, which makes each user's rate function single-peaked at the user's projection $x_n$ and gives any two users at most one rate intersection (Lemma 1). That single-crossing property is what lets the paper describe the unconstrained optimal roaming partition in closed structural form: assign each antenna position to the user with the highest instantaneous rate, with boundaries at rate-function intersections.

What would settle it

Measure the instantaneous rate functions of two users along a real dielectric waveguide with the antenna moving at constant speed. If the two curves cross more than once (e.g., under multipath or in-waveguide attenuation), Lemma 1's single-crossing property is false and the predicted optimal partition boundaries will not coincide with rate intersections. Alternatively, simulate the same system with realistic acceleration and deceleration phases: if the sum-rate gap between roaming and placement deviates from Proposition 1's constant-speed prediction, the exact decomposition's dependence on the speed model is exposed.

Watch

Extended reading notes

Core claim

The paper's central claim is that, when the pinching antenna moves at a finite speed, operating it in a roaming mode—serving users continuously as it slides along the waveguide—can outperform the conventional stop-at-a-service-point placement mode, because the time lost to repositioning outweighs the loss from averaging the channel over an interval. The formal engine is an exact identity (Proposition 1, Eq. (17)) splitting the sum-rate difference between the two modes into an effective-transmission-time term and a spatially averaged channel-quality term; under a second-order approximation near each user's projection, the channel term becomes a function of squared distance from the projection and of interval length (Proposition 2). For the unconstrained roaming problem, the paper proves a single-crossing property of the instantaneous rate functions (Lemma 1) and characterizes the optimal service-interval partition as assigning every antenna position to the currently strongest user, with boundaries at rate-function intersections (Proposition 3). Both rate-maximization problems are solved by dynamic programming over discretized positions, and simulations show that DP-optimized roaming approaches, and for wide service regions exceeds, the sum rate of ideal infinite-speed placement.

Load-bearing premise

The load-bearing premise is the pure free-space, constant-speed channel model: each user's rate curve is single-peaked and any two curves cross at most once, and antenna position maps linearly to time, so the optimal-interval structure and exact gain decomposition depend on this idealized geometry; if in-waveguide loss, reflections, fading, or acceleration break these, the derived structure can fail.

Editorial extensions

If this is right

Roaming is a viable alternative whenever repositioning overhead is non-negligible: DP-based roaming approaches ideal infinite-speed placement and, for wide service regions, exceeds it (Figs. 3 and 5).
The optimal unconstrained roaming partition has a simple rule: serve, at each antenna position, the user with the highest instantaneous rate; boundaries between users sit at intersections of their rate curves (Proposition 3).
Longer waveguides favor roaming because placement pays both repositioning time and degrading channel quality, whereas roaming only pays channel degradation (Fig. 4).
Because roaming's average rate does not depend on cycle duration $T$ (the spatial normalization $1/D_x$ cancels the temporal one), its performance is cycle-duration independent, unlike finite-speed placement whose rate grows with $T$ (Fig. 6).
The DP algorithms have $O(NK^2)$ worst-case complexity over $K$ candidate positions and are globally optimal for the discretized problems, so the tradeoff can be optimized in practice.

Reading between the lines

Editorial extensions of the paper, not claims the author makes directly.

Editorial inference: the same stop-and-serve versus move-and-serve tradeoff should arise in other reconfigurable-antenna architectures whose repositioning is finite-speed, so Proposition 1's decomposition is a candidate general design principle beyond pinching antennas.
Editorial inference: the single-crossing structure means the unconstrained roaming partition is a kind of weighted Voronoi partition in the coordinate $x$; for the free-space model, boundaries solve a quadratic equation in $x$, so the optimal intervals can be computed in closed form rather than by DP, at least when QoS constraints are inactive.
Testable extension: if movement energy or mechanical wear is counted, roaming's continuous actuation may offset its time gain; a hybrid mode that roams through low-rate regions and pauses at high-rate points could dominate both pure modes, a design the paper does not explore.
Testable extension: the paper's constant-speed, no-acceleration motion is optimistic; one could re-run the comparison with trapezoidal velocity profiles to see whether the roaming advantage survives finite acceleration, which would tell whether the qualitative conclusion depends on the exact speed model.

Share X Bluesky LinkedIn Reddit HN

Signed reviews

No signed human review yet.

Editorial analysis

A structured set of objections, weighed in public.

Desk editor's note, referee report, and a circularity audit.

Desk Editor's Note

read the letter

Short version: this is a real contribution, and the math is mostly solid, but the paper's headline comparison is not as fair as it claims. The finite-speed placement model and the roaming mode are genuinely new in the pinching-antenna line, and the algebraic decomposition in Proposition 1 is exact. But roaming is allowed to optimize user service durations while placement is fixed to equal T/N slots. The authors admit the extra degree of freedom in the remark after Eq. (14), then the abstract and conclusions drop that caveat and say roaming consistently outperforms placement. Fig. 5 makes the problem concrete: roaming beats ideal infinite-speed placement, which has zero repositioning overhead, so that gain cannot come from the stated overhead-avoidance mechanism. It comes from shifting transmission time toward high-rate users. A symmetric benchmark—placement with optimized unequal slot lengths, or roaming restricted to equal-length intervals—is needed before the headline claim is credible.

What the paper does well: the finite-speed placement model is a sensible generalization of prior instantaneous-placement work; Eq. (17) is a clean, parameter-free decomposition; Lemma 1's single-crossing proof is correct under the LoS channel model; and the DP recursions are standard and globally optimal for the discretized problems. The uniform-roaming results in Figs. 3, 6, and 7 provide some evidence that continuous transmission itself helps, so the core idea probably survives in weakened form.

Soft spots, in proportion: the LoS-only channel model underpins the single-crossing structure and the optimal partition result; if small-scale fading or reflections are significant, the interval structure may fail. The constant-speed, no-acceleration motion is another idealization, and the paper does not flag either assumption as a limitation. The simulations have no error bars or trial counts, and no code or data is provided, so the quantitative claims are not independently reproducible. None of this is fatal by itself, but together it means the present version overstates the case.

This paper is for researchers working on pinching antennas, movable antennas, or trajectory-aware resource allocation. It deserves a serious referee—the concept is useful and the derivations are careful—but I would send it back for major revision on comparison fairness and simulation reporting.

Referee Report

3 major / 4 minor

Summary. The paper considers a downlink pinching-antenna system with a single antenna moving along a waveguide and serving N users by TDMA, under a finite maximum antenna speed. It contrasts two operation modes: antenna placement, where the antenna stops at optimized service points and each user receives an equal time slot of T/N that includes repositioning time, and antenna roaming, where the antenna moves continuously at constant speed and the trajectory is partitioned into consecutive service intervals whose lengths are optimized. The paper derives an algebraic decomposition of the sum-rate difference between the two modes (Proposition 1), a local quadratic approximation (Proposition 2), a single-crossing property for the instantaneous rate functions (Lemma 1), and an optimal unconstrained service-interval partition (Proposition 3). It then formulates QoS-constrained sum-rate maximization problems for both modes and solves discretized versions via dynamic programming (Sections IV and V). Simulations compare the proposed schemes against fixed-antenna, ideal infinite-speed placement, and uniform schedules, and report that antenna roaming outperforms antenna placement, especially when repositioning overhead is significant.

Significance. If the comparison is made fair, the paper would provide a useful framework for finite-speed movable antenna systems. The proofs of Proposition 1, Lemma 1, and Proposition 3 are correct under the stated channel model, and the DP recursions are standard and globally optimal for the discretized problems. The paper ships no code or data, but the derivations are transparent and the structural result in Lemma 1 is a clean contribution. However, the central performance claim currently conflates two distinct effects: the removal of dedicated positioning overhead and the additional freedom to allocate unequal service durations. Because the manuscript itself acknowledges this extra degree of freedom and even attributes the advantage over ideal placement to it, a major revision with symmetric benchmarks is needed before the main claim is established.

major comments (3)

[Section II-C/D, Eqs. (9), (14), (17), Fig. 5] The comparison between antenna placement and antenna roaming is asymmetric in resource allocation. In Eq. (9), placement fixes each user's slot to T/N, while in Eqs. (14)-(16) roaming treats the service-interval lengths (and hence the service durations) as decision variables. Consequently, the first term in Proposition 1 measures not only the elimination of dedicated repositioning time but also the benefit of freely shifting transmission time toward high-rate users. The Remark after Eq. (14) concedes that roaming "also optimizes user service durations" and has an "additional degree of freedom." The text accompanying Fig. 5 explicitly explains roaming's ability to outperform ideal infinite-speed placement by optimizing service-interval lengths while ideal placement "retains equal service durations." Since ideal placement has zero positioning overhead, any gain over it cannot be attributed to the removal of repositioning overhead. The paper should add symmetric benchmarks: e.g., placement with optimized unequal slot durations, or roaming with equal-length service intervals, and then compare the corresponding modes under the same resource-allocation flexibility.
[Section II-A, Eq. (2), Lemma 1, Proposition 3] The single-crossing property in Lemma 1 and the resulting optimal partition structure in Proposition 3 depend on the specific channel power form |h_n(x)|^2 = \eta^2/((x-x_n)^2 + y_n^2 + d^2), which includes free-space path loss only. The channel model in Eq. (2) omits in-waveguide attenuation, even though the introduction cites related work (e.g., [16]) that explicitly accounts for the tradeoff between in-waveguide power loss and free-space path loss. With a realistic distance-dependent waveguide attenuation factor, the pairwise instantaneous rate functions need not intersect at most once, and the structural characterization of the optimal service-interval partition may fail. The authors should either include a waveguide-loss term in the channel model or state the conditions under which the single-crossing property and Proposition 3 remain valid in the presence of such loss.
[Section II-C, Eqs. (10)-(14)] The exact time-to-space transformation under antenna roaming relies on strictly constant-speed motion, vpin = Dx/T, with no acceleration, deceleration, or speed variation. The paper acknowledges that speed variations are neglected in the placement model (footnote 2), but it does not flag the same idealization for the roaming model, where the assumption is load-bearing for the equivalence between R_AR_n and the spatial integral in Eq. (14). If real actuators require acceleration/deceleration, the position-time mapping becomes nonlinear, the normalized rate expressions change, and the local quadratic interpretation in Proposition 2 would need modification. The paper should state this limitation explicitly and provide a quantitative sensitivity check, for example by simulating a trapezoidal velocity profile.

minor comments (4)

[Section II-D, Remark 5] The displayed equations in Remark 5 contain stray text "bracehtipupleft/bracehtipdownright" and similar artifacts that appear to be leftover LaTeX macro text; these should be cleaned before publication.
[Throughout] The symbol N is used both for the set of users and the number of users (e.g., "N = {1, 2, ..., N}"). This overload is confusing; use a calligraphic or other distinct symbol for the user set.
[Sections IV and V] The stage-reward function is denoted Fn in both Algorithm 1 (service-point deployment) and Algorithm 2 (service-interval partitioning), even though the two functions have different definitions. Renaming one of them (e.g., G_n for roaming) would improve readability.
[Section VI, Fig. 6] The statement "Under uniform spatial allocation, antenna roaming still achieves a higher sum rate than antenna placement" is a useful symmetric comparison, but it appears only as a sentence without a dedicated figure; a quantitative comparison of uniform placement versus uniform roaming under identical equal-duration constraints would directly address the fairness concern raised above.

Circularity Check

0 steps flagged · score 0.0 of 10

No significant circularity: the core derivations are algebraic identities and structural consequences of the Section II model, with no fitted parameter renamed as a prediction.

full rationale

Proposition 1 (Eq. (17)) is obtained by adding and subtracting a term in the difference of the two defined sum-rate expressions (Eqs. (18)-(20)); the decomposition into an effective-transmission-time term and a channel-quality term is an exact algebraic identity, not a prediction derived from its own conclusion. Lemma 1 follows from the explicit free-space channel power expression in Eq. (36), where a pairwise rate comparison reduces to a linear inequality, so the single-crossing property is a direct mathematical consequence of the stated model rather than an imported uniqueness theorem. Proposition 3 follows from pointwise maximization of the integral objective, with boundary equality following from continuity; this is a standard interchange-of-maximization argument, not a self-referential construction. The dynamic programming algorithms are standard finite-state reformulations of the additive-chain optimization problems. No quantity is fitted to data: the parameters in Table I are simulation inputs, and the DP solutions optimize service points or partition boundaries against the model-defined rates. The paper contains self-citations (e.g., [8], [29], [30]) as background for the antenna-placement convention, but none of these citations carries a load-bearing step in the placement-versus-roaming comparison or in the structural proofs. The unequal service-duration flexibility granted to roaming is a modeling and comparison-design choice, and although it weakens a strict 'fair comparison' reading of the simulation-based roaming gains over ideal placement, it is not a circularity: no derived quantity is equivalent by definition to an input or to a fitted value.

Assumptions & free parameters 0 free parameters · 6 assumptions · 0 invented entities

The core derivations require only standard calculus and DP background plus the domain assumptions listed. No free parameters are fitted; the channel and motion models carry most of the burden. The in-waveguide-loss omission is the largest single assumption because Lemma 1 and Proposition 3 hinge on a single-peaked squared-distance rate function.

assumptions (6)

domain assumption Free-space line-of-sight channel model in Eq. (2) with no in-waveguide attenuation or small-scale fading, giving |h_n(x)|^2 = eta^2/((x-x_n)^2 + y_n^2 + d^2).
Lemma 1 and Proposition 3 require each user's rate function to be single-peaked with at most one pairwise crossing; this holds for the squared-distance form but may fail with waveguide loss or multipath.
domain assumption Antenna movement is at constant speed with no acceleration or deceleration; placement moves at v_max (Eq. (6), footnote 2), roaming at v_pin = D_x/T (Eq. (10)).
Repositioning time and the position-time mapping are exact only under this idealized motion model.
domain assumption A movable dielectric structure can maintain radiation coupling while sliding along the waveguide (footnote 3).
Roaming requires continuous radiation during motion; no hardware measurement is supplied, so this is a feasibility assumption.
domain assumption Users are indexed by x-coordinate and served in that fixed order under TDMA with equal slots per user (Eq. (1), Section II-B).
The DP formulations optimize positions or boundaries for a fixed service order and do not solve user scheduling jointly.
domain assumption Doppler and phase variation from slow movement are trackable, so the rate depends only on the channel power gain |h_n(x)|^2 (discussion after Remark 4).
This justifies ignoring residual phase-tracking errors in the achievable rate.
standard math Dynamic programming is globally optimal for the discretized finite-state sequential decision problems (Sections IV-V).
The objective is an additive chain over states and transitions, so the Bellman recursion is exact for the discretized problem.

how reviews work

0 comments

Cite this review

Pith. "Pith review of Pinching-Antenna Systems: From Antenna Placement to Antenna Roaming." pith.science (2026). https://pith.science/paper/GRTVERVV

@misc{pith2026260810136,
  author       = {Pith},
  title        = {Pith review of: Pinching-Antenna Systems: From Antenna Placement to Antenna Roaming},
  year         = {2026},
  howpublished = {\url{https://pith.science/paper/GRTVERVV}},
  note         = {Machine review of arXiv:2608.10136}
}

read the original abstract

This paper investigates pinching-antenna systems with finite antenna movement speed, under which conventional antenna placement is subject to non-negligible repositioning delay, resulting in a fundamental tradeoff between channel quality and effective transmission time. In this context, antenna roaming is proposed as a novel operation mode, in which the antenna moves continuously along the waveguide while simultaneously serving users. By incorporating communication and antenna movement into the same transmission cycle, a unified cycle-duration framework is established to facilitate a fair comparison between antenna placement and antenna roaming. The sum-rate difference is then analytically derived, indicating that antenna roaming avoids dedicated positioning overhead with a loss in channel quality due to spatial averaging. The corresponding sum rate maximization problems are formulated for the two operation modes. The continuous optimization problems are transformed into finite-state sequential decision problems and solved via dynamic programming (DP) based algorithms. For antenna roaming, the optimal unconstrained service-interval partition is analytically characterized, with each antenna position assigned to the user achieving the highest instantaneous rate. Simulation results validate the theoretical analysis, demonstrate the performance advantage of antenna roaming over antenna placement, especially when positioning overhead is significant, and confirm the effectiveness of the DP based solutions in improving the achievable sum rate.

Figures

Figures reproduced from arXiv: 2608.10136 by the authors.

**Figure 2.** Illustration of the optimized antenna placement and [PITH_FULL_IMAGE:figures/full_fig_p010_2.png] view at source ↗

**Figure 4.** Impact of the waveguide length on the sum rate, where [PITH_FULL_IMAGE:figures/full_fig_p010_4.png] view at source ↗

Figures from the paper (3 more)

**Figure 5.** Figure 5: Impact of the region width on the sum rate, where [PITH_FULL_IMAGE:figures/full_fig_p011_5.png]

**Figure 6.** Figure 6: Impact of the cycle duration on the sum rate, where [PITH_FULL_IMAGE:figures/full_fig_p011_6.png]

**Figure 8.** Figure 8: Impact of the target rate on the sum rate and outage [PITH_FULL_IMAGE:figures/full_fig_p012_8.png]

Discussion (0). Continue with ORCID to comment.

Reference graph

Works this paper leans on

36 extracted references · 16 canonical work pages

[16]

Pin ching- antenna systems: Waveguide-power loss and free-space path loss trade- off,

S. Chen, W. Duan, J. Gu, S. Dang, M. Wen, and P .-H. Ho, “Pin ching- antenna systems: Waveguide-power loss and free-space path loss trade- off,” IEEE Trans. Wireless Commun. , vol. 25, pp. 17 942–17 957, 2026

work page 2026
[1]

Towards smart and reconﬁgurable envi ronment: Intelligent reﬂecting surface aided wireless network,

Q. Wu and R. Zhang, “Towards smart and reconﬁgurable envi ronment: Intelligent reﬂecting surface aided wireless network,” IEEE Commun. Mag., vol. 58, no. 1, pp. 106–112, Jan. 2020

2020
[2]

Fl uid antenna systems,

K.-K. Wong, A. Shojaeifard, K.-F. Tong, and Y . Zhang, “Fl uid antenna systems,” IEEE Trans. Wireless Commun., vol. 20, no. 3, pp. 1950–1962, Mar. 2020

1950
[3]

Movable antennas for wireles s commu- nication: Opportunities and challenges,

L. Zhu, W. Ma, and R. Zhang, “Movable antennas for wireles s commu- nication: Opportunities and challenges,” IEEE Commun. Mag. , vol. 62, no. 6, pp. 114–120, 2024

2024
[4]

Reconﬁgurable intelligent surfaces for 6G syste ms: Prin- ciples, applications, and research directions,

C. Pan, H. Ren, K. Wang, J. F. Kolb, M. Elkashlan, M. Chen, M. Di Renzo, Y . Hao, J. Wang, A. L. Swindlehurst, X. Y ou, and L. Hanzo, “Reconﬁgurable intelligent surfaces for 6G syste ms: Prin- ciples, applications, and research directions,” IEEE Commun. Mag. , vol. 59, no. 6, pp. 14–20, 2021

work page 2021
[5]

Fluid antenna systems enabling 6G: Principles, ap plications, and research directions,

T. Wu, K. Zhi, J. Y ao, X. Lai, J. Zheng, H. Niu, M. Elkashlan , K.- K. Wong, C.-B. Chae, Z. Ding, G. K. Karagiannidis, M. Debbah, and C. Y uen, “Fluid antenna systems enabling 6G: Principles, ap plications, and research directions,” IEEE Wireless Commun. , pp. 1–9, 2025

2025
[6]

MIMO capacity characterizat ion for movable antenna systems,

W. Ma, L. Zhu, and R. Zhang, “MIMO capacity characterizat ion for movable antenna systems,” IEEE Trans. Wireless Commun. , vol. 23, no. 4, pp. 3392–3407, Apr. 2024

2024
[7]

Pinching antenna-using a dielectric waveguide as an anten na,

A. Fukuda, H. Y amamoto, H. Okazaki, Y . Suzuki, and K. Kawa i, “Pinching antenna-using a dielectric waveguide as an anten na,” NTT DOCOMO Technical J. , vol. 23, no. 3, pp. 5–12, Jan. 2022

2022

Show all 36 references

[8]

Flexible-ante nna systems: A pinching-antenna perspective,

Z. Ding, R. Schober, and H. Vincent Poor, “Flexible-ante nna systems: A pinching-antenna perspective,” IEEE Trans. Commun. , pp. 1–1, 2025

2025
[9]

Pinch ing- antenna systems: Architecture designs, opportunities, an d outlook,

Y . Liu, Z. Wang, X. Mu, C. Ouyang, X. Xu, and Z. Ding, “Pinch ing- antenna systems: Architecture designs, opportunities, an d outlook,” IEEE Commun. Mag. , pp. 1–7, Sept. 2025

2025
[10]

Antenna activation fo r NOMA as- sisted pinching-antenna systems,

K. Wang, Z. Ding, and R. Schober, “Antenna activation fo r NOMA as- sisted pinching-antenna systems,” IEEE Wireless Commun. Lett., vol. 14, no. 5, pp. 1526–1530, Mar. 2025

2025
[11]

Rate maximizat ion for downlink pinching-antenna systems,

Y . Xu, Z. Ding, and G. K. Karagiannidis, “Rate maximizat ion for downlink pinching-antenna systems,” IEEE Wireless Commun. Lett. , pp. 1–1, 2025

2025
[12]

Environment divisi on multiple access (EDMA): A feasibility study via pinching antennas,

Z. Ding, R. Schober, and H. V . Poor, “Environment divisi on multiple access (EDMA): A feasibility study via pinching antennas,” IEEE Trans. Wireless Commun., vol. 25, pp. 15 675–15 691, 2026

2026
[13]

Pinching-anten na systems with LoS blockages,

K. Wang, C. Ouyang, Y . Liu, and Z. Ding, “Pinching-anten na systems with LoS blockages,” IEEE Wireless Commun. Lett., pp. 1–1, Sept. 2025

2025
[14]

Pinching antennas: Principles, applica- tions and challenges,

Z. Y ang, N. Wang, Y . Sun, Z. Ding, R. Schober, G. K. Karagi annidis, V . W. Wong, and O. A. Dobre, “Pinching antennas: Principles, applica- tions and challenges,” IEEE Wireless Commun. , pp. 1–10, Oct. 2025

2025
[15]

A survey on pinching-antenna systems: Optimiz ation techniques, intelligent designs, and multifunctional app lications,

Y . Lu, W. Mao, X. Xie, S. Liao, Y . Xu, Y . Lin, R. Zhang, B. Ai, X. Wang, and Z. Ding, “A survey on pinching-antenna systems: Optimiz ation techniques, intelligent designs, and multifunctional app lications,” IEEE Commun. Surveys Tutorials , vol. 28, pp. 6592–6627, 2026

2026
[17]

QoS-aware NOMA des ign for downlink pinching-antenna systems,

Y . Xu, Z. Ding, D. Cai, and V . W. Wong, “QoS-aware NOMA des ign for downlink pinching-antenna systems,” IEEE Trans. Commun. , pp. 1–1, Sept. 2025

2025
[18]

Resour ce allocation for pinching-antenna systems (PASS)-enabled NOMA communi cations,

S. Xue, J. Zhao, K. Cai, X. Mu, Z. Xiao, and Y . Liu, “Resour ce allocation for pinching-antenna systems (PASS)-enabled NOMA communi cations,” IEEE Trans. Commun. , vol. 74, pp. 10 246–10 260, 2026

2026
[19]

Dynamic placemen t of pinching antennas for multicast MU-MISO downlinks,

J.-C. Chen, P .-C. Wu, and K.-K. Wong, “Dynamic placemen t of pinching antennas for multicast MU-MISO downlinks,” IEEE Open J. Commun. Soc., vol. 6, pp. 5611–5625, 2025

2025
[20]

Exploiting pinchi ng-antenna systems in multicast communications,

S. Shan, C. Ouyang, Y . Li, and Y . Liu, “Exploiting pinchi ng-antenna systems in multicast communications,” IEEE Trans. Commun. , vol. 74, pp. 419–432, 2026

2026
[21]

A gradient meta-learning joint optimization for beamformin g and antenna position in pinching-antenna systems,

K. Zhou, W. Zhou, D. Cai, X. Lei, Y . Xu, Z. Ding, and P . Fan, “A gradient meta-learning joint optimization for beamformin g and antenna position in pinching-antenna systems,” IEEE Trans. Commun. , vol. 74, pp. 1099–1112, 2026

2026
[22]

Antenna acti vation and resource allocation in multi-waveguide pinching-antenna systems,

K. Wang, Z. Ding, and G. K. Karagiannidis, “Antenna acti vation and resource allocation in multi-waveguide pinching-antenna systems,” IEEE Trans. Wireless Commun. , pp. 1–1, Sept. 2025

2025
[23]

Pinchi ng-antenna systems (PASS): Power radiation model and optimal beamform ing design,

X. Xu, X. Mu, Z. Wang, Y . Liu, and A. Nallanathan, “Pinchi ng-antenna systems (PASS): Power radiation model and optimal beamform ing design,” IEEE Transactions on Communications, vol. 74, pp. 2160–2175, 2026

2026
[24]

Equivale nt radiation control for ISAC in pinching antenna systems: A discrete act ivation framework,

C. Y u, B. Ai, X. Gan, Y . Liu, G. Shi, and W. Chen, “Equivale nt radiation control for ISAC in pinching antenna systems: A discrete act ivation framework,” IEEE Trans. Wireless Commun., vol. 25, pp. 19 825–19 841, 2026

2026
[25]

Generalized pinching-a ntenna systems: A leaky-coaxial-cable perspective,

K. Wang, Z. Ding, and L. Hanzo, “Generalized pinching-a ntenna systems: A leaky-coaxial-cable perspective,” arXiv preprint arXiv:2512.04979, 2025

2025 arXiv
[26]

Energy-efﬁcient de sign for pinching-antenna system with movement energy consumption ,

M. Liu, J. Ding, L. Lin, and B. Jiao, “Energy-efﬁcient de sign for pinching-antenna system with movement energy consumption ,” Elec- tronics Letters, vol. 62, no. 1, p. e70639, 2026

2026
[27]

Join t radiation power, antenna position, and beamforming optimization for pinching- antenna systems with motion power consumption,

Y . Xu, D. Xu, X. Y u, S. Song, Z. Ding, and R. Schober, “Join t radiation power, antenna position, and beamforming optimization for pinching- antenna systems with motion power consumption,” IEEE Trans. Wireless Commun., vol. 25, pp. 7825–7841, 2026

2026
[28]

Dual-scale antenna deploym ent for pinching-antenna systems,

X. Gan, Z. Wang, and Y . Liu, “Dual-scale antenna deploym ent for pinching-antenna systems,” IEEE Trans. Commun. , vol. 74, pp. 9772– 9786, 2026

2026
[29]

A low-complexity p lacement design of pinching-antenna systems,

X. Xie, F. Fang, Z. Ding, and X. Wang, “A low-complexity p lacement design of pinching-antenna systems,” IEEE Commun. Lett. , vol. 29, no. 8, pp. 1784–1788, May 2025

2025
[30]

Analytical optimization for ant enna placement in pinching-antenna systems,

Z. Ding and H. V . Poor, “Analytical optimization for ant enna placement in pinching-antenna systems,” arXiv preprint arXiv:2507.13307 , 2025

2025 arXiv
[31]

Joint trajectory and commu nication design for multi-UA V enabled wireless networks,

Q. Wu, Y . Zeng, and R. Zhang, “Joint trajectory and commu nication design for multi-UA V enabled wireless networks,” IEEE Trans. Wireless Commun., vol. 17, no. 3, pp. 2109–2121, 2018

2018
[32]

Energy minimization for wi reless communication with rotary-wing UA V,

Y . Zeng, J. Xu, and R. Zhang, “Energy minimization for wi reless communication with rotary-wing UA V,”IEEE Trans. Wireless Commun., vol. 18, no. 4, pp. 2329–2345, 2019

2019
[33]

Study on channel model for frequencies from 0.5 to 100 G Hz,

“Study on channel model for frequencies from 0.5 to 100 G Hz,” 3rd Generation Partnership Project (3GPP), Tech. Rep. TR 38.90 1, V ersion 19.4.0, 2026

2026
[34]

Dynamic programming,

R. Bellman, “Dynamic programming,” science, vol. 153, no. 3731, pp. 34–37, 1966

1966
[35]

Bertsekas, Dynamic programming and optimal control: V olume I

D. Bertsekas, Dynamic programming and optimal control: V olume I . Athena scientiﬁc, 2012, vol. 4

2012
[36]

Multiuser beamform ing for pinching-antenna systems: An element-wise optimization f ramework,

M. Sun, C. Ouyang, S. Wu, and Y . Liu, “Multiuser beamform ing for pinching-antenna systems: An element-wise optimization f ramework,” IEEE Trans. Wireless Commun. , vol. 25, pp. 6538–6552, 2026

2026

Pith tools

Reviewed August 14, 2026 · model on record in the stance chip above.

[1] [16]

Pin ching- antenna systems: Waveguide-power loss and free-space path loss trade- off,

S. Chen, W. Duan, J. Gu, S. Dang, M. Wen, and P .-H. Ho, “Pin ching- antenna systems: Waveguide-power loss and free-space path loss trade- off,” IEEE Trans. Wireless Commun. , vol. 25, pp. 17 942–17 957, 2026

work page 2026

[2] [1]

Towards smart and reconﬁgurable envi ronment: Intelligent reﬂecting surface aided wireless network,

Q. Wu and R. Zhang, “Towards smart and reconﬁgurable envi ronment: Intelligent reﬂecting surface aided wireless network,” IEEE Commun. Mag., vol. 58, no. 1, pp. 106–112, Jan. 2020

2020

[3] [2]

Fl uid antenna systems,

K.-K. Wong, A. Shojaeifard, K.-F. Tong, and Y . Zhang, “Fl uid antenna systems,” IEEE Trans. Wireless Commun., vol. 20, no. 3, pp. 1950–1962, Mar. 2020

1950

[4] [3]

Movable antennas for wireles s commu- nication: Opportunities and challenges,

L. Zhu, W. Ma, and R. Zhang, “Movable antennas for wireles s commu- nication: Opportunities and challenges,” IEEE Commun. Mag. , vol. 62, no. 6, pp. 114–120, 2024

2024

[5] [4]

Reconﬁgurable intelligent surfaces for 6G syste ms: Prin- ciples, applications, and research directions,

C. Pan, H. Ren, K. Wang, J. F. Kolb, M. Elkashlan, M. Chen, M. Di Renzo, Y . Hao, J. Wang, A. L. Swindlehurst, X. Y ou, and L. Hanzo, “Reconﬁgurable intelligent surfaces for 6G syste ms: Prin- ciples, applications, and research directions,” IEEE Commun. Mag. , vol. 59, no. 6, pp. 14–20, 2021

work page 2021

[6] [5]

Fluid antenna systems enabling 6G: Principles, ap plications, and research directions,

T. Wu, K. Zhi, J. Y ao, X. Lai, J. Zheng, H. Niu, M. Elkashlan , K.- K. Wong, C.-B. Chae, Z. Ding, G. K. Karagiannidis, M. Debbah, and C. Y uen, “Fluid antenna systems enabling 6G: Principles, ap plications, and research directions,” IEEE Wireless Commun. , pp. 1–9, 2025

2025

[7] [6]

MIMO capacity characterizat ion for movable antenna systems,

W. Ma, L. Zhu, and R. Zhang, “MIMO capacity characterizat ion for movable antenna systems,” IEEE Trans. Wireless Commun. , vol. 23, no. 4, pp. 3392–3407, Apr. 2024

2024

[8] [7]

Pinching antenna-using a dielectric waveguide as an anten na,

A. Fukuda, H. Y amamoto, H. Okazaki, Y . Suzuki, and K. Kawa i, “Pinching antenna-using a dielectric waveguide as an anten na,” NTT DOCOMO Technical J. , vol. 23, no. 3, pp. 5–12, Jan. 2022

2022