Structured Proactive and Reactive Routing for Wireless Mobile Ad Hoc Networks
Bibliographic record
Abstract
On-demand routing schemes suffer from the initial route setup latency, introduced by their discovery phase. This degrades the performance of interactive and/or multimedia applications. Table-driven routing, on the other hand, responds more quickly to call/route requests, but it wastes a large portion of the scarce wireless bandwidth on routing table broadcasts. Structured routing can be utilized to reduce the route setup time and increase throughput. In our Virtual Base Stations (VBS) architecture, a mobile node is elected from a set of nominees to act as a mobile base station within its zone. Based on our VBS routing protocol, a mobile station that wishes to send a packet to another mobile node in the network sends the packet to its VBS, which forwards it to the proper next hop. In this chapter, we also propose a novel routing scheme based on the VBS architecture, namely, the Virtual Base Stations Proactive-Reactive (VBSPR) routing protocol. VBS-PR promises to achieve considerable gains in terms of increasing the capacity of the wireless ad hoc network, reducing the call setup times and end-to-end delays and increasing the routing efficiency. VBS-PR can operate as a purely on-demand scheme and utilize the wireless mobile infrastructure to increase 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 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.001 | 0.001 |
| Meta-epidemiology (narrow) | 0.005 | 0.004 |
| Meta-epidemiology (broad) | 0.004 | 0.002 |
| Bibliometrics | 0.002 | 0.002 |
| Science and technology studies | 0.001 | 0.000 |
| Scholarly communication | 0.001 | 0.001 |
| Open science | 0.004 | 0.001 |
| Research integrity | 0.003 | 0.008 |
| 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; both teacher heads agree on what is shown here.
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".