Skip to Main Content
In this paper, we propose an analytical approach to derive the exact value of saturation throughput of Slotted Aloha in an interference-dominating wireless ad-hoc network. In an interference-dominating wireless network, a receiver could simultaneously receive a number of packets from a variety of transmitters, as long as the signal-to-interference-plus-noise ratio exceeds a predetermined threshold. Our analysis is based on the theory of discrete-time Markov chain. Unlike previous methods in the literature, when our approach is used, the cardinality of the corresponding state space is reduced to be at most n, where n is the total number of nodes in the network. The reduction makes evaluating the saturation throughput of slotted Aloha feasible in practice. We show that our numerical results are consistent with simulation results.