A Coding Scheme for Conflict-Free Multiaccess Using Global Scheduling

A coded multiple access protocol (CMAP) to improve the delay-throughput performance of a global scheduling multiaccess model for data communication over a broadcast channel, which exhibits a short propagation delay, is described and analyzed. Upper and lower bounds on delay-throughput characteristics are obtained. It is shown that CMAP reduces system delay compared to the 1-out-of-
M
code. This reduction is attained at the expense of a dialogue exchange between the central scheduler and the users.