Enhancing Reliability and Stability of BLE Mesh Networks: A Multipath Optimized AODV Approach
Bibliographic record
Abstract
Bluetooth Low Energy (BLE) mesh networks provide flexible and reliable communication among low-power sensor-enabled Internet of Things (IoT) devices, enabling them to communicate in a flexible and robust manner. Nonetheless, the majority of existing BLE-based mesh protocols operate as flooding-based piconet or scatternet overlays on top of existing Bluetooth star topologies. In contrast, the Ad hoc On-Demand Distance Vector (AODV) protocol used primarily in wireless ad hoc networks (WAHNs) is forwarding-based and therefore more efficient, with lower overheads. However, the packet delivery ratio (PDR) and link recovery time for AODV performs worse compared to flooding-based BLE protocols when encountering link disruptions. We propose the Multipath Optimized AODV (M-O-AODV) protocol to address these issues, with improved PDR and link robustness compared with other forwarding-based protocols. In addition, M-O-AODV achieved a PDR of 88%, comparable to the PDR of 92% for flooding-based BLE, unlike protocols such as Reverse-AODV (R-AODV). Also, M-O-AODV was able to perform link recovery within 3700 ms in the case of node failures, compared with other forwarding-based protocols that require 4800 ms to 6000 ms. Consequently, M-O-AODV-based BLE mesh networks are more efficient for wireless sensor-enabled IoT environments.
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.
How this classification was reachedexpand
Full frame machine prediction
Teacher imitationNot calibrated prevalence, not ground truth. Human validation pending. The Gemma side is a direct model label for every work in the frame, read from the title-only record. The Codex side is a classifier learned from the 10,348 direct Codex labels and calibrated to design-weighted sample rates; fields without enough sample support carry no Codex call. Candidate is the union of the two sides; consensus is their intersection. These outputs are machine_predicted_unvalidated and are not human labels.
Distilled classifier scores by category (both heads)
| Category | Codex | Gemma |
|---|---|---|
| Metaresearch | 0.000 | 0.001 |
| Meta-epidemiology (narrow) | 0.000 | 0.000 |
| Meta-epidemiology (broad) | 0.000 | 0.000 |
| Bibliometrics | 0.001 | 0.000 |
| Science and technology studies | 0.000 | 0.000 |
| Scholarly communication | 0.001 | 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 itClassification
machine, unvalidatedMachine predicted; a candidate call from one source (direct Gemma or distilled Codex), not a consensus.
How this classification was reached, model by model and score by score, is at the end of the page under "How this classification was reached".