A Distributed Directional-to-Directional MAC Protocol for Asynchronous Ad Hoc Networks
Bibliographic record
Abstract
The use of directional antennae in ad hoc networks has received growing attention in recent years. However, most existing directional MAC protocols assume interchangeable directional and omnidirectional modes of operation. Such operation reduces the spatial gain and introduces the asymmetry-in-gain problem. In this paper, we propose a directional-to-directional (DtD) MAC protocol for ad-hoc networks that operates in the directional mode exclusively. The protocol is fully distributed, does not require any synchronization, eliminates the asymmetry- in-gain problem, and alleviates the deafness problem. To study the performance of the proposed DtD MAC, we develop an analytical model that estimates the saturation throughput as a function of the number of antenna sectors, packet size and number of contending nodes. The analytical results are validated by extensive simulations with the QualNet simulator. We show that the DtD MAC protocol is practical to take the advantage of directional antennae to improve network throughput and achieve better fairness in ad-hoc 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.002 | 0.003 |
| Meta-epidemiology (narrow) | 0.001 | 0.000 |
| Meta-epidemiology (broad) | 0.001 | 0.000 |
| Bibliometrics | 0.001 | 0.001 |
| Science and technology studies | 0.001 | 0.001 |
| Scholarly communication | 0.001 | 0.001 |
| Open science | 0.002 | 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".