A parallel ant colony optimization algorithm for all-pair routing in MANETs
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
A mobile ad hoc network (MANET) consists of mobile wireless nodes that communicate in a distributed fashion without any centralized administration. The nodes instantaneously and dynamically form a network on the fly when it is needed. We define an irregular application as one that changes the network dynamically during runtime, exhibits chaotic load balancing among the processors and unpredictable communication behavior among the nodes during runtime. An ad hoc network has all these characteristics and hence could be considered as an irregular application from the parallel computing perspective. In this paper, we design an on-demand routing algorithm called source update for MANET using a meta-heuristic based on the ant colony optimization (ACO) search technique. We develop a mechanism to detect cycles, parallelize this algorithm on a distributed memory machine using MPI, and study the performance of the parallel algorithm. On a distributed network of workstations, we obtain a relative speedup of 7 with 10 processors.
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.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.000 | 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