Fair Channel Access in Cooperative Vehicle Safety Systems

• Published in: Journal of Information Science and Engineering Vol. 32; no. 5; pp. 1219 - 1240
• Main Authors: 张福新(FU-XIN ZHANG), 谭囯真(GUO-ZHEN TAN), 余超(CHAO YU), 丁男(NAN DING), 刘明剑(MING-JIAN LIU)
• Format: Journal Article
• Language: English
• Published: 社團法人中華民國計算語言學學會 01.09.2016
• Subjects: Adjustment; Algorithms; Channels; Mathematical models; Tracking; Tracking (position); Vehicle safety; Vehicles; vehicular networking; fairness; channel access; cooperative vehicle safety systems; channel congestion; vehicle tracking
• ISSN: 1016-2364

Cooperative vehicle safety systems rely on periodic broadcast of each vehicle's state information to track neighbors' positions and therefore to predict potential collisions. The most pressing challenge in such systems is to maintain real-time tracking accuracy while avoiding channel congestion. Previous work on congestion control in CVSSs primarily focuses on the effort of individual vehicle to adjust the contention window based on its local channel status, which may cause the channel resource to be monopolized by a small number of vehicles. As a result, unfairness issue arises. To overcome this problem, in this paper, we present a game-based channel access approach for contention window adjustment. In this approach, a utility function that defines the relationship between vehicle tracking accuracy and throughput is firstly proposed. Then, based on the utility function, a non-cooperative dynamic game model with a penalty function is established. In order to implement the game model on each vehicle, a distributed channel access algorithm is proposed. This algorithm adjusts the contention window for each vehicle, and hence, guides each vehicle to the Nash equilibrium. Simulation results confirm that the gamebased channel access approach can guarantee a fair share of channel resources while achieving the optimal tracking performance for vehicles.