Pure asynchronous neighbor discovery algorithms in ad hoc networks using directional antennas
Bibliographic record
Abstract
Asynchronous system provides great performance improvement for wireless ad hoc networks, such as anti-jamming, collision reduction and device simplification. Nevertheless, new media access and routing protocols are required to assist the asynchronous system, e.g., a neighbor discovery algorithm, which is the first step in the initialization of wireless ad hoc networks. In the past few years, a number of algorithms have been proposed for neighbor discovery. However, most of them only consider synchronous system and cannot work efficiently in asynchronous system. In this paper, firstly, we propose an analytical model for an 1-way asynchronous system in wireless ad hoc networks with directional antennas. Then, we compare the time-slot consumption in asynchronous system to complete the neighbor discovery process with that in synchronous system. Finally, in order to improve the performance of the neighbor discovery process, we extend the 1-way asynchronous discovery algorithms to a 2-way asynchronous discovery algorithm. To the best of our knowledge, this is the first practical analytical model of 2-way asynchronous neighbor discovery algorithm with directional antennas.
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.001 | 0.002 |
| 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".