OCSID: Orthogonal Accessing Control Without Spectrum Spreading for Massive RFID Network
Bibliographic record
Abstract
In radio-frequency identification (RFID)-based sensors networks, each sensor is integrated with a tag and sensors may co-exist in an area of interest. Before sending data packets, the sensors send their IDs for channel reservations. However, ID collisions happen frequently at the reservation stage which leads to significant time delays, especially for massive and dense networks. In this article, by employing group theory, we show that for B = 2k, where k is a positive integer, the set (-1, +1)Band the Hadamard product 0 forms a group ((-1, +1)B, 01 that can be divided into (2B/B) disjoint subsets, each of which has B binary vectors that are mutually orthogonal. Based on this finding, we propose orthogonal coset identification (OCSID) and its generalization, query tree (QT)-OCSID, that can recover ID information from collisions, and thus considerably improve the efficiency at the reservation stage, particularly when the network is large and/or dense. In an ideal case, it can recover/decode B tags for each query. The fundamental difference between the proposed OCSID schemes and code-division multiple accessbased schemes is that, OCSID achieves orthogonal design for ID information recovery by exploiting the inherent orthogonal structure of the binary vector set, instead of spreading the spectrum. Hence, it requires a narrower frequency band, lower circuit complexity, and lower synchronization precision, which are much more preferred by hardware limited devices.
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.002 |
| 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.001 | 0.002 |
| Research integrity | 0.000 | 0.001 |
| Insufficient payload (model declined to judge) | 0.003 | 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".