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

  • Authors:

  • A. U. H. Sheikh;T. Wan;S. Z. Alakhdhar;I. Lambadaris;M. Devetsikiotis

  • Affiliations:

  • Telecommunications Research Laboratory, Department of Electrical Engineering, King Fahd University of Petroleum and Minerals, KFUPM Box 5038, Dhahran 31261, Saudi Arabia;Siemens Wireless Division, San Diego, CA;Telecommunications Research Laboratory, Department of Electrical Engineering, King Fahd University of Petroleum and Minerals, KFUPM Box 5038, Dhahran 31261, Saudi Arabia;Department of Systems and Computer Engineering, Carleton University, 1125 Colonel By Drive, Ottawa, Ont., Canada K1S 5B6;Department of Electrical and Computer Engineering, North Carolina State University, Rayleigh, NC

  • Venue:
  • Journal of Network and Computer Applications
  • Year:
  • 2004

Quantified Score

Hi-index 0.00

Visualization

Abstract

In this paper, R-ALOHA systems with propagation delay, finite buffer capacity and finite user population are analyzed using Tagged User Approach. The system throughput, message response time, message delay-time distribution and message blocking probability are obtained. It is assumed that each message consists of a random number of packets with a general distribution, and each user have a finite buffer capacity. To maintain the fairness to all users, it is assumed that each message in the buffer is transmitted independently that is, a user has to release the reserved slot after finishing the transmission of a message even if it has more messages waiting in the buffer. The analysis can be extended to R-ALOHA systems with infinite buffer capacity straightforwardly. The accuracy of the analysis is verified by simulations.