A game based routing algorithm for congestion control of multimedia transmission in VANETs
Bibliographic record
Abstract
When transmitting multimedia files in urban Vehicle Ad hoc Networks (VANETs), the routing protocol will find multiple next hops with different quality because of the intensive nodes. Owing to the selfishness of the nodes, all of the multimedia streams try to seize the high quality nodes, attempting to maximize their usage of the high quality nodes. Consequently, it would inevitably lead to network congestion, affecting the QoS performance of the network, and even cause network paralysis. To solve the problem, this work presents a shunting of multimedia game model and a game based routing algorithm for congestion control of multimedia transmission in VANETs. In this game model, each stream carrying messages is a player, and its strategy is to select the percentage of the steam routed through the high quality nodes. A payoff function based on node metrics is proposed. The existence and uniqueness of a Nash Equilibrium is proved. Finally, the results of simulation demonstrate the effectiveness of GRCCM.
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.000 |
| Science and technology studies | 0.000 | 0.000 |
| Scholarly communication | 0.000 | 0.000 |
| Open science | 0.000 | 0.000 |
| Research integrity | 0.000 | 0.000 |
| 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".