An efficient algorithm for dense network flow maximization with multihop backhauling and NFPs

Abstract

Network densification is promising to achieve higher data rates and higher network capacity, while causing new backhauling challenges especially when the network is highly dense. The flexible and cost efficient backhauling solutions are among the most concerning issues. Due to the high density of the next generation networks, the terrestrial wired backhauling approaches are not cost efficient. Having this challenge in hand, and recognizing the advantages of the networked flying platform (NFP)-enabled communications, we address in this paper the problem of wireless multi-hop backhauling of small cells (SC) using NFP hubs. We propose an efficient iterative heuristic algorithm that jointly optimize the SCNFP association and the SC-SC formation in order to maximize the total backhaul flow, with practical constraints in consideration, such as backhaul reliability, hardware and processing limitations in the SCs and the NFPs. Numerical simulations show that the proposed algorithm can achieve close to optimal solution at a much faster convergence rate. - 2019 IEEE.