Random Access Algorithm for Users with Multiple priorities (Special Issue on Advanced Adaptive Radio Communication Technologies)

スポンサーリンク

概要

• 論文の詳細を見る

• 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.

• 社団法人電子情報通信学会の論文
• 1996-03-25

著者

• Watanabe Fujio

  The Graduate School Of Information Systems University Of Electro-communications

• BUOT Theodore

  the Centre for Telecommunications Information Networking, University of Adelaide

• Buot T

  The Centre For Telecommunications Information Networking University Of Adelaide

• Buot Theodore

  The Centre For Telecommunications Information Networking University Of Adelaide

関連論文

• Channel Allocation Algorithms for Multislot TDMA with Multiclass Users (Special Issue on Advanced Adaptive Radio Communication Technologies)
• Overlapping Coverage Control in Sector Cells (Special Issue on Advanced Adaptive Radio Communication Technologies)
• Random Access Algorithm for Users with Multiple priorities (Special Issue on Advanced Adaptive Radio Communication Technologies)

スポンサーリンク