REVIEW 3 major objections 5 minor 38 references
Joint Beamforming and Position Optimization for IRS-Aided SWIPT with Movable Antennas
T0 review · 3 major / 5 minor · reviewed 2026-08-03 · deepseek-v4-flash
Pith's one-line read The paper claims that jointly optimizing beamforming, IRS phases, and movable-antenna positions raises the weighted sum-rate of information-decoding receivers while meeting energy-harvesting constraints, with IRS phase optimization the larg
desk verdict Solid but incremental joint IRS+MA SWIPT optimization; the feasibility characterization only certifies feasibility, not infeasibility. read the letter →
The pith
A machine-rendered reading of the paper's core claim, the machinery that carries it, and where it could break.
The reading
What carries the argument
The load-bearing construction is the equivalent cascaded channel h_i = h_{r,i} Θ G(tB), built from field-response matrices for the movable-antenna array and the IRS, plus the WMMSE transformation that turns the sum-of-log-rates objective into a weighted mean-square-error form. The solution then alternates: BS beamforming is updated by convexifying the EHR power constraints with first-order Taylor lower bounds (MM); IRS phases are updated by PDD with an auxiliary unit-modulus variable and a closed-form phase projection; and each MA position is updated via MM using quadratic upper/lower surrogates of the trigonometric field-response terms. Feasibility of the EHR power constraints is decided by
What would settle it
Simulate the same system with a non-negligible direct BS–receiver channel (for example, path loss 15–20 dB below the cascaded BS–IRS–receiver path) and compare FPA-OPS against MA-RPS: if MA position optimization yields a larger sum-rate gain than IRS phase optimization, the paper's scenario-dependent comparative conclusion would be overturned.
Extended reading notes
Core claim
The central claim is that the weighted sum-rate maximization for an IRS-aided SWIPT system with movable antennas can be solved effectively by a decomposition that iterates among WMMSE updates, IRS phase optimization via penalty dual decomposition, and MM-based position updates, while guaranteeing each EHR's received power. The paper further claims that the solution outperforms benchmarks with fixed antennas and/or random IRS phases, and that under the adopted severely-blocked propagation model, optimizing the IRS configuration contributes more to sum-rate than optimizing antenna positions.
Load-bearing premise
The system assumes the direct links between the base station and all information/energy receivers are severely blocked, so every signal path goes through the IRS; if real direct links are not negligible, the relative benefit of IRS phase tuning versus antenna movement could differ.
Editorial extensions
If this is right
- Operators can use the proposed algorithm to jointly tune beamforming, IRS phases, and MA positions, improving IDR weighted sum-rate for a fixed BS power budget while keeping each EHR above its required received power.
- The feasibility characterization gives a yes/no check for whether a given EHR power requirement and BS power budget are compatible; if the minimized slack β* is positive, the problem is infeasible.
- The comparative simulations suggest that in severely blocked direct-link scenarios, investing in IRS phase optimization yields larger returns than antenna repositioning, so system designers may prioritize IRS phase tuning.
- Under the modeled path-response statistics, increasing the number of MAs and expanding the allowed array region improve performance, though gains saturate at large array sizes.
- The proposed decomposition inherits monotonic convergence behavior, with the main algorithm increasing the objective across BCD iterations; in tests it converges within tens of iterations.
Reading between the lines
- If the direct BS–receiver link is not negligible, the comparison between IRS phase gains and MA position gains could change; a natural extension is to simulate partial blockage and observe the crossover.
- The feasibility characterization developed here does not depend on the sum-rate objective and could be lifted into any IRS/MA system with power or QoS constraints, including wirelessly powered IoT networks with strict energy floors.
- Because MA gains in the field-response model come from selecting favorable phases across multiple propagation paths, the comparative advantage of IRS phases may weaken as the number of paths grows large; testing with larger L would clarify whether the conclusion is an artifact of the L=5 setting.
- Extending the design to movable IRS elements as well as movable BS antennas is a next step the current model does not include; the same MM/PDD machinery would likely apply.
Editorial analysis
A structured set of objections, weighed in public.
Referee Report
Summary. The paper studies an IRS-aided SWIPT system in which the BS is equipped with movable antennas (MAs). It formulates a weighted sum-rate maximization problem for the information-decoding receivers subject to power-harvest constraints at the energy-harvesting receivers, a transmit power budget, IRS phase-shift constraints, and MA position/decoupling constraints. The authors propose a solution based on WMMSE, BCD, majorization-minimization, and penalty dual decomposition, and they additionally present a feasibility characterization method for the EHR power constraints. Simulation results show monotone convergence behavior and performance gains over fixed-position-antenna and/or random-IRS baselines, with the qualitative finding that IRS phase optimization contributes more than MA position optimization under the considered relay-dominated propagation scenario.
Significance. If the results hold, the paper provides one of the first joint treatments of IRS and movable-antenna techniques in a SWIPT system, together with a concrete algorithmic recipe. The algorithmic framework is standard in structure, but its assembly for this problem is nontrivial. The paper is also explicit about its simulation setup and gives a useful comparison across four schemes (FPA/MA with optimized/random IRS). The strongest advertised novelty, however, is the feasibility characterization for the EHR power constraints; this contribution is currently not sound, as detailed below. The sum-rate optimization results are plausible, but the feasibility claim needs substantial correction before the paper can be accepted.
major comments (3)
- [Sec. IV, Algorithm 4, Eqs. (25), (32), (56)] The feasibility characterization is one-sided and the claimed infeasibility certification is unsound. In (P6), the constraint is P_E,j - P_j ≤ β, and P_j is convex in the relevant block. All MM surrogates used in Algorithm 4 (Eqs. (25), (32), (56)) are global lower bounds on P_j, so the feasible set of each surrogate subproblem is a subset of the true feasible set. Consequently, the β returned by Algorithm 4 is an upper bound on the optimal value of (P6), not the optimal value itself. A returned β>0 therefore does not rule out the existence of a point outside the surrogate feasible set that satisfies P_E,j - P_j ≤ 0. The statement in Sec. IV-A that a positive β* implies infeasibility of (P1), and the corresponding branch in Algorithm 4, are valid only for a global minimizer of (P6), which BCD/MM does not provide. The figure in Fig. 3 interpreting a positive converged value as infeasibili
- [Sec. III-B, Algorithm 2] The paper provides no convergence proof for the joint BCD algorithm. Fig. 2 shows an empirical monotone increase of the WMMSE objective, but the constraint surrogates in the beamforming, IRS, and MA subproblems (e.g., (26a), (33a), (58a)) change the feasible set at every iteration. Standard BSUM or MM convergence results do not directly apply because the feasible sets are not fixed. Since the central claim is an efficient algorithm for the joint problem, the authors should either prove monotonicity/stationarity under the surrogate constraints or clearly state the exact stationarity conditions that the algorithm intends to meet. As written, the convergence is only empirically demonstrated.
- [Sec. III-A, Eq. (18)-(19)] The transformation from (P1) to (P2) is stated as an equivalence, but (18) contains only inequalities. The equivalence is standard in WMMSE, but it requires the argument that after optimizing the auxiliary variables v and w for fixed f, the lower bound becomes tight and the optimal value of (P2) equals that of (P1). The paper should either provide this lemma or give a precise citation to a theorem in [29] that establishes it. This is a minor technical gap, but it is load-bearing for the algorithmic derivation, so it should be addressed explicitly.
minor comments (5)
- [Sec. II-A, Eq. (5)] The channel G is written as G(˜tB) but its definition in (5) also depends on ˜tR through F_r^G(˜tR). The notation is misleading; either include both arguments or add a sentence that the IRS element positions are fixed for the channel G in the considered problem.
- [Sec. II-A] The assumption that direct links between the BS and IDRs/EHRs are severely blocked is load-bearing for the paper's qualitative conclusion that IRS optimization contributes more than MA positioning. The paper is careful to say 'under our considered scenario,' but a sensitivity study with a weak, non-zero direct-link component would help the reader understand the robustness of the comparative claim.
- [Sec. III-B, Algorithm 2 and Sec. IV-B, Algorithm 4] Both algorithms require a feasible starting point (e.g., 'Initialize feasible f(0), t_B(0), θ(0)'), but no procedure for constructing such a point is given. The feasibility algorithm of Sec. IV could be used for this purpose when it returns β≤0, but the paper does not explain how; a brief comment would make the algorithms more actionable.
- [Sec. IV-B, Algorithm 4] The fractional superscripts for the β updates (e.g., β^(n+1/(M+2))) are confusing. A single loop counter with separate block indices would be more readable.
- [Fig. 3] The caption and the text interpret the curve with PB=25 dBm as infeasible without acknowledging the surrogate-subset issue raised in the major comment. This should be revisited after the feasibility method is corrected.
Circularity Check
No circularity: derivations are self-contained standard transforms; the feasibility concern is a correctness issue, not circularity.
full rationale
The derivation chain is self-contained: (P1) is transformed by the standard WMMSE inequality (18) to (P2), then BCD subproblems are solved by CVX with MM/PDD surrogates (Eqs. (25), (32), (42)-(57)), and the final sum-rate values are benchmarked against FPA/RPS baselines in Figs. 4-7. No parameter is fitted and then relabeled as a prediction; the algorithm optimizes the original variables and the comparisons are external baselines. Self-citations ([4], [8], [9], [17], [22], [25], [28]) appear in the introduction and background, but none supplies the load-bearing result: the channel model is from [15]/[16] and the algorithmic machinery from [29]-[32] is standard and independent. The Sec. IV feasibility criterion is an epigraph reformulation — β is the max violation of the EHR power constraints, so 'β*≤0 iff feasible' is true by construction; this is a legitimate exact reduction, not a self-referential prediction. The skeptical concern about Algorithm 4 is substantive but orthogonal to circularity: because (P7)-(P9) enforce only lower-bound surrogates, the returned β is an upper bound on the true β*, so β>0 cannot certify infeasibility. That is an algorithmic soundness flaw, not a derivation that reduces to its own inputs. No circular step.
Assumptions & free parameters
free parameters (3)
- Path loss exponents =
αG = αh,i = αg,j = 2.2
- Number of channel paths =
L = 5
- Network geometry =
dG=4m, dh∈[20,25]m, dg∈[4,4.5]m, A=2.5λc
assumptions (4)
- domain assumption Direct BS-user links are severely blocked
- domain assumption Perfect CSI is available
- domain assumption Quasi-static far-field field-response channel model
- standard math WMMSE surrogate equivalence
Cite this review
Pith. "Pith review of Joint Beamforming and Position Optimization for IRS-Aided SWIPT with Movable Antennas." pith.science (2026). https://pith.science/paper/IINTB7SA
@misc{pith2026251111148,
author = {Pith},
title = {Pith review of: Joint Beamforming and Position Optimization for IRS-Aided SWIPT with Movable Antennas},
year = {2026},
howpublished = {\url{https://pith.science/paper/IINTB7SA}},
note = {Machine review of arXiv:2511.11148}
}
read the original abstract
Simultaneous wireless information and power transfer (SWIPT) has been envisioned as a promising technology to support ubiquitous connectivity and reliable sustainability in Internet-of-Things (IoT) networks, which, however, generally suffers from severe attenuation caused by long distance propagation, leading to inefficient wireless power transfer (WPT) for energy harvesting receivers (EHRs). This paper proposes to introduce emerging intelligent reflecting surface (IRS) and movable antenna (MA) technologies into SWIPT systems aiming at enhancing information transmission for information decoding receivers (IDRs) and improving receive power of EHRs. We consider to maximize the weighted sum-rate of IDRs via jointly optimizing the active and passive beamforming at the base station (BS) and IRS, respectively, as well as the positions of MAs, while guaranteeing the requirements of all EHRs. To tackle this challenging task due to the non-convexity of associated optimization, we develop an efficient algorithm combining weighted minimal mean square error (WMMSE), block coordinate descent (BCD), majorization-minimization (MM), and penalty duality decomposition (PDD) frameworks. Besides, we present a feasibility characterization method to examine the achievability of EHRs' requirements. Simulation results demonstrate the significant benefits of our proposed solutions. Particularly, the optimized IRS configuration may exhibit higher performance gain than MA counterpart under our considered scenario.
Figures
Reference graph
Works this paper leans on
-
[29]
An iterativ ely 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 iterativ ely 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
-
[1]
Communications and si gnals design for wireless power transmission,
Y . Zeng, B. Clerckx, and R. Zhang, “Communications and si gnals design for wireless power transmission,” IEEE Trans. Commun. , vol. 65, no. 5, pp. 2264–2290, May 2017
2017
-
[2]
Massive MIMO for next generation wireless systems,
E. G. Larsson, O. Edfors, F. Tufvesson, and T. L. Marzetta , “Massive MIMO for next generation wireless systems,” IEEE Commun. Mag. , vol. 52, no. 2, pp. 186–195, Feb. 2014
2014
-
[3]
An over view of sustainable green 5G networks,
Q. Wu, G. Y . Li, W. Chen, D. W. K. Ng, and R. Schober, “An over view of sustainable green 5G networks,” IEEE Wireless Commun. , vol. 24, no. 4, pp. 72–80, Aug. 2017
2017
-
[4]
Intelligent surfaces empowered wireless n etwork: Recent advances and the road to 6G,
Q. Wu et al., “Intelligent surfaces empowered wireless n etwork: Recent advances and the road to 6G,” Proc. IEEE, vol. 112, no. 7, pp. 724–763, Jul. 2024
2024
-
[5]
Intelligent reflecting surface enhan ced wireless network via joint active and passive beamforming,
Q. Wu and R. Zhang, “Intelligent reflecting surface enhan ced wireless network via joint active and passive beamforming,” IEEE Trans. Wireless Commun., vol. 18, no. 11, pp. 5394–5409, Nov. 2019
2019
-
[6]
Multicell MIMO communications relying on intelligent reflecting surfaces,
C. Pan et al., “Multicell MIMO communications relying on intelligent reflecting surfaces,” IEEE Trans. Wireless Commun. , vol. 19, no. 8, pp. 5218–5233, Aug. 2020
2020
-
[7]
Reconfigurable intelligent surfaces for energy efficiency in wireless communication,
C. Huang, A. Zappone, G. C. Alexandropoulos, M. Debbah, a nd C. Y uen, “Reconfigurable intelligent surfaces for energy efficiency in wireless communication,” IEEE Trans. Wireless Commun. , vol. 18, no. 8, pp. 4157–4170, Aug. 2019
2019
Show all 38 references
-
[8]
Weighted sum power maximization for i ntelligent reflecting surface aided SWIPT,
Q. Wu and R. Zhang, “Weighted sum power maximization for i ntelligent reflecting surface aided SWIPT,” IEEE Wireless Commun. Lett. , vol. 9, no. 5, pp. 586–590, May 2020
2020
-
[9]
Joint active and passive beamforming optimization for intelligent reflecting surface assisted SWIPT under QoS constraints,
Q. Wu and R. Zhang, “Joint active and passive beamforming optimization for intelligent reflecting surface assisted SWIPT under QoS constraints,” IEEE J. Sel. Areas Commun. , vol. 38, no. 8, pp. 1735–1748, Aug. 2020
2020
-
[10]
Exploiting intelligent reflecting surfaces for interfere nce channels with SWIPT,
Y . Gao, Q. Wu, W. Chen, C. Wu, D. W. K. Ng, and N. A.-Dhahir, “Exploiting intelligent reflecting surfaces for interfere nce channels with SWIPT,” IEEE Trans. Wireless Commun. , vol. 23, no. 5, pp. 4442–4458, May 2024
2024
-
[11]
Max-min fair energy-efficient beamforming design for intelligent r eflecting surface- aided SWIPT systems with non-linear energy harvesting mode l,
S. Zargari, A. Khalili, Q. Wu, M. R. Mili, and D. W. K. Ng, “ Max-min fair energy-efficient beamforming design for intelligent r eflecting surface- aided SWIPT systems with non-linear energy harvesting mode l,” IEEE Trans. V eh. Technol., vol. 70, no. 6, pp. 5848–5864, Jun. 2021
2021
-
[12]
Reinforcement learning based resource a llocation in IRS assisted SWIPT systems,
Z. Zhu et al., “Reinforcement learning based resource a llocation in IRS assisted SWIPT systems,” IEEE Trans. V eh. Technol., vol. 74, no. 4, pp. 6790–6794, Apr. 2025
2025
-
[13]
A tutorial on movable antennas for wirele ss networks,
L. Zhu et al., “A tutorial on movable antennas for wirele ss networks,” IEEE Commun. Surveys Tuts. , early access, 2025
2025
-
[14]
F luid antenna systems,
K.-K. Wong, A. Shojaeifard, K.-F. Tong, and Y . Zhang, “F luid antenna systems,” IEEE Trans. Wireless Commun. , vol. 20, no. 3, pp. 1950–1962, Mar. 2021
1950
-
[15]
Modeling and performance an alysis for movable antenna enabled wireless communications,
L. Zhu, W. Ma, and R. Zhang, “Modeling and performance an alysis for movable antenna enabled wireless communications,” IEEE Trans. Wireless Commun., vol. 23, no. 6, pp. 6234–6250, Jun. 2024
2024
-
[16]
MIMO capacity characteriza tion for movable antenna systems,
W. Ma, L. Zhu, and R. Zhang, “MIMO capacity characteriza tion for movable antenna systems,” IEEE Trans. Wireless Commun. , vol. 23, no. 4, pp. 3392–3407, Apr. 2024
2024
-
[17]
Suppressing be am squint effect for near-field wideband communication through movab le antennas,
Y . Zhu, Q. Wu, Y . Liu, Q. Shi, and W. Chen, “Suppressing be am squint effect for near-field wideband communication through movab le antennas,” IEEE Trans. V eh. Technol., early access, 2025
2025
-
[18]
Mov able- antenna-enhanced wireless-powered mobile-edge computin g systems,
P . Chen, Y . Y ang, B. Lyu, Z. Y ang, and A. Jamalipour, “Mov able- antenna-enhanced wireless-powered mobile-edge computin g systems,” IEEE Internet Things J. , vol. 11, no. 21, pp. 35505–35518, Nov. 2024
2024
-
[19]
Movable antennas enabled wir eless- powered NOMA: Continuous and discrete positioning designs ,
Y . Gao, Q. Wu, and W. Chen, “Movable antennas enabled wir eless- powered NOMA: Continuous and discrete positioning designs ,” arXiv preprint arXiv:2409.20485, 2024
2024
-
[20]
Weighted sum power maximizat ion for movable antenna assisted SWIPT networks,
Z. Huang, N. Li, and P . Wu, “Weighted sum power maximizat ion for movable antenna assisted SWIPT networks,” IEEE Commun. Lett. , early access, 2025
2025
-
[21]
Mov able antenna enhanced secure simultaneous wireless informatio n and power transfer,
X. Dong, W. Lyu, R. Y ang, Y . Xiu, W. Mei, and Z. Zhang, “Mov able antenna enhanced secure simultaneous wireless informatio n and power transfer,” IEEE Commun. Lett. , vol. 29, no. 10, pp. 2356–2360, Oct. 2025
2025
-
[22]
Integrating movable antennas and intelli gent reflecting surfaces (MA-IRS): Fundamentals, practical solutions, an d opportunities,
Q. Wu et al., “Integrating movable antennas and intelli gent reflecting surfaces (MA-IRS): Fundamentals, practical solutions, an d opportunities,” arXiv preprint arXiv:2506.14636 , 2025
2025
-
[23]
Movabl e antennas meet intelligent reflecting surface: Friends or fo es?,
X. Wei, W. Mei, Q. Wu, Q. Jia, B. Ning, and Z. Chen, “Movabl e antennas meet intelligent reflecting surface: Friends or fo es?,” IEEE Trans. Commun., early access, 2025
2025
-
[24]
S um- rate optimization for RIS-aided multiuser communications with movable antennas,
Y . Sun, H. Xu, B. Ning, Z. Cheng, C. Ouyang, and H. Y ang, “S um- rate optimization for RIS-aided multiuser communications with movable antennas,” IEEE Wireless Commun. Lett. , vol. 14, no. 2, pp. 450–454, Feb. 2025
2025
-
[25]
Inte grating movable antennas and intelligent reflecting surfaces for co verage enhance- ment,
Y . Gao, Q. Wu, W. Mei, G. Chen, W. Chen, and Z. Zheng, “Inte grating movable antennas and intelligent reflecting surfaces for co verage enhance- ment,” arXiv preprint arXiv:2506.21375 , 2025
2025
-
[26]
Movable-anten na aided secure transmission for RIS-ISAC systems,
Y . Ma, K. Liu, Y . Liu, L. Zhu, and Z. Xiao, “Movable-anten na aided secure transmission for RIS-ISAC systems,” IEEE Trans. Wireless Com- mun., early access, 2025
2025
-
[27]
Joint beamforming and antenna position optimization for IRS-aid ed multi-user movable antenna systems,
Y . Geng, T. H. Cheng, K. Zhong, K. C. Teh, and Q. Wu, “Joint beamforming and antenna position optimization for IRS-aid ed multi-user movable antenna systems,” IEEE Trans. Wireless Commun. , early access, 2025
2025
-
[28]
A flexible desig n for beam squint effect suppression in IRS-aided THz communicat ions,
Y . Zhu, Q. Wu, W. Chen, Y . Liu, and R. Liu, “A flexible desig n for beam squint effect suppression in IRS-aided THz communicat ions,” arXiv preprint arXiv:2508.21295, 2025
2025 arXiv
-
[30]
Bertsekas, Nonlinear Programming , 2nd ed
D. Bertsekas, Nonlinear Programming , 2nd ed. Belmont, MA, USA: Athena Scientific, 1999
1999
-
[31]
Majorization-minim ization algo- rithms in signal processing, communications, and machine l earning,
Y . Sun, P . Babu, and D. P . Palomar, “Majorization-minim ization algo- rithms in signal processing, communications, and machine l earning,” IEEE Trans. Signal Process. , vol. 65, no. 3, pp. 794–816, Feb. 2017
2017
-
[32]
Penalty dual decomposition method f or nonsmooth nonconvex optimization—Part I: Algorithms and convergenc e analysis,
Q. Shi and M. Hong, “Penalty dual decomposition method f or nonsmooth nonconvex optimization—Part I: Algorithms and convergenc e analysis,” IEEE Trans. Signal Process. , vol. 68, pp. 4108–4122, Jun. 2020
2020
-
[33]
A survey on channe l estimation and practical passive beamforming design for intelligent r eflecting surface aided wireless communications,
B. Zheng, C. Y ou, W. Mei, and R. Zhang, “A survey on channe l estimation and practical passive beamforming design for intelligent r eflecting surface aided wireless communications,” IEEE Commun. Surveys Tuts. , vol. 24, no. 2, pp. 1035–1071, 2nd Quart., 2022
2022
-
[34]
Channel estimat ion by transmitting pilots from reconfigurable intelligent surfa ce,
Y . Zhu, Y . Liu, Q. Wu, C. Y ou, and Q. Shi, “Channel estimat ion by transmitting pilots from reconfigurable intelligent surfa ce,” IEEE Trans. Wireless Commun., vol. 23, no. 4, pp. 3328–3343, Apr. 2024
2024
-
[35]
Compressed sensing based ch annel estimation for movable antenna communications,
W. Ma, L. Zhu, and R. Zhang, “Compressed sensing based ch annel estimation for movable antenna communications,” IEEE Commun. Lett. , vol. 27, no. 10, pp. 2747–2751, Oct. 2023
2023
-
[36]
Ch annel estimation for movable antenna communication systems: A fr amework based on compressed sensing,
Z. Xiao, S. Cao, L. Zhu, Y . Liu, B. Ning, and X.-G. Xia, “Ch annel estimation for movable antenna communication systems: A fr amework based on compressed sensing,” IEEE Trans. Wireless Commun. , vol. 23, no. 9, pp. 11814–11830, Sep. 2024
2024
-
[37]
CVX: MA TLAB software for discipli ned convex programming,
M. Grant and S. Boyd, “CVX: MA TLAB software for discipli ned convex programming,” 2016. [Online]. Available: http://cvxr.co m/cvx
2016
-
[38]
A unified converg ence analysis of block successive minimization methods for nonsmooth opt imization,
M. Razaviyayn, M. Hong, and Z.-Q. Luo, “A unified converg ence analysis of block successive minimization methods for nonsmooth opt imization,” SIAM J. Optim. , vol. 23, no. 2, pp. 1126–1153, Jan. 2013
2013
Reviewed August 3, 2026 · model on record in the stance chip above.
Discussion (0). Sign in to comment.