MétaCan
Menu
Back to cohort
Record W1991966706 · doi:10.1109/infcomw.2014.6849242

Content Relevance Opportunistic Routing for Wireless Multimedia Sensor Networks

2014· article· en· W1991966706 on OpenAlexafffund
Petros Spachos, Angelos K. Marnerides, Dimitrios Hatzinakos

Bibliographic record

Venuenot available
Typearticle
Languageen
FieldComputer Science
TopicOpportunistic and Delay-Tolerant Networks
Canadian institutionsUniversity of Toronto
FundersEngineering and Physical Sciences Research CouncilBritish Columbia Institute of Technology
KeywordsComputer scienceRouting protocolComputer networkNetwork packetRelevance (law)Wireless sensor networkRouting (electronic design automation)Bandwidth (computing)Dynamic Source RoutingMultimediaEfficient energy useEngineering

Abstract

fetched live from OpenAlex

Wireless Multimedia Sensor Networks (WMSNs) are considered as one of the most prominent infrastructures for human-centric multimedia applications due to the wide availability of low-cost hardware such as microphones and CMOS cameras. By virtue of the energy limitations on sensor nodes alongside the explicit highly demanding bandwidth requirements of real-time multimedia applications, these particular networks foster a set of non-trivial challenges that need to be confronted. In this paper we define a level of relevance in regards with the content of a multimedia packet and we further introduce a dynamic routing protocol that optimizes the overall network performance in terms of energy efficiency and packet delay. We present the design, implementation and applicability of our Content Relevance Opportunistic Routing (CROR) protocol under experimental results that show an increase in network lifetime of up to 20% compared with traditional routing.

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 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.991
Threshold uncertainty score0.943

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.051
GPT teacher head0.249
Teacher spread0.198 · 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

Citations10
Published2014
Admission routes2
Has abstractyes

Explore more

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