检索规则说明:AND代表“并且”;OR代表“或者”;NOT代表“不包含”;(注意必须大写,运算符两边需空一格)
检 索 范 例 :范例一: (K=图书馆学 OR K=情报学) AND A=范并思 范例二:J=计算机应用与软件 AND (U=C++ OR U=Basic) NOT M=Visual
作 者:张军 张瑶 孙兴华 ZHANG Jun;ZHANG Yao;SUN Xinghua(Jiangsu Key Laboratory of Wireless Communications,College of Telecommunications and Information Engineering,Nanjing University of Posts and Telecommunications,Nanjing 210003,China;School of Electronics and Communication Engineering,Sun Yat-Sen University,Guangzhou 510275,China)
机构地区:[1]南京邮电大学通信与信息工程学院江苏省无线通信重点实验室,南京210003 [2]中山大学电子与通信工程学院,广州510275
出 处:《电讯技术》2019年第4期369-374,共6页Telecommunication Engineering
基 金:国家自然科学基金面上项目(61671251)
摘 要:针对大规模机器类通信中拥塞导致的时延敏感设备时延高和接入成功率低的问题,提出将小区中设备按时延要求分组,对不同组设备引入不同的退避模型,分析时延敏感设备的时延和吞吐量,按照不同组中设备的时延需求动态分配前导数目,同时通过调整接入类限制因子实现吞吐量的优化。仿真结果表明,在给定时延敏感设备的时延限制条件时,与统一退避的机制对比,所提分组机制的时延敏感设备能够满足时延要求,并且提高了接入效率。In order to solve the problem of high delay and low access success rate caused by congestion in large-scale machine type communication(MTC),this paper groups the devices according to the delay requirements and analyzes the delay and throughput of delay-sensitive devices by introducing different back-off models for different groups.The number of preambles is dynamically allocated according to the delay requirements of different groups,and the throughput is optimized by adjusting the access class barring factor.By comparing with the mechanism of uniform backoff,the simulation results show that the delay-sensitive devices can achieve latency requirement and the access efficiency is improved when the latency of the delay sensitive devices is limited.
关 键 词:机器类通信(MTC) 机器对机器(M2M)通信 随机接入 吞吐量优化 时延敏感
分 类 号:TN915.0[电子电信—通信与信息系统]
正在载入数据...
正在载入数据...
正在载入数据...
正在载入数据...
正在载入数据...
正在载入数据...
正在载入数据...
正在链接到云南高校图书馆文献保障联盟下载...
云南高校图书馆联盟文献共享服务平台 版权所有©
您的IP:216.73.216.222