Refinement of AODV routing algorithm for wireless mesh networks (WMNs)
Bibliographic record
Abstract
Wireless Mesh Networks (WMNs) has recently gained popularities due to their fast and economical ways to access to the Internet. Because the WMNs are one of the few commonly implemented types of the ad hoc networks (MANETs), general MANET routing protocols can be used in the WMNs. it also is expected that a protocol that takes the particularities of the WMNs into account will outperform the general protocol. In this paper, we present a reactive routing protocol, called AODV-Mesh, for the WMNs. This protocol is an extension of a common ad hoc routing protocol to be compatible with the specifications of the WMNs. In addition, we discuss the route recovery mechanism of this protocol in two cases; using the local repair mechanism (AODV-Mesh), and not using the local repair mechanism (AODV-Mesh NoLR). Our simulation results show that not using the local repair mechanism in the AODV-Mesh algorithm improves the performance and 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.
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.001 | 0.002 |
| Meta-epidemiology (narrow) | 0.000 | 0.000 |
| Meta-epidemiology (broad) | 0.000 | 0.001 |
| Bibliometrics | 0.001 | 0.001 |
| Science and technology studies | 0.001 | 0.000 |
| Scholarly communication | 0.001 | 0.001 |
| Open science | 0.002 | 0.001 |
| Research integrity | 0.001 | 0.001 |
| Insufficient payload (model declined to judge) | 0.001 | 0.001 |
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".