Minimum Time Length Scheduling under Blockage and Interference in Multi-Hop mmWave Networks

We study the problem of minimizing the scheduling time length to serve users´ traffic demand by link scheduling in multi-hop mmWave wireless networks. We formulate a constrained Binary Integer Programming (BIP) problem incorporating a flexible interference model for directional transmissions and a Markov chain based blockage model. Since the problem is NP hard, we propose a heuristic algorithm with greatly reduced complexity, which first finds the optimal streaming path for each data flow and then maximizes the instant network throughput by optimizing the link scheduling at each time slot. The performance of the heuristic algorithm is validated with simulations.