Finite Blocklength Analysis of the Multiple Access Relay Channel with Batch-and-Forward Strategy

摘要

This work provides a comprehensive framework regarding the analysis of the Multiple Access Relay Channel (MARC) with Time Division Multiple Access (TDMA) scheduling, subject to finite blocklength constraints. In particular, we examine the stability conditions and evaluate the maximum throughput, by applying a cognitive cooperation protocol that assumes relaying is enabled when sources are idle. Moreover, we propose the novel Batch-And-Forward (BAF) strategy, that can significantly enhance the performance of cooperative networks in the finite blocklength regime, as well as reduce the requirement in metadata. The BAF strategy is quite versatile, thus, it can be embedded in existing cooperative protocols, without imposing additional complexity on the overall scheme.