An Efficient Adaptive Backoff Algorithm for Wireless Sensor Networks
Bibliographic record
Abstract
The IEEE 802.15.4 standard utilizes the Binary Exponential Backoff (BEB) algorithm to control nodes' access to the shared wireless medium. The main drawback of BEB is that it updates the size of the contention window (CW) without taking into consideration the number of competing nodes and the conditions in the communications medium. Therefore, BEB has been shown to be inefficient in terms of channel utilization and fairness among the contending nodes. In this paper, we propose Adaptive Backoff Algorithm (ABA), a new backoff algorithm that adaptively determines the appropriate size of CW based on the collisions experienced by the nodes. That is, while BEB updates CW in a deterministic fashion, we introduce a probabilistic methodology to achieve that update. Our simulations compare the performance of ABA with that of BEB as well as three other algorithms proposed in the literature, namely, NO-BEB, KEB, and IBEB. The performance is studied in terms of power consumption, reliability, and channel utilization. Our results show that ABA outperforms the aforementioned algorithms while granting each node a fair access to the wireless medium.
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.001 | 0.000 |
| Meta-epidemiology (broad) | 0.001 | 0.000 |
| Bibliometrics | 0.001 | 0.001 |
| Science and technology studies | 0.001 | 0.000 |
| Scholarly communication | 0.001 | 0.001 |
| Open science | 0.001 | 0.001 |
| Research integrity | 0.001 | 0.001 |
| 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".