In this report, we extend the work of Qin and Berry , who have proposed medium access control splitting algorithms that exploit multi-user diversity to schedule the user with best channel gain. The case of channel with memory, in particular, a first order Markovian model is considered in our work. We show that it is possible to resolve contention in fewer attempts with the knowledge of channel memory. Also, we have simulated the algorithms for a slightly different time slot model and plotted the throughput and delay results so obtained. The observations and inferences from these results are also discussed.