Statistical Analysis of a Distributed Queuing Random Access Protocol in a Massive Communication Environment

Abstract

Most of the networks deployed for massive IoT communications use Aloha-based algorithms for channel access. However, those algorithms are known to be unstable and inefficient when the network size is high. Since recently, a Distributed Queuing (DQ) algorithm is being proposed as a solution to mitigate several of the Aloha issues in IoT networks. In this paper, a statistical performance analysis of the DQ algorithm without any prior consideration of any physical layer is presented. We evaluate the DQ algorithm in a massive communication environment and give the average values for these performance metrics: collision resolution time, access delay per sensor, channel throughput, number of attempts required by a sensor to complete the contention process, number of nodes contending per frame and the distribution of contention slots into idle, successful, and collided. The goal of this paper is to provide a statistical baseline performance evaluation of the DQ algorithm in general.

Keywords

• aloha
• distributed queuing
• collision resolution
• massive machine-to-machine (m2m) communications
• random access protocol
• tree splitting