Communication-Network Theory and Large System Science

Lower Bound on Delay in an RMA System with $N$-Conflicts and Errors

B. S. Tsybakov, A. Yu. Privalov


Abstract: We derive a lower bound on delay, which is valid for any random multiple access algorithm in a channel with errors and $N$-conflicts. For $N=2$ and without errors, our lower bound reduces to the bound of [B. S. Tsybakov and N. B. Likhanov, Probl. Peredachi Inf., 27, no. 3, 73–88].

UDC: 621.394.74:519.2

Received: 16.10.1991

 English version: Problems of Information Transmission, 1992, 28:4, 360–374

Bibliographic databases:

•