An Information Theoretic Analysis for Adaptive-Network-Coded-Cooperation (ANCC) in Wireless Relay Networks

We conduct an information theoretic analysis for the adaptive-network-coded-cooperation (ANCC) protocol over large wireless relay networks. The ANCC protocol adaptively encodes the data from different terminals using a single network code by matching the instantaneous network topology with the code graph of a low-density-parity-check (LDPC) code. The ergodic capacity and the outage probability of this protocol are analyzed for both finite and infinite network sizes, and closed-form expressions are derived for the infinite case. Comparison with the existing protocols including repetition and space-time-coded-cooperation confirm that ANCC is both low-complexity and high-performance