Random access with large propagation delay

Abstract

Random access to a packet broadcast channel with large propagation delay is investigated. A protocol is presented that combines slotted ALOHA random access with the use of forward-error-correction (FEC) across transmitted packets. Ex- pressions for the throughput, delay, and drift of this protocol are derived. Numerical studies and asymptotic analyses of the drift indicate that the protocol has a maximum throughput of and exhibits bistability and saturation behavior similar to that of slotted ALOHA with immediate feedback. However, unlike ALOHA, bistability and saturation in the code protocol can be eliminated with the proper choice of protocol parameters without increasing the packet delay. It is further shown that, when compared to slotted ALOHA, the code protocol typically achieves a higher throughput and lower delay at system equilibrium with no loss in maximum throughput.