scholarly journals Distributed Congestion Control via Outage Probability Model for Delay-Constrained Flying Ad Hoc Networks

2020 ◽  
Vol 2020 ◽  
pp. 1-9
Author(s):  
Shaojie Wen ◽  
Lianbing Deng ◽  
Shuo Shi ◽  
Xiying Fan ◽  
Hao Li

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.

2018 ◽  
Vol 2018 ◽  
pp. 1-12 ◽  
Author(s):  
Shaojie Wen ◽  
Chuanhe Huang

This paper aims at solving the end-to-end delay-constrained routing problem in a local way for flying ad hoc networks (FANETs). Due to the high mobility, it is difficult for each node in FANETs to obtain the global information. To solve this issue, we propose an adaptive delay-constrained routing with the aid of a stochastic model, which allows the senders to deliver the packets with only local information. We represent the problem in a mathematical form, where the effective transmission rate is viewed as the optimization objective and the link quality and end-to-end delay as the constraints. And, some mathematical tools are used to obtain the approximate solutions for the optimization problem. Before designing the routing scheme, the senders calculate the transition probability for its relay node by jointly considering local delay estimation and expected one-hop delay. Then, the sender transmits the packets to their relay node with transition probability. Finally, we prove the convergence of the proposed routing algorithm and analyse its performances. The simulation results show that the proposed routing policy can improve the network performance effectively in terms of throughput, loss rate, and end-to-end delay.


2018 ◽  
Vol 23 (5) ◽  
pp. 1293-1305 ◽  
Author(s):  
Jean-Daniel Medjo Me Biomo ◽  
Thomas Kunz ◽  
Marc St-Hilaire

2015 ◽  
Vol 2015 ◽  
pp. 1-9 ◽  
Author(s):  
Jing Gao ◽  
Changchuan Yin ◽  
Xi Han

Delay and throughput are important metrics for network performance. We analyze the end-to-end delay of cognitive radio ad hoc networks for two traffic models: backlogged and geometric, respectively. By modelling the primary users as a Poisson point process and the secondary network deploying multihop transmissions, we derive the closed-form expression for the end-to-end delay in secondary networks. Furthermore, we optimize the end-to-end delay in terms of the hop number and the secondary transmission probability, respectively. The range of the optimal hop number and the equation satisfied by the optimal transmission probability are obtained for backlogged source models. The equation met by the optimal hop number is presented for geometric source models.


Sign in / Sign up

Export Citation Format

Share Document