Multi-Agent Deep Reinforcement Learning for Packet Routing in Tactical Mobile Sensor 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
Tactical wireless sensor networks (T-WSNs) are used in critical data-gathering military operations, such as battlefield surveillance, combat monitoring, and intrusion detection. These networks have unique challenges, such as jamming attacks, which are not normally encountered in traditional WSNs. Jamming attacks on the networks’ links disrupt data communication and make packet routing in T-WSNs a difficult task. Consequently, T-WSN routing aims to find the most reliable routes, while meeting the stringent delay and energy requirements. To this end, we propose a distributed multi-agent deep reinforcement learning (MADRL)-based routing solution for multi-sink tactical mobile sensor networks to overcome link layer jamming attacks. Our proposed routing scheme captures the hop count to the nearest sink, the one-hop delay, the next hop’s packet loss rate (PLR), and the energy cost of packet forwarding in the action reward estimation. Furthermore, the proposed scheme outperforms benchmark algorithms in terms of the packet delivery ratio (PDR), packet delivery time, and energy efficiency.
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.001 |
| 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.001 |
| 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