Mobility based dynamic TXOP for vehicular communication
Bibliographic record
Abstract
Due to the mobile nature of nodes comprising the vehicular networks in addition to interference and congested network traffic, the design of an efficient MAC network becomes challenging. Moreover, the latency constraints underlying safety application add complexity to this design. The TXOP (Transmit Opportunity) mechanism defined in the IEEE 802.11e is optimized to meet the requirements of a Multimedia Network (voice and audio) but not a vehicular network thus making it unsuitable to be used in a VANet environment. On the other hand, existing MAC algorithms for VANets are designed to overcome some challenges overlooking others. Hence, the merit of this paper lies in developing a MAC mechanism that incorporates in an integrated manner various VANet's challenges while modifying the 802.11e TXOP to meet vehicular conditions. In this work, we propose MoByToP (Mobility Based Dynamic TXOP for VANets). MoByToP is an enhancement mechanism added to the MAC layer to extend the operation of the medium reservation phase. The uniqueness of MoByToP lies in designing a dynamic TXOP to incorporate mobility and QoS (Quality of Service) while considering the transmit data rate of the source vehicle. The proposed protocol was implemented in OMNET++4.1 and extensive experiments demonstrated that the proposed MAC with MoByToP mechanism ensures the reception of QoS messages much faster, more efficient and reliable than existing VANet MAC protocols.
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.001 | 0.000 |
| Meta-epidemiology (broad) | 0.000 | 0.000 |
| Bibliometrics | 0.000 | 0.001 |
| 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.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".