Single‐band full‐duplex MAC protocol for distributed access networks
Bibliographic record
Abstract
Recent advances in wireless communications promised the realisation of a revolutionary technique, called full‐duplex (FD), which allows communication in both directions at the same time and over the same channel. However, the viability of FD in the physical layer requires the support of the MAC layer to fully spread the advantages of this technology to the whole wireless network. In this study, the authors introduce a distributed MAC protocol, termed distributed‐access FD MAC, suitable for multi‐hop communications whereby nodes are FD enabled. Using this protocol, a data packet can be forwarded by a number of nodes along a multi‐hop path with un‐contented access to the channel at each hop except for the head node. After detailing the specifications of this protocol, they establish a finite‐state discrete‐time Markov model to evaluate its performance. Using probabilistic mathematical methods, they derive important quantitative metrics such as path delay and throughput. Numerical results are provided and demonstrate the considerable improvement in network performance that the proposed protocol achieves compared with CSMA/CA half‐duplex access mechanism.
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.001 |
| Bibliometrics | 0.001 | 0.002 |
| Science and technology studies | 0.001 | 0.001 |
| Scholarly communication | 0.002 | 0.001 |
| Open science | 0.002 | 0.001 |
| Research integrity | 0.002 | 0.002 |
| Insufficient payload (model declined to judge) | 0.006 | 0.003 |
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".