Contention With Collision Detection in Wireless Full-Duplex Networks
Bibliographic record
Abstract
Conventional wireless networks are half-duplex and most of them use contention-based protocols. These protocols usually adopt a principle of contention with collision avoidance and infer a collision occurrence very late from the absence of an acknowledgment after data transmission, causing low network performance. Wireless full-duplex (FD) enables simultaneous transmission (TX) and reception (RX) on the same channel. Exploiting this functionality, this article proposes the first design that enables contention with collision detection (CCD) to improve the network performance. We call the proposed design FD-CCD. With FD-CCD, in contention, a node exploits the TX antenna to transmit a signal for channel contention, while exploiting the RX antenna to sense if other nodes are transmitting too. By checking the status of the TX and RX antennas, the node can detect the contention collision before data transmission and, hence, obtain an opportunity to avoid the data collision effectively. FD-CCD also supports priority-based contentions, is of very low contention overhead, and is compatible with conventional 802.11 networks. This article then develops a theoretical model to analyze the system performance and optimize protocol parameter settings. Extensive simulations verify the effectiveness of our design and the accuracy of our model. This study is very helpful in designing efficient FD 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 distilled prediction
Teacher imitationNot calibrated prevalence, not ground truth. Human validation pending. Learned from the 10,348 direct Codex labels and 10,348 direct Gemma labels. Candidate is the union of thresholded teacher heads; consensus is their intersection. These outputs are machine_predicted_unvalidated and are not human labels or direct frontier model labels.
Codex and Gemma teacher scores by category
| Category | Codex | Gemma |
|---|---|---|
| Metaresearch | 0.000 | 0.000 |
| Meta-epidemiology (narrow) | 0.000 | 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.000 | 0.000 |
| Open science | 0.000 | 0.000 |
| Research integrity | 0.000 | 0.001 |
| Insufficient payload (model declined to judge) | 0.000 | 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 teacher head, 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".