Minimum time length link scheduling under blockage and interference in 60GHz networks

In this paper we tackle the problem of minimum time length link scheduling in 60GHz wireless networks, under both traffic demand and Signal to Interference and Noise Ratio (SINR) constraints. A constrained Binary Integer Programming (BIP) problem is formulated by incorporating a flexible interference model for directional transmissions and a Markov chain based blockage model. We then propose two effective solution algorithms, including a Greedy Algorithm (GA) that finds the maximum instant throughput for each time slot, and a Column Generation based algorithm (CG) that iteratively improves the current link schedule. The performance of the proposed algorithms is validated with simulations.