• español
    • English
  • Login
  • español 
    • español
    • English
  • Tipos de Publicaciones
    • bookbook partconference objectdoctoral thesisjournal articlemagazinemaster thesispatenttechnical documentationtechnical report
Ver ítem 
  •   IMDEA Networks Principal
  • Ver ítem
  •   IMDEA Networks Principal
  • Ver ítem
JavaScript is disabled for your browser. Some features of this site may not work without it.

Optimal and approximation algorithms for joint routing and scheduling in millimeter-wave cellular networks

Compartir
Ficheros
Optimal_and_Approximation_Algorithms.pdf (7.770Mb)
Identificadores
URI: http://hdl.handle.net/20.500.12761/835
ISSN: 1063-6692
DOI: DOI: 10.1109/TNET.2020.3006312
Metadatos
Mostrar el registro completo del ítem
Autor(es)
Yuan, Dingwen; Lin, Hsuan-Yin; Widmer, Joerg; Hollick, Matthias
Fecha
2020-10
Resumen
Millimeter-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.
Compartir
Ficheros
Optimal_and_Approximation_Algorithms.pdf (7.770Mb)
Identificadores
URI: http://hdl.handle.net/20.500.12761/835
ISSN: 1063-6692
DOI: DOI: 10.1109/TNET.2020.3006312
Metadatos
Mostrar el registro completo del ítem

Listar

Todo IMDEA NetworksPor fecha de publicaciónAutoresTítulosPalabras claveTipos de contenido

Mi cuenta

Acceder

Estadísticas

Ver Estadísticas de uso

Difusión

emailContacto person Directorio wifi Eduroam rss_feed Noticias
Iniciativa IMDEA Sobre IMDEA Networks Organización Memorias anuales Transparencia
Síguenos en:
Comunidad de Madrid

UNIÓN EUROPEA

Fondo Social Europeo

UNIÓN EUROPEA

Fondo Europeo de Desarrollo Regional

UNIÓN EUROPEA

Fondos Estructurales y de Inversión Europeos

© 2021 IMDEA Networks. | Declaración de accesibilidad | Política de Privacidad | Aviso legal | Política de Cookies - Valoramos su privacidad: ¡este sitio no utiliza cookies!