A random multiple-access algorithm for the dependent feedback error channelA random multiple-access algorithm for the dependent feedback error channel Πλήρης Δημοσίευση σε Συνέδριο Conference Full Paper 2015-11-191991enA noisy slotted channel is considered. It is assumed that channel feedback might be misinterpreted due to the existence of noise on the channel. Furthermore, this disturbance is dependent on the channel state (either good or bad) which varies from slot to slot according to a Markov chain. Consequently, the occurrence of a channel feedback error is dependent on previous occurrences of errors (i.e., with error memory). Under this assumption, the throughput performance of a random multiple-access algorithm (called a two-cell algorithm) is analyzed, and the result is compared with the throughput of the J. Capetanakis (1979) tree splitting algorithm operating over the same channel. It is shown that the two-cell algorithm retains positive throughputs for all possible values of channel state parameters, and for all practical purposes, it outperforms the Capetanakis algorithm in terms of insensitivity to channel feedback errorshttp://creativecommons.org/licenses/by/4.0/620 - 627 Proceedings. Tenth Annual Joint Conference of the IEEE Computer and Communications Societies. Networking in the 90s., IEEE Proceedings. Tenth Annual Joint Conference of the IEEE Computer and Communications Societies. Networking in the 90s., IEEE Gong, Y Paterakis Michalis Πατερακης Μιχαλης Institute of Electrical and Electronics Engineers