摘要
根据帧结构的不同对现有的时隙分配算法进行分类,分析其特点及综合性能。根据二叉树块内均分法,提出一种改进的时分多址动态时隙分配算法,地面主控站可根据用户的紧急或优先级高低的预约请求进行实时分配,能满足用户占用时隙块发送较长报文的需求。仿真结果表明,该算法能减少报文的平均延误时间,适合突发应急报文的传输需要。
A description of the current dynamic slot allocation algorithms is provided from the perspective of difference in time frame construction. It analyzes the performance of algorithms based on each characteristic. Based on algorithm of bintree average allocation in the block, an improved dynamic slot allocation algorithm is proposed, which aims at allocating slot for users according to the urgency or priority of their requirements in real time and sustains the requirement of transmitting longer message in time-slot block. Simulation results show that the algorithm can reduce the message delay, and thus is applicable to the situation where the users have urgent requirements.
出处
《计算机工程》
CAS
CSCD
北大核心
2011年第14期288-290,共3页
Computer Engineering
基金
国家部委基金资助项目
关键词
数据链
时分多址
时隙块
二叉树
时隙分配
data link
Time Division Multiple Access（TDMA）
slot block
binary tree
slot allocation
