MétaCan
Menu
Back to cohort
Record W2242976416 · doi:10.1049/iet-com.2014.1236

Transmit power allocation for asymmetric bi‐directional relay networks using channel statistics

2015· article· en· W2242976416 on OpenAlexafffund
Xiaodong Ji, Wei‐Ping Zhu, Daniel Massicotte

Bibliographic record

VenueIET Communications · 2015
Typearticle
Languageen
FieldComputer Science
TopicCooperative Communication and Network Coding
Canadian institutionsUniversité du Québec à Trois-RivièresConcordia University
FundersNantong UniversityGovernment of Jiangsu ProvinceNatural Sciences and Engineering Research Council of CanadaNatural Science Foundation of Jiangsu ProvinceNational Natural Science Foundation of China
KeywordsRelayRelay channelComputer scienceChannel (broadcasting)Transmitter power outputPower (physics)Computer networkTelecommunicationsStatisticsTransmitterMathematics

Abstract

fetched live from OpenAlex

This study proposes a transmit power allocation (TPA) scheme for bi‐directional relay networks with an objective of minimising the total power consumption to meet both the service quality (i.e. the outage probability) and individual power requirements. This new scheme focuses on the amplify‐and‐forward protocol‐based multiple‐access broadcast mode with asymmetric network traffics where the bi‐directional relay channel (BDRC) statistics are assumed to be available at the transmitters. A two‐step method is devised to solve the optimisation problem pertaining to the total power minimisation. In the proposed method, the system outage probability is first minimised subject to both the individual and total power constraints, and then the total power consumption of the network is minimised subject to the given service quality constraint based on the preliminary solutions achieved in the first step. This two‐step optimisation mechanism leads to a novel TPA algorithm for the relay and two sources of the network. Simulation results are provided to validate the proposed algorithm, showing that the proposed new power allocation scheme can significantly reduce the total power consumption, especially when the BDRC or the network traffic is asymmetric.

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.861
Threshold uncertainty score0.724

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.001
Science and technology studies0.0010.000
Scholarly communication0.0000.000
Open science0.0020.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.136
GPT teacher head0.342
Teacher spread0.205 · 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
Published2015
Admission routes2
Has abstractyes

Explore more

Same venueIET CommunicationsSame topicCooperative Communication and Network CodingFrench-language works237,207