Intelligent Reflecting Surfaces Assisted Cellular V2X Based Open RAN Communications
Bibliographic record
Abstract
Open radio access networks (RAN) enhance the capabilities of traditional RAN by introducing features such as interoperability, open interfaces, software/hardware separation, and intelligence. Open RAN has several use cases in cellular vehicle-to-everything communications such as low-latency information exchange between vehicles and RAN intelligence controller (RIC). However, efficient data sharing between vehicles and RIC suffers from the challenges of signal loss due to mobility and dynamic channel conditions. In this regard, intelligent reflecting surfaces (IRS) have emerged as an intriguing concept of reconfigurable and smart environments to improve the performance of wireless communication systems. In the proposed research work, our main focus is on a multi-IRS aided single input single output system, where open RAN base stations (BS) convey information to a remote vehicular user. The transmitted signal is reflected by IRSs via multi-hop passive beamforming over pairwise line-of-sight links. To maximize the overall network sum-rate, we propose an IRS assignment method that allocates either a single IRS or multiple IRSs to each BS-user pair. In particular, the proposed algorithm consists of two stages, where in the first stage we perform <inline-formula xmlns:mml="http://www.w3.org/1998/Math/MathML" xmlns:xlink="http://www.w3.org/1999/xlink"><tex-math notation="LaTeX">$k$</tex-math></inline-formula> -means clustering to group the IRSs according to their location. In the next stage, for each group, we select the best IRS-assisted path (based on received signal strength) by transforming the original network into a trellis graph and using a trellis-search method. Simulation results show that the proposed technique outperforms existing IRS selection techniques in multiple IRS-enabled multi-hop communication systems.
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.001 | 0.002 |
| Science and technology studies | 0.000 | 0.000 |
| Scholarly communication | 0.000 | 0.000 |
| Open science | 0.003 | 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".