MétaCan
Menu
Back to cohort

Power Efficient Networking Support for Digital Twins with Age of Information Targets

2025· article· en· W4414648228 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

Venuenot available
Typearticle
Languageen
FieldComputer Science
TopicAge of Information Optimization
Canadian institutionsMcMaster University
Fundersnot available
KeywordsResource allocationMarkov decision processReinforcement learningFrame (networking)Transmission (telecommunications)ComputationProcess (computing)Power (physics)Markov process

Abstract

fetched live from OpenAlex

This paper studies network resource allocation for multiple IoT devices as physical systems (PSs) tasked with maintaining their digital twins (DTs) at a shared edge server (ES) through a shared communication channel. The problem is formulated as a constrained Markov decision process with an objective of reducing the average transmission power of the PSs while keeping the age of information (Aol) at the DTs below predetermined targets. A hybrid decision making frame is proposed, where multiple agent reinforcement learning is used to make decisions for the transmission power of the PSs in a distributed way, and a centralized and deterministic algorithm is proposed to allocate the computation resources of the ES among the DTs. Simulation results show that, compared with the multiagent duelling double deep Q-Network, the proposed multi-agent deep deterministic policy gradient for power allocation together with the urgency-baed computation resource allocation solution achieves much lower the average power consumption of the PSs while maintaining low AoI violation rate at the DTs.

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 categoriesnone
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.841
Threshold uncertainty score0.221

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.002
Open science0.0000.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.004
GPT teacher head0.206
Teacher spread0.202 · 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

Citations0
Published2025
Admission routes1
Has abstractyes

Explore more

Same topicAge of Information OptimizationFrench-language works237,207