Sensing for Communication: RIS-Assisted ISAC Coordination Gain Enhancement With Imperfect CSI
Bibliographic record
Abstract
Integrated sensing and communication (ISAC) has the potential to facilitate coordination gains from mutual assistance between sensing and communication (S&C), especially sensing-aided communication enhancement (SACE). Reconfigurable intelligent surface (RIS) is another potential technique for achieving resource-efficient communication enhancement. Therefore, this paper proposes an innovative RIS-assisted SACE (R-SACE) mechanism with the goal of improving the systemic communication performance of the ISAC system in practical scenarios where the channel status information (CSI) is imperfectly known. In the proposed R-SACE mechanism, a dual-functional base station (BS) provides downlink communication services to both the communication user and the dynamically changing target that is detected using the communication signals. RIS assists in both sensing and communications of the BS. A typical scenario is investigated in which either or both the direct and RIS-assisted reflected communication links are available depending on sensing results. The average systemic throughput (AST) over the entire timeline of the R-SACE mechanism is maximized by jointly optimizing both temporal and spatial resources under the probabilistic constraint and the sensing performance, transmission power, and communication interference constraints. The non-convex probabilistic mixed optimization problem is transformed and then solved by the proposed fixed-point iterative (FPI) algorithm. Simulation results demonstrate that the proposed FPI algorithm and R-SACE mechanism outperform the baseline algorithms and communication enhancement mechanisms in achieving higher systemic communication performance.
Fetched live from OpenAlex and de-inverted. Abstracts are not stored in this database: the inverted indexes are 8.6 GB of the frame’s 9.3 GB of text, and the host has 13 GB free.
How this classification was reachedexpand
Full frame machine prediction
Teacher imitationNot calibrated prevalence, not ground truth. Human validation pending. The Gemma side is a direct model label for every work in the frame, read from the title-only record. The Codex side is a classifier learned from the 10,348 direct Codex labels and calibrated to design-weighted sample rates; fields without enough sample support carry no Codex call. Candidate is the union of the two sides; consensus is their intersection. These outputs are machine_predicted_unvalidated and are not human labels.
Distilled classifier scores by category (both heads)
| Category | Codex | Gemma |
|---|---|---|
| Metaresearch | 0.001 | 0.002 |
| Meta-epidemiology (narrow) | 0.001 | 0.000 |
| Meta-epidemiology (broad) | 0.001 | 0.000 |
| Bibliometrics | 0.000 | 0.001 |
| Science and technology studies | 0.000 | 0.001 |
| Scholarly communication | 0.001 | 0.001 |
| Open science | 0.001 | 0.002 |
| Research integrity | 0.001 | 0.001 |
| Insufficient payload (model declined to judge) | 0.001 | 0.000 |
Machine scores (provisional)
The two teacher heads of the student model, read on this work. A score orders the frame for review; it never asserts a category, and the validation status ships verbatim with every row.
Baseline scores from an immature model (maturity gate not passed, 7 training rounds). Scores rank; they never assert a category.
score_only:v0-immature-baseline · verbatim from the scoring run: score_only means the number may rank works, and no category label ships from itClassification
machine, unvalidatedMachine predicted; a candidate call from one source (direct Gemma or distilled Codex), not a consensus.
How this classification was reached, model by model and score by score, is at the end of the page under "How this classification was reached".