By Topic

Preassigned retransmission slots multiple access scheme (PARS)

Sign In

Cookies must be enabled to login.After enabling cookies , please use refresh or reload or ctrl+f5 on the browser for the login options.

Formats Non-Member Member
$33 $13
Learn how you can qualify for the best price for this item!
Become an IEEE Member or Subscribe to
IEEE Xplore for exclusive pricing!
close button

puzzle piece

IEEE membership options for an individual and IEEE Xplore subscriptions for an organization offer the most affordable access to essential journal articles, conference papers, standards, eBooks, and eLearning courses.

Learn more about:

IEEE membership

IEEE Xplore subscriptions

1 Author(s)
Sarraf, M. ; AT&T Bell Lab., Middletown, NJ, USA

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

Published in:

INFOCOM '91. Proceedings. Tenth Annual Joint Conference of the IEEE Computer and Communications Societies. Networking in the 90s., IEEE

Date of Conference:

7-11 Apr 1991