Performance evaluation of persistent admission control in frequency-hopped slotted random access networks

We propose an admission control for slow-frequency-hopped slotted random access networks. The proposed scheme delays new packet transmission until the number of backlogged users decreases to the threshold or less. Performance of the proposed protocol is evaluated with a two-dimensional Markov chain for systems with finite number of users in terms of throughput efficiency and the average transmission delay. Numerical results show that the proposed protocol can achieve better performance, compared to the conventional frequency-hopped slotted ALOHA. The optimum value of the threshold is also numerically derived.