随机多址接入分布式排队的优先级调度方法  

A scheme of priority scheduling for distributed queuing of random multiple access

作　　者：王文鼐[1,2] 杨继海 吴炜 王斌[1,2] WANG Wennai;YANG Jihai;WU Wei;WANG Bin(School of Communications and Information Engineering,Nanjing University of Posts and Telecommunications,Nanjing 210003,China;Key Lab of Broadband Wireless Communication and Sensor Network Technology,Ministry of Education,Nanjing University of Posts and Telecommunications,Nanjing 210003,China)

机构地区：[1]南京邮电大学通信与信息工程学院,江苏南京210003 [2]南京邮电大学宽带无线通信与传感网技术教育部重点实验室,江苏南京210003

出　　处：《南京邮电大学学报（自然科学版）》2022年第4期1-6,共6页Journal of Nanjing University of Posts and Telecommunications：Natural Science Edition

基　　金：江苏省研究生科研与实践创新计划(KYCX_0724)资助项目。

摘　　要：重负载下具有突出平稳性能的分布式排队(DQ)系统,以等权方式调度并发终端对共享信道的争占,所以缺少优先级控制手段。文中提出一种DQ竞争时隙加倍争占的接入方法,设计高优先级终端请求与退避的调控时序,给出性能仿真的计算算法,分析冲突解决时长和终端接入时延。结果表明,高优先级终端占比小于30%是不影响整体性能的界限,在此条件下高优先级终端的平均接入时延可以缩小45%以上。Although a distributed queuing(DQ) system has an attractive steady access performance for concurrent terminals even under heavy-loaded traffics, it does not provide techniques for priority control because the terminals are scheduled with an equal weight over the shared channel. We propose a scheme to double the weight in contending the DQ collision slots, a control flow of access and back-off for high priority terminals, and a numeric simulation algorithm for performance of collision resolution and access latency. Results show that the number of high priority terminals must be limited below 30% of the total in order to make no significant drop in throughput, and under this limitation, the statistic latency of high priority terminals can be averagely reduced by 45% at least.

关 键 词：随机多址接入 分布式排队 优先级调度 性能分析 

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