MétaCan
Menu
Back to cohort
Record W4402189324 · doi:10.32920/26871397

Efficient Geocast Routing Protocols for Opportunistic Networks

2024· preprint· en· W4402189324 on OpenAlexaff
Khuram Khalid

Bibliographic record

Venuenot available
Typepreprint
Languageen
FieldComputer Science
TopicOpportunistic and Delay-Tolerant Networks
Canadian institutionsToronto Metropolitan UniversityMemorial University of Newfoundland
Fundersnot available
KeywordsGeocastComputer networkComputer scienceRouting (electronic design automation)Routing protocolLink-state routing protocol

Abstract

fetched live from OpenAlex

<p>Unlike communication networks which are traditionally assumed to be connected, Opportunistic networks (OppNets) are a type of ad hoc networks where there is no guarantee of end-to-end path for data routing due to node mobility, volatile links, and frequent disconnections. In such networks, data transmission among the nodes relies on nodes' cooperation and is achieved in a store-carry-and-forward fashion. As such, the design of routing protocols for OppNets is challenging since it relies on opportunistic connections that may arise among the nodes. To address this challenge, this thesis proposes three novel geocast routing protocols for OppNets, namely: (1) an Energy-Efficient Check-and-Spray Geocast (EECSG) routing protocol, (2) a Fuzzy-based Check-and-Spray Geocast (FCSG) protocol and an Energy-Efficient version of it (EFCSG), and (3) a Reinforcement Learning-based Fuzzy Geocast Routing Protocol (RLFGRP). Using the Opportunistic Networks (ONE) simulator along with the INFOCOM 2006 real mobility traces and synthetic mobility models, the proposed routing protocols are evaluated and compared against some benchmark schemes, in terms of predefined performance metrics, showing their superiority.</p>

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 imitation

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

metaresearch head score (Codex)0.001
metaresearch head score (Gemma)0.000
Version: codex-gemma-dda1882f352aValidation status: machine_predicted_unvalidated
Candidate categoriesMeta-epidemiology (narrow), Scholarly communication
Consensus categoriesnone
DomainCandidate signal: none · Consensus signal: none
Study designCandidate signal: Simulation or modeling · Consensus signal: none
GenreCandidate signal: Methods · Consensus signal: none
Teacher disagreement score0.858
Threshold uncertainty score1.000

Codex and Gemma teacher scores by category

CategoryCodexGemma
Metaresearch0.0010.000
Meta-epidemiology (narrow)0.0010.001
Meta-epidemiology (broad)0.0010.000
Bibliometrics0.0000.000
Science and technology studies0.0000.000
Scholarly communication0.0010.000
Open science0.0020.005
Research integrity0.0010.001
Insufficient payload (model declined to judge)0.0000.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.

Opus teacher head0.060
GPT teacher head0.315
Teacher spread0.255 · 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 teacher head, not a consensus.

Study designSimulation or modeling
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
Published2024
Admission routes1
Has abstractyes

Explore more

Same topicOpportunistic and Delay-Tolerant NetworksFrench-language works237,207