Random multiple access system with impatient packets
A version of slotted random-access protocol (slotted ALOHA) with impatient users is considered. Each user can either lose patience and stop packet transmission with probability p or can continue packet transmission with probability \(q=1-p\). Using modifications of a few variations of the slotted random-access protocol given previously a number of lemmas and theorems are proved. Finally, the lower and upper bounds of channel utilization are obtained on the basis of these theorems. It is shown that the upper bound of channel utilization reaches 0.5874 if impatient users are considered.
scientific article; zbMATH DE number 3902536