MétaCan
Menu
Back to cohort
Record W3190625697 · doi:10.1109/icc42927.2021.9500645

Energy Efficient Multi-Objectives Optimized Routing for Opportunistic Networks

2021· article· en· W3190625697 on OpenAlexaff
Jagdeep Singh, Sanjay Kumar Dhurandher, Isaac Woungang, Shivin Diwakar, Periklis Chatzimisios

Bibliographic record

Venuenot available
Typearticle
Languageen
FieldComputer Science
TopicOpportunistic and Delay-Tolerant Networks
Canadian institutionsToronto Metropolitan University
Fundersnot available
KeywordsComputer scienceRouting protocolNetwork packetRouting (electronic design automation)Node (physics)Context (archaeology)Computer networkSet (abstract data type)Routing tableDynamic Source RoutingEnergy consumptionZone Routing ProtocolProtocol (science)Engineering

Abstract

fetched live from OpenAlex

This paper proposes a novel routing protocol for Opportunistic networks called Energy Efficient MultiObjectives Optimized Routing (E <sup xmlns:mml="http://www.w3.org/1998/Math/MathML" xmlns:xlink="http://www.w3.org/1999/xlink">2</sup> MOOR), which uses a multi-objectives weight function for efficient routing. The proposed protocol is energy efficient and predicts the next optimal forwarder based on four objectives, which consists of hop encounter, distance between the source/intermediate and destination, delivery probability, and node’s energy consumption, as context information. The pareto optimal solutions set is extracted through the Naive and Slow algorithm. The nodes in the set are further used for forwarding the data packets to the destination node. The proposed protocol is evaluated considering the double, triple, and quadruple objective functions, when the predefined threshold values are varied. Simulations results show that the proposed E <sup xmlns:mml="http://www.w3.org/1998/Math/MathML" xmlns:xlink="http://www.w3.org/1999/xlink">2</sup> MOOR scheme outperforms the E-Epidemic, E-PRoPHET, and E-EDR chosen as benchmarks 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 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.000
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: Methods · Consensus signal: none
Teacher disagreement score0.870
Threshold uncertainty score0.938

Codex and Gemma teacher scores by category

CategoryCodexGemma
Metaresearch0.0000.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.031
GPT teacher head0.258
Teacher spread0.226 · 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.

The models applied no category: nothing in the taxonomy fit this work.
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

Citations6
Published2021
Admission routes1
Has abstractyes

Explore more

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