By Topic

Dynamic Optimal Random Access for Vehicle-to-Roadside Communications

Sign In

Cookies must be enabled to login.After enabling cookies , please use refresh or reload or ctrl+f5 on the browser for the login options.

Formats Non-Member Member
$31 $13
Learn how you can qualify for the best price for this item!
Become an IEEE Member or Subscribe to
IEEE Xplore for exclusive pricing!
close button

puzzle piece

IEEE membership options for an individual and IEEE Xplore subscriptions for an organization offer the most affordable access to essential journal articles, conference papers, standards, eBooks, and eLearning courses.

Learn more about:

IEEE membership

IEEE Xplore subscriptions

4 Author(s)
Man Hon Cheung ; Dept. of Electr. & Comput. Eng., Univ. of British Columbia, Vancouver, BC, Canada ; Fen Hou ; Wong, V.W.S. ; Jianwei Huang

In a drive-thru scenario where vehicles drive by a roadside access point (AP) to obtain temporary Internet access, it is important to design efficient resource allocation schemes to fully utilize the limited communication opportunities. In this paper, we study the random access problem in drive thru communications in a dynamic environment, where both the channel contention level and channel capacity vary over time. We assume that a vehicle has a file to upload when it is within the coverage range of the AP. The vehicle will pay a fixed amount each time it tries to access the AP, and will incur a penalty if it cannot finish the file uploading when leaving the AP. We first formulate the optimal transmission problem as a finite-horizon sequential decision problem. Then we solve the problem using dynamic programming, and design a dynamic optimal random access algorithm. Simulation results based on a realistic vehicular traffic model show that our algorithm achieves the minimal total cost, the highest probability of completing file upload, and the highest upload ratio as compared with two other heuristic schemes.

Published in:

Communications (ICC), 2011 IEEE International Conference on

Date of Conference:

5-9 June 2011