Mixing collision resolution algorithms exploiting information of successful messages

Algorithms for accessing a slotted-time collision-type broadcast are considered under a Poisson infinite-user model, where each user observes the channel and determines for each slot whether idle or success or collision has occurred. The highest throughput previously achieved for this model is 0.4878. A new scheme is introduced which does not exceed the limitations of the system model, yet achieves a throughput of 0.4892. Extra information is added to the message that can be used only when the message is received successfully. One form of extra information is described, and a new algorithm that exploits it is proposed