Most distributed wireless scheduling schemes that are provably efficient have been developed under the protocol model, which describes interference constraints in a binary form. However, the oversimplified interference model imposes fundamental limitations on the performance in practice. The signal-to-interference-plus-noise-ratio (SINR) based interference model is more accurate and realistic accounting for the cumulative nature of the interference signals, but its complex structure makes the design of scheduling schemes much more challenging. In this paper, we focus on the scheduling performance under the SINR model and develop random access scheduling schemes that are amenable to implement in a distributed fashion with only local information. We analytically show that they are provably efficient under the SINR model, and through simulations demonstrate that they empirically perform better than the theoretical performance bound.
|Title of host publication
|IEEE INFOCOM 2016 - 35th Annual IEEE International Conference on Computer Communications
|Institute of Electrical and Electronics Engineers Inc.
|Published - 2016 Jul 27
|35th Annual IEEE International Conference on Computer Communications, IEEE INFOCOM 2016 - San Francisco, United States
Duration: 2016 Apr 10 → 2016 Apr 14
|Proceedings - IEEE INFOCOM
|35th Annual IEEE International Conference on Computer Communications, IEEE INFOCOM 2016
|16/4/10 → 16/4/14
Bibliographical notePublisher Copyright:
© 2016 IEEE.
ASJC Scopus subject areas
- General Computer Science
- Electrical and Electronic Engineering