Joint Beamforming Design for Energy Efficient Wireless Communications in Heterogeneous Intelligent Connected Vehicles Networks
Bibliographic record
Abstract
The wireless communications is studied for the intelligent connected vehicles (ICV) networks by supporting heterogeneous access with direct access of one vehicle yet the dual-hop access of another vehicle. The dual-hop access is enhanced by one dedicated vehicle as relaying vehicle with multiple antennas. The goal in this paper is to joint design of both receive beamforming and transmit beamforming at the relaying multi-antenna vehicle to suppress the interference between the two wireless receive vehicles yet match the dual-hop wireless channel as much as possible. The energy efficiency is optimized as the objective function under the constraint of the limited power over every beamforming vector. Due to the difficulty of the optimization, the principle of the signal to leakage plus noise ratio (SLNR) is introduced to the studied ICV networks and thus to obtain the analytical expression of the beamforming vectors. With the derived closed form over all the beamforming vectors, an iterative algorithm is developed for jointly optimizing all the beamforming vectors to maximize the energy efficiency of the whole system, which is guaranteed to be convergent to one local optimum. Numerical simulations show the good performances of the proposed method in ICV networks.
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.001 |
| 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.001 |
| Research integrity | 0.001 | 0.001 |
| Insufficient payload (model declined to judge) | 0.002 | 0.001 |
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".