1. Analytical Investigation of Two Benchmark Resource Allocation Algorithms for LTE-V2V
- Author
-
Giammarco Cecchini, Barbara M. Masini, Alberto Zanella, Alessandro Bazzi, Bazzi A., Zanella A., Cecchini G., and Masini B.M.
- Subjects
Signal Processing (eess.SP) ,FOS: Computer and information sciences ,Computer Networks and Communications ,Computer science ,cooperative awareness ,Distributed computing ,resource allocation ,Aerospace Engineering ,Context (language use) ,02 engineering and technology ,cooperative awarene ,Connected vehicles ,Computer Science - Networking and Internet Architecture ,0203 mechanical engineering ,FOS: Electrical engineering, electronic engineering, information engineering ,Wireless ,Resource management ,Electrical and Electronic Engineering ,Electrical Engineering and Systems Science - Signal Processing ,Networking and Internet Architecture (cs.NI) ,business.industry ,LTE-V2V ,cellular-V2V ,Physical layer ,020302 automobile design & engineering ,Automotive Engineering ,Connected vehicle ,Benchmark (computing) ,Key (cryptography) ,business ,Communication channel - Abstract
Short-range wireless technologies will enable vehicles to communicate and coordinate their actions, thus improving people's safety and traffic efficiency. Whereas IEEE 802.11p (and related standards) had been the only practical solution for years, in 2016 a new option was introduced with Release of 14 long-term evolution (LTE), which includes new features to enable direct vehicle-to-vehicle (V2V) communications. LTE-V2V promises a more efficient use of the channel compared to IEEE 802.11p, thanks to an improved PHY layer and the use of orthogonal resources at the MAC layer. In LTE-V2V, a key role is played by the resource allocation algorithm and increasing efforts are being made to design new solutions to optimize the spatial reuse. In this context, an important aspect still little studied, is therefore that of identifying references that allow, first, to have a perception of the space in which the resource allocation algorithms move and, second, to verify the performance of new proposals. In this paper, we focus on a highway scenario and identify two algorithms to be used as a minimum and maximum reference in terms of the packet reception probability (PRP). The PRP is derived as a function of various parameters that describe the scenario and settings, from the application to the physical layer. Results, obtained both in a simplified Poisson point process scenario and with realistic traffic traces, show that the PRP varies considerably with different algorithms and that there is room for the improvement of current solutions.
- Published
- 2023
- Full Text
- View/download PDF