Radio Resource Allocation for Reliable Out-of-Coverage V2V Communications

Abstract

We explore a new approach to radio resource allocation for vehicle-to-vehicle (V2V) communications in case of outof-coverage areas that are delimited by network infrastructure. By collecting and predicting information such as vehicle velocity, density and message traffic, the network infrastructure ensures reliability of the V2V services. We propose reserving required amount of resources for services that cannot be pre-scheduled (e.g., emergency braking, crash notifications, etc.), and scheduling those services that can be pre-scheduled (e.g., platooning). We analyze the resource reservation as a function of target reliability under varying vehicle densities and sizes of out-of-coverage area. For pre-scheduled services, we explore how variations in the vehicle velocities and predictions affect successful transmissions.The results indicate that increase in required reliability does not penalize the system prohibitively. On the other hand, speed prediction errors decrease the transmission success rate considerably, thus calling for a more flexible scheduler design.

Three-Dimensional Resource Allocation in D2D-Based V2V Communication

“…Most of the current research focuses on the in-coverage scenario in V2X. Out of coverage scenario could be an interesting area of research as presented in [17]. Topology of the network and the differential Quality of Service (QoS) of the users can make different sets of optimization problems with varying constraints.…”

Radio Resource Management for V2V Multihop Communication Considering Adjacent Channel Interference

“…V2V scheduling algorithms for broadcast services are studied in [20], [21]. Out-of-cellular coverage scenario for V2V is studied theoretically in [22], and simulationbased in [23]. Infrastructure-based and distributed autonomous based scheduling are studied in [24] and [21] respectively.…”

“…, (10), (11), (19), (21), (22), (23) where Z τ i,j = 1{τ j,m ≤ τ T } indicates if the deterministic latency requirement is satisfied for the end-node pair (i, j) and ζ is chosen large enough such that (37b) is holds when Z τ i,j = 0. A technical problem arise here, since, by convention, τ j,m = ∞ if message m is not scheduled to be transmitted in an RB where the SINR at VUE j is larger or equal to γ T .…”

Optimizing the Resource Allocation of Periodic Messages With Different Sizes in LTE-V2V

“…Depending on the entity responsible for the allocation, two modes are defined by 3GPP: Mode 3, where the task is performed by the network, and Mode 4, where each vehicle selects autonomously, in a fully distributed way [23]. Solutions have been thus proposed, mainly with reference to the cooperative awareness service, focusing on both Mode 3, e.g., [24], [25], and Mode 4, e.g., [21], [26].…”