Efficient Computation of Collision Probability for Grant-Free Multiple Access with Repeated Packet Transmissions

摘要

This paper provides a derivation of the packet collision probability associated with grant-free multiple access with repeated packet transmissions. After obtaining a closed form expression of the packet collision probability, it is observed that the amount of computation can be excessive. Consequently, an alternative probability expression is derived in order to reduce the computational complexity. Since the packet collision probability is directly related to the service reliability defined as the percentage of successful packet transmissions within the latency limit, the obtained analytical expression can provide practical computation for reliability evaluation.