Versatile medium access control (VMAC) protocol for mobile sensor networks
Bibliographic record
Abstract
In this thesis, the problem of mobility handling in wireless sensor network is introduced with an appreciation for the applications that may be possible once the problem is resolved. Mobility handling is solved with a simple priority backoff technique inspired by novel MAC protocols. To incorporate this technique for stationary and mobile sensor nodes, a hybrid MAC protocol called VMAC is designed with a fixed frame length. VMAC combines the advantages of scheduled-based MAC for energy savings and contention-based MAC for short transmission delays. To exploit network bandwidth, channel reuse is encouraged and is readily integrated into the protoco\. To evaluate VMAC and its performance when compared to other MAC protocols, an implementation inside NS-2 is conducted with simulations of various topologies. These topologies vary in hop-count from source to destination and also contention levels. Simulation results show that VMAC with certain frame lengths are suited for selected topologies, but the frame length of one can always provide sufficient performance. The backoff technique is shown to be fair when nodes contend for medium access and it is even resourceful in speeding up hardware address resolution and routing.
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.003 |
| Meta-epidemiology (narrow) | 0.001 | 0.000 |
| Meta-epidemiology (broad) | 0.001 | 0.000 |
| Bibliometrics | 0.001 | 0.001 |
| Science and technology studies | 0.001 | 0.001 |
| Scholarly communication | 0.001 | 0.001 |
| Open science | 0.002 | 0.001 |
| Research integrity | 0.001 | 0.002 |
| Insufficient payload (model declined to judge) | 0.002 | 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".