For Full-Text PDF, please login, if you are a member of IEICE,|
or go to Pay Per View on menu list, if you are a nonmember of IEICE.
Random Access Algorithm for Users with Multiple Priorities
Theodore BUOT Fujio WATANABE
IEICE TRANSACTIONS on Communications
Publication Date: 1996/03/25
Print ISSN: 0916-8516
Type of Manuscript: Special Section PAPER (Special Issue on Advanced Adaptive Radio Communication Technologies)
Category: Access, Network
aloha, reservation, random access algorithm, stack algorithm,
Full Text: PDF(545KB)>>
This paper presents a method of employing a priority scheme in a random access environment. A prioritized nonblocked stack collision resolution algorithm with binary feedback is developed and tested using simulations. The algorithm accommodates an n-level priority scheme which makes it attractive in mobile data systems. The effectiveness of the algorithm is described on its ability to first, reject the lowest priority class when the system load is near or on the maximum value and second, minimize the delay spread of the higher class users. The performance of the algorithm is characterized using the throughput/delay and cumulative delay for each class of users.