# Graph-based resource allocation with conflict avoidance for V2V broadcast communications

@article{AbantoLeon2017GraphbasedRA,
title={Graph-based resource allocation with conflict avoidance for V2V broadcast communications},
author={Luis F. Abanto-Leon and Arie G. C. Koppelaar and Sonia M. Heemstra de Groot},
journal={2017 IEEE 28th Annual International Symposium on Personal, Indoor, and Mobile Radio Communications (PIMRC)},
year={2017},
pages={1-7}
}
• Published 1 October 2017
• Computer Science, Engineering
• 2017 IEEE 28th Annual International Symposium on Personal, Indoor, and Mobile Radio Communications (PIMRC)
In this paper we present a graph-based resource allocation scheme for sidelink broadcast vehicle-to-vehicle (V2V) communications. Harnessing available information on the geographical position of vehicles and spectrum resources utilization, eNodeBs are capable of allotting the same set of sidelink resources to several different vehicles in order for them to broadcast their signals. Hence, vehicles sharing the same resources would ideally be in different communications clusters for the…
15 Citations
Network-Assisted Resource Allocation with Quality and Conflict Constraints for V2V Communications
• Engineering, Computer Science
2018 IEEE 87th Vehicular Technology Conference (VTC Spring)
• 2018
This work proposes a three-stage suboptimal approach that is cast as multiple independent knapsack problems (MIKPs) and compares the two approaches through simulations and shows that the latter formulation can attain acceptable performance at lesser complexity.
Subchannel allocation for vehicle-to-vehicle broadcast communications in mode-3
• Computer Science, Engineering
2018 IEEE Wireless Communications and Networking Conference (WCNC)
• 2018
Four types of conditions that are of forceful character for attaining QoS-aware conflict-free allocations have been identified and a surrogate relaxation of the problem is proposed that does not affect optimality provided that certain requisites are satisfied.
Resource Allocation for NOMA-based V2V System
• Computer Science
2018 International Conference on Network Infrastructure and Digital Content (IC-NIDC)
• 2018
The proposed mechanism outperforms the energy sensing mechanism under the broadcast scenario with Non-orthogonal Multiple Access (NOMA) manner in Vehicle to Vehicle (V2V) communications system.
Radio Resource Allocation Algorithm for Device to Device based on LTE-V2X Communications
• Computer Science
ICETE
• 2018
Simulation results indicate promising performance of the proposed ERAVC scheme compared with another and a new algorithm called Efficient Resources Allocation for V2X Communications (ERAVC) is proposed in order to maximize the sum rate of V2I users while guaranteeing the reliability requirement ofV2Vusers.
A Survey on Radio Resource Allocation for V2X Communication
• Computer Science
Wirel. Commun. Mob. Comput.
• 2019
This paper presents the V2X communications, their requirements and services, the V1X-based LTE-D2D communication modes, and the existing resource allocation algorithms for V2x communications, and classify the existing resources allocation algorithms proposed in the literature and compare them according to selected criteria.
Impact of Quantized Side Information on Subchannel Scheduling for Cellular V2X
• Computer Science, Engineering
2018 IEEE 87th Vehicular Technology Conference (VTC Spring)
• 2018
A graph theoretical approach for semi- persistent scheduling (SPS) in mode-3 harnessing a sensing mechanism whereby vehicles can monitor signal-to-interference-plus-noise ratio (SINR) levels across sidelink subchannels is discussed.
Ikram Ashraf RADIO RESOURCE MANAGEMENT IN DEVICE-TO-DEVICE AND VEHICLE-TO-VEHICLE COMMUNICATION IN 5 G NETWORKS AND BEYOND
Future cellular networks need to support the ever-increasing demand of bandwidth-intensive applications and interconnection of people, devices, and vehicles. Small cell network (SCN)based
Two-Tier Architecture for Spectrum Auction in SDN-Enabled Cloud Radio Access Network
• Computer Science
IEEE Transactions on Vehicular Technology
• 2019
Simulation results reveal the performance and the benefits of the proposed SDN-enabled spectrum auction mechanism under different scenarios.
Decentralized Subchannel Scheduling for C-V2X Mode-4: A Non-Standard Configuration for CAM Retransmissions
This work assumes the existence of a primary sub-band that supports semi-persistently reserved subchannels (as specified by 3GPP) and also considers that there exist auxiliary sub-bands that convey random re-transmissions in order to improve reception reliability.
System Level Simulation of Scheduling Schemes for C-V2X Mode-3
• Engineering, Computer Science
• 2018
Through simulations, it is shown that the proposed schemes outperform C-V2X \textit{mode-4} as the subchannels are assigned in a more efficient manner with mitigated interference.

## References

SHOWING 1-10 OF 11 REFERENCES
Joint Mode Selection and Resource Allocation for Device-to-Device Communications
• Engineering, Computer Science
IEEE Transactions on Communications
• 2014
This paper aims at maximizing the overall system throughput while guaranteeing the signal-to-noise-and-interference ratio of both D2D and cellular links, and develops low-complexity algorithms according to the network load.
D2D-based V2V communications with latency and reliability constraints
• Computer Science, Mathematics
2014 IEEE Globecom Workshops (GC Wkshps)
• 2014
This paper analyzes and mathematically model the actual requirements for vehicular communications and traditional cellular links, and proposes a problem formulation and then a Separate Resource Block allocation and Power control (SRBP) algorithm to solve this problem.
An n5/2 Algorithm for Maximum Matchings in Bipartite Graphs
• Mathematics, Computer Science
SIAM J. Comput.
• 1973
The present paper shows how to construct a maximum matching in a bipartite graph with n vertices and m edges in a number of computation steps proportional to $(m + n)\sqrt n$.
Algorithms for the Assignment and Transportation Problems
In this paper, algorithms for the solution of the general assignment and transportation problems are presen, and the algorithm is generalized to one for the transportation problem.
A n^5/2 Algorithm for Maximum Matchings in Bipartite Graphs
• Computer Science, Mathematics
SWAT
• 1971
The present paper shows how to construct a maximum matching in a bipartite graph with n vertices and m edges in a number of computation steps proportional to (m+n) n.
Crash Data Analyses for Vehicle-To-Infrastructure Communications for Safety Applications
• Engineering
• 2012
This report presents the potential safety benefits of wireless communication between the roadway infrastructure and vehicles, (i.e., vehicle-to-infrastructure (V2I) safety). Specifically, it
Linear-Time Approximation for Maximum Weight Matching
• Mathematics, Computer Science
JACM
• 2014
This article gives an algorithm that computes a (1 − 1 − 0))-approximate maximum weight matching in O(i) time, that is, optimal <i>linear time</i> for any fixed ε, and should be appealing in all applications that can tolerate a negligible relative error.
Intelligent Transport Systems (its); Stdma Recommended Parameters and Settings for Cooperative Its; Access Layer Part
The present document may be made available in more than one electronic version or in print. In any case of existing or perceived difference in contents between such versions, the reference version is
Monotonicity for entrywise functions of matrices
Abstract We characterize real functions f on an interval ( - α , α ) for which the entrywise matrix function [ a ij ] ↦ [ f ( a ij ) ] is positive, monotone, and convex, respectively, in the positive
3GPP TR 36.885; Technical Specification Group Radio Access Network; Study on LTE-based V2X Services