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.

Additional Metadata
Persistent URL dx.doi.org/10.1016/j.jnca.2003.11.002
Journal Journal of Network and Computer Applications
Citation
Sheikh, A.U.H. (Asrar U.H.), Wan, T. (Tan), Alakhdhar, S.Z., Lambadaris, I, & Devestsikiotis, M. (Michael). (2004). Performance analysis of buffered R-ALOHA systems using tagged user approach. Journal of Network and Computer Applications, 27(3), 131–150. doi:10.1016/j.jnca.2003.11.002