Cargando…

Graph-Based Resource Allocation for Integrated Space and Terrestrial Communications

Resource allocation (RA) has always had a prominent place in wireless communications research due to its significance for network throughput maximization, and its inherent complexity. Concurrently, graph-based solutions for RA have also grown in importance, providing opportunities for higher through...

Descripción completa

Detalles Bibliográficos
Autores principales: Ivanov, Antoni, Tonchev, Krasimir, Poulkov, Vladimir, Manolova, Agata, Neshov, Nikolay N.
Formato: Online Artículo Texto
Lenguaje:English
Publicado: MDPI 2022
Materias:
Acceso en línea:https://www.ncbi.nlm.nih.gov/pmc/articles/PMC9371046/
https://www.ncbi.nlm.nih.gov/pubmed/35957333
http://dx.doi.org/10.3390/s22155778
Descripción
Sumario:Resource allocation (RA) has always had a prominent place in wireless communications research due to its significance for network throughput maximization, and its inherent complexity. Concurrently, graph-based solutions for RA have also grown in importance, providing opportunities for higher throughput and efficiency due to their representational capabilities, as well as challenges for realizing scalable algorithms. This article presents a comprehensive review and analysis of graph-based RA methods in three major wireless network types: cellular homogeneous and heterogeneous, device-to-device, and cognitive radio networks. The main design characteristics, as well as directions for future research, are provided for each of these categories. On the basis of this review, the concept of Graph-based Resource allocation for Integrated Space and Terrestrial communications (GRIST) is proposed. It describes the inter-connectivity and coexistence of various terrestrial and non-terrestrial networks via a hypergraph and its attributes. In addition, the implementation challenges of GRIST are explained in detail. Finally, to complement GRIST, a scheme for determining the appropriate balance between different design considerations is introduced. It is described via a simplified complete graph-based design process for resource management algorithms.