Pith. sign in

REVIEW 3 major objections 6 minor 1 cited by

Resource Allocation for ISAC Networks with Application to Target Tracking

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

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

Pith's one-line read A block coordinate descent solver turns per-frame ISAC resource allocation into convex subproblems, enabling joint target tracking and communication every frame.

desk verdict Competent, incremental ISAC resource allocation paper whose per-frame EKF formulation is new but whose measurement model and omitted derivations keep the numerical gains from being fully verified. read the letter →

arxiv 2412.20314 v1 pith:4STTNUED submitted 2024-12-29 eess.SP

Lu Wang , Luis F. Abanto-Leon This is my paper · ORCID
classification eess.SP
keywords ISACresourceallocationtargettrackingposteriorCramér-Raoboundblockcoordinatedescentsuccessiveconvexapproximationbeamforming6G
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 tackles a practical gap in integrated sensing and communication (ISAC) networks: scheduling both target tracking and user communication in every frame while targets move and channels change. It formulates a joint allocation of frequency resource blocks, time mini-slots, transmit power, and beams that minimizes the trace of the posterior Cramér-Rao bound (PCRB) on tracking error under per-user throughput and resource limits. Because the resulting problem is non-convex with coupled integer and continuous variables, the paper develops a block coordinate descent algorithm combining a penalty method, successive convex approximation, and one-dimensional beam search. Simulations show the algorithm tracks ten moving targets, reaches the resource-rich upper bound in most frames, and outperforms a random allocation benchmark by 28.57% in sensing and 53.95% in communication, exposing the sensing–communication trade-off.

What carries the argument

The central object is the posterior Fisher information matrix $J(\xi^u_m)=J_p+J_d$, whose inverse is the PCRB used as the objective. The load-bearing manipulation is the decomposition $J(\xi_m)=E_m+n_m^2 V_m$ (and its power analogue $J_p+p_m\bar V_m$), whose eigendecomposition reduces the matrix objective to a sum of reciprocals $(a_{mj}+b_{mj}n_m^2)^{-1}$, making the non-convex problem amenable to successive convex approximation. Around this, the solver applies block coordinate descent to separate the variables, a penalty term with an iteratively growing weight to softly enforce the throughput constraint, and a one-dimensional search over a beam codebook for each user.

What would settle it

Run the proposed allocation with realistic estimators whose empirical error covariance differs from the CRB formulas in (11)–(12), then compare realized tracking mean squared error with the predicted trace of PCRB; if the optimized allocation does not reduce actual MSE as predicted, the minimized objective is the wrong one.

Watch

Extended reading notes

Core claim

The paper's contention is that per-frame ISAC scheduling under dynamicity does not require instant target channel state information. Using an extended Kalman filter to predict target states, it rewrites the PCRB objective at each frame into a sum of scalar terms $\sum_j (a_{mj}+b_{mj}(n_m^2))^{-1}$ via an eigendecomposition, which turns the bandwidth allocation part into a tractable difference-of-convex form. The block coordinate descent then alternates between a convex subproblem for bandwidth, time, and user power, and a convex subproblem for target power plus a codebook beam search for users. On its own simulation evidence, the trace of PCRB tracks the upper bound in most frames while the QoS feasibility ratio stays near 100%.

Load-bearing premise

The whole optimization minimizes a posterior error bound built from assumed Cramér-Rao formulas for distance and angle estimation error, so those formulas must match the real estimators actually producing the measurements.

Editorial extensions

If this is right

  • Per-frame joint allocation becomes computationally feasible: each BCD iteration solves convex subproblems, so scheduling can be updated every frame as targets and channels evolve.
  • The PCRB-based formulation gives a policy that reaches the resource-rich upper bound in most simulated frames, meaning the allocation algorithm itself contributes little tracking loss relative to maximum-resource provisioning.
  • Raising the communication throughput requirement degrades sensing PCRB in a smooth, predictable way, making the sensing–communication trade-off a tunable design knob.
  • No instant target CSI is required; the extended Kalman filter prediction supplies the sensing beam direction, so the scheme is applicable when target channel estimates are unavailable or outdated.

Reading between the lines

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

  • The BCD decomposition does not depend on the specific CRB proportionality constants; if experiments show the assumed inverse-power CRB scaling is inaccurate, the same solver could be rerun with empirical covariances, though the claimed near-optimality would have to be rechecked.
  • The same algebraic manipulation works for other sensing objectives, such as worst-target PCRB or determinant of the PCRB, because it only requires the Fisher information matrix to be affine in squared bandwidth and in power.
  • With larger beam codebooks the one-dimensional search would dominate cost, so gradient-based or hierarchical beam selection is a natural extension for massive MIMO arrays.
  • The formulation assumes a single line-of-sight base station; multiple base stations or multipath would introduce cross-target Fisher information terms that break the per-target decomposition, pointing toward distributed or consensus-based extensions.
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

3 major / 6 minor

Summary. The paper considers a millimeter-wave ISAC network in which a base station tracks M moving targets and serves K single-antenna UEs over multiple frames. The authors formulate a per-frame joint resource allocation problem (P1) that minimizes the trace of the posterior Cramér-Rao bound (PCRB) for target tracking, subject to UE throughput constraints, power constraints, and frequency/time/spatial resource constraints. To solve the non-convex mixed-integer problem, they propose a block coordinate descent (BCD) algorithm that alternates between a block {n_m, o_ki, p_k} handled by penalty, successive convex approximation (SCA), and CVX, and a block {p_m, f_k} handled by a one-dimensional beam search and CVX. Numerical simulations show that the proposed solution tracks all targets, approaches an upper bound on the PCRB in most frames, maintains high QoS feasibility, and outperforms a random-allocation benchmark by 28.57% in sensing and 53.95% in communication. The paper also demonstrates a sensing-communication trade-off as the throughput threshold increases.

Significance. If the claims hold, the paper offers a practical per-frame resource allocation framework for ISAC target tracking under target motion and time-varying channels, without requiring instantaneous target CSI. The core idea of transforming the PCRB objective into an algebraic form via eigendecomposition is sound and follows the established framework of [8]. The paper provides a clearly specified system model, a reproducible simulation setup, and a quantitative comparison against a benchmark. The significance is moderated, however, by two omitted derivations, an under-specified measurement model with proportionality constants absent, and the absence of a direct comparison between the optimized PCRB and the actual tracking MSE. These gaps are fixable but are load-bearing for the numerical claims.

major comments (3)
  1. [II-B3, Eqs. (11)-(12)] The distance and AoA error variances are given only up to proportionality, with the constants omitted. These variances define the measurement covariance Σ^u_m in Eq. (10), enter the data FIM in Eq. (15), and therefore determine the entire PCRB objective in Eq. (25a). Since the two quantities have different physical dimensions (meters squared and radians squared), the trace in Eq. (25a) is not even dimensionally meaningful unless the missing constants supply the appropriate scaling. As written, the numerical results and the reported 28.57% and 53.95% gains are not reproducible. Please provide the explicit CRB expressions with all constants, or state exactly which constants were used in the simulations.
  2. [IV, after Eq. (34) and after Eq. (38)] The convexity of f(o_ki, p_k) is load-bearing for the claim that P1.4 is convex and hence solvable by CVX, but the proof is omitted with the sentence 'The detailed proof is omitted due to limited space.' Similarly, the derivation of the algebraic form for the sub-problem P2.1 is omitted with 'Detailed derivation is omitted due to limited space.' These are not merely presentational omissions: the algorithm's convergence and the validity of the SCA penalty step depend on these derivations. Please include the Hessian computation for f(o_ki, p_k) and the full derivation for P2.1, or provide a precise reference where each result is proven.
  3. [II-B3, II-B5, and IV] The PCRB objective is evaluated at the predicted target state, because the Jacobian Q̂^u_m and measurement covariance Σ̂^u_m in Eq. (15) use the predicted state ξ̂^u_m from the EKF (Eqs. (16)-(20)), and the beamformer in Eq. (4) is matched to the predicted AoD. The expressions in Eqs. (11)-(12) do include the beamforming gain through ||H^u_m f^u_m||^2, so the mismatch between the predicted and true AoD is partially captured; however, the prediction error itself is not modeled or bounded. If the EKF prediction error is significant, the optimized PCRB is optimistic and the EKF update in Eq. (18) uses an overconfident measurement covariance. Please state the assumption on the prediction error magnitude and, ideally, compare the simulated tracking MSE with the optimized PCRB to validate that the minimized quantity reflects the actual tracking performance.
minor comments (6)
  1. [Eq. (8)] The noise term appears as '\tilde w^u_m' in some places and as 'ewu_m' in the text immediately after Eq. (8); this typo should be corrected.
  2. [Eqs. (1) and (25e)] The initial resource constraint (1) states n^u_m ∈ {1, ..., N_RB-1}, while the optimization constraint (25e) uses n_m ∈ {n_req, n_req+1, ..., N_RB}; the relationship between these two formulations should be clarified.
  3. [Section V, Fig. 3] The 'upper bound' is not precisely defined. If it means allocating the maximum resources to every target and UE simultaneously, that allocation violates constraint (25d); if it means a per-target bound with all resources dedicated to sensing, then it is not an upper bound on the constrained problem. Please define the upper bound explicitly.
  4. [Section V] The acronym RFTEP is used without expansion; the text later explains that it corresponds to random resource block and mini-slot allocation with equal power and one-dimensional beam search, but this should be stated at first use.
  5. [Eq. (12) and Table I] The null-to-null beamwidth ϖ_nn is given as 4.14° in Table I, but Eq. (12) uses ϖ_nn in a formula that otherwise mixes units; please state whether ϖ_nn is used in radians or degrees and ensure dimensional consistency.
  6. [Algorithm 1] Algorithm 1 is titled 'BCD-based algorithm for solving problem P1.1', but it actually solves the per-frame version of the original problem P1; the naming should be made consistent with the problem labels in Section IV.

Circularity Check

0 steps flagged · score 0.0 of 10

No significant circularity: the PCRB objective is built from external CRB/FIM models and the algorithm is evaluated against its own objective plus internal benchmarks; no fitted input is relabeled as a prediction.

full rationale

The derivation chain is self-contained in the relevant sense. The objective (25a) is the trace of the posterior FIM J(ξ_m^u) recursively defined in (13)-(15), where the measurement covariance in (10)-(12) is taken from the external CRB result [18] and the posterior recursion from [8]; neither is authored by the present authors, and no parameter is fitted to the data whose prediction is later claimed. The SCA step in (32)-(35) is justified by a standard convex-DC argument; the only self-citation [19] supports the generic KKT claim and is not load-bearing for the numerical results. The benchmarks in Section V are internal (random allocation and an infeasible upper bound), so they validate the solver but do not convert a fitted quantity into a prediction. The QoS feasibility ratio is a constraint-satisfaction check, not an independent prediction. The under-specified proportionality constants in (11)-(12) and the use of predicted AoD in (4) are modeling and correctness risks, not circular reductions: the paper's equations do not define the output in terms of the result claimed. No circular step can be exhibited, so the score is 0.

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

The paper adds no fitted constants and no new physical entities; its central claim rests on standard domain models (constant-velocity motion, orthogonal sensing/communication resources, CRB-based measurement error, EKF linearization, first-order channel Markov model) and on one unproved convexity assertion for the throughput constraint. Algorithmic hyperparameters such as the penalty schedule and convergence threshold are chosen by hand without sensitivity analysis.

free parameters (4)
  • Penalty parameter beta schedule = 0.1, multiplied by 5 at every iteration
    Hand-chosen algorithm hyperparameter that controls feasibility enforcement in P1.4; no sensitivity analysis is provided (Sec IV-1, Sec V).
  • Convergence threshold = 0.001
    Stopping threshold for BCD; affects suboptimality of the solution and is chosen without a sensitivity study (Sec V).
  • Target process noise level sigma_m
    Appears in state evolution covariance (7) but is not listed in Table I; exact tracking and PCRB values depend on it, so reproduction requires guessing.
  • Beam codebook design
    Codebook CB and size NCB in (36) are not specified; beam selection performance and the 1D search complexity depend on this omitted design choice (Sec IV-2).
assumptions (6)
  • domain assumption All targets move with constant velocity frame-to-frame, with Gaussian process noise
    State evolution model (5)-(7) in Sec II-B2; used for EKF prediction and the PCRB recursion.
  • domain assumption UE and target signals use disjoint resource blocks to avoid interference
    Sec II-A and constraint (25d); eliminates cross-interference terms from PCRB and throughput.
  • domain assumption Distance and AoA measurement error variances equal the CRB expressions (11)-(12)
    Sec II-B3; (10) sets the covariance to these CRBs, and (15) uses them as the data FIM, so the optimized objective is a bound built on an assumed estimator covariance.
  • domain assumption EKF linearization at the predicted state gives accurate Q and Sigma, and predicted AoD can drive the beamforming vector
    Sec II-B5 and Eq (4); avoids instant CSI but depends on prediction accuracy.
  • domain assumption UE channels evolve as a first-order AR model with no frequency selectivity
    Eq (21)-(22) in Sec II-C; used in the throughput calculation (24) and codebook beam search (36).
  • ad hoc to paper Hessian of f(oki,pk) is positive semidefinite, so (34) is convex
    Stated in Sec IV-1 with 'detailed proof is omitted due to limited space'; used to justify the penalty method and CVX.

how reviews work

0 comments
Cite this review

Pith. "Pith review of Resource Allocation for ISAC Networks with Application to Target Tracking." pith.science (2026). https://pith.science/paper/4STTNUED

@misc{pith2026241220314,
  author       = {Pith},
  title        = {Pith review of: Resource Allocation for ISAC Networks with Application to Target Tracking},
  year         = {2026},
  howpublished = {\url{https://pith.science/paper/4STTNUED}},
  note         = {Machine review of arXiv:2412.20314}
}
read the original abstract

Future 6G networks are expected to empower communication systems by integrating sensing capabilities, resulting in integrated sensing and communication (ISAC) systems. However, this integration may exacerbate the data traffic congestion in existing communication systems due to limited resources. Therefore, the resources of ISAC systems must be carefully allocated to ensure high performance. Given the increasing demands for both sensing and communication services, current methods are inadequate for tracking targets frequently in every frame while simultaneously communicating with users. To address this gap, this work formulates an optimization problem that jointly allocates resources in the time, frequency, power, and spatial domains for targets and users, accounting for the movement of targets and time-varying communication channels. Specifically, we minimize the trace of posterior Cram\'er-Rao bound for target tracking subject to communication throughput and resource allocation constraints. To solve this non-convex problem, we develop a block coordinate descent (BCD) algorithm based on the penalty method, successive convex approximation (SCA), and one-dimensional search. Simulation results demonstrate the validity of the proposed algorithm and the performance trade-off between sensing and communication.

Figures

Figures reproduced from arXiv: 2412.20314 by the authors.

Figure 1
Figure 1. Transmission protocol of ISAC system. u, let n u m ∈ {1, . . . , NRB−1} denote the number of contiguous RBs allocated to the m-th target. Let o u ki ∈ {1, . . . , NRB − 1} represent the number of RBs allocated to the k-th UE in the i-th mini-slot. The total number of RUs allocated to UEs and targets in each frame is no larger than the maximum number of RUs, mathematically expressed as X M m=1 n u m + X K k=1 X I i=1… view at source ↗
Figure 2
Figure 2. Location tracking results of targets. 0 10 20 30 40 50 60 70 80 90 100 Frame 0 0.01 0.02 0.03 0.04 0.05 0.06 0.07 0.08 0.09 0.1 trace of PCRB 55 60 65 70 75 80 85 90 95 100 QoS feasibility ratio [%] upper bound RFTEP proposed solution upper bound RFTEP proposed solution [PITH_FULL_IMAGE:figures/full_fig_p006_2.png] view at source ↗

Discussion (0). Continue with ORCID to comment.

Forward citations

Cited by 1 Pith paper

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

  1. Tracking-Aided Multi-User MIMO Communications with Hybrid Reconfigurable Intelligent Surfaces

    eess.SP 2025-04 conditional novelty 6.0 of 10

    A joint design of base station precoding, hybrid RIS reflection, and analog combining enables tracking-aided multi-user MIMO by maximizing a Fisher information bound under SINR constraints.

Reference graph

Works this paper leans on

21 extracted references · 19 canonical work pages · cited by 1 Pith paper

  1. [16]

    Impact of channel aging on dual-function radar-communication systems: Performance analysis and resource allocation,

    J. Chen, X. Wang, and Y .-C. Liang, “Impact of channel aging on dual-function radar-communication systems: Performance analysis and resource allocation,” IEEE Trans. Commun., 2023

    work page 2023

  2. [8]

    Sensing as a service in 6G perceptive networks: A unified framework for ISAC resource allocation,

    F. Dong, F. Liu, Y . Cui, W. Wang, K. Han, and Z. Wang, “Sensing as a service in 6G perceptive networks: A unified framework for ISAC resource allocation,” IEEE Trans. Wireless Commun., 2022

    work page 2022

  3. [1]

    6G: The next horizon: From connected people and things to connected intelligence,

    L. Huawei Technologies Co., “6G: The next horizon: From connected people and things to connected intelligence,” 2022, accessed July 2024. [Online]. Available: https://www-file.huawei.com/-/media/corp2020/pdf/ tech-insights/1/6g-white-paper-en.pdf?la=en

    work page 2022

  4. [2]

    IMT towards 2030 and beyond,

    D. ITU-R WP, “IMT towards 2030 and beyond,” 2023, accessed June

    work page 2023

  5. [3]

    Integrated sensing and communications: Toward dual- functional wireless networks for 6G and beyond,

    F. Liu et al. , “Integrated sensing and communications: Toward dual- functional wireless networks for 6G and beyond,” IEEE J. Sel. Areas Commun., vol. 40, no. 6, pp. 1728–1767, 2022

    2022

  6. [4]

    An overview of resource allocation in integrated sensing and communication,

    J. Du et al. , “An overview of resource allocation in integrated sensing and communication,” in Proc. 2023 IEEE/CIC Intl. Conf. on Commun. in China (ICCC Wkshp.), 2023, pp. 1–6

    work page 2023

  7. [5]

    Novel KLD-based resource allocation for integrated sensing and communication,

    Y . Kloob, M. Al-Jarrah, E. Alsusa, and C. Masouros, “Novel KLD-based resource allocation for integrated sensing and communication,” IEEE Trans. Signal Process., vol. 72, pp. 2292–2307, 2024

    work page 2024

  8. [6]

    UA V assisted integrated sensing and communications for internet of things: 3D trajectory optimization and resource allocation,

    Z. Liu, X. Liu, Y . Liu, V . C. M. Leung, and T. S. Durrani, “UA V assisted integrated sensing and communications for internet of things: 3D trajectory optimization and resource allocation,” IEEE Trans. Wireless Commun., pp. 1–14, 2024

    work page 2024

Show all 21 references
  1. [7]

    Joint optimization algorithm of offloading decision and resource allocation based on integrated sensing, communication, and computation,

    S. Sun and Q. Zhu, “Joint optimization algorithm of offloading decision and resource allocation based on integrated sensing, communication, and computation,” Wireless Netw., vol. 30, pp. 557–576, 2024

    2024

  2. [9]

    Cooperative trajectory planning and resource allocation for UA V-enabled integrated sensing and communication systems,

    Y . Panet al. , “Cooperative trajectory planning and resource allocation for UA V-enabled integrated sensing and communication systems,” IEEE Trans. Veh. Tech., pp. 1–16, 2023

    2023

  3. [10]

    Energy-aware resource allocation and trajectory design for UA V-enabled ISAC,

    A. Khalili, A. Rezaei, D. Xu, and R. Schober, “Energy-aware resource allocation and trajectory design for UA V-enabled ISAC,” in Proc. 2023 IEEE Global Commun. Conf., 2023, pp. 4193–4198

    2023

  4. [11]

    Joint MIMO precoding and computation resource allocation for dual-function radar and communication systems with mobile edge computing,

    C. Ding, J.-B. Wang, H. Zhang, M. Lin, and G. Y . Li, “Joint MIMO precoding and computation resource allocation for dual-function radar and communication systems with mobile edge computing,” IEEE J. Sel. Areas Commun., vol. 40, no. 7, pp. 2085–2102, 2022

    2022

  5. [12]

    Joint beam alignment and resource allocation for multi-user mmWave integrated sensing and communication systems,

    J. Zhang, S. Yan, and M. Peng, “Joint beam alignment and resource allocation for multi-user mmWave integrated sensing and communication systems,” IEEE Trans. Veh. Tech., pp. 1–16, 2023

    2023

  6. [13]

    UA V-enabled integrated sensing, computing and communication for internet of things: Joint resource allocation and trajectory design,

    Y . Zhou, X. Liu, X. Zhai, Q. Zhu, and T. S. Durrani, “UA V-enabled integrated sensing, computing and communication for internet of things: Joint resource allocation and trajectory design,” IEEE Internet Things J., pp. 12 717–12 727, 2023

    2023

  7. [14]

    Resource allocation in heterogeneously-distributed joint radar-communications under asynchronous Bayesian tracking framework,

    L. Wu, K. V . Mishra, M. B. Shankar, and B. Ottersten, “Resource allocation in heterogeneously-distributed joint radar-communications under asynchronous Bayesian tracking framework,” IEEE J. Sel. Areas Commun., vol. 40, no. 7, pp. 2026–2042, 2022

    2026

  8. [15]

    Robust and secure resource allocation for ISAC systems: A novel optimization framework for variable-length snapshots,

    X. Dongfang et al. , “Robust and secure resource allocation for ISAC systems: A novel optimization framework for variable-length snapshots,” IEEE Trans. Commun., vol. 70, no. 12, pp. 8196–8214, 2022

    2022

  9. [17]

    3GPP TR 38.912 v17.0.0 Study on new radio (NR) access technology,

    3rd Generation Partnership Project, “3GPP TR 38.912 v17.0.0 Study on new radio (NR) access technology,” 3GPP, 2022 Mar

    2022

  10. [18]

    Simultaneous multibeam resource allocation scheme for multiple target tracking,

    J. Yan, H. Liu, B. Jiu, B. Chen, Z. Liu, and Z. Bao, “Simultaneous multibeam resource allocation scheme for multiple target tracking,” IEEE Trans. Signal Process., vol. 63, no. 12, pp. 3110–3122, 2015

    2015

  11. [19]

    Radiorchestra: Proactive management of millimeter-wave self-backhauled small cells via joint optimization of beamforming, user association, rate selection, and admission control,

    L. F. Abanto-Leon et al. , “Radiorchestra: Proactive management of millimeter-wave self-backhauled small cells via joint optimization of beamforming, user association, rate selection, and admission control,” IEEE Trans. Wireless Commun., vol. 22, no. 1, pp. 153–173, 2023

    2023

  12. [20]

    3GPP TS 38.211 v17.1.0 5G NR physical channels and modulation,

    3rd Generation Partnership Project, “3GPP TS 38.211 v17.1.0 5G NR physical channels and modulation,” 3GPP, 2022 Apr

    2022

  13. [2024]

    Available: https://www.itu.int/en/ITU-R/study-groups/ rsg5/rwp5d/imt-2030/Pages/default.aspx

    [Online]. Available: https://www.itu.int/en/ITU-R/study-groups/ rsg5/rwp5d/imt-2030/Pages/default.aspx

Pith tools

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