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

Zhifeng He; Shiwen Mao; Theodore Ted S Rappaport

doi:10.1109/WCNC.2015.7127578

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

Zhifeng He, Shiwen Mao, Theodore Ted S Rappaport

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

Abstract

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.

Original language	English (US)
Title of host publication	2015 IEEE Wireless Communications and Networking Conference, WCNC 2015
Publisher	Institute of Electrical and Electronics Engineers Inc.
Pages	837-842
Number of pages	6
ISBN (Electronic)	9781479984060
DOIs	https://doi.org/10.1109/WCNC.2015.7127578
State	Published - Jun 17 2015
Event	2015 IEEE Wireless Communications and Networking Conference, WCNC 2015 - New Orleans, United States Duration: Mar 9 2015 → Mar 12 2015

Publication series

Name	2015 IEEE Wireless Communications and Networking Conference, WCNC 2015

Other

Other	2015 IEEE Wireless Communications and Networking Conference, WCNC 2015
Country/Territory	United States
City	New Orleans
Period	3/9/15 → 3/12/15

ASJC Scopus subject areas

Electrical and Electronic Engineering
Computer Networks and Communications
Computer Science Applications
Signal Processing

Access to Document

10.1109/WCNC.2015.7127578

Cite this

He, Z., Mao, S., & Rappaport, T. T. S. (2015). Minimum time length link scheduling under blockage and interference in 60GHz networks. In 2015 IEEE Wireless Communications and Networking Conference, WCNC 2015 (pp. 837-842). Article 7127578 (2015 IEEE Wireless Communications and Networking Conference, WCNC 2015). Institute of Electrical and Electronics Engineers Inc.. https://doi.org/10.1109/WCNC.2015.7127578

Minimum time length link scheduling under blockage and interference in 60GHz networks. / He, Zhifeng; Mao, Shiwen; Rappaport, Theodore Ted S.
2015 IEEE Wireless Communications and Networking Conference, WCNC 2015. Institute of Electrical and Electronics Engineers Inc., 2015. p. 837-842 7127578 (2015 IEEE Wireless Communications and Networking Conference, WCNC 2015).

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

He, Z, Mao, S & Rappaport, TTS 2015, Minimum time length link scheduling under blockage and interference in 60GHz networks. in 2015 IEEE Wireless Communications and Networking Conference, WCNC 2015., 7127578, 2015 IEEE Wireless Communications and Networking Conference, WCNC 2015, Institute of Electrical and Electronics Engineers Inc., pp. 837-842, 2015 IEEE Wireless Communications and Networking Conference, WCNC 2015, New Orleans, United States, 3/9/15. https://doi.org/10.1109/WCNC.2015.7127578

He Z, Mao S, Rappaport TTS. Minimum time length link scheduling under blockage and interference in 60GHz networks. In 2015 IEEE Wireless Communications and Networking Conference, WCNC 2015. Institute of Electrical and Electronics Engineers Inc. 2015. p. 837-842. 7127578. (2015 IEEE Wireless Communications and Networking Conference, WCNC 2015). doi: 10.1109/WCNC.2015.7127578

@inproceedings{f99aab9b5ef04244bf7d2650fd7afa83,

title = "Minimum time length link scheduling under blockage and interference in 60GHz networks",

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

author = "Zhifeng He and Shiwen Mao and Rappaport, {Theodore Ted S}",

note = "Publisher Copyright: {\textcopyright} 2015 IEEE.; 2015 IEEE Wireless Communications and Networking Conference, WCNC 2015 ; Conference date: 09-03-2015 Through 12-03-2015",

year = "2015",

month = jun,

day = "17",

doi = "10.1109/WCNC.2015.7127578",

language = "English (US)",

series = "2015 IEEE Wireless Communications and Networking Conference, WCNC 2015",

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

pages = "837--842",

booktitle = "2015 IEEE Wireless Communications and Networking Conference, WCNC 2015",

}

TY - GEN

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

AU - He, Zhifeng

AU - Mao, Shiwen

AU - Rappaport, Theodore Ted S

PY - 2015/6/17

Y1 - 2015/6/17

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

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

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

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

U2 - 10.1109/WCNC.2015.7127578

DO - 10.1109/WCNC.2015.7127578

M3 - Conference contribution

AN - SCOPUS:84938723200

T3 - 2015 IEEE Wireless Communications and Networking Conference, WCNC 2015

SP - 837

EP - 842

BT - 2015 IEEE Wireless Communications and Networking Conference, WCNC 2015

PB - Institute of Electrical and Electronics Engineers Inc.

T2 - 2015 IEEE Wireless Communications and Networking Conference, WCNC 2015

Y2 - 9 March 2015 through 12 March 2015

ER -

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

Abstract

Publication series

Other

ASJC Scopus subject areas

Access to Document

Other files and links

Fingerprint

Cite this