Random access in coded wireless packet networks: Feasibility and distributed optimization

Abstract

We study the throughput region of random access in coded wireless packet networks. We propose a distributed and robust fixed point algorithm that determines whether given coded information flow requirements are feasible with random access and computes the minimal required attempt probabilities supporting these requirements. Combined with linear coding subgraph and flow optimization, this yields a distributed algorithm for joint network coding and random access optimization for multicast networks. Numerical examples show that the proposed method reduces the gap of existing approaches to the optimal solution significantly.