A queueing model for wireless tandem network coding

Authors:
Mohammad B. Iraji;Mohammad H. Amerimehr;Farid Ashtiani
Affiliations:
Department of Electrical Engineering, Advanced Communications Research Institute, Sharif University of Technology;Department of Electrical Engineering, Advanced Communications Research Institute, Sharif University of Technology;Department of Electrical Engineering, Advanced Communications Research Institute, Sharif University of Technology
Venue:
WCNC'09 Proceedings of the 2009 IEEE conference on Wireless Communications & Networking Conference
Year:
2009

Citing 8
Cited 1

An algebraic approach to network coding

IEEE/ACM Transactions on Networking (TON)
Network Coding for Wireless Mesh Networks: A Case Study

WOWMOM '06 Proceedings of the 2006 International Symposium on on World of Wireless, Mobile and Multimedia Networks
XORs in the air: practical wireless network coding

IEEE/ACM Transactions on Networking (TON)
The capacity of wireless networks

IEEE Transactions on Information Theory
Network information flow

IEEE Transactions on Information Theory
Linear network coding

IEEE Transactions on Information Theory
Cross-Layer Optimization of MAC and Network Coding in Wireless Queueing Tandem Networks

IEEE Transactions on Information Theory
Performance analysis of the IEEE 802.11 distributed coordination function

IEEE Journal on Selected Areas in Communications

An analytical approach for throughput evaluation of wireless network coding

ICC'09 Proceedings of the 2009 IEEE international conference on Communications

Quantified Score

Hi-index	0.00

Visualization

Abstract

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.