Performance analysis of BitTorrent enabled ad hoc network routing
Bibliographic record
Abstract
The analytical model of BitTorrent Enabled Ad hoc Network (BEAN) routing protocol (unicast extension of Multi-cast BEAN - MBEAN routing protocol) is discussed for a random network. The source node forms multiple routes to destination differentiating each route by it's neighbor and sends packets through the best route. When a link or route fails, the source node chooses one of the existing alternate routes. This paper compares the throughput obtained analytically with that obtained in simulation for both AODV (Ad hoc On Demand Distance Vector) and BEAN routing protocols. Further simulations are run for realistic cases and the two protocols are compared for packet delivery ratio (PDR) and system throughput. The results show that, in spite of expending more time and control packets in finding a new route, BEAN performs as good as and in many cases, better than AODV, for a network with high density, in terms of throughput and PDR, thereby making it a potential unicast routing protocol for multicast applications.
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.000 | 0.000 |
| Meta-epidemiology (narrow) | 0.000 | 0.000 |
| Meta-epidemiology (broad) | 0.000 | 0.000 |
| Bibliometrics | 0.000 | 0.003 |
| 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".