ArticleSensors (Basel, Switzerland)2026
Adaptive Probabilistic RREQ Rebroadcasting Using Thompson Sampling for Mobile Ad Hoc Sensor Networks.
Article in Sensors (Basel, Switzerland), 2026. The graph could read no effect estimate from its abstract, so it casts no vote on the map. Not yet cited in PubMed.
What it found
Each row is one number read from the abstract, on the scale the paper reported it, with its interval. Left of the dashed line favours the treatment, right favours the comparator. Under each row is the sentence it came from. New to these charts? A ten-minute tutorial.
The abstract states no effect estimate the extractor could read, or names no intervention and outcome on the map, so this paper lights no cell and moves no belief. It is still indexed, cited and linked below.
The trial behind it
Trials whose registry record cites this paper, or whose number appears in the abstract. A trial that started after this paper was published is citing it as background, not reporting it.
Neither the registry nor the abstract names a trial number. If this is a trial report, that itself is worth knowing.
Who cites it
0 citing papers in PubMed.
No citing paper in PubMed yet.
Corrections and comments
PubMed lists nothing against this paper. Absence here is not a guarantee, only a check that was made.
Authors and funding
2 authors.
Funding
No grant is acknowledged in the PubMed record.
Abstract
Route discovery in ad hoc on-demand distance vector (AODV)-based mobile ad hoc sensor networks relies on route request (RREQ) dissemination, which improves reachability, but generates redundant rebroadcasts, channel contention, delay, and energy waste. Fixed probabilistic rebroadcasting mitigates broadcast storms, but its performance depends on a manually selected forwarding probability applied uniformly across different local redundancy conditions. This work proposes the Thompson-sampling probabilistic AODV (TSP-AODV), a lightweight adaptive extension, in which each intermediate node selects among a small set of forwarding probability arms using a local duplicate-pressure context and delayed route reply (RREP) feedback. The reward function uses the local observation of a corresponding RREP as delayed feedback while penalising high forwarding probability in locally redundant contexts. TSP-AODV requires no additional control packets, no topology exchange, and only a small number of local Beta belief distribution parameters per node. Evaluated against AODV, fixed probabilistic rebroadcasting, counter-based suppression, and dynamic probabilistic-counter suppression over 1600 simulation runs spanning four node densities and four mobility levels, TSP-AODV achieves the lowest normalised routing overhead and the highest RREQ suppression ratio, while no statistically significant PDR difference relative to the fixed probabilistic baseline was observed under the tested conditions. End-to-end delay is also reduced significantly relative to fixed probabilistic rebroadcasting. The learned belief behaviour confirms context-dependent adaptation, with the dominant forwarding-probability arm decreasing as duplicate pressure increases. An additional 800-run sensitivity analysis characterises the PDR-NRO-delay trade-off across the tested penalty coefficients and feedback-window durations in two representative scenarios. These results are limited to the evaluated parameter grid and do not establish scenario-independent parameter robustness.
Indexed as
Identifiers
What OpenQuestion holds
Registered trials
Read under generation 80e0d062 · epoch 390. Bibliography from PubMed, PubMed Central and OpenAlex; grants from NIH RePORTER; trial links from ClinicalTrials.gov; estimates, votes and beliefs from the OpenQuestion graph.