Abstract
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.< <ETX xmlns:mml="http://www.w3.org/1998/Math/MathML" xmlns:xlink="http://www.w3.org/1999/xlink">></ETX>
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a callDisclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.
