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

Achieving Per-Flow Satisfaction with Multi-Path D2D

Compartir
Ficheros
main_ADHOC_102162.pdf (1.370Mb)
Identificadores
URI: http://hdl.handle.net/20.500.12761/801
ISSN: 1570-8705
DOI: https://doi.org/10.1016/j.adhoc.2020.102162
Metadatos
Mostrar el registro completo del ítem
Autor(es)
Arribas, Edgar; Mancuso, Vincenzo
Fecha
2020-09-01
Resumen
Device-to-Device (D2D) communication allows for users placed in a cell to establish direct connections with each other using several connection modes. In this paper, we propose Multi-Path D2D (MPD2D), a mathematical optimization framework that accounts for the availability of D2D modes under the requirements dictated by a process of flow requests. MPD2D selects the combination of cellular and D2D links that boosts network performance as much as possible. We consider Underlay and Overlay as Inband D2D modes reusing cellular frequencies with scheduled resources and the Outband D2D mode exploiting WLAN frequencies and the 802.11 random access scheme to complement cellular resources. We model throughput, energy consumption, interference, and per-flow network requirements, so to define a network utility function that accounts for throughput and power efficiency. Moreover, we formulate a user satisfaction metric that accounts for the history of users within the cell. Integrating such a metric in a throughput optimization problem is lightweight yet very effective to drive towards almost complete fairness. Our optimization scheme is formulated as a Binary Non-Linear Program, which results in higher throughput performance in comparison to other state-of-the-art solutions we have tested. Finally, we propose two effective heuristics, whose performance is near-optimal, whereas their complexity scales polynomially with the number of users.
Compartir
Ficheros
main_ADHOC_102162.pdf (1.370Mb)
Identificadores
URI: http://hdl.handle.net/20.500.12761/801
ISSN: 1570-8705
DOI: https://doi.org/10.1016/j.adhoc.2020.102162
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!