PACONET: imProved  Ant Colony Optimization Routing Algorithm for Mobile 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
Mobile Ad Hoc Networks (MANETS) are infrastructureless network consisting of mobile nodes, with constantly changing topologies, that communicate via a wireless medium. Therefore, routing is a challenging issue in MANETs. Recently, nature inspired algorithms have been explored as means of finding an efficient solution to this routing problem. In this paper, we develop an improved routing algorithm for MANETs based on Ant Colony Optimization (ACO) inspired by real ants. The performance of the routing algorithm is evaluated through simulation and is compared to an existing well known MANET routing protocol, Ad hoc On-Demand Distance Vector (AODV). Several performance metrics are considered in different scenarios with varying mobility levels and traffic load.
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.001 | 0.000 |
| Meta-epidemiology (broad) | 0.001 | 0.000 |
| Bibliometrics | 0.000 | 0.001 |
| Science and technology studies | 0.001 | 0.000 |
| Scholarly communication | 0.000 | 0.001 |
| Open science | 0.001 | 0.001 |
| 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