Prioritized random access based on compute-and-forward

In wireless networks, the prioritized transmission scheme is essential for accommodating different priority classes of users sharing a common channel. In this paper, we propose a prioritized random access scheme based on compute-and-forward, referred to as expanding window sign-compute diversity slotted ALOHA (EW-SCDSA). We improve the expanding window technique and apply it to a high-throughput random access scheme, i.e., the sign-compute diversity slotted ALOHA (SCDSA) scheme, to implement prioritized random access. We analyze the probability of user resolution in each priority class utilizing a bipartite graph and derive the corresponding lower bounds, the effectiveness of which is validated through simulation experiments. Simulation results demonstrate that the EW-SCDSA scheme can provide heterogeneous reliability performance for various user priority classes and significantly outperforms the existing advanced prioritized random access scheme.