Link scheduling for mmWave WMN backhaul

Jorma Kilpi, Kari Seppänen, Tapio Suihko, Jori Paananen, David T. Chen, Pekka Wainio

Research output: Chapter in Book/Report/Conference proceedingConference article in proceedingsScientificpeer-review

2 Citations (Scopus)

Abstract

A new link scheduling approach for millimeter wave wireless mesh network is presented. The proposed link scheduling solution is designed to work together with a multiple overlapping spanning trees-based routing schemes on a mesh network topology. The link schedule computation will minimize the end-to-end delay along a subset of shortest-hop paths from non-gateway nodes to a gateway node of the mesh, where each path is obtained from one of the spanning trees. The link schedule itself consists of cyclic repetition of a vector of transmission sets, where a transmission set is a maximal collection of links that can be active simultaneously. Simultaneous activity of the links is limited by radio interference and by shared resources. Algorithms for the computation of the link schedule are provided and computational issues of the algorithms are discussed.
Original languageEnglish
Title of host publication2017 IEEE International Conference on Communications, ICC 2017
EditorsMerouane Debbah, David Gesbert, Abdelhamid Mellouk
PublisherInstitute of Electrical and Electronic Engineers IEEE
ISBN (Electronic)9781467389990
ISBN (Print)978-1-4673-8999-0, 978-1-4673-9000-2
DOIs
Publication statusPublished - 28 Jul 2017
MoE publication typeA4 Article in a conference publication
EventIEEE International Conference on Communications, ICC 2017 - Paris, France
Duration: 21 May 201725 May 2017

Conference

ConferenceIEEE International Conference on Communications, ICC 2017
Abbreviated titleICC 2017
CountryFrance
CityParis
Period21/05/1725/05/17

Fingerprint

Wireless mesh networks (WMN)
Telecommunication links
Scheduling
Radio interference
Millimeter waves
Topology

Cite this

Kilpi, J., Seppänen, K., Suihko, T., Paananen, J., Chen, D. T., & Wainio, P. (2017). Link scheduling for mmWave WMN backhaul. In M. Debbah, D. Gesbert, & A. Mellouk (Eds.), 2017 IEEE International Conference on Communications, ICC 2017 [7996621] Institute of Electrical and Electronic Engineers IEEE. https://doi.org/10.1109/ICC.2017.7996621
Kilpi, Jorma ; Seppänen, Kari ; Suihko, Tapio ; Paananen, Jori ; Chen, David T. ; Wainio, Pekka. / Link scheduling for mmWave WMN backhaul. 2017 IEEE International Conference on Communications, ICC 2017. editor / Merouane Debbah ; David Gesbert ; Abdelhamid Mellouk. Institute of Electrical and Electronic Engineers IEEE, 2017.
@inproceedings{1521098414ac40c29db11110f7ebd23a,
title = "Link scheduling for mmWave WMN backhaul",
abstract = "A new link scheduling approach for millimeter wave wireless mesh network is presented. The proposed link scheduling solution is designed to work together with a multiple overlapping spanning trees-based routing schemes on a mesh network topology. The link schedule computation will minimize the end-to-end delay along a subset of shortest-hop paths from non-gateway nodes to a gateway node of the mesh, where each path is obtained from one of the spanning trees. The link schedule itself consists of cyclic repetition of a vector of transmission sets, where a transmission set is a maximal collection of links that can be active simultaneously. Simultaneous activity of the links is limited by radio interference and by shared resources. Algorithms for the computation of the link schedule are provided and computational issues of the algorithms are discussed.",
author = "Jorma Kilpi and Kari Sepp{\"a}nen and Tapio Suihko and Jori Paananen and Chen, {David T.} and Pekka Wainio",
year = "2017",
month = "7",
day = "28",
doi = "10.1109/ICC.2017.7996621",
language = "English",
isbn = "978-1-4673-8999-0",
editor = "Merouane Debbah and David Gesbert and Abdelhamid Mellouk",
booktitle = "2017 IEEE International Conference on Communications, ICC 2017",
publisher = "Institute of Electrical and Electronic Engineers IEEE",
address = "United States",

}

Kilpi, J, Seppänen, K, Suihko, T, Paananen, J, Chen, DT & Wainio, P 2017, Link scheduling for mmWave WMN backhaul. in M Debbah, D Gesbert & A Mellouk (eds), 2017 IEEE International Conference on Communications, ICC 2017., 7996621, Institute of Electrical and Electronic Engineers IEEE, IEEE International Conference on Communications, ICC 2017, Paris, France, 21/05/17. https://doi.org/10.1109/ICC.2017.7996621

Link scheduling for mmWave WMN backhaul. / Kilpi, Jorma; Seppänen, Kari; Suihko, Tapio; Paananen, Jori; Chen, David T.; Wainio, Pekka.

2017 IEEE International Conference on Communications, ICC 2017. ed. / Merouane Debbah; David Gesbert; Abdelhamid Mellouk. Institute of Electrical and Electronic Engineers IEEE, 2017. 7996621.

Research output: Chapter in Book/Report/Conference proceedingConference article in proceedingsScientificpeer-review

TY - GEN

T1 - Link scheduling for mmWave WMN backhaul

AU - Kilpi, Jorma

AU - Seppänen, Kari

AU - Suihko, Tapio

AU - Paananen, Jori

AU - Chen, David T.

AU - Wainio, Pekka

PY - 2017/7/28

Y1 - 2017/7/28

N2 - A new link scheduling approach for millimeter wave wireless mesh network is presented. The proposed link scheduling solution is designed to work together with a multiple overlapping spanning trees-based routing schemes on a mesh network topology. The link schedule computation will minimize the end-to-end delay along a subset of shortest-hop paths from non-gateway nodes to a gateway node of the mesh, where each path is obtained from one of the spanning trees. The link schedule itself consists of cyclic repetition of a vector of transmission sets, where a transmission set is a maximal collection of links that can be active simultaneously. Simultaneous activity of the links is limited by radio interference and by shared resources. Algorithms for the computation of the link schedule are provided and computational issues of the algorithms are discussed.

AB - A new link scheduling approach for millimeter wave wireless mesh network is presented. The proposed link scheduling solution is designed to work together with a multiple overlapping spanning trees-based routing schemes on a mesh network topology. The link schedule computation will minimize the end-to-end delay along a subset of shortest-hop paths from non-gateway nodes to a gateway node of the mesh, where each path is obtained from one of the spanning trees. The link schedule itself consists of cyclic repetition of a vector of transmission sets, where a transmission set is a maximal collection of links that can be active simultaneously. Simultaneous activity of the links is limited by radio interference and by shared resources. Algorithms for the computation of the link schedule are provided and computational issues of the algorithms are discussed.

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

U2 - 10.1109/ICC.2017.7996621

DO - 10.1109/ICC.2017.7996621

M3 - Conference article in proceedings

SN - 978-1-4673-8999-0

SN - 978-1-4673-9000-2

BT - 2017 IEEE International Conference on Communications, ICC 2017

A2 - Debbah, Merouane

A2 - Gesbert, David

A2 - Mellouk, Abdelhamid

PB - Institute of Electrical and Electronic Engineers IEEE

ER -

Kilpi J, Seppänen K, Suihko T, Paananen J, Chen DT, Wainio P. Link scheduling for mmWave WMN backhaul. In Debbah M, Gesbert D, Mellouk A, editors, 2017 IEEE International Conference on Communications, ICC 2017. Institute of Electrical and Electronic Engineers IEEE. 2017. 7996621 https://doi.org/10.1109/ICC.2017.7996621