Faton Maliqi, Francesca Bassi, P. Duhamel, Ilir Limani
{"title":"基于有限状态马尔可夫链的HARQ合作网络简化分析","authors":"Faton Maliqi, Francesca Bassi, P. Duhamel, Ilir Limani","doi":"10.23919/EUSIPCO.2017.8081561","DOIUrl":null,"url":null,"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 communication 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.","PeriodicalId":346811,"journal":{"name":"2017 25th European Signal Processing Conference (EUSIPCO)","volume":"16 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2017-08-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"0","resultStr":"{\"title\":\"Simplified analysis of HARQ cooperative networks using finite-state Markov chains\",\"authors\":\"Faton Maliqi, Francesca Bassi, P. Duhamel, Ilir Limani\",\"doi\":\"10.23919/EUSIPCO.2017.8081561\",\"DOIUrl\":null,\"url\":null,\"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 communication 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.\",\"PeriodicalId\":346811,\"journal\":{\"name\":\"2017 25th European Signal Processing Conference (EUSIPCO)\",\"volume\":\"16 1\",\"pages\":\"0\"},\"PeriodicalIF\":0.0000,\"publicationDate\":\"2017-08-01\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"0\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"2017 25th European Signal Processing Conference (EUSIPCO)\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://doi.org/10.23919/EUSIPCO.2017.8081561\",\"RegionNum\":0,\"RegionCategory\":null,\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"\",\"JCRName\":\"\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"2017 25th European Signal Processing Conference (EUSIPCO)","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.23919/EUSIPCO.2017.8081561","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
Simplified analysis of HARQ cooperative networks using finite-state Markov chains
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 communication 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.