QLA-MAODV: A Q-learning adaptive multicast routing protocol 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 face challenges in achieving efficient multicasting due to dynamic topology changes and unreliable links. Existing multicast approaches either suffer from low packet delivery ratio or high overhead. These approaches rely on simple metrics like hop count to find the optimal path to the destination. Once the path is selected, all packets are sent over the same path as long as it remains available. However, a path that is deemed optimal at a specific instance of time may not retain its optimality at a subsequent moment due to node mobility. Moreover, using a metric like hop count that does not consider link quality can lead to poor packet delivery ratio, as it can favor an unreliable path over a reliable one just because it is the shortest. To tackle these concerns, a Q-Learning Adaptive Multicast Ad-hoc On-Demand Distance Vector routing protocol is proposed. It is an adaptive and bandwidth-efficient solution that utilizes link reliability as a routing metric instead of hop count, aiming to build a more stable multicast tree. By leveraging Q-learning principles, the proposed protocol continuously updates path costs to detect any deterioration. Additionally, the protocol dynamically explores the network using periodic group hello messages, enabling the identification of alternative paths and proactively switches to them if path costs deteriorate. Simulations conducted in Network Simulator 3 demonstrate the superiority of the proposed protocol over the traditional Multicast Ad-hoc On-Demand Distance Vector protocol. Furthermore, it outperforms a modified version, called Multicast Ad-hoc On-Demand Distance Vector-Route Reliability, that uses link reliability as a metric, demonstrating enhanced packet delivery ratio and reduced multicast-related overhead.
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.002 | 0.000 |
| Meta-epidemiology (narrow) | 0.001 | 0.001 |
| Meta-epidemiology (broad) | 0.001 | 0.000 |
| Bibliometrics | 0.000 | 0.002 |
| Science and technology studies | 0.001 | 0.000 |
| Scholarly communication | 0.001 | 0.001 |
| Open science | 0.002 | 0.002 |
| Research integrity | 0.001 | 0.002 |
| 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