Effect of an Unbalanced Random Number Generator on the Throughput of a Random Access Local Area Network

A local area network with a random access of user packets is considered. Colliding packets repeat transmission with probability $p$ and postpone it with probability $1-p$. A lower bound for the algorithm throughput is derived. The bound is used for numerical evaluation of the throughput dependence on the network parameters. It is shown that the random number generator with p\neq 1/2$ (unbalanced generator) can be used in a network with large packet length. A comparison with other known random access algorithms for local area networks is presented.