Abstract
In random multiple-access schemes, end users are usually modeled as with buffer capacity of one unit. Although it is, introduced for analytical conveniences, practically, buffer length of one unit is a rather restrictive limitation. In practice, a finite buffer capacity is needed so that stations can accept more than one unit. In the paper, the performance of slotted ALOHA with finite buffer capacity is analyzed. The study shows that the finite buffer capacity system yields a higher throughput and a lower rejection probability at low transmission probabilities if compared to the one unit buffer capacity system. However, the average packet delay of the finite buffer capacity system is higher than that of the one unit buffer capacity system. >
Sign-in/Register to access full text options 
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.
