An enhanced heuristic XoR network coding-based method for high quality video streaming over VANETs
Bibliographic record
Abstract
One of the most important challenges in live video streaming in mobile vehicular networks is the optimal use of broadband and point-to-point packet delay. Recent studies show that the sheer use of frames flow compression methods (such as H.264 or HEVC) and the proper communication overlay, such as Peer-to-Peer (P2P), has no absolute influence on increasing the quality of received video in VANET networks. Therefore, the use of an appropriate data exchange method, such as network coding, seems to be of great importance. Compared to Random Network Coding (RNC), XoR Network Coding (XNC) method has the least computational load for the network which is an important factor in optimal use of limited energy of nodes in a wireless network. The basic problem in XNC is that when a node is supposed to combine several frames and transmit them through an encoded frame, how this combination could be made to enable other nodes of the network to be broadcasted through receiving this packet and how can the available packets in their buffers decode as well as extract the largest number of frames in order to experience a higher video quality. To fulfil this aim, an encoding intelligent method is required which is based on the buffers' status of neighbours. In the proposed method in this article, the best frame combination is reached through buffers status of neighbours and AHP methods or AHP-TOPSIS methods, and the encoded frames are broadcasted through XNC. Simulation results show that due to the reduction in number of transmitted packets in the network, parameters such as congestion and point-to-point delay are significantly reduced and vehicles experience a higher video quality compared with other similar methods.
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.000 | 0.001 |
| 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.001 |
| Open science | 0.001 | 0.001 |
| Research integrity | 0.000 | 0.000 |
| Insufficient payload (model declined to judge) | 0.002 | 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".