Time cumulative complexity modeling and analysis for space-based networks

Du, Jun; Jiang, Chunxiao; Yu, Shui; Ren, Yong

doi:10.1109/icc.2016.7511259

Cited by 5 publications

(3 citation statements)

References 16 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…Then, dynamic and intelligent multiple access needs to be implemented through CR methods (discussed in Section 6 ). Several noteworthy works [ 44 , 45 , 46 , 47 , 48 , 49 ] have expanded the scope of RA methods for communications between UAV and satellite nodes, as well as their connection to terrestrial Het-Nets. The presented graph models are hereby briefly reviewed, and the relevant challenges described.…”

Section: Graph-based Ra In Cellular Homogeneous and Het-netsmentioning

confidence: 99%

“…The presented graph models are hereby briefly reviewed, and the relevant challenges described. Reliable connectivity between satellite nodes, considering the temporal changes due to their varying movement velocities, is considered in [ 44 , 45 , 46 , 47 ]. The creation of edges is determined by the duration of direct visibility between two communication nodes and their link latency.…”

Section: Graph-based Ra In Cellular Homogeneous and Het-netsmentioning

confidence: 99%

“…The creation of edges is determined by the duration of direct visibility between two communication nodes and their link latency. Network topology is adapted in time by the vertices’ attributes, according to the shortest path length and relevance (number of shortest paths going through a vertex) [ 44 ]. Alternatively, an RA solution is proposed in [ 45 ] which constructs the time-varying graph using two types of edges.…”

Section: Graph-based Ra In Cellular Homogeneous and Het-netsmentioning

confidence: 99%

See 2 more Smart Citations

Graph-Based Resource Allocation for Integrated Space and Terrestrial Communications

Ivanov

Tonchev

Poulkov

et al. 2022

Sensors

View full text Add to dashboard Cite

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.

show abstract