HAL will be down for maintenance from Friday, June 10 at 4pm through Monday, June 13 at 9am. More information
Skip to Main content Skip to Navigation
Conference papers

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 metadata

Cited literature [16 references]  Display  Hide  Download

Contributor : Pierre Duhamel Connect in order to contact the contributor
Submitted on : Monday, April 27, 2020 - 7:16:19 PM
Last modification on : Friday, April 22, 2022 - 10:48:02 AM


Files produced by the author(s)



Faton Maliqi, Francesca Bassi, Pierre Duhamel, Ilir Limani. 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⟩



Record views


Files downloads