Group mobility and partition prediction in wireless ad-hoc networks
Why is this work in the frame?
A frame that forgets how it found something cannot be audited. These are the routes that admitted this work.
Full frame distilled prediction
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.
- Candidate categories
- none
- Consensus categories
- none
- Domain
- Candidate signal: noneConsensus signal: none
- Study design
- Candidate signal: Simulation or modelingConsensus signal: none
- Genre
- Candidate signal: EmpiricalConsensus signal: none
- Teacher disagreement score
- 0.919
- Threshold uncertainty score
- 0.411
- Validation status
machine_predicted_unvalidated·codex-gemma-dda1882f352a
Codex and Gemma teacher scores by category
| Category | Codex | Gemma |
|---|---|---|
| Metaresearch | 0.001 | 0.000 |
| Meta-epidemiology (narrow) | 0.000 | 0.000 |
| Meta-epidemiology (broad) | 0.000 | 0.000 |
| Bibliometrics | 0.000 | 0.000 |
| Science and technology studies | 0.000 | 0.000 |
| Scholarly communication | 0.000 | 0.001 |
| Open science | 0.000 | 0.000 |
| Research integrity | 0.000 | 0.000 |
| Insufficient payload (model declined to judge) | 0.000 | 0.000 |
Machine scores (provisional)
Baseline scores from an immature model (maturity gate not passed, 7 training rounds). Scores rank; they never assert a category.
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.
- Teacher spread
- 0.200 · how far apart the two teachers sit on this one work
- Validation status
score_only:v0-immature-baseline· verbatim from the scoring run: score_only means the number may rank works, and no category label ships from it
Abstract
In wireless ad-hoc networks, network partitioning occurs when the mobile nodes move with diverse patterns and cause the network to separate into completely disconnected portions. Network partitioning is a wide-scale topology change that can cause sudden and severe disruptions to ongoing network routing and upper layer applications. Its occurrence can be attributed to the aggregate group motion exhibited in the movements of the mobile nodes. By exploiting the group mobility pattern, we can predict the future network partitioning, and thus minimize the amount of disruption. We propose a new characterization of group mobility, based on existing group mobility models, which provides parameters that are sufficient for network partition prediction. We then demonstrate how partition prediction can be made using the mobility model parameters and illustrate the applicability of the prediction information. Furthermore, we use a simple but effective data clustering algorithm that, given the velocities of the mobile nodes in an ad-hoc network, can accurately determine the mobility groups and estimate the characteristic parameters of each group.
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.
The record
- Venue
- Topic
- Mobile Ad Hoc Networks
- Field
- Computer Science
- Canadian institutions
- University of Toronto
- Funders
- not available
- Keywords
- Network partitionComputer scienceWireless ad hoc networkMobile ad hoc networkComputer networkMobility modelPartition (number theory)Optimized Link State Routing ProtocolDistributed computingWireless networkCluster analysisNetwork topologyMobile radioWirelessRouting protocolRouting (electronic design automation)Artificial intelligenceNetwork packetMathematics
- Has abstract in OpenAlex
- yes