Queue-affectance-based scheduling in multi-hop wireless networks under SINR interference constraints

Changhee Joo; Myeongseon Shin

doi:10.1109/INFOCOM.2016.7524515

Queue-affectance-based scheduling in multi-hop wireless networks under SINR interference constraints

Changhee Joo, Myeongseon Shin

Research output: Chapter in Book/Report/Conference proceeding › Conference contribution

5 Citations (Scopus)

Abstract

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.

Original language	English
Title of host publication	IEEE INFOCOM 2016 - 35th Annual IEEE International Conference on Computer Communications
Publisher	Institute of Electrical and Electronics Engineers Inc.
ISBN (Electronic)	9781467399531
DOIs	https://doi.org/10.1109/INFOCOM.2016.7524515
Publication status	Published - 2016 Jul 27
Externally published	Yes
Event	35th Annual IEEE International Conference on Computer Communications, IEEE INFOCOM 2016 - San Francisco, United States Duration: 2016 Apr 10 → 2016 Apr 14

Publication series

Name	Proceedings - IEEE INFOCOM
Volume	2016-July
ISSN (Print)	0743-166X

Conference

Conference	35th Annual IEEE International Conference on Computer Communications, IEEE INFOCOM 2016
Country/Territory	United States
City	San Francisco
Period	16/4/10 → 16/4/14

Bibliographical note

Publisher Copyright:
© 2016 IEEE.

ASJC Scopus subject areas

Computer Science(all)
Electrical and Electronic Engineering

Access to Document

10.1109/INFOCOM.2016.7524515

Cite this

Joo, C., & Shin, M. (2016). Queue-affectance-based scheduling in multi-hop wireless networks under SINR interference constraints. In IEEE INFOCOM 2016 - 35th Annual IEEE International Conference on Computer Communications Article 7524515 (Proceedings - IEEE INFOCOM; Vol. 2016-July). Institute of Electrical and Electronics Engineers Inc.. https://doi.org/10.1109/INFOCOM.2016.7524515

Queue-affectance-based scheduling in multi-hop wireless networks under SINR interference constraints. / Joo, Changhee; Shin, Myeongseon.
IEEE INFOCOM 2016 - 35th Annual IEEE International Conference on Computer Communications. Institute of Electrical and Electronics Engineers Inc., 2016. 7524515 (Proceedings - IEEE INFOCOM; Vol. 2016-July).

Research output: Chapter in Book/Report/Conference proceeding › Conference contribution

Joo, C & Shin, M 2016, Queue-affectance-based scheduling in multi-hop wireless networks under SINR interference constraints. in IEEE INFOCOM 2016 - 35th Annual IEEE International Conference on Computer Communications., 7524515, Proceedings - IEEE INFOCOM, vol. 2016-July, Institute of Electrical and Electronics Engineers Inc., 35th Annual IEEE International Conference on Computer Communications, IEEE INFOCOM 2016, San Francisco, United States, 16/4/10. https://doi.org/10.1109/INFOCOM.2016.7524515

@inproceedings{77512c7959e647f9a8b8b8562d8732a7,

title = "Queue-affectance-based scheduling in multi-hop wireless networks under SINR interference constraints",

abstract = "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.",

author = "Changhee Joo and Myeongseon Shin",

note = "Publisher Copyright: {\textcopyright} 2016 IEEE.; 35th Annual IEEE International Conference on Computer Communications, IEEE INFOCOM 2016 ; Conference date: 10-04-2016 Through 14-04-2016",

year = "2016",

month = jul,

day = "27",

doi = "10.1109/INFOCOM.2016.7524515",

language = "English",

series = "Proceedings - IEEE INFOCOM",

publisher = "Institute of Electrical and Electronics Engineers Inc.",

booktitle = "IEEE INFOCOM 2016 - 35th Annual IEEE International Conference on Computer Communications",

}

TY - GEN

T1 - Queue-affectance-based scheduling in multi-hop wireless networks under SINR interference constraints

AU - Joo, Changhee

AU - Shin, Myeongseon

PY - 2016/7/27

Y1 - 2016/7/27

N2 - 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.

AB - 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.

UR - http://www.scopus.com/inward/record.url?scp=84983349811&partnerID=8YFLogxK

U2 - 10.1109/INFOCOM.2016.7524515

DO - 10.1109/INFOCOM.2016.7524515

M3 - Conference contribution

AN - SCOPUS:84983349811

T3 - Proceedings - IEEE INFOCOM

BT - IEEE INFOCOM 2016 - 35th Annual IEEE International Conference on Computer Communications

PB - Institute of Electrical and Electronics Engineers Inc.

T2 - 35th Annual IEEE International Conference on Computer Communications, IEEE INFOCOM 2016

Y2 - 10 April 2016 through 14 April 2016

ER -

Queue-affectance-based scheduling in multi-hop wireless networks under SINR interference constraints

Abstract

Publication series

Conference

Bibliographical note

ASJC Scopus subject areas

Access to Document

Other files and links

Fingerprint

Cite this