Simplified Analysis of HARQ Cooperative Networks Using Finite-State Markov Chains

Abstract : This paper considers the analysis of communication protocols in wireless networks implementing both cooperation and Hybrid Automatic Repeat reQuest (HARQ) for Type I decoder and Type II decoder with Chase Combining. Using an example of a three-node network, we show that the commu- nication protocol can be modeled using Finite State Markov Chains. This model efficiently predicts the performance of the system. However, the complexity depends on the number of states, which increases very fast as the protocol gets more sophisticated. We then derive a simplified model using state aggregation, and obtain a compact description which can be used to predict the performance with a reduced complexity. Moreover, we show that the simplified model describes a probabilistic communication protocol on the same network. Monte Carlo simulations show that the theoretical predictions match the simulated performance.
Document type :
Conference papers
Complete list of metadatas

https://hal-centralesupelec.archives-ouvertes.fr/hal-01535664
Contributor : Pierre Duhamel <>
Submitted on : Friday, June 9, 2017 - 12:02:06 PM
Last modification on : Monday, June 24, 2019 - 2:36:08 PM

Identifiers

Citation

Faton Maliqi, Pierre Duhamel, Francesca Bassi, Limani Ilir. Simplified Analysis of HARQ Cooperative Networks Using Finite-State Markov Chains. European Signal Processing Conference (EUSIPCO), Eurasip, Aug 2017, Kos, Greece. ⟨10.23919/eusipco.2017.8081561 ⟩. ⟨hal-01535664⟩

Share

Metrics

Record views

225