Optimal Scheduling for Interference Mitigation by Range Information

This paper describes several algorithms for generating an optimal schedule for multiple access on a shared channel by utilizing range information in a fully connected network. We also provide detailed analysis for the proposed algorithms in terms of their complexity, convergence, and effect of non-idealities in the network. The performance of the proposed schemes are compared with non-aided methods to quantify the benefits of using the range information in the communication. We argue that the proposed techniques yield significant benefits as the number of nodes in the network increases. We provide simulation results in support of the claim. The proposed methods indicate that the throughput can be increased on average by 3-10 times for typical network configurations.
QS 2016