AbstractIn this paper we study the performance of tree‐like splitting collision resolution algorithms in channels with markovian capture. In particular, we assume that in each slot the channel can be in one of two states ‐b(for “bad”) andg(for “good”). When the channel is in stateb, a capture can never occur. When the channel is in stategandnnodes (n ≥ 2) are transmitting, a capture occurs with probability πn. The sequence of channel states is assumed to be a homogeneous Markov chain. We derive the throughput of a splitting tree‐like multiple access algorithm for this channel. We also provide simulation results for t