Throughput performance of ARQ and HARQ I schemes over a two-states Markov channel model

Boujemâa, Hatem; Said, Maymouna Ben; Siala, Mohamed

doi:10.1109/icecs.2005.4633423

Cited by 6 publications

(4 citation statements)

References 7 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…NC-(H)ARQ has yet another interesting feature, it alters between different communication modes (when sending regular-or NC-packets). Moreover, schemes shifting between different channel states can also be seen as changes in communication modes [18]. This selection of works studies one particular retransmission scheme at a time.…”

Section: Acknowledgements (Acks)mentioning

confidence: 99%

“…To model channels with memory, a block Gilbert-Elliot channel, altering between a good and a bad channel state is a simple but useful option. For this case, the throughput for ARQ is T GE-ARQ = P GG T ARQ GG + P BB T ARQ BB , for P GG = 1 − P BB [18], where GG and BB represents being in the good and the bad channel state, respectively. NC-(H)ARQ, as well as ARQ in a Gilbert-Elliot channel, are examples of where the retransmission scheme operate in different communication modes over time.…”

Section: B Retransmissions Schemesmentioning

confidence: 99%

“…where E e −θRN k = S s=1 f k,s . A structured strategy 6 to solve (18) is to first reformulate it into a matrix recurrence relation, while omitting the summation over s. We then get the order-m linear homogeneous matrix recurrence relation…”

Section: Effective Capacity Of Retransmission Schemesmentioning

confidence: 99%

“…While a full derivation for a general retransmission scheme is performed in Theorem 1, it is nevertheless instructive and useful to highlight some of the key-expressions for truncated-HARQ. Simplifying the notation from Theorem 1, with f k f k,1 and a m a m11 , we see that the recurrence relation (18), for one communication mode, can be written as the homogeneous recurrence relation…”

Section: Is Given By Theorem 1 For Finite K (Or Corollary 1 For Infin...mentioning

confidence: 99%

See 3 more Smart Citations

Effective Capacity of Retransmission Schemes: A Recurrence Relation Approach

Larsson

Gross

Al-Zubaidy

et al. 2016

IEEE Trans. Commun.

View full text Add to dashboard Cite

Abstract-We consider the effective capacity performance measure of persistent-and truncated-retransmission schemes that can involve any combination of multiple transmissions per packet, multiple communication modes, or multiple packet communication. We present a structured unified analytical approach, based on a random walk model and recurrence relation formulation, and give exact effective capacity expressions for persistent hybrid automatic repeat request (HARQ) and for truncated-retransmission schemes. For the latter, effective capacity expressions are given for systems with finite (infinite) time horizon on an algebraic (spectral radius-based) form of a special block companion matrix. In contrast to prior HARQ models, assuming infinite time horizon, the proposed method does not involve a non-trivial per case modeling step. We give effective capacity expressions for several important cases that have not been addressed before, e.g. persistent-HARQ, truncated-HARQ, network-coded ARQ (NC-ARQ), two-mode-ARQ, and multilayer-ARQ. We propose an alternative QoSparameter (instead of the commonly used moment generating function parameter) that represents explicitly the target delay and the delay violation probability. This also enables closedform expressions for many of the studied systems. Moreover, we use the recently proposed matrix-exponential distributed (MED) modeling of wireless fading channels to provide the basis for numerous new effective capacity results for HARQ.

show abstract

Section: Acknowledgements (Acks)mentioning

confidence: 99%

Section: B Retransmissions Schemesmentioning

confidence: 99%

Section: Effective Capacity Of Retransmission Schemesmentioning

confidence: 99%

Section: Is Given By Theorem 1 For Finite K (Or Corollary 1 For Infin...mentioning

confidence: 99%

See 2 more Smart Citations

Effective Capacity of Retransmission Schemes: A Recurrence Relation Approach

Larsson

Gross

Al-Zubaidy

et al. 2016

IEEE Trans. Commun.

View full text Add to dashboard Cite

show abstract

Cooperative HARQ protocols using semi-blind relays for underlay cognitive radio networks

et al. 2016

View full text Add to dashboard Cite

Throughput analysis and optimization of cognitive radio networks using incremental relaying

Alnwaimi

Boujemâa

2018

Telecommun Syst

Self Cite

View full text Add to dashboard Cite

In this paper, we derive the throughput and Bit Error Probability of incremental relaying for cognitive radio networks. Relaying in the secondary network is performed only when the SNR of the direct link is lower than a predefined threshold β. Also, all relays must verify interference constraints: the generated interference to primary receiver must be below a chosen threshold (T ) so that the primary throughput is larger than a predefined value. The analysis is valid for different relay selection techniques: Opportunistic amplify and forward, opportunistic decode and forward, partial and reactive AF relay selection. We also consider multihop relaying with single and multiple branches. For multiple branches, two scenarios are considered: all branches are maximum ratio combined or the best branch is activated. We also take into account the interference from primary to secondary nodes. The parameter β of incremental relaying is also numerically optimized to achieve the highest secondary throughput. KeywordsCognitive radio networks • Incremental relaying • Amplify and forward • Decode and forward • Rayleigh channels

show abstract

Throughput performance of ARQ and HARQ I schemes over a two-states Markov channel model

Cited by 6 publications

References 7 publications

Effective Capacity of Retransmission Schemes: A Recurrence Relation Approach

Effective Capacity of Retransmission Schemes: A Recurrence Relation Approach

Cooperative HARQ protocols using semi-blind relays for underlay cognitive radio networks

Throughput analysis and optimization of cognitive radio networks using incremental relaying

Contact Info

Product

Resources

About