Review Article

A Survey on Radio Resource Allocation for V2X Communication

Table 1

Comparison of the existing underlaying RBs sharing-based user pairing V2X services.

Ref.Unicast/broadcastObjectivesScenariosUser typesAllocation constraintsPower control/allocationAllocation processMethods/theoryRB sharing

[18]BroadcastIncrease throughputRoadV2V-UEs
V2I-UEs
PFOrthogonal RBs are allocated to each user typeGraph theory1 V2V-UE
1 V2I-UE
[19]UnicastMaximize sum rate fairness; minimize latency reliabilityUrbanC-UEs
V-UEs
OP
SINR
Latency
PCOrthogonal RBs are allocated to each user typeAn interior point method
Hungarian algorithm
1 C-UE
1 V-UE
[20]UnicastMaximize sum rate fairness; minimize latency reliabilityUrbanC-UEs
V-UEs
OP
SINR
Latency
PAOrthogonal RBs are allocated to each user typeKarush–Kuhn–Tucker theory
Dual decomposition method
Hungarian algorithm
1 C-UE
1 V-UE
[21]UnicastMaximize sum rate fairness; minimize latency reliabilityUrbanC-UEs
V-UEs
OP
SINR
Latency
PAOrthogonal RBs are allocated to C-UEs; nonorthogonal RBs are allocated to V-UEsPerron–Frobenius theory
Interior point method
1 C-UE
N V-UEs
[22]UnicastMaximize sum rate fairness; minimize latency reliabilityUrbanC-UEs
V-UEs
OP
SINR
Latency
PAOrthogonal RBs are allocated to C-UEs; nonorthogonal RBs are allocated to V-UEsMatching theory
Interior point method
1 C-UE
N V-UEs
[23]BroadcastMaximize the number of concurrent V2V transmissionsUrban freewayV-UEsSINRNonorthogonal RBs are allocated to V-UEsPerron–Frobenius theoryN V-UEs
[24]UnicastMaximize throughput; minimize latencyUrbanC-UEs
Safety and nonsafety V-UEs
SINR
Latency
Orthogonal RBs are allocated to each user typeHypergraph matching theory1 C-UE
1 safety
V-UE
1 nonsafety V-UE
[25]UnicastMaximize throughput reliabilityMultilane freewayV2V-UEs
V2I-UEs
OPPAOrthogonal RBs are allocated to each user typeHungarian method1 V2V-UE
1 V2I-UE
[26]UnicastReliability; maximize the ergodic capacityMulti-lane freewayV2V-UEs
V2I-UEs
OPPAOrthogonal RBs are allocated to each user typeHungarian method1 V2V-UE
1 V2I-UE
[27]BroadcastMaximize the C-UEs information rate; guarantee reliability/latency requirement of V-UEsUrbanC-UEs
V-UEs
Latency
OP
SINR
PAOrthogonal RBs are allocated to each user typeLagrange dual decomposition method
Binary search method
Subgradient iteration method
1 C-UE
1 V-UE
[28]UnicastMaximize throughput (C-UEs/nonsafety V-UEs); guarantee QoS demand (W-UEs/safety V-UEs)FreewayW-UEs
C-UEs
Safety and nonsafety V-UEs
SINROrthogonal RBs are allocated to each user typeKuhn–Munkres algorithm
Gale–Shapley algorithm
1 C-UE
1 nonsafety V-UE
[29]UnicastMaximize the total throughput for C-UEs and V-UEsFreewayW-UEs
C-UEs
Safety and nonsafety V-UEs
SINROrthogonal RBs are allocated to each user typeAn interior point method
Kuhn–Munkres method
1 C-UE
1 nonsafety V-UE
[30]UnicastMaximize V2I-UEs sum rate; guarantee V2V-UEs reliability requirementFreewayV2I-UEs
V2V-UEs
SINR
Buffer size
Packet delay
Orthogonal RBs are allocated to each user type1 V2I-UE
1 V2V-UE
[31]UnicastMaximize V2I-UEs sum rate; guarantee V2V-UEs reliability requirementFreewayV2I-UEs
V2V-UEs
SINR
Buffer size
Packet delay
PCOrthogonal RBs are allocated to each user type1 V2I-UE
1 V2V-UE
[32]UnicastMaximize C-UEs sum rate; guarantee V-UEs reliability requirementFreewayGBR C-UEs
NGBR C-UEs
V-UEs
PDR
SINR
Buffer size
Packet delay
Orthogonal RBs are allocated to each user type1 C-UE
1 V-UE
[33]UnicastMaximize sum rate and respect constraint delay of C-UEs; guarantee V-UEs reliability and latencyFreewayC-UEs
Safety V-UE
Nonsafety V-UE
PDOR
SINR
Delay
Orthogonal RBs are allocated to each user type1 C-UE
1 safety V-UE
1 nonsafety V-UE