Efficient methods for broadcasting multi-slot messages with random access with capture

A new technique for best effort delivery of broadcast bursty multi-slot messages is investigated, using random access with capture. It is shown that a combination of packet level coding and random spreading of a message´s packets can improve message reception probability, satisfaction of delay constraints, and throughput in many cases. Furthermore, we show how the specific transmission strategy employed should depend on the message length, total offered traffic, and the specific delay constraints. In addition, we show how edge effects, the finite size of the network, and receiver capture significantly impact performance not only at the edges of the network, but also near the center of the network. Finally, we demonstrate how to leverage these edge effects so that the introduction of minimal feedback from only one or two nodes can substantially improve the probability of message reception for all nodes in the network.