Mostrar el registro sencillo del ítem

dc.contributor.authorYuan, Dingwen
dc.contributor.authorLin, Hsuan-Yin
dc.contributor.authorWidmer, Joerg 
dc.contributor.authorHollick, Matthias
dc.date.accessioned2021-07-13T09:43:08Z
dc.date.available2021-07-13T09:43:08Z
dc.date.issued2020-10
dc.identifier.issn1063-6692
dc.identifier.urihttp://hdl.handle.net/20.500.12761/835
dc.description.abstractMillimeter-wave (mmWave) communication is a promising technology to cope with the exponential increase in 5G data traffic. Such networks typically require a very dense deployment of base stations. A subset of those, so-called macro base stations, feature high-bandwidth connection to the core network, while relay base stations are connected wirelessly. To reduce cost and increase flexibility, wireless backhauling is needed to connect both macro to relay as well as relay to relay base stations. The characteristics of mmWave communication mandates new paradigms for routing and scheduling. The paper investigates scheduling algorithms under different interference models. To showcase the scheduling methods, we study the maximum throughput fair scheduling problem. Yet the proposed algorithms can be easily extended to other problems. For a fullduplex network under the no interference model, we propose an efficient polynomial-time scheduling method, the scheduleoriented optimization. Further, we prove that the problem is NPhard if we assume pairwise link interference model or halfduplex radios. Fractional weighted coloring based approximation algorithms are proposed for these NP-hard cases. Moreover, the approximation algorithm parallel data stream scheduling is proposed for the case of half-duplex network under the no interference model. It has better approximation ratio than the fractional weighted coloring based algorithms and even attains the optimal solution for the special case of uniform orthogonal backhaul networks.
dc.language.isoeng
dc.publisherCo-sponsored by the IEEE Communications Society, the IEEE Computer Society, and the ACM with its Special Interest Group on Data Communications (SIGCOMM)
dc.titleOptimal and approximation algorithms for joint routing and scheduling in millimeter-wave cellular networksen
dc.typejournal article
dc.journal.titleIEEE/ACM Transactions on Networking
dc.rights.accessRightsopen access
dc.volume.number28
dc.issue.number5
dc.identifier.doiDOI: 10.1109/TNET.2020.3006312
dc.page.final2202
dc.page.initial2188
dc.description.statuspub
dc.eprint.idhttp://eprints.networks.imdea.org/id/eprint/2169


Ficheros en el ítem

Este ítem aparece en la(s) siguiente(s) colección(ones)

Mostrar el registro sencillo del ítem