Pith. sign in

REVIEW 4 major objections 4 minor 15 references

Joint Optimization of Computation Offloading and Resource Allocation in ISAC-assisted SAGIN-based IoT

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

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

Pith's one-line read Jointly tuning pilot time, data time, bit allocation, and offload ratio minimizes a flying edge server's energy in a satellite-and-drone IoT system.

desk verdict A narrow but useful ISAC-SAGIN offloading formulation whose SCA convergence proof as written fails due to invalid surrogates. read the letter →

arxiv 2509.08238 v1 pith:FUOHNLO5 submitted 2025-09-10 eess.SY cs.SY

Sooyeob Jung , Seongah Jeong , Jinkyu Kang This is my paper · ORCID
classification eess.SYcs.SY
keywords integratedsensingandcommunicationspace-air-groundnetworkcomputationoffloadingenergyminimizationsuccessiveconvexapproximationInternetofThingsLEOsatelliteautonomousaerialvehicle
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

Integrated sensing and communication lets a flying edge server (an autonomous aerial vehicle, AAV) use the same uplink signal to sense a target and to receive IoT data, while excess computation is offloaded to a low-Earth-orbit satellite. The paper's central claim is that the AAV's total energy—channel-estimation, on-board computation, and satellite-uplink transmission—can be minimized by jointly choosing two time durations (training and data), the per-frame bit allocation, and the fraction of data offloaded, subject to data-offloading and sensing-accuracy constraints. Solving that non-convex problem is the hard part; the paper builds a successive convex approximation whose inner problem is strongly convex and claims convergence to a stationary point under a diminishing step size. Simulations show the joint choice beats benchmarks that optimize only one variable class (frame duration alone, offloading ratio alone, or neither). If the proof holds, the practical message is that an integrated sensing and communication setup can do double duty: one pilot signal serves both radar detection and channel estimation, and careful time/bit splitting materially lowers the aerial node's energy budget.

What carries the argument

The central mechanism is the surrogate decomposition of the AAV energy objective. Each cubic computation term is a product f1(rho) f2(ld,n) of two nonnegative convex functions, and the transmit term is an exponential of rho*ld,n; the paper replaces these with a strongly convex inner approximation that separates the two factors and adds proximal penalties, yielding a convex program with a unique solution. The outer loop over Np supplies the training/data split while the inner SCA loop updates rho and ld,n; convergence to a stationary point of the original problem is claimed to follow from the cited SCA theory when the surrogate satisfies the matching conditions.

What would settle it

Take any feasible (rho(v), ld,n(v)) with 0<rho<1 and evaluate (15) at rho=rho(v), ld,n=ld,n(v); the printed form equals twice the original computation energy in (11) rather than the same value, so one algebraic check decides whether the surrogate is locally exact. If it is not, the paper's own citation [15, Lemma 1] cannot support the convergence claim, and a numerical run of Algorithm 1 from different starting points would show whether the limit energies match the predicted stationary values.

Watch

Extended reading notes

Core claim

The paper formulates the AAV energy minimization as Problem (14): minimize the sum over N frames of channel-estimation energy, on-board computation energy, and AAV-to-LEO uplink transmission energy by choosing the training duration Np, data duration Nd, per-frame data bits ld,n, and partial offloading ratio rho, subject to a total offloaded-data requirement, per-frame achievable-rate constraints at the AAV and at the LEO satellite, a sensing SINR constraint, and rho in [0,1]. The non-convexity comes from cubic product terms in the computation energy and from an exponential transmit term in rho*ld,n. To handle it, the authors fix Np and Nd in an outer loop and, for each fixed pair, replace th

Load-bearing premise

The claimed convergence to a stationary point of Problem (14) rests on the surrogate expressions (15) and (17) satisfying the standard tangent condition—equal to the original non-convex terms at the current iterate—and the printed expressions do not obviously satisfy it; if that equality fails, the stationary-point guarantee from the cited SCA theory does not apply.

Editorial extensions

If this is right

  • When the mission time is longer (more frames at fixed frame length), the per-frame energy denominators N_p^2 and N_d^2 shrink the energy needed per bit, so the jointly optimized schedule is most beneficial in long missions.
  • The offloading ratio is the dominant lever: optimizing only the frame duration while fixing rho=0.5 costs much more than optimizing rho alone.
  • Tight sensing SINR constraints push the optimizer to lengthen the pilot phase, which inflates computation and satellite-uplink energy; beyond about -1.5 dB a fixed pilot split cannot satisfy the sensing constraint at all.
  • The per-iteration cost of the inner SCA step is linear in the number of frames, so the full double-loop algorithm is affordable for frame counts in the hundreds.

Reading between the lines

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

  • If the surrogate equality is repaired by adding the missing subtraction term so that the inner approximation matches the original functions at the current iterate, the same algorithm should still converge; a direct numerical check at one frame would settle whether the reported energy gains survive the correction.
  • The same f1*f2 surrogate trick should extend to multiple IoT devices or multiple targets, since those extensions add more product terms of the same shape; the convergence proof would need to be rebuilt term-by-term, not assumed.
  • Because flight energy and trajectory are fixed a priori, the reported total AAV energy excludes the largest physical cost of an AAV; treating trajectory as a decision variable could shift the optimal balance from offloading ratio toward where the AAV flies.
  • The claim that the offloading ratio matters more than frame duration is parameter-dependent; at much shorter AAV-to-satellite distances the exponential transmit term becomes cheaper, so frame-duration optimization might gain weight.
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.

Referee Report

4 major / 4 minor

Summary. The paper studies an ISAC-assisted SAGIN-based IoT system in which an AAV performs uplink sensing of a target and, together with a LEO satellite, provides hybrid edge computing for an IoT device. The authors formulate a nonconvex optimization problem that minimizes the total AAV energy consumption by jointly optimizing the training/data phase durations, the data bit allocation, and the partial offloading ratio, subject to offloading rate constraints and a sensing SINR constraint. They propose an SCA-based double-loop algorithm (Algorithm 1) and empirically compare it with partial-optimization and fixed-mode benchmarks, reporting lower AAV energy consumption.

Significance. The problem setting is topical and the system model is described in a fairly self-contained way, with explicit formulas for channel estimation, achievable rates, sensing detection, and energy consumption. If the SCA convergence claim were valid, the paper would provide a useful optimization framework for energy-efficient ISAC-assisted SAGIN IoT. However, the central algorithmic claim rests on surrogate functions that do not satisfy the required tangent and majorization conditions of the cited SCA theory. Since the simulation advantage is not backed by a valid convergence argument, the main contribution is not yet established. The paper's strengths are its clear problem statement, the inclusion of ROC-based sensing verification, and the comparison against several benchmarks.

major comments (4)
  1. [Sec. III-A, Eq. (15)] The surrogate for E_A^n is not tight at the current iterate. With f1(ρ)=(1−ρ)^3 and f2(ld,n)=ld,n^3, evaluating (15) at zn=zn(v) gives γU C_A^3/N_d^2 · [f1(ρ(v))f2(ld,n(v)) + f1(ρ(v))f2(ld,n(v))], i.e., twice the original term, because the constant −f1(ρ(v))f2(ld,n(v)) is omitted. Thus the tangent condition of [15, Lemma 1] is violated. Moreover, the two-term expression is not generally an upper bound of f1(ρ)f2(ld,n); e.g., at ρ=0, ρ(v)=0.5, ld,n=2, ld,n(v)=1 the surrogate equals 2 while the original product equals 8. The missing constant would make this worse, so the majorization property also fails.
  2. [Sec. III-A, Eq. (17) and constraint (18b)] Equation (17) applies the product surrogate built for (1−ρ)^3 ld,n^3 to the bilinear term B_n(ρ,ld,n)=ρ ld,n T/(B N_d). At the current iterate, (17) evaluates to 2(1−ρ(v))^3 ld,n(v)^3 T/(B N_d), which is not equal to B_n(z_n(v))=ρ(v)ld,n(v)T/(B N_d). Therefore (18b) is not a tangent approximation of (16), and the equivalence between the original communication energy and the slack-variable reformulation is broken. The surrogate for B_n should be constructed from f1(ρ)=ρ and f2(ld,n)=ld,n, and its tangent/majorization properties must be checked explicitly.
  3. [Sec. III-A, convergence statement after Algorithm 1] The claim that the update sequence {z(v)} converges to a stationary point is unsupported because it is based on [15, Theorem 2] whose assumptions are not satisfied by the surrogates in (15) and (17), as noted above. Without a valid convergence proof, the energy reductions reported in Figs. 3 and 4 cannot be attributed to convergence to a stationary point of (14).
  4. [Sec. II and Problem (14), l_p,n] The total energy E_t in (13) includes E_CH^n(Np) defined in (10), which depends on l_p,n, but the decision vector is z_n=(N_p,N_d,ρ,l_d,n) and l_p,n is not defined as a variable, fixed parameter, or function of N_p/N_d in (14). This makes the objective incomplete as stated: the channel-estimation energy term cannot be evaluated or optimized unless l_p,n is specified. The authors should either add l_p,n to the optimization or provide a rule linking it to the training duration and/or bit allocation.
minor comments (4)
  1. [Abstract and throughout] Grammar and copyediting: 'In this letters', 'a IoT device', 'AAV' vs 'AA V' inconsistency, and 'energy comsumption' in Fig. 4 should be corrected.
  2. [Sec. III-A after Lemma 1] The sentence 'if the algorithm does not terminate in finite steps, these stationary points are not local minima of Problem (14)' is misleading; limit points can be saddle points, but stationarity does not imply they cannot be local minima. Recast as 'limit points are stationary but not necessarily local minima.'
  3. [Algorithm 1] The feasible set is referred to as 'X' in the initialization but never explicitly defined; define X as the feasible set of (14) or the convex inner approximation (18).
  4. [Eqs. (7)-(8), (14c)-(14d)] The rate expressions and the constraints are dimensionally ambiguous: R_I,A^n and R_A,L^n include Nd/T, and then are multiplied by B and compared with bit counts ld,n and ρld,n without an explicit frame-time factor. Clarify whether l_d,n is bits per frame or bits per data phase and adjust the inequalities accordingly.

Circularity Check

0 steps flagged · score 0.0 of 10

No circularity: the optimization derivation is self-contained; suspected issues are correctness gaps, not input-output equivalences.

full rationale

The paper's central claim is the energy minimization problem (14) and the SCA-based Algorithm 1. The objective and constraints are constructed from physical models: channel-estimation energy (10), computation energy (11), transmit energy (12), achievable rates (7)-(8), and sensing SINR (9). These formulas are not fitted to the simulation outputs, and the benchmarks are independent fixed/partial-optimization schemes. The self-citations [2] and [10] supply the SAGIN edge-computing framework and the detection model, respectively; they are modeling inputs, not predictions derived in this paper. The SCA convergence assertion relies on the external theorem [15], not on a self-citation or on the paper's own fitted parameters. The reader's/skeptic's concern is that surrogates (15) and (17) may not satisfy the tightness/majorization conditions of [15, Lemma 1], e.g., at z_n(v), (15) evaluates to twice the original objective term rather than the term itself. This is a mathematical correctness gap in the convergence proof, not a circular reduction: the claimed stationarity is unsupported if the conditions fail, but it is not equivalent to an input by construction. Therefore no circular step is present, and the appropriate circularity score is 0.

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

The central claim rests on the energy model (from [14]), the LOS/Swerling-I channel model (from [2], [10]), and the SCA convergence theory (from [15]). The only hand-chosen algorithmic parameters are the SCA proximal weights tau_rho, tau_ld and the step size schedule gamma(v), which are not specified numerically. No entities beyond the modeled system components (AAV, LEO satellite, IoT device, target, clutter) are invented. The load-bearing unverified assumption is that the surrogate functions in (15) and (17) satisfy the conditions of [15, Lemma 1].

free parameters (3)
  • SCA proximal weights tau_rho, tau_ld = not specified
    In (15) and (17), the proximal penalty weights tau_rho, tau_ld are declared positive but not given values; the solution and convergence behavior depend on them.
  • Step size sequence gamma(v) = not specified
    Algorithm 1 requires a diminishing step size gamma(v) in (0,1] with sum to infinity; no concrete schedule is provided, so the convergence claim is not directly checkable.
  • Energy model constants gamma_U, C_CH, C_A = not specified (from [14])
    These constants are adopted from the energy model of [14] and determine the computation energy. They are inputs, not fitted, but their values are not stated.
assumptions (4)
  • ad hoc to paper The SCA surrogate functions in (15) and (17) satisfy the tangent and majorization conditions of [15, Lemma 1].
    This is the load-bearing assumption for the convergence claim. The surrogate in (15) appears to be missing a subtraction term (f1(v) f2(v)) and (17) reuses the cubic-product form for a bilinear product, so the conditions are not verified.
  • domain assumption LEO satellite channel is quasi-static, so its channel estimation error is negligible.
    Stated in Section II; used to omit AAV-LEO training and use the known channel h^{A,L}_n in (8) and (12).
  • domain assumption Channels are modeled as LOS with scattering, with Swerling-I target and Gaussian clutter.
    Used in Section II to define the channel covariance and the detection hypotheses in (4)-(5).
  • standard math CMOS dynamic energy model E = gamma (C L)^3 / T^2.
    Used for E_CH (10) and E^A (11), referencing [14].

how reviews work

0 comments
Cite this review

Pith. "Pith review of Joint Optimization of Computation Offloading and Resource Allocation in ISAC-assisted SAGIN-based IoT." pith.science (2026). https://pith.science/paper/FUOHNLO5

@misc{pith2026250908238,
  author       = {Pith},
  title        = {Pith review of: Joint Optimization of Computation Offloading and Resource Allocation in ISAC-assisted SAGIN-based IoT},
  year         = {2026},
  howpublished = {\url{https://pith.science/paper/FUOHNLO5}},
  note         = {Machine review of arXiv:2509.08238}
}
read the original abstract

In this letters, an energy-efficient integrated sensing and communication (ISAC) for space-air-ground integrated network (SAGIN)-based Internet of Things (IoT) systems is proposed to facilitate wide coverage and real-time 6G services. For processing a sizable data collected at a IoT device, a hybrid edge computing scheme is applied with the cloudlets mounted at autonomous aerial vehicle (AAV) and low earth orbit (LEO) satellite, where the AAV with multiple antennas performs uplink sensing of the nearby target. With the aim of minimizing the total AAV's energy consumption, we optimize the duration of training and data phase and the bit allocation coupled with the offloading ratio under the constraints for offloading and sensing. Via simulations, the superiority of the proposed algorithm is verified to be pronounced with the sufficient mission time and the high sensing performance constraint.

Figures

Figures reproduced from arXiv: 2509.08238 by the authors.

Figure 1
Figure 1. ISAC-assisted SAGIN-based IoT system. To this end, the authors in [4], [5] propose a massive multiple￾input multiple-output (MIMO) structure to implement ISAC￾LEO systems by designing a hybrid beamforming design. For AAV-enabled ISAC, a joint optimization of AAV’s path and beamforming is proposed in [6], [7]. The existing works [4]- [7] on ISAC-assisted SAGIN systems focus on the general communication networks that … view at source ↗
Figure 2
Figure 2. ROC performance according to the sensing SINR. [PITH_FULL_IMAGE:figures/full_fig_p004_2.png] view at source ↗
Figure 3
Figure 3. Comparison of the AAV energy consumption with the frame length. [PITH_FULL_IMAGE:figures/full_fig_p005_3.png] view at source ↗
Figures from the paper (1 more)
Figure 4
Figure 4. Figure 4: Comparison of the AAV energy consumption with the sensing SINR. [PITH_FULL_IMAGE:figures/full_fig_p005_4.png]

Discussion (0). Continue with ORCID to comment.

Reference graph

Works this paper leans on

15 extracted references · 15 canonical work pages

  1. [1]

    Integrating communi- cation, sensing and computing in satellite Internet of Things: Challenges and opportunities,

    Y . Zuo, M. Yue, H. Yang, L. Wu, and X. Yuan, “Integrating communi- cation, sensing and computing in satellite Internet of Things: Challenges and opportunities,”IEEE Wireless Comm. Early Access, Mar. 2024

    work page 2024

  2. [2]

    Marine IoT systems with space- air-sea integrated networks: Hybrid LEO and UA V edge computing,

    S. Jung, S. Jeong, J. Kang, and J. Kang, “Marine IoT systems with space- air-sea integrated networks: Hybrid LEO and UA V edge computing,” IEEE Internet of Things J., vol. 10, no. 23, pp. 20498-20510, Dec. 2023

    work page 2023

  3. [3]

    Space/aerial-assisted computing offloading for IoT applications: A learning-based approach,

    N. Cheng, F. Lyu, W. Quan, C. Zhou, H. He, W. Shi, and X. Shen, “Space/aerial-assisted computing offloading for IoT applications: A learning-based approach,”IEEE J. Sel. Areas Commun., vol. 37, no. 5, pp. 1117-1129, May 2019

    work page 2019

  4. [4]

    Integrated communications and localization for massive MIMO LEO satellite systems,

    L. You, X. Qiang, Y . Zhu, F. Jiang, C. G. Tsinos, W. Wang, H. Wymeersch, X. Gao, and B. Ottersten, “Integrated communications and localization for massive MIMO LEO satellite systems,”IEEE Trans. on Wireless Commun. Early Access, Mar. 2024

    work page 2024

  5. [5]

    Integrated sensing and communications enabled low earth orbit satellite systems,

    L. Yin, Z. Liu, M. R. B. Shankar, M. A.-Kerahroodi, and B. Clerckx, “Integrated sensing and communications enabled low earth orbit satellite systems,”IEEE Network, vol. 38, no. 6, pp. 252-258, Nov. 2024

    work page 2024

  6. [6]

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

    C. Deng, X. Fang, and X. Wang, “Beamforming design and trajectory optimization for UA V-empowered adaptable integrated sensing and com- munication,”IEEE T. on Wire. Comm., vol. 22, no. 11, pp. 8512-8526, Apr. 2023

    work page 2023

  7. [7]

    UA V-assisted communications in SAGIN-ISAC: Mobile user tracking and robust beamforming,

    W. Mao, Y . Lu, G. Pan, and B. Ai, “UA V-assisted communications in SAGIN-ISAC: Mobile user tracking and robust beamforming,”IEEE J. Sel. Areas Commun., vo. 43, no. 1, pp. 186-200, Jan. 2025. [8]Study on integrated sensing and communication (Release 19),3GPP TR 22.837, v.19.2.1, Feb. 2024

    work page 2025

  8. [9]

    LEO satellite-enabled random access with large differential delay and doppler shift,

    B. Shen, Y . Wu, W. Zhang, S. Chatzinotas, and B. Ottersten, “LEO satellite-enabled random access with large differential delay and doppler shift,”IEEE T. on Wire. Com., vol. 24, no. 4, pp. 2876-2893, Apr. 2025

    work page 2025

Show all 15 references
  1. [10]

    Cell-free MIMO perceptive mobile networks: Cloud vs. edge processing,

    S. Jeong, J. Kang, O. Simeone, and S. Shamai, “Cell-free MIMO perceptive mobile networks: Cloud vs. edge processing,”IEEE Trans. on V eh. Technol., vol. 74, no. 6, pp. 9520-9532, Jan. 2025

    2025

  2. [11]

    Robust energy-efficient hybrid beamforming design for massive MIMO LEO satellite communication systems,

    Y . Liu, C. Li, J. Li, and L. Feng, “Robust energy-efficient hybrid beamforming design for massive MIMO LEO satellite communication systems,”IEEE Access, vol. 10, pp. 63085-63099, Jun. 2022

    2022

  3. [12]

    Optimal signal design for detection of Gaussian point targets in stationary Gaussian clutter/reverberation,

    S. Kay, “Optimal signal design for detection of Gaussian point targets in stationary Gaussian clutter/reverberation,”IEEE J. of Sel. Topics in Signal Proc., vol. 1, no. 1, pp. 31–41, Jun. 2007

    2007

  4. [13]

    Multi-static target detection and power allocation for integrated sensing and communication in cell-free massive MIMO,

    Z. Behdad, O. T. Demir, K. W. Sung, E. Bjornson, and C. Cavdar, “Multi-static target detection and power allocation for integrated sensing and communication in cell-free massive MIMO,”IEEE T. on Wire. Com., vol. 23, no. 9, pp. 11580-11596, Apr. 2024

    2024

  5. [14]

    Energy-efficient channel estimation in MIMO systems,

    S. Yatawatta, A. P. Petropulu, and C. J. Graff, “Energy-efficient channel estimation in MIMO systems,”EURASIP J. on Wireless Comm. and Net., vol. 2006, no. 27694, pp. 1-11, Dec. 2005

    2006

  6. [15]

    Parallel and distributed methods for nonconvex optimization part I: Theory,

    G. Scutari, F. Facchinei, L. Lampariello, and P. Song, “Parallel and distributed methods for nonconvex optimization part I: Theory,” arXiv:1410.4754v2, Jan. 2016

    2016 arXiv

  7. [16]

    Integrated sensing and communication assisted mobile edge computing: An energy- efficient design via intelligent reflecting surface,

    N. Huang, T. Wang, Y . Wu, Q. Wu, and T. Q. S. Quek, “Integrated sensing and communication assisted mobile edge computing: An energy- efficient design via intelligent reflecting surface,”IEEE Wireless Comm. Letters, vol. 11, no 10, pp. 2085-2089, Oct. 2022

Pith tools

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