{'fraction_non_alphanumeric': 0.02202283849918434, 'fraction_numerical': 0.0032626427406199023, 'mean_word_length': 5.704918032786885, 'pattern_counts': {'":': 0, '<': 0, '<?xml version=': 0, '>': 0, 'https://': 0, 'lorem ipsum': 0, 'www.': 0, 'xml': 0}, 'pii_count': 0, 'substrings_counts': 0, 'word_list_counts': {'cursed_substrings.json': 0, 'profanity_word_list.json': 0, 'sexual_word_list.json': 0, 'zh_pornsignals.json': 0}}
Resource Allocation for Low-Latency Vehicular Communications: An Effective Capacity Perspective

Vehicular communications face a tremendous challenge in guaranteeing low latency for safety-critical information exchange due to fast varying channels caused by high mobility. Focusing on the tail behavior of random latency experienced by packets, latency violation probability (LVP) deserves particular attention. Based on only large-scale channel information, this paper performs spectrum and power allocation to maximize the sum ergodic capacity of vehicle-to-infrastructure (V2I) links while guaranteeing the LVP for vehicle-to-vehicle (V2V) links. Using the effective capacity theory, we explicitly express the latency constraint with introduced latency exponents. Then, the resource allocation problem is decomposed into a pure power allocation subproblem and a pure spectrum allocation subproblem, both of which can be solved with global optimum in polynomial time. Simulation results show that the effective capacity model can accurately characterize the LVP. In addition, the effectiveness of the proposed algorithm is demonstrated from the perspectives of the capacity of the V2I links and the latency of the V2V links.