1. DORA: Dynamic Optimal Random Access
Vehicle-to-Roadside Communications
ABSTRACT
In this project, we use random access in a drive thru scenario, where roadside access points (APs) are
installed on a highway to provide permanent Internet access for vehicles.We consider vehicle-to-
roadside (V2R) communications for a vehicle that aims to upload a file when it is within the APs’
coverage ranges, where both the channel contention level and transmission data rate vary over time.
The vehicle will pay a fixed amount reach time it tries to access the APs, and will incur a penalty if it
cannot finish the file uploading when leaving the APs. First, we consider the problem of finding the
optimal transmissionpolicy with a single AP and random vehicular traffic arrivals. We formulate it as a
finite-horizon sequential decision problem, solve it using dynamic programming (DP), and design a
general jointdynamicoptimalrandomaccess(JDORA) algorithm.We derive the conditions under which
the optimal transmission policy has a threshold structure, and propose a monotone DORA algorithm
witha lowercomputational complexity for this special case. Next, we consider the problem of finding
the optimal transmissionpolicy with multiple APs and deterministic vehicular traffic arrivals thanks to
perfecttrafficestimation.We againobtainthe optimal transmissionpolicyusing DP and propose a joint
DORA algorithm..
Existing System
A numberof previousresultshave beenreportedonthe resource allocation in V2R communications. In
considered the case where roadside APs only store the data uploaded by the vehicles. Scheduling
priority is determined by two factors: data size and deadline. A request with a smaller data size or an
earlierdeadline will be servedfirst.Hadalleretal.inproposedaschedulingprotocol thatgrants channel
access to a vehicle with the maximum transmission rate. Analytical and simulation results showed
significant overall system throughput improvement over a benchmark scheme.
2. ARCHITECTUREOF EXISTING SYSTEM
Disadvantage of Exiting System
Lessuploadingratio
Hightotal cost
Highthresholdnodesoccur
Proposed System
We proposedanoptimal randomaccessalgorithmbasedonthe analysisof finite-horizondynamic
programming.ourscheme achievesthe minimal total cost,the highestprobabilityof completingfile
upload,andthe highestuploadratiocomparingwithtwootherheuristicschemes.
Advantage:
Highuploadratio
Lesstotal cost
Lessthresholdnode occur