MétaCan
Menu
Back to cohort

Mobility Prediction and Mobile-aware Routing Protocols in MANETs

2012· book-chapter· en· W2477462074 on OpenAlexaff
Lamiaa Khalid, Muhammad Jaseemmuddin, Alagan Anpalagan

Bibliographic record

VenueIGI Global eBooks · 2012
Typebook-chapter
Languageen
FieldComputer Science
TopicMobile Ad Hoc Networks
Canadian institutionsToronto Metropolitan University
Fundersnot available
KeywordsComputer networkMobile ad hoc networkComputer scienceMobility modelWireless ad hoc networkNode (physics)Optimized Link State Routing ProtocolAdaptive quality of service multi-hop routingWireless networkAd hoc wireless distribution serviceRouting protocolDistributed computingWirelessRouting (electronic design automation)EngineeringTelecommunicationsNetwork packet

Abstract

fetched live from OpenAlex

Ad hoc wireless networks comprise of mobile devices that use wireless transmission for communication without the need for a pre-existing infrastructure. One of the main characteristics of ad hoc networks is that they are self-organizing, which necessitates that all networking functions be performed by the nodes themselves. When designing mobile ad hoc networks, several challenges arise due to the shared nature of the wireless medium, limited transmission range of wireless devices, and node mobility. Node mobility poses a greater challenge as it makes routes more prone to frequent ruptures, which in turn degrades the overall network performance. If the future movement of the node can be predicted in a precise way, the impact of mobility can be decreased, and the overall performance of the network can be improved. This chapter provides an introduction and a critical review on some of the existing mobility prediction models and their effect on the performance of existing routing protocols.

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 imitation

Not 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.

metaresearch head score (Codex)0.001
metaresearch head score (Gemma)0.002
Version: metacan-v3-hybrid-931329e0061cValidation status: machine_predicted_unvalidated
Candidate categoriesnone
Consensus categoriesnone
DomainCandidate signal: none · Consensus signal: none
Study designCandidate signal: Not applicable · Consensus signal: none
GenreCandidate signal: Methods · Consensus signal: none
Teacher disagreement score0.004
Threshold uncertainty score0.014

Distilled classifier scores by category (both heads)

CategoryCodexGemma
Metaresearch0.0010.002
Meta-epidemiology (narrow)0.0010.001
Meta-epidemiology (broad)0.0010.001
Bibliometrics0.0010.003
Science and technology studies0.0000.001
Scholarly communication0.0020.004
Open science0.0010.001
Research integrity0.0010.002
Insufficient payload (model declined to judge)0.0040.003

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.

Opus teacher head0.020
GPT teacher head0.260
Teacher spread0.240 · how far apart the two teachers sit on this one work
Validation statusscore_only:v0-immature-baseline · verbatim from the scoring run: score_only means the number may rank works, and no category label ships from it

Classification

machine, unvalidated

Machine predicted; a candidate call from one source (direct Gemma or distilled Codex), not a consensus.

The models applied no category: nothing in the taxonomy fit this work.
Study designNot applicable
Domainnot available
GenreMethods

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".

Quick stats

Citations0
Published2012
Admission routes1
Has abstractyes

Explore more

Same venueIGI Global eBooksSame topicMobile Ad Hoc NetworksFrench-language works237,207