An efficient distributed scheduling algorithm for relay-assisted mmWave backhaul networks

TL;DR

This paper introduces a new distributed scheduling algorithm for relay-assisted mmWave backhaul networks that efficiently manages traffic, adapts to dynamic demands, and closely approaches maximum network capacity.

Contribution

It presents a novel distributed scheduling algorithm specifically designed for relay-assisted mmWave backhaul networks with a tree topology, improving efficiency and adaptability.

Findings

Performance close to maximum traffic demand

Quick adaptation to dynamic traffic changes

Effective scheduling in relay-assisted mmWave networks

Abstract

In this paper, a novel distributed scheduling algorithm is proposed, which aims to efficiently schedule both the uplink and downlink backhaul traffic in the relay-assisted mmWave backhaul network with a tree topology. The handshaking of control messages, calculation of local schedules, and the determination of final valid schedule are all discussed. Simulation results show that the performance of the distributed algorithm can reach very close to the maximum traffic demand of the backhaul network, and it can also adapt to the dynamic traffic with sharp traffic demand change of small-cell BSs quickly and accurately.