Abstract
A new multiple-access scheme for a finite number of stations, called preassigned retransmission slots (PARS), is introduced. The delay-throughput performance of the algorithm has been analyzed under single buffer assumption, and simulated under the infinite buffer assumption. Both performance studies show that the algorithm is stable and performs like slotted-ALOHA in light traffic situations and like time division multiple access (TDMA) in heavy traffic situations. The adaptation to traffic intensity is inherent in the algorithm and no dynamic control of any parameters of the algorithm is needed to achieve this property. Hence, implementation of PARS is much easier than some other algorithms with the same property. It is also shown that in cases in which traffic is not uniformly generated among stations, PARS performs better than TDMA, even in heavy traffic situations. >
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.
