Pith. sign in

REVIEW 3 major objections 6 minor 3 cited by

Movable-Antenna Empowered AAV-Enabled Data Collection over Low-Altitude Wireless Networks

T0 review · 3 major / 6 minor · reviewed 2026-08-06 · deepseek-v4-flash

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

Pith's one-line read An aerial vehicle with movable receive antennas can collect uplink data at higher total rate by jointly optimizing trajectory, beamforming, powers, and antenna positions.

desk verdict Uplink MA-drone data collection with a standard AO recipe, but the convergence proof has a real gap (missing trust region) and the PSO step is heuristic; fixable and worth reviewing. read the letter →

arxiv 2507.15515 v1 pith:Q6TE4E2W submitted 2025-07-21 eess.SP cs.ITmath.IT

Xuhui Zhang , Wenchao Liu , Jinke Ren , Chunjie Wang , Huijun Xing , Yanyan Shen , Shuguang Cui This is my paper · ORCID
classification eess.SPcs.ITmath.IT
keywords movableantennasautonomousaerialvehicleslow-altitudewirelessnetworksuplinkdatacollectionsumachievableratetrajectoryoptimizationbeamformingdesignalternating
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 sets out to show that putting movable receive antennas on an autonomous aerial vehicle (AAV) meaningfully improves uplink data collection from ground users. It formulates the sum of achievable rates as a joint optimization over the AAV's flight trajectory, the receive beamforming, the users' transmit powers, and the two-dimensional positions of the vehicle's antennas, then solves it with an alternating algorithm that combines successive convex approximation, a weighted-MMSE reformulation, and particle swarm optimization. In simulation, the proposed design reaches above 300 bps/Hz within about nine iterations and beats fixed-trajectory, fixed-antenna, and minorization-maximization movable-antenna benchmarks, with 90 percent of users above 7.5 bps/Hz. A sympathetic reader would take this as evidence that antenna position is a distinct degree of freedom that complements AAV mobility for collection tasks.

What carries the argument

The load-bearing object is the receive field-response channel model: because the antenna region is small relative to propagation distance, each multi-path component's angle of arrival and amplitude stay fixed, and only the phase changes as the antenna slides. This makes the channel vector $\mathbf{h}_{m,n} = \mathbf{G}_{m,n}^H \boldsymbol{\Sigma}_{m,n} \mathbf{f}_m$ a sum of phase-shifted path responses, turning antenna placement into a phase-alignment problem. The argument is carried by the alternating optimization loop: a trust-region successive convex approximation updates the trajectory, the WMMSE equivalence with auxiliary variables $\beta_{m,n}$ and $\omega_{m,n}$ turns the rate into a sequence of convex beamforming and power problems with closed-form updates, and particle swarm optimization positions the antennas with a penalty for violating the minimum-distance constraint.

What would settle it

Measure the channel at an AAV as a single antenna is moved over a $4\lambda \times 4\lambda$ region in a realistic multipath environment; if path amplitudes vary substantially with position, or if the optimized movable-antenna positions do not beat the best fixed position chosen from the same region by the same optimizer, the central claim fails.

Watch

Extended reading notes

Core claim

The paper's central claim is that a single AAV with $K$ movable receive antennas collecting from $M$ single-antenna ground users over $N$ slots can maximize the sum achievable rate only when all four variable sets are optimized together: trajectory $\mathbf{Q}$, receive beamforming $\mathbf{W}$, user powers $\mathbf{P}$, and antenna positions $\mathbf{U}$. Under the far-field field-response model, moving the $k$-th antenna by $(x_{k,n},y_{k,n})$ changes the channel phase by $\frac{2\pi}{\lambda}(x_{k,n}\sin\theta\cos\phi + y_{k,n}\sin\theta\sin\phi)$ per path, so the antenna-placement subproblem is one of aligning phases with the strongest multi-path components while maintaining a minimum antenna spacing. The paper proposes an alternating optimization algorithm that guarantees a non-decreasing objective and reports simulation results in which the joint design exceeds all benchmarks on sum rate and on the tail of the user rate distribution.

Load-bearing premise

The whole rate gain rests on the far-field field-response assumption that, within the small antenna region, each multi-path arrival keeps a fixed angle and amplitude while only its phase changes, and that the AAV knows these angles perfectly and can reposition its antennas instantly each two-second slot.

Editorial extensions

If this is right

  • Jointly optimizing the AAV trajectory and the antenna positions yields the largest simulated gains; fixing the trajectory causes 30 percent of users to fall below 0.2 bps/Hz, while the joint design keeps 90 percent above 7.5 bps/Hz.
  • Each movable antenna acts as a continuously reconfigurable phase shifter across multi-path arrivals, so the same $K$ antennas can align with different users over different time slots without additional RF chains.
  • The simulated gain grows with the number of antennas, the number of paths, and the size of the allowed antenna region, while a fixed antenna array cannot exploit the extra spatial degrees of freedom.
  • The monotone convergence of the alternating algorithm in simulation makes the joint design computationally plausible at the tested scale of about four users, four antennas, and twenty slots.

Reading between the lines

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

  • The phase-only far-field assumption is the most fragile part; an obvious next experiment is to measure channel vectors as an antenna sweeps the region, since angle-dependent amplitudes or near-field effects would shrink the reported gains.
  • The paper defers AAV aerodynamic energy to future work, so its trajectories are energy-unconstrained; an energy budget would likely shorten the optimized paths and reduce the gap over non-optimized trajectories.
  • A comparison against a dense fixed array with antenna selection in the same $4\lambda \times 4\lambda$ region would isolate whether the benefit comes from continuous phase tuning or simply from having more receive positions to choose from.
  • The current scenario is small, with four users, one AAV, and no delay constraints; scaling to dense IoT collections with per-user latency and fairness constraints is a natural stress test for the PSO-based antenna placement.
Share X Bluesky LinkedIn Reddit HN

Editorial analysis

A structured set of objections, weighed in public.

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

Referee Report

3 major / 6 minor

Summary. The paper considers an AAV equipped with movable antennas (MAs) that flies over a low-altitude network to collect uplink data from single-antenna ground users. The authors formulate a sum achievable-rate maximization problem that jointly optimizes the AAV trajectory, receive beamforming, user transmit power, and MA positions. They solve it with an alternating optimization framework: SCA for the trajectory subproblem, WMMSE-based updates for beamforming and power, and PSO for MA positions. A convergence proof and complexity analysis are provided, and simulations compare the proposed scheme with three benchmarks (AO-MM, fixed trajectory, fixed antenna array).

Significance. The problem is timely and the algorithmic pipeline is competently assembled from standard tools; the paper also provides a complexity analysis and evaluates true sum-rates in the AO loop, which is good practice. If the technical gaps below are fixed, the result would be a useful contribution to MA-empowered UAV communications. However, the current version's theoretical guarantees and the validity of the numerical gains rest on two load-bearing issues: an invalid SCA lower bound (both the trust-region omission and an incorrect linearization coefficient) and an unsupported monotonicity claim for the PSO step. These need to be addressed before the central claims can be accepted.

major comments (3)
  1. [IV-A, Eq. (18) and (26)] The trust-region constraint (18), introduced to justify freezing the field-response angles at the previous iterate when forming the surrogate channel in (16)-(17), is not included in the constraint set of subproblem P2-1 in (26) nor in Algorithm 1. Consequently, the surrogate objective (22)-(25) is only a lower bound on the true sum-rate in the neighborhood defined by (18); an SCA step can move outside this neighborhood, where the surrogate may exceed the true objective, so inequality (52) in Appendix C does not follow. Proposition 1 and the convergence results in Fig. 2 therefore lack a theoretical basis. The authors should either add (18) to P2-1 and Algorithm 1 or replace it with a backtracking line-search rule that preserves the lower-bound property.
  2. [IV-A, Eq. (23)] The first-order lower bound on the signal-plus-interference-plus-noise term in (23) is not generally valid as written. For a logarithmic function of sum terms a_r d_{r,n}^{-2} + c, the linearization coefficient for each r should be proportional to a_r = p_{r,n}|w_{m,n}^H h_{r,n}^{Xi}|^2, but Eq. (23) defines E_{r,n} with the sum over r of p_{r,n}|...|^2 in the numerator. This overestimates the slope of the tangent, which is only a lower bound for the exact derivative; the inequality can be violated away from the expansion point (e.g., when distances shrink). This invalidates the concavity claim for R_first and the overall validity of P2-1 as a surrogate for P2.
  3. [IV-C, Algorithm 3, and Appendix C] The monotonicity argument in (54) of Appendix C assumes that the PSO step yields a non-decreasing objective value. This is not guaranteed by Algorithm 3 as stated: the output is the final swarm positions P(T) (Algorithm 3, line 18), not the global best position. The global best fitness is non-decreasing only for the global best, not for the returned positions. Moreover, the position update in (43) clips only to the region [0, L] and does not enforce the minimum-distance constraint (14f), which is handled only through a penalty in the fitness (44); the returned solution can therefore be infeasible or have a lower true sum-rate than the previous iterate. The authors should return the global best (and project it onto the feasible set) or provide a different argument that the PSO step does not decrease the objective.
minor comments (6)
  1. [Eq. (26b)] The constraint list of P2-1 is written as "(14b) - (14d), (24), (26b)", which appears to include the constraint label itself; this should be corrected to "(14b)-(14d), (18), (24)" if the trust region is restored.
  2. [Eq. (27b)] The constraint list of P3 includes (14f), which is the minimum-distance constraint on MA positions and is not relevant when optimizing over W and P with U fixed; the constraints should be (14e) and (14h).
  3. [Algorithm 4] The input line lists "initial feasible solution Qi, Wi, Wi, and Pi", with a duplicated Wi; this appears to be a typo.
  4. [Eq. (44)] The term U_bar(P_t) is defined as a set of violating position pairs, but the expression ||U_bar(P_t)|| is used; a norm of a set is undefined. Please define this quantity, for example as the number of violating pairs or the squared violation magnitude.
  5. [Theorem 2 and Eq. (37)] The closed-form power update in (37) contains the dual variables mu_{m,n}, but the paper does not specify how these dual variables are updated or how the box constraint (35b) is enforced. Please provide the dual update rule (e.g., bisection) so that Algorithm 2 is reproducible.
  6. [Fig. 9] The statement that "90% of users of the proposed scheme achieves over 7.5 bps/Hz" is not directly supported by the CDF plot alone; please clarify whether the CDF is over users, time slots, or both, and define the axis variable.

Circularity Check

0 steps flagged · score 2.0 of 10

No circular derivation found: the claimed rate gains are produced by an independent simulator from a standard AO pipeline; the paper's self-citations are contextual and not load-bearing.

full rationale

The central claim (sum achievable rate and reliability gains of the proposed MA-AAV scheme) is evaluated by simulating the system model in Section III and running Algorithms 1-4 against three baselines in Section V. The optimized variables (trajectory Q, beamforming W, power P, MA positions U) are not fitted to the target rate curves; the curves are outputs of the simulation, so there is no fitted-input-called-prediction or self-definitional reduction. The channel model is taken from external works ([13], [45]), the WMMSE transformation from [48], and PSO from [49], [50]; none of these citations is used to assert the paper's performance conclusion. Several prior papers by overlapping authors ([5], [12], [23], [27], [30], [33], [41], [42]) appear, but they are cited for background, problem motivation, or related-work comparison (Table I), not as the proof of the proposed algorithm's effectiveness. The one notable gap, the omitted trust-region constraint (18) in subproblem P2-1 and the unproven non-decreasing PSO fitness assumption in Appendix C, undermines the convergence proof of Algorithm 4; however, that is a correctness and convergence concern, not a circularity, because the surrogate objective is not defined to equal the target result. No step in the derivation chain reduces by construction to its own input.

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

The central performance claim rests on idealized channel and CSI assumptions plus hand-tuned solver hyperparameters. No genuinely new physical entity is introduced. The most fragile entries are the far-field channel model, which defines the MA gain mechanism, and the perfect-CSI assumption, which is not modeled as a cost. Several hand-set algorithm parameters such as PSO constants and the trust-region radius are not subjected to sensitivity analysis.

free parameters (3)
  • PSO hyperparameters (chi_min, chi_max, L1, L2, penalty psi) = 0.4, 0.9, 1.4, 1.4, 20
    Hand-set in Table II; no sensitivity analysis is reported, and these values directly control the quality of the MA-position solutions that drive the reported gains.
  • PSO swarm size S and iteration count t_max = 100, 100
    Hand-set; no ablation study is provided. Larger values would improve the heuristic solution at higher computational cost.
  • Trust-region radius phi_l = not specified
    Introduced in Eq. (18) to justify the fixed-FRV approximation, but never given a value or update rule, and omitted from the constraint list of P2-1 in Eq. (26b).
assumptions (6)
  • domain assumption Far-field field-response channel model: MA displacement changes path phases only, while AoAs, AoDs, and amplitudes remain constant over the MA region.
    Invoked in Section III-A before Eq. (7), following [13], [45]. This is the physical mechanism that makes MA position optimization valuable; if it fails, the central rate gain is not established.
  • domain assumption Free-space large-scale path loss alpha_m,n = h0 * d_m,n^(-2) for every AAV-user link.
    Used in Section III-A and in Table II with h0 = -60 dB. No LoS probability, shadowing, or ground reflection terms are included, so the model is optimistic and may inflate trajectory or MA gains.
  • domain assumption Perfect instantaneous CSI and perfect instantaneous MA repositioning within each time slot.
    Implicit throughout the problem formulation and simulations; the 2 s slot duration, AoA estimation error, positioning latency, and channel aging are not modeled.
  • domain assumption The AAV is quasi-static within each time slot and flies at fixed altitude H.
    Used in Section III-A to define Q_n and per-slot channels; the model ignores dynamics within each 2 s slot.
  • standard math The WMMSE equivalence and SCA surrogate bounds from [47] and [48] are exact and applicable to this problem.
    The algorithm depends on these known transformations; they are cited rather than re-proved, and their applicability is assumed.
  • standard math The objective is bounded so that monotone increase implies convergence of Algorithm 4.
    Appendix C asserts boundedness from 'resource constraints on communication, AAV mobility, and energy', but P1 as stated in Eq. (14) contains no explicit energy constraint. The sum rate is finite for other reasons, yet the proof is not precise.

how reviews work

0 comments
Cite this review

Pith. "Pith review of Movable-Antenna Empowered AAV-Enabled Data Collection over Low-Altitude Wireless Networks." pith.science (2026). https://pith.science/paper/Q6TE4E2W

@misc{pith2026250715515,
  author       = {Pith},
  title        = {Pith review of: Movable-Antenna Empowered AAV-Enabled Data Collection over Low-Altitude Wireless Networks},
  year         = {2026},
  howpublished = {\url{https://pith.science/paper/Q6TE4E2W}},
  note         = {Machine review of arXiv:2507.15515}
}
read the original abstract

Movable-antennas (MAs) are revolutionizing spatial signal processing by providing flexible beamforming in next-generation wireless systems. This paper investigates an MA-empowered autonomous aerial vehicle (AAV) system in low-altitude wireless networks (LAWNs) for uplink data collection from ground users. We aim to maximize the sum achievable rate by jointly optimizing the AAV trajectory, receive beamforming, and MA positions. An efficient alternating optimization (AO) algorithm that incorporates successive convex approximation, weighted minimum mean square error, and particle swarm optimization is developed. The analysis of the computational complexity and convergence features is provided. Extensive simulations demonstrate superior performance in terms of the sum achievable rate and the service reliability comparing to several benchmark schemes. These results demonstrate the distinctive advantages of the proposed scheme: enhanced spectral efficiency via adaptive beam-user alignment and improved collection reliability through spatial interference management, highlighting the implementation potential of the MA-empowered LAWNs.

Figures

Figures reproduced from arXiv: 2507.15515 by the authors.

Figure 1
Figure 1. The system model. A three-dimensional Cartesian coordinate system is utilized to represent the position of the AAV and the users, where the location of the m-th user is denoted by Pm = [sm, 0], where sm = [xm, ym] represents the horizontal coordinates. The AAV flies at a fixed altitude H, which is sufficiently high to avoid any obstacles including terrains, towers, and buildings. Additionally, given the short durati… view at source ↗
Figure 3
Figure 3. The optimized trajectory of the AAV [PITH_FULL_IMAGE:figures/full_fig_p009_3.png] view at source ↗
Figure 4
Figure 4. The sum achievable rate versus maximum transmit [PITH_FULL_IMAGE:figures/full_fig_p009_4.png] view at source ↗
Figures from the paper (5 more)
Figure 6
Figure 6. Figure 6: The sum achievable rate versus number of path. [PITH_FULL_IMAGE:figures/full_fig_p010_6.png]
Figure 5
Figure 5. Figure 5: The sum achievable rate versus number of antennas. [PITH_FULL_IMAGE:figures/full_fig_p010_5.png]
Figure 7
Figure 7. Figure 7: The sum achievable rate versus the normalized region [PITH_FULL_IMAGE:figures/full_fig_p010_7.png]
Figure 8
Figure 8. Figure 8: The sum achievable rate versus the AAV maximum [PITH_FULL_IMAGE:figures/full_fig_p011_8.png]
Figure 9
Figure 9. Figure 9: The CDFs of communication rates versus the achiev [PITH_FULL_IMAGE:figures/full_fig_p011_9.png]

Discussion (0). Continue with ORCID to comment.

Forward citations

Cited by 3 Pith papers

Reviewed papers in the Pith corpus that reference this work. Sorted by Pith novelty score. Full citation record

  1. UAV-Enabled Fluid Antenna Systems for Multi-Target Wireless Sensing over LAWCNs

    cs.IT 2025-09 reject novelty 4.0 of 10

    A joint trajectory, beamforming, and fluid-antenna-position optimization is proposed to minimize the average Cramér-Rao bound for multi-target sensing from a UAV.

  2. Latency Minimization for Multi-AAV-Enabled ISCC Systems with Movable Antenna

    cs.IT 2025-08 conditional novelty 4.0 of 10

    Jointly optimizing movable-antenna positions, beamforming, and computation resources via PSO plus convex relaxation reduces worst-case latency in a simulated multi-drone ISCC system.

  3. Advancing Fluid Antenna-Assisted Non-Terrestrial Networks in 6G and Beyond: Fundamentals, State of the Art, and Future Directions

    cs.NI 2025-11 unverdicted novelty 1.0 of 10

    A literature survey of fluid-antenna-assisted non-terrestrial networks; it organizes existing results and identifies future directions but proves no new result.

Reference graph

Works this paper leans on

54 extracted references · 40 canonical work pages · cited by 3 Pith papers

  1. [42]

    UA V-enabled wireless networks with movable-antenna array: Flexible beamforming and trajectory design,

    W. Liu, X. Zhang, H. Xing, J. Ren, Y . Shen, and S. Cui, “UA V-enabled wireless networks with movable-antenna array: Flexible beamforming and trajectory design,” IEEE Wireless Commun. Lett., vol. 14, no. 3, pp. 566–570, Mar. 2025

    work page 2025

  2. [1]

    Networked ISAC for low- altitude economy: Coordinated transmit beamforming and UA V trajec- tory design,

    G. Cheng, X. Song, Z. Lyu, and J. Xu, “Networked ISAC for low- altitude economy: Coordinated transmit beamforming and UA V trajec- tory design,” IEEE Trans. Commun. , to appear, 2025

    2025

  3. [2]

    Movable-antenna array empowered ISAC systems for low-altitude economy,

    Z. Kuang, W. Liu, C. Wang, Z. Jin, J. Ren, X. Zhang, and Y . Shen, “Movable-antenna array empowered ISAC systems for low-altitude economy,” in Proc. IEEE/CIC Int. Conf. Commun. China Workshops (ICCC Workshops), Hangzhou, China, Aug. 2024, pp. 776–781

    work page 2024

  4. [3]

    A comprehensive overview on 5G-and-beyond networks with UA Vs: From communications to sensing and intelligence,

    Q. Wu, J. Xu, Y . Zeng, D. W. K. Ng, N. Al-Dhahir, R. Schober, and A. L. Swindlehurst, “A comprehensive overview on 5G-and-beyond networks with UA Vs: From communications to sensing and intelligence,” IEEE J. Sel. Areas Commun. , vol. 39, no. 10, pp. 2912–2945, Oct. 2021

    work page 2021

  5. [4]

    Accessing from the sky: A tutorial on UA V communications for 5G and beyond,

    Y . Zeng, Q. Wu, and R. Zhang, “Accessing from the sky: A tutorial on UA V communications for 5G and beyond,”Proc. IEEE, vol. 107, no. 12, pp. 2327–2375, Dec. 2019

    2019

  6. [5]

    Joint trajectory design and resource allocation in UA V-enabled heterogeneous MEC systems,

    W. Liu, H. Wang, X. Zhang, H. Xing, J. Ren, Y . Shen, and S. Cui, “Joint trajectory design and resource allocation in UA V-enabled heterogeneous MEC systems,” IEEE Internet Things J. , vol. 11, no. 19, pp. 30 817– 30 832, Oct. 2024

    2024

  7. [6]

    5G: A tutorial overview of standards, trials, challenges, deployment, and practice,

    M. Shafi, A. F. Molisch, P. J. Smith, T. Haustein, P. Zhu, P. De Silva, F. Tufvesson, A. Benjebbour, and G. Wunder, “5G: A tutorial overview of standards, trials, challenges, deployment, and practice,” IEEE J. Sel. Areas Commun., vol. 35, no. 6, pp. 1201–1221, Jun. 2017

    work page 2017

  8. [7]

    Hybrid beamforming for massive MIMO: A survey,

    A. F. Molisch, V . V . Ratnam, S. Han, Z. Li, S. L. H. Nguyen, L. Li, and K. Haneda, “Hybrid beamforming for massive MIMO: A survey,” IEEE Commun. Mag. , vol. 55, no. 9, pp. 134–141, Sep. 2017

    work page 2017

Show all 54 references
  1. [8]

    Hybrid beamforming design and resource allocation for UA V-aided wireless-powered mobile edge computing networks with NOMA,

    W. Feng, J. Tang, N. Zhao, X. Zhang, X. Wang, K.-K. Wong, and J. A. Chambers, “Hybrid beamforming design and resource allocation for UA V-aided wireless-powered mobile edge computing networks with NOMA,” IEEE J. Sel. Areas Commun. , vol. 39, no. 11, pp. 3271–3286, Nov. 2021

    2021

  2. [9]

    Movable antennas enabled ISAC systems: Fundamentals, opportunities, and future directions,

    Z. Li, J. Ba, Z. Su, J. Huang, H. Peng, W. Chen, L. Du, and T. H. Luan, “Movable antennas enabled ISAC systems: Fundamentals, opportunities, and future directions,” IEEE Wireless Commun., to appear, 2025

    2025

  3. [10]

    Historical review of fluid antenna and movable antenna,

    L. Zhu and K.-K. Wong, “Historical review of fluid antenna and movable antenna,” arXiv preprint arXiv:2401.02362 , 2024

    2024 arXiv

  4. [11]

    Movable antennas for wireless commu- nication: Opportunities and challenges,

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

    2024

  5. [12]

    Movable antennas meet low-altitude wireless networks: Fundamentals, opportunities, and future directions,

    W. Liu, X. Zhang, C. Wang, J. Ren, and W. Yuan, “Movable antennas meet low-altitude wireless networks: Fundamentals, opportunities, and future directions,” arXiv preprint arXiv:2506.13250 , 2025. 14 ˜Rm,n = gH m,k,nEm,k,ngm,k,n + Re{FH m,k,ngm,k,n} + ˜Υm,n ≥ ζm,k,ngH m,k,nIgm,...

    2025

  6. [13]

    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

    2024

  7. [14]

    Fluid antenna empowered integration of sensing, communications and computing with hybrid multi-task offloading,

    C. Dou, Y . Wu, L. Qian, K.-K. Wong, and T. Q. S. Quek, “Fluid antenna empowered integration of sensing, communications and computing with hybrid multi-task offloading,” IEEE Wireless Commun. Lett. , to appear, 2025

    2025

  8. [15]

    Movable antenna-equipped UA V for data collection in backscatter sensor net- works: A deep reinforcement learning-based approach,

    Y . Bai, B. Xie, R. Zhu, Z. Chang, and R. Jantti, “Movable antenna-equipped UA V for data collection in backscatter sensor net- works: A deep reinforcement learning-based approach,” arXiv preprint arXiv:2411.13970, 2024

    2024 arXiv

  9. [16]

    Multi-agent reinforcement learning- based resource allocation for UA V networks,

    J. Cui, Y . Liu, and A. Nallanathan, “Multi-agent reinforcement learning- based resource allocation for UA V networks,” IEEE Trans. Wireless Commun., vol. 19, no. 2, pp. 729–743, Feb. 2020

    2020

  10. [17]

    Distributed energy-efficient multi-UA V navigation for long-term communication coverage by deep reinforcement learning,

    C. H. Liu, X. Ma, X. Gao, and J. Tang, “Distributed energy-efficient multi-UA V navigation for long-term communication coverage by deep reinforcement learning,” IEEE Trans. Mobile Comput. , vol. 19, no. 6, pp. 1274–1285, Jun. 2020

    2020

  11. [18]

    UA V- relaying-assisted secure transmission with caching,

    F. Cheng, G. Gui, N. Zhao, Y . Chen, J. Tang, and H. Sari, “UA V- relaying-assisted secure transmission with caching,” IEEE Trans. Com- mun., vol. 67, no. 5, pp. 3140–3153, May 2019

    2019

  12. [19]

    URLLC facilitated by mobile UA V relay and RIS: A joint design of passive beamforming, blocklength, and UA V positioning,

    A. Ranjha and G. Kaddoum, “URLLC facilitated by mobile UA V relay and RIS: A joint design of passive beamforming, blocklength, and UA V positioning,” IEEE Internet Things J., vol. 8, no. 6, pp. 4618–4627, Mar. 2021

    2021

  13. [20]

    Joint 3-D trajectory and resource optimization in multi-UA V-enabled IoT networks with wireless power transfer,

    W. Luo, Y . Shen, B. Yang, S. Wang, and X. Guan, “Joint 3-D trajectory and resource optimization in multi-UA V-enabled IoT networks with wireless power transfer,” IEEE Internet Things J. , vol. 8, no. 10, pp. 7833–7848, May 2021

    2021

  14. [21]

    Bayesian optimization enhanced deep reinforcement learning for tra- jectory planning and network formation in multi-UA V networks,

    S. Gong, M. Wang, B. Gu, W. Zhang, D. T. Hoang, and D. Niyato, “Bayesian optimization enhanced deep reinforcement learning for tra- jectory planning and network formation in multi-UA V networks,” IEEE Trans. Veh. Technol., vol. 72, no. 8, pp. 10 933–10 948, Aug. 2023

    2023

  15. [22]

    Joint maneuver and beamforming design for UA V-enabled integrated sensing and communication,

    Z. Lyu, G. Zhu, and J. Xu, “Joint maneuver and beamforming design for UA V-enabled integrated sensing and communication,” IEEE Trans. Wireless Commun., vol. 22, no. 4, pp. 2424–2440, Apr. 2023

    2023

  16. [23]

    AoI-aware UA V-enabled marine MEC networks with integrated sensing, computa- tion, and communication,

    W. Liu, Z. Jin, X. Zhang, W. Zang, S. Wang, and Y . Shen, “AoI-aware UA V-enabled marine MEC networks with integrated sensing, computa- tion, and communication,” in Proc. IEEE/CIC Int. Conf. Commun. China Workshops (ICCC Workshops), Dalian, China, Aug. 2023, pp. 1–6

    2023

  17. [24]

    Joint 3-D deployment and resource allocation for UA V-assisted integrated communication and localization,

    S. Bi, J. Yu, Z. Yang, X. Lin, and Y . Wu, “Joint 3-D deployment and resource allocation for UA V-assisted integrated communication and localization,” IEEE Wireless Commun. Lett. , vol. 12, no. 10, pp. 1672– 1676, Oct. 2023

    2023

  18. [25]

    On the design of RIS–UA V relay-assisted hybrid FSO/RF satellite–aerial–ground integrated net- work,

    T. V . Nguyen, H. D. Le, and A. T. Pham, “On the design of RIS–UA V relay-assisted hybrid FSO/RF satellite–aerial–ground integrated net- work,” IEEE Trans. Aerosp. Electron. Syst., vol. 59, no. 2, pp. 757–771, Apr. 2023

    2023

  19. [26]

    Hierarchical bandwidth allocation for social community-oriented multicast in space-air-ground integrated networks,

    Q. Xu, Z. Su, D. Fang, and Y . Wu, “Hierarchical bandwidth allocation for social community-oriented multicast in space-air-ground integrated networks,” IEEE Trans. Wireless Commun. , vol. 22, no. 3, pp. 1915– 1930, Mar. 2023

    1915

  20. [27]

    Blockchain- empowered space-air-ground integrated networks for remote internet of things,

    W. Liu, J. Wang, H. Xing, Z. Jin, X. Zhang, and Y . Shen, “Blockchain- empowered space-air-ground integrated networks for remote internet of things,” in Proc. IEEE/CIC Int. Conf. Commun. China , Dalian, China, Aug. 2023, pp. 1–6

    2023

  21. [28]

    UA V-IRS assisted covert communication: Introducing uncertainty via phase shifting,

    X. Chen, Z. Chang, M. Liu, N. Zhao, T. H ¨am¨al¨ainen, and D. Niyato, “UA V-IRS assisted covert communication: Introducing uncertainty via phase shifting,” IEEE Wireless Commun. Lett. , vol. 13, no. 1, pp. 103– 107, Jan. 2024

    2024

  22. [29]

    Alternative optimization for secrecy throughput maximization in UA V-aided NOMA networks,

    L. P. Qian, W. Zhang, Q. Wang, Y . Wu, and X. Yang, “Alternative optimization for secrecy throughput maximization in UA V-aided NOMA networks,” IEEE Wireless Commun. Lett. , vol. 11, no. 12, pp. 2580– 2584, Dec. 2022

    2022

  23. [30]

    Average AoI minimization in UA V-assisted IoT backscatter communication systems with updated information,

    X. Zhang, W. Luo, Y . Shen, and S. Wang, “Average AoI minimization in UA V-assisted IoT backscatter communication systems with updated information,” in Proc. IEEE Ubiquitous Intell. Comput. (UIC) , Atlanta, GA, USA, Oct. 2021, pp. 123–130

    2021

  24. [31]

    AoI-aware sensing scheduling and trajectory optimization for multi-UA V-assisted wireless backscatter networks,

    Y . Long, S. Zhao, S. Gong, B. Gu, D. Niyato, and X. Shen, “AoI-aware sensing scheduling and trajectory optimization for multi-UA V-assisted wireless backscatter networks,” IEEE Trans. Veh. Technol. , vol. 73, no. 10, pp. 15 440–15 455, Oct. 2024

    2024

  25. [32]

    UA V-assisted data collection for internet of things: A survey,

    Z. Wei, M. Zhu, N. Zhang, L. Wang, Y . Zou, Z. Meng, H. Wu, and Z. Feng, “UA V-assisted data collection for internet of things: A survey,” IEEE Internet Things J. , vol. 9, no. 17, pp. 15 460–15 483, Sep. 2022

    2022

  26. [33]

    Age of information minimization in UA V-enabled IoT networks via federated reinforcement learning,

    X. Zhang, H. Xing, Y . Shen, J. Xu, and S. Cui, “Age of information minimization in UA V-enabled IoT networks via federated reinforcement learning,” IEEE Trans. Wireless Commun. , to appear, 2025

    2025

  27. [34]

    Energy-efficient UA V-enabled data collection via wireless charging: A reinforcement learning approach,

    S. Fu, Y . Tang, Y . Wu, N. Zhang, H. Gu, C. Chen, and M. Liu, “Energy-efficient UA V-enabled data collection via wireless charging: A reinforcement learning approach,” IEEE Internet Things J. , vol. 8, no. 12, pp. 10 209–10 219, Jun. 2021

    2021

  28. [35]

    Joint task offloading and resource allocation in UA V-enabled mobile edge computing,

    Z. Yu, Y . Gong, S. Gong, and Y . Guo, “Joint task offloading and resource allocation in UA V-enabled mobile edge computing,” IEEE Internet Things J. , vol. 7, no. 4, pp. 3147–3159, Apr. 2020

    2020

  29. [36]

    Incentive oriented two-tier task offloading scheme in marine edge computing networks: A hybrid stackelberg-auction game approach,

    M. Dai, Z. Luo, Y . Wu, L. Qian, B. Lin, and Z. Su, “Incentive oriented two-tier task offloading scheme in marine edge computing networks: A hybrid stackelberg-auction game approach,” IEEE Trans. Wireless Commun., vol. 22, no. 12, pp. 8603–8619, Dec. 2023

    2023

  30. [37]

    UA V-assisted multi-cluster over-the-air computation,

    M. Fu, Y . Zhou, Y . Shi, C. Jiang, and W. Zhang, “UA V-assisted multi-cluster over-the-air computation,” IEEE Trans. Wireless Commun., vol. 22, no. 7, pp. 4668–4682, Jul. 2023

    2023

  31. [38]

    Energy-efficient over-the-air computation in UA V-assisted IIoT networks,

    Y . Chen, S. Sun, M. Liu, B. Ai, Y . Wang, and Y . Liu, “Energy-efficient over-the-air computation in UA V-assisted IIoT networks,” IEEE Trans. Mobile Comput., to appear, 2025

    2025

  32. [39]

    Federated learning via unmanned aerial vehicle,

    M. Fu, Y . Shi, and Y . Zhou, “Federated learning via unmanned aerial vehicle,” IEEE Trans. Wireless Commun., vol. 23, no. 4, pp. 2884–2900, Apr. 2024

    2024

  33. [40]

    UA V-enabled asynchronous federated learning,

    Z. Zhai, X. Yuan, X. Wang, and H. Yang, “UA V-enabled asynchronous federated learning,” IEEE Trans. Wireless Commun., vol. 24, no. 3, pp. 2358–2372, Mar. 2025

    2025

  34. [41]

    Latency minimization for UA V-enabled federated learning: Trajectory design and resource allocation,

    X. Zhang, W. Liu, J. Ren, H. Xing, G. Gui, Y . Shen, and S. Cui, “Latency minimization for UA V-enabled federated learning: Trajectory design and resource allocation,” IEEE Internet Things J., vol. 12, no. 14, pp. 27 097– 27 112, Jul. 2025

    2025

  35. [43]

    6D movable antenna enhanced interference mitigation for cellular-connected UA V communications,

    T. Ren, X. Zhang, L. Zhu, W. Ma, X. Gao, and R. Zhang, “6D movable antenna enhanced interference mitigation for cellular-connected UA V communications,” IEEE Wireless Commun. Lett. , vol. 14, no. 6, pp. 1618–1622, Jun. 2025

    2025

  36. [44]

    Multiuser MISO UA V communications in uncertain environments with no-fly zones: Ro- bust trajectory and resource allocation design,

    D. Xu, Y . Sun, D. W. K. Ng, and R. Schober, “Multiuser MISO UA V communications in uncertain environments with no-fly zones: Ro- bust trajectory and resource allocation design,” IEEE Trans. Commun. , vol. 68, no. 5, pp. 3153–3172, May 2020

    2020

  37. [45]

    Antenna positioning and beamforming design for fluid antenna-assisted multi- user downlink communications,

    H. Qin, W. Chen, Z. Li, Q. Wu, N. Cheng, and F. Chen, “Antenna positioning and beamforming design for fluid antenna-assisted multi- user downlink communications,” IEEE Wireless Commun. Lett., vol. 13, no. 4, pp. 1073–1077, Apr. 2024

    2024

  38. [46]

    Advanced ISAC design: Movable antennas and accounting for dynamic RCS,

    A. Khalili and R. Schober, “Advanced ISAC design: Movable antennas and accounting for dynamic RCS,” in Proc. IEEE Glob. Commun. Conf. (GLOBECOM), Cape Town, South Africa, Dec. 2024, pp. 4022–4027. 15

    2024

  39. [47]

    Beamforming design and trajectory optimization for UA V-empowered adaptable integrated sensing and communication,

    C. Deng, X. Fang, and X. Wang, “Beamforming design and trajectory optimization for UA V-empowered adaptable integrated sensing and communication,” IEEE Trans. Wireless Commun. , vol. 22, no. 11, pp. 8512–8526, Nov. 2023

    2023

  40. [48]

    An iteratively weighted MMSE approach to distributed sum-utility maximization for a MIMO interfering broadcast channel,

    Q. Shi, M. Razaviyayn, Z.-Q. Luo, and C. He, “An iteratively weighted MMSE approach to distributed sum-utility maximization for a MIMO interfering broadcast channel,” IEEE Trans. Signal Process. , vol. 59, no. 9, pp. 4331–4340, Sep. 2011

    2011

  41. [49]

    Multiuser commu- nications with movable-antenna base station: Joint antenna positioning, receive combining, and power control,

    Z. Xiao, X. Pi, L. Zhu, X.-G. Xia, and R. Zhang, “Multiuser commu- nications with movable-antenna base station: Joint antenna positioning, receive combining, and power control,” IEEE Trans. Wireless Commun., vol. 23, no. 12, pp. 19 744–19 759, Dec. 2024

    2024

  42. [50]

    Movable antenna-aided secure full-duplex multi-user communications,

    J. Ding, Z. Zhou, and B. Jiao, “Movable antenna-aided secure full-duplex multi-user communications,” IEEE Trans. Wireless Commun. , vol. 24, no. 3, pp. 2389–2403, Mar. 2025

    2025

  43. [51]

    Semidefinite relaxation of quadratic optimization problems,

    Z.-q. Luo, W.-k. Ma, A. M.-c. So, Y . Ye, and S. Zhang, “Semidefinite relaxation of quadratic optimization problems,” IEEE Signal Processing Magazine, vol. 27, no. 3, pp. 20–34, May 2010

    2010

  44. [52]

    Weighted sum-rate maximiza- tion for movable antenna-enhanced wireless networks,

    B. Feng, Y . Wu, X.-G. Xia, and C. Xiao, “Weighted sum-rate maximiza- tion for movable antenna-enhanced wireless networks,” IEEE Wireless Commun. Lett., vol. 13, no. 6, pp. 1770–1774, Jun. 2024

    2024

  45. [53]

    MIMO capacity characterization for movable antenna systems,

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

    2024

  46. [54]

    Majorization-minimization algo- rithms in signal processing, communications, and machine learning,

    Y . Sun, P. Babu, and D. P. Palomar, “Majorization-minimization algo- rithms in signal processing, communications, and machine learning,” IEEE Trans. Signal Process. , vol. 65, no. 3, pp. 794–816, Feb. 2016

    2016

Pith tools

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