Abstract This paper aims to optimize the different network parameters in a distributed manner for delay-constrained flying ad hoc networks (FANETs) without the global network topology information. To this end,… Click to show full abstract
Abstract This paper aims to optimize the different network parameters in a distributed manner for delay-constrained flying ad hoc networks (FANETs) without the global network topology information. To this end, each Unmanned Aerial Vehicle (UAV) calculates the average interference level during a certain time period to indicate the channel states. Next, we formulate the distributed optimization problem as a utility maximization problem, which jointly optimizes power control, rate allocation and delay-constrained routing. To obtain a distributed solution, a dual method is proposed to eliminate the link capacity constraint, and a primal decomposition method is employed to decouple the end-to-end delay constraint. Built on these two methods above, a distributed optimization algorithm is proposed in this work by considering the estimated one-hop delay for each transmission, which only uses the local channel information to optimize the sub-problems and limit the end-to-end delay. Finally, we deduce the relationship between the primal and dual solutions to underpin the advantage of the proposed algorithm. Experiments on simulate (and real) data demonstrate that the proposed algorithm effectively can improve network performances in terms of energy efficiency, packet timeout ratio and network throughput.
               
Click one of the above tabs to view related content.