MétaCan
Menu
Back to cohort
Record W4396799150 · doi:10.1504/ijahuc.2024.10064040

Energy Efficient Random Forest Classifier-Based Secure Routing for Opportunistic Internet of Things

2024· article· en· W4396799150 on OpenAlex

Why this work is in the frame

A frame that forgets how it found something cannot be audited. These are the routes that admitted this work.

affAt least one author lists a Canadian institution in the pinned OpenAlex snapshot.

Bibliographic record

VenueInternational Journal of Ad Hoc and Ubiquitous Computing · 2024
Typearticle
Languageen
FieldComputer Science
TopicSecurity in Wireless Sensor Networks
Canadian institutionsToronto Metropolitan University
Fundersnot available
KeywordsComputer scienceRandom forestInternet of ThingsClassifier (UML)Computer networkThe InternetComputer securityArtificial intelligenceWorld Wide Web

Abstract

fetched live from OpenAlex

Opportunistic internet of things (OppIoT) is a class of opportunistic networks, where the data are transmitted in a broadcast manner and shared among the nodes (i.e., IoT devices and human communities' devices) through opportunistic contact. In such networks, taking into consideration the energy level of each node while performing the routing of data is of utmost importance. This paper proposes an energy-efficient secure routing protocol that uses a random forest classifier (called ESRFCSec) for device behaviour predictions and for protecting the OppIoT network against packet collusion attacks. Through simulations, ESRFCSec is shown to achieve a prediction accuracy of 97.97%. It is also shown to be superior to three benchmark routing schemes in terms of node's residual energy, delivery probability, average latency, number of dead nodes, and number of dropped packets.

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.

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 categoriesnone
Consensus categoriesnone
DomainCandidate signal: none · Consensus signal: none
Study designCandidate signal: Simulation or modeling · Consensus signal: none
GenreCandidate signal: Empirical · Consensus signal: none
Teacher disagreement score0.908
Threshold uncertainty score0.639

Codex and Gemma teacher scores by category

CategoryCodexGemma
Metaresearch0.0010.000
Meta-epidemiology (narrow)0.0000.000
Meta-epidemiology (broad)0.0000.000
Bibliometrics0.0000.000
Science and technology studies0.0000.000
Scholarly communication0.0000.000
Open science0.0010.000
Research integrity0.0000.000
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.016
GPT teacher head0.263
Teacher spread0.247 · 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