A Novel Link Scheduling Algorithm for Spatial Reuse in Wireless Networks

In this paper, we study the problem of one-slot scheduling under the exact SINR interference model, which aims to find a maximum subset of links to be scheduled simultaneously in one slot. We present a novel link scheduling algorithm (DIVISION) to give an effect solution for link scheduling. Algorithm DIVISION seeks to schedule the wireless links by their geometric locations, which provides a new angle to explore the spatial reuse in wireless networks. Combined with numerical results, it is pointed out that the proposed algorithm has the same complexity as the typical algorithm GOW* which is also based on space scheduling, but yields potential better performance of the network throughput.