By Topic

A protocol for random multiple access of packets with mixed priorities in wireless networks

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

3 Author(s)
T. Papantoni-Kazakos ; Dept. of Electr. Eng., Alabama Univ., Tuscaloosa, AL, USA ; N. B. Likhanov ; B. S. Tsybakov

Random multiple access (RMA) protocols comprise an important class for the accessing/signaling stage in multimedia ATM wireless networks. Within the RMA class, the ALOHA algorithm is most widely used at this point in time, while, as is well known, the latter algorithm becomes unstable, as the user population increases. In this paper, we consider the part-and-try algorithm, instead, for a system with different priorities. Based on this algorithm, we construct a mixed priority protocol whose total throughput-for all priorities combined-equals 0.487. In the special and important for ATM case of two, low, and high priorities, with respective Poisson intensities λL and λH. We also present an analytical methodology which allows the computation of the average packet delays as functions of the rates λL and λH

Published in:

IEEE Journal on Selected Areas in Communications  (Volume:13 ,  Issue: 7 )