Drastic changes in network topology of Flying Ad Hoc Networks (FANETs) result in the instability of the single-hop delay and link status accordingly. Therefore, it is difficult to implement the congestion control with delay-sensitive traffic according to the instantaneous link status. To solve the above difficulty effectively, we formulate the delay-aware congestion control as a network utility maximization, which considers the link capacity and end-to-end delay as constraints. Next, we combine the Lagrange dual method and delay auxiliary variable to decouple the link capacity and delay threshold constraints, as well as to update single-hop delay bound with the delay-outage mode. Built on the methods above, a distributed optimization algorithm is proposed in this work by considering the estimated single-hop delay bound for each transmission, which only uses the local channel information to limit the end-to-end delay. Finally, we deduce the relationship between the primal and dual solutions to underpin the advantages of the proposed algorithm. Simulation results demonstrate that the proposed algorithm effectively can improve network performances in terms of packet time-out rate and network throughput.

中文翻译：

---

基于停运概率模型的时延受限飞行自组织网络的分布式拥塞控制

Flying Ad Hoc网络（FANET）的网络拓扑结构的急剧变化导致单跳延迟和相应链路状态的不稳定。因此，难以根据瞬时链路状态来实现对延迟敏感的通信量的拥塞控制。为了有效地解决上述困难，我们将延迟感知拥塞控制公式化为网络效用最大化，将链路容量和端到端延迟作为约束条件。接下来，我们结合拉格朗日对偶方法和延迟辅助变量来解耦链路容量和延迟阈值约束，以及用延迟中断模式更新单跳延迟范围。在上述方法的基础上，本文通过考虑每次传输的估计单跳延迟范围，提出了一种分布式优化算法，它仅使用本地信道信息来限制端到端延迟。最后，我们推导了原始解和对偶解之间的关系，以支持所提出算法的优势。仿真结果表明，该算法可以有效地提高数据包超时率和网络吞吐量。