Bibliographic record
Abstract
This thesis presents an effective routing solution for the backbone of hierarchical Mobile Ad hoc Networks (MANETs).Our solution leverages the storage and retrieval mechanisms of a Distributed Hash Table (DHT) to make routing information available in a decentralized fashion, while supporting different forms of node and network mobility scenarios effectively.We do so by splitting a flat network into clusters, each having a gateway who participates in a DHT overlay.These gateways interconnect the clusters in a backbone network.Two routing approaches for the backbone are explored: flooding, which we use as a base approach, and our solution, which is DHT-based.We compare the performance of our solution against the flooding approach via experimentation in a simulator.Our results show that our DHT-based solution, even in the presence of mobility, achieved above 90% success rates and maintained very low and constant round trip times, which was not the case with the flooding approach.The advantage of our proposed approach increases as the number of clusters increases, demonstrating the superior scalability of our proposed approach.i Special appreciation goes to my supervisor -Professor Thomas Kunz and cosupervisor -Professor Babak Esfandiari, whose patient encouragement, mentoring and insightful criticism brought me to develop in-dept research skills and enabled me see the beauty of being original.On a personal note, I remember my loving parents of blessed memories, Late
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.001 |
| Meta-epidemiology (narrow) | 0.000 | 0.000 |
| Meta-epidemiology (broad) | 0.000 | 0.000 |
| Bibliometrics | 0.001 | 0.001 |
| Science and technology studies | 0.001 | 0.000 |
| Scholarly communication | 0.001 | 0.002 |
| Open science | 0.001 | 0.001 |
| Research integrity | 0.001 | 0.001 |
| Insufficient payload (model declined to judge) | 0.003 | 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".