Random multiple access system with impatient packets
type: Item
instance of: scholarly article
title: Random multiple access system with impatient packets
zbMATH Open document ID: 0565.94002
author: B. S. Tsybakov
author: Nikolay Likhanov
published in: Problems of Information Transmission
publication date: 1984-01-01T00:00:00Z
review text: 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.
Mathematics Subject Classification ID: 94A05
Mathematics Subject Classification ID: 62B10
zbMATH DE Number: 3902536
zbMATH Keywords: slotted random-access protocol
zbMATH Keywords: slotted ALOHA
zbMATH Keywords: channel utilization
MaRDI profile type: Publication
description: scientific article; zbMATH DE number 3902536