Grouping Decision Algorithm for Dynamic Terminals in Random Access Networks  

作　　者：Hongliang Sun Tongfei Chen Chuangye Zhao Mengxin Chen 

机构地区：[1]College of Information and Control Engineering,Jilin Institute of Chemical Technology,Jilin 132022,China

出　　处：《Journal of Communications and Information Networks》2024年第2期176-183,共8页通信与信息网络学报（英文）

基　　金：supported by the Science and Technology Development Plan Project of Jilin Province under Grant YDZJ202401383ZYTS.

摘　　要：This paper proposes a grouping decision algorithm for random access networks with the carrier sense multiple access (CSMA) mechanism, which can balance the traffic load and solve the hidden terminal issue. Considering the arrival characteristics of terminals and quality of service (QoS) requirements, the traffic load is evaluated based on the effective bandwidth theory. Additionally, a probability matrix of hidden terminals is constructed to take into account the dynamic nature of hidden terminal relations. In the grouping process, an income function is established with a view to the benefits of decreasing the probability of hidden terminal collisions and load balancing. Then, we introduce the grey wolf optimization (GWO) algorithm to implement the grouping decision. Simulation results demonstrate that the grouping algorithm can effectively alleviate the performance degradation and facilitate the management of network resources.

关 键 词：random access network hidden terminal collision probability effective bandwidth traffic load grey wolf optimization 

分 类 号：TN92[电子电信—通信与信息系统]