Efficient Transmission of H.264 Video over Multirate IEEE 802.11e WLANs
Bibliographic record
Abstract
The H.264 video encoding technology, which has emerged as one of the most promising compression standards, offers many new delivery-aware features such as data partitioning. Efficient transmission of H.264 video over any communication medium requires a great deal of coordination between different communication network layers. This paper considers the increasingly popular and widespread 802.11 Wireless Local Area Networks (WLANs) and studies different schemes for the delivery of the baseline and extended profiles of H.264 video over such networks. While the baseline profile produces data similar to conventional video technologies, the extended profile offers a partitioning feature that divides video data into three sets with different levels of importance. This allows for the use of service differentiation provided in the WLAN. This paper examines the video transmission performance of the existing contention-based solutions for 802.11e, and compares it to our proposed scheduled access mechanism. It is demonstrated that the scheduled access scheme outperforms contention-based prioritized services of the 802.11e standard. For partitioned video, it is shown that the overhead of partitioning is too high, and better results are achieved if some partitions are aggregated. The effect of link adaptation and multirate operation of the physical layer (PHY) is also investigated in this paper.
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.003 |
| 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.001 | 0.001 |
| Open science | 0.001 | 0.001 |
| Research integrity | 0.000 | 0.000 |
| Insufficient payload (model declined to judge) | 0.001 | 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".