Performance and stability analysis of buffered R-ALOHA systems using tagged user approach (TUA)

This paper uses the tagged user approach (TUA) to analyse R-ALOHA systems with propagation delay, finite buffer capacity and finite user population. The system stability, throughput, message delay and message blocking probability are studied. It is assumed that each message comprises a random number of packets that have 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 the message even if it has other messages waiting in the buffer. It is straightforward to extend the analysis to R-ALOHA systems with infinite buffer capacity. The accuracy of the analysis is verified by simulation