Design of survivable wireless backhaul networks with reliability considerations

Abstract

The ever-increasing need for stable, seamless, high-speed connectivity places an enormous burden on the communications infrastructure, comprised of access, backhaul, and core networks. Furthermore, recent advances in access technologies shift the capacity bottleneck towards the newly popularized wireless backhaul network, which is also susceptible to different types of failures. In this paper, a wireless backhaul network design under reliability and survivability constraints is formulated as a mixed integer linear programming (MILP) model to determine the minimum cost bandwidth assignment of wireless links. We developed an accelerated Benders decomposition algorithm to solve this model. Extensive computational experiments show the accuracy of the model proposed to tackle the problem and the efficiency of the solving method, particularly in larger networks.