Sum-Rate Maximization for RIS-IoV: From Instantaneous to Statistical CSI
Bibliographic record
Abstract
To fully exploit the potential of reconfigurable intelligent surface (RIS), the controllable channel state information (CSI) should be accurate for its future applications. Unfortunately, in vehicular communications, obtaining exact instantaneous CSI presents substantial challenges. Moreover, even with an instantaneous CSI acquisition, a processing latency for RIS phase shift adaption might occur before the vehicular system reacts to the instantaneous CSI information. To effectively introduce RIS into Internet of vehicle (IoV) networks, we employ a more realistic statistical CSI approach in designing RIS-assisted vehicular communication systems that are robust to the general characteristics of the channel, rather than its instantaneous fluctuations. We present a practical system framework, where a roadside unit employs an RIS to facilitate indirect wireless communications for vehicle-to-vehicle (V2V) communications. Particularly, the direct links between vehicles are susceptible to blockages caused by surrounding obstacles/vehicles. The deployment of RIS is to establish supplementary communication links between a multi-antenna vehicle source (VS) and multiple vehicular users (VUs) as they traverse areas with a poor service coverage. With the objective to maximize the time-averaged sum-rate of VUs, instead of instantaneous CSI, we rely on the delayed statistical CSI feedback to design active beamforming at the VS and passive beamforming at RIS. Moreover, we develop an efficient algorithm, named JAPBNB, which leverages the fractional programming technique to find a stationary solution for the formulated sum-of-logarithms-of-ratio problem. Specifically, a non-convex block coordinate descent (BCD) approach, collaborating with the alternating direction method of multipliers (ADMM), is applied for the joint optimization of active and passive beamforming. Finally, the complexity and convergence of the proposed JAPBNB algorithm are thoroughly discussed and validated. Simulation results demonstrate that the time-averaged sum-rate obtained by the proposed JAPBNB algorithm approaches that obtained by the instantaneous CSI scheme, when the delayed statistical CSI feedback interval is adequately small.
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 distilled prediction
Teacher imitationNot calibrated prevalence, not ground truth. Human validation pending. Learned from the 10,348 direct Codex labels and 10,348 direct Gemma labels. Candidate is the union of thresholded teacher heads; consensus is their intersection. These outputs are machine_predicted_unvalidated and are not human labels or direct frontier model labels.
Codex and Gemma teacher scores by category
| Category | Codex | Gemma |
|---|---|---|
| Metaresearch | 0.000 | 0.000 |
| Meta-epidemiology (narrow) | 0.000 | 0.000 |
| Meta-epidemiology (broad) | 0.000 | 0.000 |
| Bibliometrics | 0.000 | 0.001 |
| Science and technology studies | 0.000 | 0.000 |
| Scholarly communication | 0.000 | 0.000 |
| Open science | 0.001 | 0.000 |
| Research integrity | 0.000 | 0.001 |
| Insufficient payload (model declined to judge) | 0.000 | 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 teacher head, 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".