Search arXivSearch

arXiv · 2609.01908

CRB-Guided Sensing and Resource Allocation for Human Pose Prediction in Integrated Sensing, Communication, and Computation Systems

Abstract

Integrated sensing, communication, and computation (ISCC) provides a promising framework for indoor human-centric applications. In these applications, short-term human pose prediction facilitates continuous human pose tracking and proactive resource allocation. This paper proposes a Cramer-Rao bound (CRB)-guided sensing framework and investigates a problem of minimizing prediction error in resource-constrained ISCC systems. Specifically, a pose prediction model (ET-Mamba) is first developed to predict human joint positions for continuous tracking. To account for computation-resource limitations, lightweight prediction heads are attached to different inference layers, enabling adaptive-depth pose prediction. A CRB-guided perturbation strategy is then introduced to translate sensing uncertainty at different sensing SNR levels into point-cloud perturbations. Based on that, an empirical relationship among pose prediction error, sensing SNR, and model inference depth is established. Furthermore, to improve prediction accuracy under limited resources, this paper formulates a resource allocation optimization problem that minimizes the pose prediction error by jointly optimizing the beamforming matrix, model inference depth, and computation frequency. To solve this mixed-integer non-convex optimization problem, we propose an alternating optimization (AO)-based algorithm, where closed-form updates and semidefinite programming (SDP) are integrated into the iterative solution process. Simulation results show that the proposed method effectively improves pose prediction performance by up to 35 percent under resource constraints, verifying the effectiveness of conducting joint sensing, communication, and computation design in ISCC systems.

Explore related subjects

Keep this discovery

BibTeXRIS

Zhonghao Liu, Yahao Ding, Jiaxiang Wang, Zhaohui Yang, Abdol Hamid Aghvami, Mohammad Shikh-Bahaei. 2026-09-01. CRB-Guided Sensing and Resource Allocation for Human Pose Prediction in Integrated Sensing, Communication, and Computation Systems. https://arxiv.org/abs/2609.01908

Cite the original work for its findings. Save a collection to share your selection of sources.

Discover connections

Connections use source metadata and explicit phrase matches, not verified experimental comparisons.

KEEP EXPLORING

Related papers

On the Delay-Constrained Maximum Concurrent Flow Problem

Real-time services, such as VoIP and large-scale neural network training, require strict transmission delay guarantees. While routing under hop constraints is tractable, real-world delays increase sharply with equipment load, typically modeled using the M/M/1 queuing function where delay is inversely proportional to available bandwidth. We investigate the resulting Delay-Constrained Maximum Concurrent Flow (DCMCF) problem, which seeks to maximize the minimum throughput across all commodities. The problem's complexity stems from the conditional and non-linear nature of the delay constraints, which are active only along the specific paths used by the flow. We prove that DCMCF is strongly NP-hard, even for single-source/single-destination instances. To address the inherent non-convexity of the problem, we introduce a new convex relaxation expressed through second-order cone constraints, obtained from the convex envelope of a function representing the conditional delay associated with a single arc of a given path. The relaxation is shown to outperform existing formulations based on disjunctive programming. Leveraging this result, we develop a polynomial-time approximation algorithm with a provable performance guarantee and present numerical experiments demonstrating the effectiveness of the proposed approach.

cs.NI

Semantic Freshness Optimal Sampling and Transmission for Gossiping Receivers

We study the optimal joint sampling and transmission policy for a transmitter communicating with two gossiping receivers that share information with each other, with the objective of tracking a source under the Version Age of Information (VAoI) metric. The transmitter can observe source-version changes, but it has to pay a sampling cost to get the current source information content. Similarly, it can communicate with a receiver by paying a transmission cost. Gossiping enables local information exchange and is able to reduce costly direct transmissions. With imperfect communication links, we formulate an infinite-horizon average-cost Markov Decision Process (MDP) to jointly minimize receiver VAoI, sampling cost, and transmission cost. Using Relative Value Iteration (RVI), we evaluate the optimal policy and establish several properties of its structure. We prove that sampling has a threshold structure in the transmitter VAoI. Among direct transmissions, it is optimal to serve the older receiver. We further characterize the transmit or idle decision through the receiver VAoI difference. Our analysis shows that link reliability and receiver VAoI imbalance have a significant effect on the optimal policy structure. Numerical results verify the structural properties and demonstrate the performance gains of the optimal policy over multiple baselines.

cs.IT

Initialization and Rate-Quality Functions for Generative Network Layer Protocols

Generative AI (GenAI) creates full content based on compact encodings. While GenAI has been used for applications where the generated content is returned to the encoding sender, it can also extend the capacity of communication networks by transmitting compact encodings through capacity-limited links, then generating and forwarding approximations from the GenAI node to the destination. This poses the challenge of evaluating approximation quality as a function of the rate between the source and GenAI node, while accounting for the communication overhead of learning. We present a method- and modality-agnostic initialization protocol for learning rate-quality functions in GenAI-aided networks, defining three variants: source-, node-, and destination-oriented, each with different messaging flows based on where quality is measured. The protocol augments node discovery protocols (e.g., MCP, A2A) when sources lack confidence in advertised model performance. We illustrate operation via a minimum estimation budget calculated using a distribution-free tolerance limit , and validate using a case study on image transmission under quality constraints. Results confirm the calculated budget meets the target quality requirement, with positive gains over JPEG after around 20 post-learning transmissions for a perceptual metric and more than 100 for a goal-oriented metric, providing a practical foundation for GenAI-based network compression.

cs.NI