Efficient Methods for Broadcasting Multi-Slot Messages with Random Access with Capture.

摘要

A new technique for best effort delivery of bursty multi-slot messages is investigated when the messages are broadcast to a group of users with random access with capture. The messages originate at random times from each node within a network and are destined to all other nodes in the network. It is shown how in the absence of any feedback, the proper combination of coding and channel access strategy can improve message reception probability, satisfaction of delay constraints, and throughput in many cases. Furthermore, we show how even in large networks with the optimal use of coding and access strategies, the edge effects of receiver capture due to the finite size of the network significantly impact performance not only at the edges of the network, but also in the center of the network. Finally, we demonstrate how the addition of minimal feedback from a single node can substantially improve the probability of message reception for all nodes in such a network.