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.
Mendeley helps you to discover research relevant for your work.
CITATION STYLE
Wen, S., Deng, L., Shi, S., Fan, X., & Li, H. (2020). Distributed Congestion Control via Outage Probability Model for Delay-Constrained Flying Ad Hoc Networks. Wireless Communications and Mobile Computing, 2020. https://doi.org/10.1155/2020/8811840