Performance of Random Access Markov Modelling for Two-Way Buffer-Aided Relaying Networks with Wireless Assisted Links

Abstract

In this paper, we consider two-way relaying networks (TWRNs) in which information of two users randomly exchange via buffer-aided relay. We assume that all nodes work on half-duplex decode-and-forward for relaying of data packets. The relay is equipped with two finite-size buffers and both the users know the exact number of data packets. The data packets are scheduling with different channel access probabilities to avoid collision at relay. The protocols are developed on the basis of selective transmission scheme with states of Markov chain at relay for buffer state information (BSI) and Hybrid buffer state information/channel state information (BSI/CSI). On the basis of these protocols, we investigate closed-from expressions of maximum achievable sum throughput and end-to-end throughput for TWRNs. The numerical results are obtained with the help of CVX software package. Our proposed scheme significantly outperforms the existing two-way buffer-aided relaying scheme in literature.