北京航空航天大学学报 ›› 2019, Vol. 45 ›› Issue (2): 325-332.doi: 10.13700/j.bh.1001-5965.2018.0305

• 论文 • 上一篇    下一篇

蜂群无人机自组网多优先级自适应退避算法

刘炜伦, 张衡阳, 郑博, 高维廷   

  1. 空军工程大学 信息与导航学院, 西安 710077
  • 收稿日期:2018-05-28 出版日期:2019-02-20 发布日期:2019-03-04
  • 通讯作者: 张衡阳 E-mail:hareed@163.com
  • 作者简介:刘炜伦男,硕士研究生。主要研究方向:机载自组网;张衡阳男,博士,副教授,硕士生导师。主要研究方向:移动Ad hoc网络;郑博男,博士,讲师。主要研究方向:移动Ad hoc网络。
  • 基金资助:
    国家自然科学基金(61701521);中国博士后科学基金(2016M603044);航空科学基金(20161996010);陕西省自然科学基金(2018JQ6074)

An adaptive backoff algorithm for FANETs based on multiple priority

LIU Weilun, ZHANG Hengyang, ZHENG Bo, GAO Weiting   

  1. Information and Navigation College, Air Force Engineering University, Xi'an 710077, China
  • Received:2018-05-28 Online:2019-02-20 Published:2019-03-04
  • Supported by:
    National Natural Science Foundation of China (61701521); China Postdoctoral Science Foundation (2016M603044); Aeronautical Science Foundation of China (20161996010); Natural Science Foundation of Shaanxi Province, China (2018JQ6074)

摘要: 针对现有媒质接入控制(MAC)协议退避算法无法为蜂群无人机自组网(FANETs)提供区分服务,且在重负载时性能严重恶化等问题,提出一种多优先级自适应退避算法。采用忙闲因子自适应机制和最优竞争窗自适应机制,根据信道忙闲程度和网络状态参数自适应实时更新各优先级竞争窗口(CW)长度,从而使每次退避的竞争窗口可快速收敛到最佳状态,并实现了多业务区分服务,得到了最优的系统性能。通过建立不同优先级退避过程的三维Markov链模型求解得到了饱和吞吐量下的最优竞争窗自适应因子,并且理论推导了系统吞吐量和平均MAC时延的数学表达式。仿真结果表明,所提算法在重负载时能够实现多优先级区分服务并有效提高系统的吞吐量性能,相比区分业务优先级的自适应退避(PAB)算法和支持QoS的自适应竞争窗口退避算法(Q-ABACW),性能均有较大提升。

关键词: 蜂群无人机自组网(FANETs), 自适应退避, 区分优先级, 忙闲因子, 最优竞争窗口, 忙闲程度

Abstract: The existing backoff algorithms of the medium access control (MAC) protocols cannot provide the multiple priority differentiation, and the performance declines sharply under heavy loads in flying Ad hoc networks (FANETs), so a novel adaptive backoff algorithm based on multiple priority differentiation is proposed in this paper. The algorithm adopts a busy/idle factor adaptive mechanism and an optimal contention window (CW) adaptive mechanism, so the length of CW for each priority can be adjusted in real time with the busy degree of channels and network state parameters. Meanwhile, the CW can quickly converge to the best state in every backoff stage, and the multiple priority differentiation can be obtained. Furthermore, the best system throughput performance can be achieved by modeling. The three-dimensional Markov chain model of the backoff process for different priorities is established and the adaptive factor under the saturated throughput is solved by theory. In addition, the mathematical expressions of system throughput and mean MAC delay are also deduced. Simulation results show that the algorithm can achieve the multiple priority differentiation and availably enhance the system throughput, and its performance is superior to the priority adaptive backoff (PAB) algorithm and adaptive CW backoff algorithm for QoS (Q-ABACW).

Key words: flying Ad hoc networks (FANETs), adaptive backoff, priority differentiation, busy/idle factor, optimal contention window, busy degree

中图分类号: 


版权所有 © 《北京航空航天大学学报》编辑部
通讯地址:北京市海淀区学院路37号 北京航空航天大学学报编辑部 邮编:100191 E-mail:jbuaa@buaa.edu.cn
本系统由北京玛格泰克科技发展有限公司设计开发