|
Ref. | Unicast/broadcast | Objectives | Scenarios | User types | Allocation constraints | Power control/allocation | Allocation process | Methods/theory | RB sharing |
|
[18] | Broadcast | Increase throughput | Road | V2V-UEs V2I-UEs | PF | — | Orthogonal RBs are allocated to each user type | Graph theory | 1 V2V-UE 1 V2I-UE |
[19] | Unicast | Maximize sum rate fairness; minimize latency reliability | Urban | C-UEs V-UEs | OP SINR Latency | PC | Orthogonal RBs are allocated to each user type | An interior point method Hungarian algorithm | 1 C-UE 1 V-UE |
[20] | Unicast | Maximize sum rate fairness; minimize latency reliability | Urban | C-UEs V-UEs | OP SINR Latency | PA | Orthogonal RBs are allocated to each user type | Karush–Kuhn–Tucker theory Dual decomposition method Hungarian algorithm | 1 C-UE 1 V-UE |
[21] | Unicast | Maximize sum rate fairness; minimize latency reliability | Urban | C-UEs V-UEs | OP SINR Latency | PA | Orthogonal RBs are allocated to C-UEs; nonorthogonal RBs are allocated to V-UEs | Perron–Frobenius theory Interior point method | 1 C-UE N V-UEs |
[22] | Unicast | Maximize sum rate fairness; minimize latency reliability | Urban | C-UEs V-UEs | OP SINR Latency | PA | Orthogonal RBs are allocated to C-UEs; nonorthogonal RBs are allocated to V-UEs | Matching theory Interior point method | 1 C-UE N V-UEs |
[23] | Broadcast | Maximize the number of concurrent V2V transmissions | Urban freeway | V-UEs | SINR | — | Nonorthogonal RBs are allocated to V-UEs | Perron–Frobenius theory | N V-UEs |
[24] | Unicast | Maximize throughput; minimize latency | Urban | C-UEs Safety and nonsafety V-UEs | SINR Latency | — | Orthogonal RBs are allocated to each user type | Hypergraph matching theory | 1 C-UE 1 safety V-UE 1 nonsafety V-UE |
[25] | Unicast | Maximize throughput reliability | Multilane freeway | V2V-UEs V2I-UEs | OP | PA | Orthogonal RBs are allocated to each user type | Hungarian method | 1 V2V-UE 1 V2I-UE |
[26] | Unicast | Reliability; maximize the ergodic capacity | Multi-lane freeway | V2V-UEs V2I-UEs | OP | PA | Orthogonal RBs are allocated to each user type | Hungarian method | 1 V2V-UE 1 V2I-UE |
[27] | Broadcast | Maximize the C-UEs information rate; guarantee reliability/latency requirement of V-UEs | Urban | C-UEs V-UEs | Latency OP SINR | PA | Orthogonal RBs are allocated to each user type | Lagrange dual decomposition method Binary search method Subgradient iteration method | 1 C-UE 1 V-UE |
[28] | Unicast | Maximize throughput (C-UEs/nonsafety V-UEs); guarantee QoS demand (W-UEs/safety V-UEs) | Freeway | W-UEs C-UEs Safety and nonsafety V-UEs | SINR | — | Orthogonal RBs are allocated to each user type | Kuhn–Munkres algorithm Gale–Shapley algorithm | 1 C-UE 1 nonsafety V-UE |
[29] | Unicast | Maximize the total throughput for C-UEs and V-UEs | Freeway | W-UEs C-UEs Safety and nonsafety V-UEs | SINR | — | Orthogonal RBs are allocated to each user type | An interior point method Kuhn–Munkres method | 1 C-UE 1 nonsafety V-UE |
[30] | Unicast | Maximize V2I-UEs sum rate; guarantee V2V-UEs reliability requirement | Freeway | V2I-UEs V2V-UEs | SINR Buffer size Packet delay | — | Orthogonal RBs are allocated to each user type | — | 1 V2I-UE 1 V2V-UE |
[31] | Unicast | Maximize V2I-UEs sum rate; guarantee V2V-UEs reliability requirement | Freeway | V2I-UEs V2V-UEs | SINR Buffer size Packet delay | PC | Orthogonal RBs are allocated to each user type | — | 1 V2I-UE 1 V2V-UE |
[32] | Unicast | Maximize C-UEs sum rate; guarantee V-UEs reliability requirement | Freeway | GBR C-UEs NGBR C-UEs V-UEs | PDR SINR Buffer size Packet delay | — | Orthogonal RBs are allocated to each user type | — | 1 C-UE 1 V-UE |
[33] | Unicast | Maximize sum rate and respect constraint delay of C-UEs; guarantee V-UEs reliability and latency | Freeway | C-UEs Safety V-UE Nonsafety V-UE | PDOR SINR Delay | — | Orthogonal RBs are allocated to each user type | — | 1 C-UE 1 safety V-UE 1 nonsafety V-UE |
|