MétaCan
Menu
Back to cohort
Record W2151826058 · doi:10.1109/glocom.2009.5425485

Adaptive Asynchronous Clock Based Power Saving Protocols for Delay Tolerant Networks

2009· article· en· W2151826058 on OpenAlex
Bong Jun Choi, Xuemin Shen

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

Venuenot available
Typearticle
Languageen
FieldComputer Science
TopicOpportunistic and Delay-Tolerant Networks
Canadian institutionsUniversity of Waterloo
Fundersnot available
KeywordsComputer scienceAsynchronous communicationScalabilityDistributed computingComputer networkDelay-tolerant networkingEfficient energy useScheduling (production processes)Routing protocolRouting (electronic design automation)EngineeringWireless Routing Protocol

Abstract

fetched live from OpenAlex

Recently, considerable research efforts have been devoted to Delay/disruption Tolerant Network (DTN) in order to enable communications between disconnected network entities. In this paper, we focus on power management for DTN, and propose two asynchronous clock based power saving protocols with distributed adaptive sleep scheduling protocols. The proposed protocols allow different levels of power saving and are robust to long delayed and intermittent network dynamics of DTN. Analytical and simulation results are given to demonstrate the energy efficiency and scalability of the proposed protocols. In addition, we show how the proposed protocols can be applied to the mobile devices for adapting to dynamic network conditions of DTN in order to maximize energy efficiency.

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.000
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: none
GenreCandidate signal: Methods · Consensus signal: none
Teacher disagreement score0.934
Threshold uncertainty score1.000

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.026
GPT teacher head0.271
Teacher spread0.245 · 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

Quick stats

Citations17
Published2009
Admission routes1
Has abstractyes

Explore more

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