Performance Analysis of SPMA Protocol: A Markov Renewal Process Approach

Abstract

Low latency and high reliability are significant trends in the development of wireless communications. Both the new generation of data link system, Tactical Targeting Network Technology (TTNT), and the fifth-generation mobile networks (5G) have put forward higher requirements for low latency and high reliability. Statistical priority-based multiple access protocol (SPMA) can be applied to these systems by virtue of its excellent performance. It is very important to model and analyze the performance of SPMA. In this paper, we establish the node state model by discrete-time Markov renewal process under a saturated network. We construct a fixed-point equation to solve the medium access probability. Then the average packet success rate and throughput are obtained. We evaluate the performance of the saturated SPMA system through the three variables. We also analyze the impact of system parameters on protocol performance. Extensive simulations demonstrate that our theoretical results closely match the simulation results. Moreover, the throughput limit can be obtained by adjusting the system parameters.