Pith. sign in

REVIEW 2 cited by

Energy-Efficient Probabilistic Semantic Communication over Space-Air-Ground Integrated Networks

Not yet reviewed by Pith; the record is open.

This paper has not been read by Pith yet. Machine review is queued; the pith claim, tier, and objections will appear here once it completes.

SPECIMEN: schema-true, not a live event

T0 review · schema-true

One-sentence machine reading of the paper's core claim.

pith:XXXXXXXX · record.json · timestamp

arxiv 2407.03776 v1 pith:YN5AACJG submitted 2024-07-04 cs.IT math.IT

Energy-Efficient Probabilistic Semantic Communication over Space-Air-Ground Integrated Networks

classification cs.IT math.IT
keywords computationcommunicationproblemsemanticenergynetworksalgorithmcapacity
verification ladder T0 review T1 audit T2 compute T3 formal T4 reserved
0 comments
read the original abstract

Space-air-ground integrated networks (SAGINs) are emerging as a pivotal element in the evolution of future wireless networks. Despite their potential, the joint design of communication and computation within SAGINs remains a formidable challenge. In this paper, the problem of energy efficiency in SAGIN-enabled probabilistic semantic communication (PSC) system is investigated. In the considered model, a satellite needs to transmit data to multiple ground terminals (GTs) via an unmanned aerial vehicle (UAV) acting as a relay. During transmission, the satellite and the UAV can use PSC technique to compress the transmitting data, while the GTs can automatically recover the missing information. The PSC is underpinned by shared probability graphs that serve as a common knowledge base among the transceivers, allowing for resource-saving communication at the expense of increased computation resource. Through analysis, the computation overhead function in PSC is a piecewise function with respect to the semantic compression ratio. Therefore, it is important to make a balance between communication and computation to achieve optimal energy efficiency. The joint communication and computation problem is formulated as an optimization problem aiming to minimize the total communication and computation energy consumption of the network under latency, power, computation capacity, bandwidth, semantic compression ratio, and UAV location constraints. To solve this non-convex non-smooth problem, we propose an iterative algorithm where the closed-form solutions for computation capacity allocation and UAV altitude are obtained at each iteration. Numerical results show the effectiveness of the proposed algorithm.

discussion (0)

Sign in with ORCID, Apple, or X to comment. Anyone can read and Pith papers without signing in.

Forward citations

Cited by 2 Pith papers

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

  1. The Price of Meaning: Quantifying Semantic Communication Overheads in Practice

    cs.NI 2026-07 conditional novelty 6.0

    SemCom is spectrally and energetically worthwhile only above closed-form payload break-even thresholds that amortize protocol, sync, and compute overheads, with multi-user downlink the most favorable case.

  2. When Robots Exchange Meaning: A Demo of Goal-Oriented Semantic Communications for Collaborative Robotics

    cs.RO 2026-07 conditional novelty 3.5

    A robot-edge demo encodes 320×240 RGB into 5400-byte VQ-VAE tokens (42.67× smaller), reconstructs them for RTAB-Map semantic mapping, and exposes object-level mission control.