Link scheduling for mmWave WMN backhaul
| Autor: | Jori Paananen, Jorma Kilpi, Kari Seppänen, Pekka Wainio, Tapio Suihko, David Chen |
|---|---|
| Přispěvatelé: | Debbah, Merouane, Gesbert, David, Mellouk, Abdelhamid |
| Jazyk: | angličtina |
| Rok vydání: | 2017 |
| Předmět: |
Schedule
Spanning tree ta213 Wireless mesh network business.industry Computer science Distributed computing 05 social sciences Mesh networking ComputerSystemsOrganization_COMPUTER-COMMUNICATIONNETWORKS 050801 communication & media studies 020206 networking & telecommunications 02 engineering and technology Shared mesh Scheduling (computing) Backhaul (telecommunications) 0508 media and communications Default gateway 0202 electrical engineering electronic engineering information engineering Switched mesh business Computer Science::Operating Systems Computer network |
| Zdroj: | 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, IEEE Institute of Electrical and Electronic Engineers, IEEE International Conference on Communications, IEEE International Conference on Communications, ICC 2017, Paris, France, 21/05/17 . https://doi.org/10.1109/ICC.2017.7996621 ICC |
| DOI: | 10.1109/ICC.2017.7996621 |
| Popis: | 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. |
| Databáze: | OpenAIRE |
| Externí odkaz: |
|