Splitting algorithms in noisy channels with memory

Abstract

Multi-access networks are considered in which the shared channel is noisy. The authors assume a slotted-time collision-type channel, Poisson infinite-user model, and binary feedback. Due to the noise in the shared channel, the received signal may be detected as a collision even though no message or a single message is transmitted. This kind of imperfect feedback is referred to as error. A common assumption in all previous studies of multi-access algorithms in channels with errors is that the channel is memoryless. The authors consider the problem of splitting algorithms when the channel has memory. They introduce a two-state, first-order Markovian model for the channel and analyze the operation of the tree collision-resolution algorithm in this channel. They obtain a stability result, i.e., the necessary conditions on the channel parameters for stability of the algorithm. Assuming that the stability conditions hold, they calculate the throughput of the algorithm. Assuming that the stability conditions hold, they calculate the throughput of the algorithm. Extensions to more general channel moders are discussed. >