MétaCan
Menu
Back to cohort
Record W2921537655 · doi:10.1049/iet-net.2018.5106

Energy aware routing for efficient green communication in opportunistic networks

2019· article· en· W2921537655 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

VenueIET Networks · 2019
Typearticle
Languageen
FieldComputer Science
TopicOpportunistic and Delay-Tolerant Networks
Canadian institutionsToronto Metropolitan University
Fundersnot available
KeywordsComputer networkComputer scienceRouting protocolRouting (electronic design automation)Overhead (engineering)Dynamic Source RoutingLink-state routing protocolStatic routingGeographic routingNode (physics)Distributed computingEngineering

Abstract

fetched live from OpenAlex

Opportunistic networks are characterised by intermittent connectivity, unstable topology, and no assurance of a fixed end‐to‐end path to transfer the messages because of nodes mobility. Due to this, the store‐carry and forward mechanism is used for routing the data in such networks. Considering that the energy of relaying nodes during the routing operation get depleted, there is a clear demand for power‐aware routing schemes for opportunistic networks. This article proposes an energy‐efficient altruism‐based trust‐dependent message forwarding routing protocol for opportunistic networks (called E‐ATDTN), where social matrices are exploited to determine the trustworthiness of a node in participating in the message forwarding procedure. Extensive simulations are conducted to assess the performance of the newly proposed E‐ATDTN protocol against that of the power‐aware PRoPHET, energy efficient PRoWait, and power‐aware EDR protocols showing that E‐ATDTN outperforms E‐PRoPHET, E‐ProWait, and E‐EDR in terms of average residual energy, overhead ratio, dropped messages, and number of dead nodes under varying time‐to‐live, and message generation interval.

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 categoriesMeta-epidemiology (narrow)
Consensus categoriesnone
DomainCandidate signal: none · Consensus signal: none
Study designCandidate signal: Simulation or modeling · Consensus signal: Simulation or modeling
GenreCandidate signal: Methods · Consensus signal: none
Teacher disagreement score0.992
Threshold uncertainty score1.000

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.001
Science and technology studies0.0000.000
Scholarly communication0.0000.000
Open science0.0010.001
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.018
GPT teacher head0.235
Teacher spread0.218 · 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