We specify the stable throughput region for broadcast systems with one or two source nodes transmitting packets to two receivers over independent channels with probabilistic reception. We show that the plain retransmission policy is suboptimal and the stable operation is optimized by coded retransmissions with finite packet delay and low complexity. We introduce a dynamic network coding policy based on the instantaneous queue content and prove the equivalence of the queueing stability region and maximum throughput region for random access of two sources randomly transmitting packets to two receivers over multi-packet reception channels. We also discuss the relationship between the maximum achievable and stable throughput regions (for saturated and possibly emptying packet queues) and the general capacity region. Finally, we explore the maximum stable throughput region for unicast traffic of packets addressed to either one of the two receivers and combine the results with broadcast communication.
展开▼
