Assessment of a Mobile Agent Based Routing Protocol for Mobile Ad-hoc Networks
Bibliographic record
Abstract
Ad-hoc networking allows users to form temporary wireless networks without existing infrastructure. Each node acts both as host and router and must therefore be willing to forward packets for other nodes. This is done using a mobile ad-hoc network (MANET) routing protocol. Frequent topology changes make such routing challenging. Existing protocols include dynamic source routing (DSR), the cluster-based routing protocol (CBRP), and the ad hoc on-demand distance vector (AODV) protocol, among others. Using existing protocols, however, some nodes may be unduly loaded and end-to-end delay may be high. Further, existing protocols are hard to upgrade once they are in use. To address these problems, a new routing protocol, MARP, using mobile agents is presented. Mobile agents are software entities that can move between network nodes and execute programs they carry with them wherever they are running. Our agent-based algorithm implements a demand-based protocol that provides efficient routing at the application layer. A proof of concept implementation has been developed using Aglets and simulated to evaluate its performance. The details of the protocol and its performance are reported in this paper.
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 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.002 | 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.001 | 0.000 |
| 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 teacher head, 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".