A reservation-type protocol for channel-aware ALOHA

We consider a contention based random access protocol for networks with multiple users sharing the same transmission medium. Specifically, communication channel between the base station and each user is modeled by a simplified finite-state Markov model to capture the correlation of the channel evolution in time. Under this scenario, we study a reservation-type protocol in channel aware ALOHA context. We formulate the Markovian model necessitates a state description consisting the outcome of the transmission in each slot. The average throughput of the scheme is obtained using the Markov Analysis technique, and we show that reservation help improve the system performance by reducing the number of collision in transmission. Numerical results show that the proposed scheme always improves the system performance when the user channels are more correlated over the time.