A unified approach to analyze multiple access protocols for buffered finite users

Authors:
Asrar Sheikh;Tao Wan;Zaki Alakhdar
Affiliations:
Telecommunications Research Laboratory, Department of Electrical Engineering, King Fahd University, of Petroleum and Minerals, KFUPM Box 5038, Dhahran 31261, Saudi Arabia;Siemens Wireless Systems, Los Angles, CA;Telecommunications Research Laboratory, Department of Electrical Engineering, King Fahd University, of Petroleum and Minerals, KFUPM Box 5038, Dhahran 31261, Saudi Arabia
Venue:
Journal of Network and Computer Applications
Year:
2004

Citing 4
Cited 3

Performance analysis of multiple access protocols

Performance analysis of multiple access protocols
Distributions of packet delay and interdeparture time in slotted ALOHA and carrier sense multiple access

Journal of the ACM (JACM)
Performance Analysis of Buffered CSMA/CD Systems

Wireless Personal Communications: An International Journal
Performance analysis of buffered R-ALOHA systems using tagged user approach

Journal of Network and Computer Applications

Performance analysis of buffered R-ALOHA systems using tagged user approach

Journal of Network and Computer Applications
Markov Chain-based performance analysis of multihop IEEE 802.15.4 wireless networks

Performance Evaluation
Markov chain-based optimization of multihop IEEE 802.15.4 wireless sensor networks

Proceedings of the Fourth International ICST Conference on Performance Evaluation Methodologies and Tools

Quantified Score

Hi-index	0.00

Visualization

Abstract

In this paper, a new approach is proposed to analyze the performance of buffered random multiple access protocols called tagged user analysis (TUA). In TUA, each user is modeled as an independent queueing system, which operates at its own equilibrium probability. As a result, the classical queueing theory can be employed to analyze the queueing behavior of each user. On the basis of the behavior of the tagged user, the performance of the whole system is analyzed. TUA is a unified method of analyzing most of random access methods including the heterogeneous random multiple access techniques that are difficult to analyze otherwise. Furthermore, TUA can also handle those systems where user terminals may have arbitrary packet size (in slots) distribution, arbitrary arrival processes such as batch packet arrivals in Bernoulli, arbitrary service principle such as priority queueing, last came first served, and random service. In this paper, in addition to analyzing for the distributions of several performance indices, their mean values are obtained.