pith. sign in

arxiv: 2604.09128 · v1 · submitted 2026-04-10 · 📡 eess.SP

Flexible Cylindrical Array-Aided Secure Wireless Communications

Pith reviewed 2026-05-10 17:12 UTC · model grok-4.3

classification 📡 eess.SP
keywords flexible cylindrical arraysecure communicationsartificial noisebeamforming optimizationmovable antennassum-rate maximizationmultiuser MISOsecrecy constraints
0
0 comments X

The pith

A flexible cylindrical array with movable antennas maximizes secure sum rates in multiuser MISO systems by jointly tuning positions, beamforming, and artificial noise.

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

The paper examines a downlink secure communication setup where a cylindrical array can adjust its shape: individual antennas rotate on circular tracks while entire slices slide along a vertical axis. The goal is to maximize the total rate delivered to multiple legitimate users while ensuring an eavesdropper's rate stays below a secrecy threshold, by simultaneously choosing the transmit beamforming vectors, the covariance of added artificial noise, and the exact antenna locations. A block coordinate descent method is introduced that alternates between a Lagrangian dual transform, semidefinite relaxation, and accelerated projected gradient steps to handle the resulting non-convex problem. Numerical experiments indicate fast convergence and clear rate improvements over fixed-geometry baselines precisely because the extra positional degrees of freedom allow the array to reshape its radiation pattern in response to the channels.

Core claim

In a multiuser MISO downlink with an eavesdropper, a flexible cylindrical array whose elements rotate on circular tracks and whose slices translate vertically can be jointly optimized with beamforming and artificial-noise covariance to deliver substantially higher sum rates to the legitimate receivers while satisfying secrecy rate constraints.

What carries the argument

The block coordinate descent (BCD) framework that alternates Lagrangian dual transform, tight semidefinite relaxation (SDR), and Nesterov-accelerated projected gradient descent (PGD) to solve the non-convex joint optimization over beamforming, AN covariance, and continuous antenna positions.

If this is right

  • The extra positional freedom lets the array reshape its effective channel vectors to favor legitimate users over the eavesdropper without increasing total transmit power.
  • The algorithm converges in a modest number of outer iterations, making real-time or near-real-time reconfiguration feasible when channels vary slowly.
  • Benchmark comparisons show that the gains come directly from the movable geometry rather than from the optimization method alone.

Where Pith is reading between the lines

These are editorial extensions of the paper, not claims the author makes directly.

  • Similar movable-geometry ideas could be applied to linear or planar arrays in other propagation environments where vertical or rotational freedom is easier to implement.
  • Hardware cost and latency of physically moving the elements become the next practical bottleneck once the algorithmic gains are established.
  • If the same framework is extended to imperfect channel state information, the positional variables might serve as an additional robustness mechanism against estimation errors.

Load-bearing premise

The non-convex joint optimization over beamforming, artificial-noise covariance, and continuous antenna positions can be solved to near-optimality by the proposed BCD-SDR-PGD procedure.

What would settle it

Running the same secrecy-constrained sum-rate maximization with antenna positions fixed at random or uniform locations and observing no meaningful rate loss compared with the optimized positions would falsify the value of the geometry flexibility.

Figures

Figures reproduced from arXiv: 2604.09128 by Lipeng Zhu, Ran Yang, Songjie Yang, Weidong Mei, Xiangyu Dong, Yue Xiu, Zhongpei Zhang.

Figure 1
Figure 1. Figure 1: Performance comparison of different schemes. [PITH_FULL_IMAGE:figures/full_fig_p005_1.png] view at source ↗
read the original abstract

Flexible-geometry arrays based on movable antennas have shown considerable potential for improving wireless communication performance. In this letter, we investigate a multiuser multiple-input single-output (MU-MISO) downlink secure communication system aided by a flexible cylindrical array (FCLA) and artificial noise (AN), where each antenna element rotates along circular tracks while the circular slices move along a vertical axis. To guarantee transmission security, we aim to maximize the achievable sum rate at multiple legitimate information receivers by jointly optimizing transmit beamforming, AN covariance matrix, and antenna placement under secrecy constraints for an eavesdropper. While the resulting problem is intractable to solve, we develop a block coordinate descent (BCD)-based framework that combines the Lagrangian dual transform, tight semidefinite relaxation (SDR), and Nesterov-accelerated projected gradient descent (PGD). Numerical results show that the proposed algorithm converges rapidly and achieves significant sum-rate gains over benchmark schemes by exploiting the geometry flexibility of the array.

Editorial analysis

A structured set of objections, weighed in public.

Desk editor's note, referee report, simulated authors' rebuttal, and a circularity audit. Tearing a paper down is the easy half of reading it; the pith above is the substance, this is the friction.

Referee Report

2 major / 2 minor

Summary. The paper investigates a MU-MISO downlink secure communication system using a flexible cylindrical array (FCLA) with movable antennas and artificial noise (AN). The goal is to maximize the sum rate of legitimate users by jointly optimizing the transmit beamforming, AN covariance matrix, and antenna positions on the cylindrical structure, subject to secrecy rate constraints for an eavesdropper. A BCD-based algorithm combining Lagrangian dual transform, SDR, and Nesterov-accelerated PGD is proposed to handle the non-convex problem. Numerical results indicate rapid convergence and significant sum-rate improvements over benchmark schemes due to the array's geometry flexibility.

Significance. If validated, this work demonstrates the potential of continuous geometry optimization in cylindrical movable antenna arrays for enhancing physical layer security in multiuser systems. It applies standard convex relaxation and iterative optimization techniques to a new array configuration, potentially providing practical insights for secure wireless designs. The numerical demonstration of gains is promising, but the absence of convergence proofs and detailed parameter specifications reduces the immediate impact and reproducibility.

major comments (2)
  1. [§IV (Proposed Algorithm)] §IV (Proposed Algorithm): The BCD-SDR-PGD framework is presented as solving the joint optimization to near-optimality, but there is no analysis or bound on the optimality gap or convergence rate provided. This is load-bearing for the central performance claim since the sum-rate gains rely on the quality of the solution obtained.
  2. [§V (Numerical Results)] §V (Numerical Results): The description of simulation parameters (e.g., number of users, antenna elements, channel fading models, eavesdropper location) is incomplete, undermining the ability to verify the reported convergence speed and sum-rate gains over benchmarks.
minor comments (2)
  1. [Abstract] Abstract: The term 'tight semidefinite relaxation (SDR)' is used without qualification; clarify if it is proven tight or empirically observed.
  2. [§II (System Model)] §II (System Model): The modeling of the cylindrical array movement (rotation along circular tracks and vertical movement) could benefit from a clearer diagram or mathematical definition of the position variables.

Simulated Author's Rebuttal

2 responses · 0 unresolved

We thank the referee for the constructive comments and the recommendation for minor revision. We address each major comment below and will update the manuscript to improve the presentation and reproducibility of our results.

read point-by-point responses
  1. Referee: [§IV (Proposed Algorithm)] §IV (Proposed Algorithm): The BCD-SDR-PGD framework is presented as solving the joint optimization to near-optimality, but there is no analysis or bound on the optimality gap or convergence rate provided. This is load-bearing for the central performance claim since the sum-rate gains rely on the quality of the solution obtained.

    Authors: We acknowledge that the manuscript lacks a theoretical analysis or bound on the optimality gap and convergence rate of the BCD-SDR-PGD algorithm. Deriving such guarantees for this non-convex joint optimization over continuous antenna positions, beamforming vectors, and AN covariance is challenging and would require extensive additional analysis beyond the scope of this letter. The BCD approach is guaranteed to converge to a stationary point under standard assumptions for block-wise convex subproblems, and we demonstrate rapid empirical convergence (within a small number of iterations) across various scenarios in Section V. In the revision, we will expand Section IV with a discussion of the observed convergence behavior, additional iteration plots, and a note on the limitations of the current analysis. revision: partial

  2. Referee: [§V (Numerical Results)] §V (Numerical Results): The description of simulation parameters (e.g., number of users, antenna elements, channel fading models, eavesdropper location) is incomplete, undermining the ability to verify the reported convergence speed and sum-rate gains over benchmarks.

    Authors: We agree that the simulation parameters in Section V were insufficiently detailed. This omission hinders reproducibility. In the revised manuscript, we will add a dedicated subsection or table in Section V that explicitly lists all parameters, including the number of legitimate users, number of antenna elements, channel models (e.g., Rician fading parameters), eavesdropper location and channel, power constraints, noise variance, and benchmark scheme details. This will allow readers to fully replicate the reported convergence and performance results. revision: yes

Circularity Check

0 steps flagged

No significant circularity detected

full rationale

The paper formulates a joint non-convex optimization of beamforming vectors, AN covariance, and continuous antenna positions on a flexible cylindrical array to maximize sum secrecy rate. It decomposes the problem via BCD and applies standard tools (Lagrangian dual transform for rate expressions, SDR for beamforming/AN subproblems, Nesterov PGD for position updates). Numerical results demonstrate convergence and gains relative to fixed-geometry benchmarks. No equation reduces to its own input by construction, no parameter is fitted on a subset and then relabeled as a prediction, and no load-bearing premise rests on self-citation. The derivation chain is self-contained against the stated channel and secrecy model.

Axiom & Free-Parameter Ledger

1 free parameters · 1 axioms · 0 invented entities

Abstract-only review limits visibility into exact modeling assumptions; the work rests on standard far-field channel models and the tightness of SDR for the beamforming subproblem.

free parameters (1)
  • antenna placement variables
    Continuous positions along circular tracks and vertical axis are decision variables optimized jointly with beamforming and AN covariance.
axioms (1)
  • domain assumption Semidefinite relaxation of the beamforming subproblem is tight
    Invoked to convert the non-convex QCQP into an SDP solvable by standard solvers.

pith-pipeline@v0.9.0 · 5473 in / 1175 out tokens · 40386 ms · 2026-05-10T17:12:42.673096+00:00 · methodology

discussion (0)

Sign in with ORCID, Apple, or X to comment. Anyone can read and Pith papers without signing in.

Reference graph

Works this paper leans on

26 extracted references · 26 canonical work pages

  1. [1]

    A tutorial on six-dimensional movable antenna for 6G networks: Synergizing positionable and rotatable antennas,

    X. Shaoet al., “A tutorial on six-dimensional movable antenna for 6G networks: Synergizing positionable and rotatable antennas,”IEEE Commun. Surv. Tutorials, vol. 28, pp. 3666–3709, Aug. 2025

  2. [2]

    A survey on reconfigurable and movable antennas for wireless communications and sensing,

    W. Maet al., “A survey on reconfigurable and movable antennas for wireless communications and sensing,”IEEE Commun. Surv. Tutorials, vol. 28, pp. 4842–4882, Feb. 2026

  3. [3]

    Antenna array topologies for mmwave massive MIMO systems: Spectral efficiency analysis,

    W. Tan and S. Ma, “Antenna array topologies for mmwave massive MIMO systems: Spectral efficiency analysis,”IEEE Trans. V eh. Technol., vol. 71, no. 12, pp. 12 901–12 915, Dec. 2022

  4. [4]

    Sparse array enabled near-field communications: Beam pattern analysis and hybrid beamforming design,

    C. Zhouet al., “Sparse array enabled near-field communications: Beam pattern analysis and hybrid beamforming design,”IEEE Trans. Wireless Commun., vol. 24, no. 12, pp. 10 261–10 277, Dec. 2025

  5. [5]

    Movable antenna-aided cooperative ISAC network with time synchronization error and imperfect CSI,

    Y . Xiu, Y . Zhao, R. Yang, D. Niyato, J. Jin, Q. Wang, G. Liu, and N. Wei, “Movable antenna-aided cooperative ISAC network with time synchronization error and imperfect CSI,”IEEE Trans. Commun., vol. 74, pp. 2968–2983, May 2025

  6. [6]

    On the application of cylindrical arrays for massive MIMO in cellular systems,

    M. Kurraset al., “On the application of cylindrical arrays for massive MIMO in cellular systems,” inProc. 22nd Int. ITG Workshop on Smart Antennas, Mar. 2018, pp. 1–8

  7. [7]

    Enabling more users to benefit from near-field communications: From linear to circular array,

    Z. Wu, M. Cui, and L. Dai, “Enabling more users to benefit from near-field communications: From linear to circular array,”IEEE Trans. Wireless Commun., vol. 23, no. 4, pp. 3735–3748, Apr. 2024

  8. [8]

    The manifestation of spatial wideband effect in circular array: From beam split to beam defocus,

    Z. Wu and L. Dai, “The manifestation of spatial wideband effect in circular array: From beam split to beam defocus,”IEEE Trans. Commun., vol. 72, no. 5, pp. 3064–3078, May 2024

  9. [9]

    Collaborative precoding design for adjacent integrated sensing and communication base stations,

    W. Jiang, Z. Wei, F. Liu, Z. Feng, and P. Zhang, “Collaborative precoding design for adjacent integrated sensing and communication base stations,” IEEE Internet Things J., vol. 11, no. 9, pp. 15 059–15 074, May 2024

  10. [10]

    5G beamforming implementation and trade-off investigation of cylindrical array arrangements,

    D. G. Riviello and F. D. Stasio, “5G beamforming implementation and trade-off investigation of cylindrical array arrangements,” inProc. Int. Symp. Wirel. Pers. Multimed. Commun. (WPMC), Nov. 2019, pp. 1–6

  11. [11]

    3D beamforming with massive cylindrical arrays for physical layer secure data transmission,

    E. Yaacoubet al., “3D beamforming with massive cylindrical arrays for physical layer secure data transmission,”IEEE Commun. Lett., vol. 23, no. 5, pp. 830–833, May 2019

  12. [12]

    Latency minimization for movable relay-aided D2D-MEC communication systems,

    Y . Xiu, Y . Zhao, R. Yang, H. Tang, L. Qu, M. Khabbaz, C. Assi, and N. Wei, “Latency minimization for movable relay-aided D2D-MEC communication systems,”IEEE Trans. Mobile Comput., vol. 25, no. 1, pp. 533–549, Jan. 2026. 6

  13. [13]

    A cylindrical phased array radar system for UA V detection,

    J. Yanget al., “A cylindrical phased array radar system for UA V detection,” inProc. 6th Int. Conf. Intell. Comput. Signal Process. (ICSP), Apr. 2021, pp. 894–898

  14. [14]

    Modeling and performance analysis for movable antenna enabled wireless communications,

    L. Zhu, W. Ma, and R. Zhang, “Modeling and performance analysis for movable antenna enabled wireless communications,”IEEE Trans. Wireless Commun., vol. 23, no. 6, pp. 6234–6250, Jun. 2024

  15. [15]

    Movable-antenna array enhanced beamforming: Achieving full array gain with null steering,

    ——, “Movable-antenna array enhanced beamforming: Achieving full array gain with null steering,”IEEE Commun. Lett., vol. 27, no. 12, pp. 3340–3344, Dec. 2023

  16. [16]

    A tutorial on movable antennas for wireless networks,

    L. Zhuet al., “A tutorial on movable antennas for wireless networks,” IEEE Commun. Surv. Tutorials, vol. 28, pp. 3002–3054, Feb. 2026

  17. [17]

    Movable-antenna po- sition optimization: A graph-based approach,

    W. Mei, X. Wei, B. Ning, Z. Chen, and R. Zhang, “Movable-antenna po- sition optimization: A graph-based approach,”IEEE Wireless Commun. Lett., vol. 13, no. 7, pp. 1853–1857, Jul. 2024

  18. [18]

    Meta-reinforcement learning optimization for movable antenna- aided full-duplex CF-DFRC systems with carrier frequency offset,

    Y . Xiu, W. Lyu, Y . Li, R. Yang, P. L. Yeoh, W. Zhang, G. Liu, and N. Wei, “Meta-reinforcement learning optimization for movable antenna- aided full-duplex CF-DFRC systems with carrier frequency offset,”IEEE Trans. Commun., vol. 74, pp. 5803–5819, Mar. 2026

  19. [19]

    Delay minimization for movable antennas-enabled anti-jamming communica- tions with mobile edge computing,

    Y . Xiu, Y . Zhao, K. Wang, M. Xu, D. Niyato, G. Liu, and N. Wei, “Delay minimization for movable antennas-enabled anti-jamming communica- tions with mobile edge computing,”IEEE Trans. Commun., vol. 74, pp. 6243–6258, Mar. 2026

  20. [20]

    Movable antenna-enhanced secure communication: Oppor- tunities, challenges, and solutions,

    Y . Maet al., “Movable antenna-enhanced secure communication: Oppor- tunities, challenges, and solutions,”IEEE Wireless Commun., pp. 1–8, Early Access, 2025

  21. [21]

    Frequency-switching array enhanced physical-layer security in terahertz bands: A movable antenna perspective,

    C. Zhouet al., “Frequency-switching array enhanced physical-layer security in terahertz bands: A movable antenna perspective,”arXiv preprint arXiv:2507.01624, Jul. 2025

  22. [22]

    Secure Com- munication in MIMOME Movable-Antenna Systems with Statistical Eavesdropper CSI,

    L. Xie, P. Wang, G. Shen, G. Li, W. Mei, and L. Chen, “Secure Com- munication in MIMOME Movable-Antenna Systems with Statistical Eavesdropper CSI,”arXiv e-prints, p. arXiv:2601.14755, Jan. 2026

  23. [23]

    Movable-antenna-enhanced physical-layer service inte- gration: Performance analysis and optimization,

    X. Shenet al., “Movable-antenna-enhanced physical-layer service inte- gration: Performance analysis and optimization,”IEEE Wireless Com- mun. Lett., vol. 14, no. 9, pp. 2952–2956, Sep. 2025

  24. [24]

    Movable Antenna Empowered Covert Dual-Functional Radar-Communication,

    R. Yanget al., “Movable Antenna Empowered Covert Dual-Functional Radar-Communication,”arXiv e-prints, p. arXiv:2601.14868, Jan. 2026

  25. [25]

    Movable-antenna aided secure transmission for RIS-ISAC systems,

    Y . Ma, K. Liu, Y . Liu, L. Zhu, and Z. Xiao, “Movable-antenna aided secure transmission for RIS-ISAC systems,”IEEE Trans. Wireless Commun., vol. 24, no. 12, pp. 10 019–10 035, Dec. 2025

  26. [26]

    Robust optimization for movable antenna-aided cell-free ISAC with time synchronization errors,

    Y . Xiu, Y . Zhao, R. Yang, W. Lyu, D. Niyato, D. In Kim, G. Liu, and N. Wei, “Robust optimization for movable antenna-aided cell-free ISAC with time synchronization errors,”IEEE Trans. Wireless Commun., vol. 25, pp. 10 082–10 097, Jan. 2026