Interference Hypergraph-Based 3D Matching Resource Allocation Protocol for NOMA-V2X Networks

Abstract

Vehicle-to-everything (V2X) communications are regarded as the key technology in future vehicular networks due to its ability in providing efficient and reliable massive connections, improving traffic efficiency and safety, and supporting in-vehicle entertainment and working. Recently, non-orthogonal multiple access (NOMA), as a promising solution in the fifth-generation (5G) mobile communication systems, has drawn much attention because it can significantly improve the network throughput and lower the accessing and transmission latency to meet the quality-of-service (QoS) requirements of many 5G-enabled applications. Noticing these, in this paper, we consider a device-to-device (D2D)-enhanced V2X network, in which NOMA is introduced to increase the capacity. In our studied NOMA-V2X system, except for the NOMA-based intra-group resource reuse, the D2D-enabled resource sharing based on spatial reuse among all the V2X communication groups is also permitted through centralized resource management, leading to a significantly improved network performance but a more complicated and challenging interference scenario. In order to efficiently manage the interference and allocate the resource in the NOMA-V2X network, we create a weighted 3-partite interference hypergraph (IHG) to imitate the complex interference environment in our studied scenario. Then, with the help of this hypergraph, we make another step to put forward an IHG-based 3-dimensional matching (IHG-3DM) resource allocation protocol with a greedy 3DM algorithm and an iterative 3DM algorithm. As a consequence, the network throughput is significantly improved with the help of our proposed IHG-3DM resource allocation protocol for the investigated NOMAintegrated V2X communications, which is verified by the simulation results.

On 5G-V2X Use Cases and Enabling Technologies: A Comprehensive Survey

“…The authors ensure the quality of service of vehicles with poor channel conditions using bisection-based power allocation algorithm. As part of building the NOMA-V2X architecture, [122], [123] propose combining NOMA and resource sharing based on spatial reuse D2D to improve notably the network performance, spectrum efficiency, transmission efficiency and network throughput. [122] tackles the interference and resource allocation problem by creating a weighted interference hypergraph-based 3-dimensional matching resource allocation protocol.…”

“…As part of building the NOMA-V2X architecture, [122], [123] propose combining NOMA and resource sharing based on spatial reuse D2D to improve notably the network performance, spectrum efficiency, transmission efficiency and network throughput. [122] tackles the interference and resource allocation problem by creating a weighted interference hypergraph-based 3-dimensional matching resource allocation protocol. According to [107], NOMA can help enhance the capacity of V2X networks.…”

Graph-Based Resource Allocation for Integrated Space and Terrestrial Communications

“…The proposed solution shows increased V2I total throughput for the high SINR levels at the V2Vs, and so exhibits resilience in fast fading. The study [ 56 ] explores a NOMA-based vehicular communications scenario with channel allocation between V2Is, broadcast V2Vs (a group of V2Vs where one of them transmits messages to all the others), and standard V2Vs, each of these types forming separate communication groups (the latter two being underlay users of the V2I spectrum). Two kinds of interference are considered—between each group, and within the groups themselves.…”

“…The main challenge, then, is to define a graph which corresponds well to the real-world relationships between the network nodes and the available frequency and power resources. On the other hand, introducing new modes of communication (such as NOMA or FD [ 60 , 62 , 63 ]) or application scenarios (such as V2V and V2I [ 55 , 56 , 57 ]) can expand the graph’s representation potency. Most of the reviewed methods utilize interference or bipartite grpahs due to their emphasis, either on the mutual influence between CUEs and DUEs, or on the allocation relationships between the nodes and the channels.…”

Distance-Based Resource Allocation for Vehicle-to-Pedestrian Safety Communication

“…Interference is usually taken as a metric to define the edges between the vertices in a graph. Interference hypergraph-based 3D matching resource allocation for V2X [17] using a weighted 3-partite interference hypergraph based on greedy and iterative matching, has been shown to improve the network throughput.…”