Steady-State Analysis of the Distributed Queueing Algorithm in a Single-Channel M2M Network  

作　　者：Romeo Nibitanga Elijah Mwangi Edward Ndung’u Romeo Nibitanga;Elijah Mwangi;Edward Ndung’u(Department of Electrical Engineering, Pan African University Institute of Basic Sciences, Technology and Innovation, Nairobi, Kenya;Department of Electrical and Information Engineering, University of Nairobi, Nairobi, Kenya;Department of Telecommunication and Information Engineering, Jomo Kenyatta University of Agriculture and Technology, Juja, Kenya)

机构地区：[1]Department of Electrical Engineering, Pan African University Institute of Basic Sciences, Technology and Innovation, Nairobi, Kenya [2]Department of Electrical and Information Engineering, University of Nairobi, Nairobi, Kenya [3]Department of Telecommunication and Information Engineering, Jomo Kenyatta University of Agriculture and Technology, Juja, Kenya

出　　处：《Journal of Computer and Communications》2020年第9期28-40,共13页电脑和通信（英文）

摘　　要：The Distributed Queuing (DQ) algorithm is predicted as one of the solutions to the issues currently found in IoT networks over the use of Aloha based algorithms. Since recently, the algorithm has been of interest to many IoT researchers as a replacement of those Aloha variants for channel access. However, previous works analyzed and evaluated the DQ algorithm without any consideration of the stability of its queues, assuming it is stable for any given number of nodes in the network. In this paper, we define the DQ stability condition in a single-channel M2M environment considering a traffic model of periodic and urgent frames from each node in the network. Besides, a steady-state evaluation of the algorithm’s performance metrics is also presented. In general, the DQ algorithm, when it is stable, was observed not to efficiently use the contention slots for the collision resolution. In a single-channel environment, the DQ algorithm is found to outperform the Aloha based algorithms only in an idle-to-saturation scenario.The Distributed Queuing (DQ) algorithm is predicted as one of the solutions to the issues currently found in IoT networks over the use of Aloha based algorithms. Since recently, the algorithm has been of interest to many IoT researchers as a replacement of those Aloha variants for channel access. However, previous works analyzed and evaluated the DQ algorithm without any consideration of the stability of its queues, assuming it is stable for any given number of nodes in the network. In this paper, we define the DQ stability condition in a single-channel M2M environment considering a traffic model of periodic and urgent frames from each node in the network. Besides, a steady-state evaluation of the algorithm’s performance metrics is also presented. In general, the DQ algorithm, when it is stable, was observed not to efficiently use the contention slots for the collision resolution. In a single-channel environment, the DQ algorithm is found to outperform the Aloha based algorithms only in an idle-to-saturation scenario.

关 键 词：ALOHA Collision Resolution Distributed Queueing IoT Networks M2M Communications Stability Condition 

分 类 号：TN9[电子电信—信息与通信工程]