An occupancy problem involved in multiaccess communication systems Original Research Article

An occupancy problem involved in multiaccess communication systems is studied. We are primarily interested in the prbability of the number of successful time slots after n consecutive time slots for contention with the initial number of users being k. Two different approaches are used to derive the required probability: one is based on the concept of multiple summations and the other uses the theory of Markov chain. It is shown that the latter approach is more computationally efficient than the former.