Matrix-Geometric Method Based Unified Delay Analysis for Wireless Relay Networks

A lot of work has been focused on designing and analyzing various cooperative diversity protocols for wireless relay networks.To provide a unified queuing analytic framework,we formulate an embedded Markov chain,which turns out to be a Quasi-Birth-and-Death (QBD) process.Using the Matrix-Geometric method,we can analyze the average delay in a unified way.Theoretical analysis is validated by simulation results.We show that the delay performances of Amplify-and-Forward or Decode-and-Forward (AF/DF) and incremental AF/DF schemes can be analyzed in the unified way.Thus,we can always choose the best cooperative diversity scheme in different scenarios for delay minimization.

A lot of work has been focused on desig-ning and analyzing various cooperative diversity pro-tocols for wireless relay networks. To provide a uni-fied queuing analytic framework, we fonmlate an em-bedded Markov chain, which rams out to be a Quasi-Birth-and-Death （QBD） process. Using the Matrix-Ce-ometric method, we can analyze the average delay in a unified way. Theoretical analysis is validated by simu-lation results. We show that the delay performances of Amplify-and-Forward or Decode-and-Forwaxd （AF/ DF） and incremental AF/DF schemes can be analyzed in the unified way. Thus, we can always choose the best cooperative diversity scheme in different scenari-os for delay minimization.