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

Optimisation of power allocation for asymmetric relay placement in multi‐hop relay systems

2013· article· en· W2027609975 on OpenAlexaff
Kalpana Dhaka, Ranjan K. Mallik, Robert Schober

Bibliographic record

VenueIET Communications · 2013
Typearticle
Languageen
FieldComputer Science
TopicCooperative Communication and Network Coding
Canadian institutionsUniversity of British Columbia
Fundersnot available
KeywordsRelayHop (telecommunications)Computer scienceComputer networkRelay channelPower (physics)

Abstract

fetched live from OpenAlex

In this study, schemes for optimisation of power allocation (OPA) for asymmetric relay placement are presented for multi‐hop communication in a Rayleigh‐fading environment. For a decode‐and‐forward (DF) multi‐hop communication system, expressions are derived for optimised power allocation based on symbol error probability (SEP) and global channel state information (GCSI). The analysis for OPA based on GCSI is extended to a hybrid combination of amplify‐and‐forward (AF) and DF relays. Analysis is done for two kinds of modulation schemes: M ‐ary phase‐shift keying with coherent detection and orthogonal M ‐ary frequency‐shift keying with non‐coherent detection. Simulation results show that for a multi‐hop system with asymmetric relay placement, power optimisation schemes perform better than the conventional equal power allocation scheme. In addition, power optimisation based on GCSI shows substantially improved performance compared with power allocation based on end‐to‐end SEP. Further, performance comparison is shown for increase in number of relay nodes in an AF and DF multi‐hop system with and without power allocation. The performance of a DF system improves with increase in number of relay nodes whereas performance of an AF system degrades. Hybrid relaying provides an option to exercise switching between DF and AF so as to extract the maximum advantage of the two relaying 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 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.885
Threshold uncertainty score0.537

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.0000.000
Scholarly communication0.0000.001
Open science0.0020.001
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.082
GPT teacher head0.323
Teacher spread0.241 · 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

Citations5
Published2013
Admission routes1
Has abstractyes

Explore more

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