ALOHA Improvement Algorithm for Dynamic Frame Time Slots with Transformer
Bibliographic record
Abstract
In recent years, with the widespread application of RFID technology in production and daily life, the demand for tag reading systems has been increasing. When faced with a large number of tags, RFID systems often experience severe collisions within the same reading frame due to tag responses, leading to low reading efficiency. The key to solving this problem lies in the speed and accuracy of the tag number estimation algorithm. Based on the analysis of traditional algorithms, this paper proposes a new tag number estimation algorithm. This algorithm generates tag datasets with specific word lengths based on the principle of the dynamic framed slotted ALOHA (DFSA) algorithm and establishes a model using a Transformer neural network to predict the number of tags. The network establishes a mapping relationship between the reader and the remaining number of tags to estimate the tag count. Compared with traditional algorithms, the innovation of this paper lies in the introduction of the self-attention mechanism, which significantly improves the accuracy of tag number prediction while reducing the time consumption of the reading system. Simulation results show that the proposed algorithm improves system efficiency while maintaining accuracy, offering a new solution for large-scale RFID applications.
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.001 |
| 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.005 | 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".