Algorithm for Random Access Communication over a Noisy Channel

摘要

We consider synchronous random access systems with noisy transmission channels. We model the channel noise as two types of erroneous feedbacks observed by the users. Specifically, with some probabilities, a successful channel slot and an empty channel slot can be seen as collision slots. For such systems, we analyze the stability conditions of a random access algorithm, both in its full sensing and limited sensing versions. We exhibit the superior resistance of the algorithm to the above feedback errors.