Randomized 3D Position-based Routing Algorithms for Ad-hoc Networks
Why this work is in the frame
A frame that forgets how it found something cannot be audited. These are the routes that admitted this work.
Bibliographic record
Abstract
In position-based routing algorithms for ad-hoc networks, the nodes use the geographical information to make the routing decisions. Recent research in this field primarily addresses such routing algorithms in two dimensional space (2D). However, in real applications, nodes may be distributed in 3D space. In this paper we extend previous randomized routing algorithms from 2D space to 3D space, and we propose two new position-based routing algorithms that combine randomized AB3D routing algorithms with a deterministic CFace (coordinate face) algorithm. The first algorithm AB3D-CFace(1)-AB3D starts with AB3D routing algorithm until a local minimum is reached. The algorithm then switches to CFace routing using one projected coordinate. If CFace(1) enters a loop, the algorithm switches back to AB3D. The second algorithm AB3D-CFace(3) starts with AB3D, until a local minimum is reached The algorithm then permanently switches to CFace routing using three projected coordinates, in order. We evaluate our mechanisms and compare them with the current routing algorithms. The simulation results show the significant improvement in delivery rate over pure AB3D randomized routing (97% compared to 70%) and reduction in path dilation (up to 50%) over pure CFace algorithm
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.
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.001 | 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 it