作者投稿和查稿 主编审稿 专家审稿 编委审稿 远程编辑

计算机工程 ›› 2011, Vol. 37 ›› Issue (14): 288-290. doi: 10.3969/j.issn.1000-3428.2011.14.098

• 开发研究与设计技术 • 上一篇    下一篇

基于优先级的TDMA动态时隙分配算法

李建勋,樊晓光,张 喆,万 明   

  1. (空军工程大学工程学院,西安 710038)
  • 收稿日期:2011-01-17 出版日期:2011-07-20 发布日期:2011-07-20
  • 作者简介:李建勋(1986-),男,博士研究生,主研方向:机载计算机,航空数据链;樊晓光,教授、博士;张 喆,硕士研究生;万 明,讲师、博士
  • 基金资助:
    国家部委基金资助项目

TDMA Dynamic Slot Allocation Algorithm Based on Priority

LI Jian-xun, FAN Xiao-guang, ZHANG Zhe, WAN Ming   

  1. (Engineering College, Air Force Engineering University, Xi’an 710038, China)
  • Received:2011-01-17 Online:2011-07-20 Published:2011-07-20

摘要: 根据帧结构的不同对现有的时隙分配算法进行分类,分析其特点及综合性能。根据二叉树块内均分法,提出一种改进的时分多址动态时隙分配算法,地面主控站可根据用户的紧急或优先级高低的预约请求进行实时分配,能满足用户占用时隙块发送较长报文的需求。仿真结果表明,该算法能减少报文的平均延误时间,适合突发应急报文的传输需要。

关键词: 数据链, 时分多址, 时隙块, 二叉树, 时隙分配

Abstract: 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.

Key words: data link, Time Division Multiple Access(TDMA), slot block binary tree, slot allocation

中图分类号: