MétaCan
Menu
Back to cohort
Record W4312853625 · doi:10.1109/lcomm.2022.3214146

Joint Lifetime-Outage Optimization in Relay-Enabled IoT Networks—A Deep Reinforcement Learning Approach

2022· article· en· W4312853625 on OpenAlexaff
Ali Reza Heidarpour, Mohammad Reza Heidarpour, Masoud Ardakani, Chintha Tellambura, Murat Uysal

Bibliographic record

VenueIEEE Communications Letters · 2022
Typearticle
Languageen
FieldComputer Science
TopicCooperative Communication and Network Coding
Canadian institutionsUniversity of Alberta
Fundersnot available
KeywordsComputer scienceRelayBenchmark (surveying)Reinforcement learningMaximizationJoint (building)Internet of ThingsScheme (mathematics)Base stationSelection (genetic algorithm)Optimization problemTransmission (telecommunications)Computer networkNonlinear programmingMathematical optimizationNonlinear systemArtificial intelligenceTelecommunicationsAlgorithmPower (physics)Engineering

Abstract

fetched live from OpenAlex

Network lifetime maximization in Internet of things (IoT) is of paramount importance to ensure uninterrupted data transmission and reduce the frequency of battery replacement. This letter deals with the joint lifetime-outage optimization in relay-enabled IoT networks employing a multiple relay selection (MRS) scheme. The considered MRS problem is essentially a general nonlinear 0-1 programming which is NP-hard. In this work, we use the application of the double deep Q network (DDQN) algorithm to solve the MRS problem. Our results reveal that the proposed DDQN-MRS scheme can achieve superior performance than the benchmark MRS schemes.

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 machine prediction

Teacher imitation

Not calibrated prevalence, not ground truth. Human validation pending. The Gemma side is a direct model label for every work in the frame, read from the title-only record. The Codex side is a classifier learned from the 10,348 direct Codex labels and calibrated to design-weighted sample rates; fields without enough sample support carry no Codex call. Candidate is the union of the two sides; consensus is their intersection. These outputs are machine_predicted_unvalidated and are not human labels.

metaresearch head score (Codex)0.001
metaresearch head score (Gemma)0.003
Version: metacan-v3-hybrid-931329e0061cValidation 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: Empirical · Consensus signal: none
Teacher disagreement score0.005
Threshold uncertainty score0.010

Distilled classifier scores by category (both heads)

CategoryCodexGemma
Metaresearch0.0010.003
Meta-epidemiology (narrow)0.0010.000
Meta-epidemiology (broad)0.0010.000
Bibliometrics0.0000.000
Science and technology studies0.0000.001
Scholarly communication0.0010.001
Open science0.0010.001
Research integrity0.0010.001
Insufficient payload (model declined to judge)0.0010.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.036
GPT teacher head0.252
Teacher spread0.215 · 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 source (direct Gemma or distilled Codex), not a consensus.

The models applied no category: nothing in the taxonomy fit this work.
Study designSimulation or modeling
Domainnot available
GenreEmpirical

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

Citations1
Published2022
Admission routes1
Has abstractyes

Explore more

Same venueIEEE Communications LettersSame topicCooperative Communication and Network CodingFrench-language works237,207