Retransmission cut-off half-duplex slotted aloha for wireless ad hoc and sensor networks
Bibliographic record
Abstract
Communication in wireless Ad Hoc and sensor networks may be achieved without a central entity (base station) and nodes communicate with each other in a half-duplex manner. In those kinds of networks each node either will be in a transmitting mode or in a receiving mode or in an idle mode. A transmission policy algorithm for half-duplex Slotted ALOHA is studied in terms of the node transmitting probability, the node receiving probability and the number of retransmission attempts. Results show that the retransmission cut-off is not required for the stable operation of half-duplex Slotted ALOHA, if the new packet transmission probability from each transmitting node is less than e-1/ (1+e-1) packet per time slot. The stability can also be achieved by decreasing the number of retransmission attempts sharply, when new packet transmission probability from each transmitting node is more than e-1/(1+e-1) packet per time slot. The results of this study are portrayed on graphs and may be used as a guideline of half-duplex contention-based multiple access schemes with and without retransmission cut-off.
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.000 |
| Science and technology studies | 0.000 | 0.000 |
| Scholarly communication | 0.000 | 0.000 |
| Open science | 0.001 | 0.000 |
| Research integrity | 0.000 | 0.000 |
| 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".