Distributed Construction of Fault Resilient High Capacity Wireless Networks with Bounded Node Degree

Multi-hop wireless networks using directional antennas are increasingly deployed for various applications such as wireless backhaul. In such systems, each node is equipped with a few directional antennas. Each antenna is exclusively used for establishing a point-to-point link with another antenna on some neighboring node. Thus in the constructed network, each node cannot have more links than its number of installed antennas, which defines a degree bound on all nodes. Hence, a practically important problem is to construct fault resilient and high capacity networks with bounded node degree. The main contribution of this paper is two-fold. First, we propose a localized algorithm for building fault resilient wireless networks that contain the path with highest possible capacity for every pair of nodes, not only in normal cases but also in the presence of any node/link failure. Second, we give an algorithm for building fault resilient wireless networks with the lowest possible degree bound.