An efficient random access algorithm for packet broadcast channels with long propagation delays

This paper introduces and analyzes an efficient algorithm for the random accessing of a broadcast channel by a large number of packet-transmitting, bursty users. The algorithm uses a minislot overhead, per packet, to extract detailed information regarding possible packet collisions. In the event of a collision, this information is used by the algorithm for accelerating the collision resolution process. The maximum stable throughput and the mean packet delay induced by the algorithm are evaluated via a systematic analysis method. The packet delay characteristics indicate that the proposed algorithm is well suited for operation on satellite channels, over a wide range of input traffic rates.