A Queueing Model for Wireless Tandem Network Coding

In this paper, we propose a new analytical model in order to evaluate the throughput of a wireless tandem network coding. Our analytical model is based on a multi-class open queueing network. In this model, we include two basic processes of network coding, i.e., packets combination and packets multicasting, in a suitable way considering the constraints of the queueing networks. To this end, we consider the coded packets as new classes of customers. In our model we consider the arrival and departure rates in and from the wireless nodes in steady state. By solving the related traffic equations and applying the stability condition, we compute the maximum stable throughput, i.e., the maximum packet generation rate at which the packets reach their destinations with finite delays. We apply our approach on a simple and yet fundamental model of wireless tandem networks with multicast flows and two different MAC schemes, i.e., scheduled access and slotted random access and then compute the maximum stable throughputs for the cases of simple routing and network coding, distinctly. Finally, we confirm our analytical results by simulation.