A Robust Channel Access Using Cooperative Reinforcement Learning for Congested Vehicular Networks

被引:11
作者
Choe, Chungjae [1 ]
Ahn, Jangyong [1 ]
Choi, Junsung [1 ]
Park, Dongryul [1 ]
Kim, Minjun [2 ]
Ahn, Seungyoung [1 ]
机构
[1] Korea Adv Inst Sci & Technol KAIST, CCS Grad Sch Green Transporat, Daejeon 34141, South Korea
[2] Korea Aerosp Res Inst KARI, Daejeon 34133, South Korea
关键词
Safety; Vehicular ad hoc networks; Robustness; Media Access Protocol; Learning (artificial intelligence); Standards; Vehicular ad-hoc network; congestion control; decentralized channel access; reinforcement learning; cooperative multi-agent systems; MAC PROTOCOLS; BROADCAST; EFFICIENT; MODELS;
D O I
10.1109/ACCESS.2020.3011568
中图分类号
TP [自动化技术、计算机技术];
学科分类号
0812 ;
摘要
Vehicular Ad-hoc Network (VANET) is an emerging technique dedicated to wireless vehicular communication to improve transportation safety by exchanging driving information between vehicles. For safety purposes, vehicles periodically broadcast a safety packet via Vehicle-to-Vehicle (V2V) communication. Accordingly, VANET safety applications demand a reliable exchange of the safety packet with high Packet Delivery Ratio (PDR), acceptable latency, and communication fairness. However, the communication performance significantly degrades due to numerous packet collisions when a large number of vehicles simultaneously access limited channel resources for the safety broadcast. In particular, the problem grows more severe in congested VANETs absent infrastructures since vehicles must control channel access using a self-adaptive scheme without external assistance. Thus, a robust and decentralized channel access protocol for VANETs is required to achieve road safety. In this paper, we propose an intelligent channel access algorithm empowered by cooperative Reinforcement Learning (RL), in which vehicles coordinate the channel access in a fully-decentralized manner. We also consider a proper interaction scheme between vehicles for enhancing the V2V safety broadcast in infrastructure-less congested VANETs. We provide evaluation results with extensive simulations according to various levels of traffic congestion. Simulations confirm the superior performance of the algorithm: the algorithm has a 20% increase in PDR compared to the latest RL-based channel access scheme. Furthermore, the algorithm satisfies the low latency requirement of VANET safety applications as well as both short-term and long-term communication fairness.
引用
收藏
页码:135540 / 135557
页数:18
相关论文
共 49 条
[1]   A Measurement Based Shadow Fading Model for Vehicle-to-Vehicle Network Simulations [J].
Abbas, Taimoor ;
Sjoberg, Katrin ;
Karedal, Johan ;
Tufvesson, Fredrik .
INTERNATIONAL JOURNAL OF ANTENNAS AND PROPAGATION, 2015, 2015
[2]   A Distributed Cluster Based Transmission Scheduling in VANET [J].
Azizian, Meysam ;
Cherkaoui, Soumaya ;
Hafid, Abdelhakim Senhaji .
2016 IEEE INTERNATIONAL CONFERENCE ON COMMUNICATIONS (ICC), 2016,
[3]  
Bellemare MG, 2017, PR MACH LEARN RES, V70
[4]  
Celimuge Wu, 2014, 2014 IEEE 11th Consumer Communications and Networking Conference (CCNC), P438, DOI 10.1109/CCNC.2014.6866607
[5]  
Chen Q., 2009, VEHICLE NETWORKINQ C, P1
[6]   Performance evaluation of the IEEE 802.11p WAVE communication standard [J].
Eichler, Stephan .
2007 IEEE 66TH VEHICULAR TECHNOLOGY CONFERENCE, VOLS 1-5, 2007, :2199-2203
[7]  
ElBatt Tamer., 2006, P 3 INT WORKSHOP VEH, P1, DOI DOI 10.1145/1161064.1161066
[8]   A Novel Problem Model and Solution Scheme for Roadside Unit Deployment Problem in VANETs [J].
Gao, Zhenguo ;
Chen, Danjie ;
Yao, Nianmin ;
Lu, Zhimao ;
Chen, Bingcai .
WIRELESS PERSONAL COMMUNICATIONS, 2018, 98 (01) :651-663
[9]   ns-3 meets OpenAI Gym: The Playground for Machine Learning in Networking Research [J].
Gawlowicz, Piotr ;
Zubow, Anatolij .
MSWIM'19: PROCEEDINGS OF THE 22ND INTERNATIONAL ACM CONFERENCE ON MODELING, ANALYSIS AND SIMULATION OF WIRELESS AND MOBILE SYSTEMS, 2019, :113-120
[10]   STABILITY OF BINARY EXPONENTIAL BACKOFF [J].
GOODMAN, J ;
GREENBERG, AG ;
MADRAS, N ;
MARCH, P .
JOURNAL OF THE ACM, 1988, 35 (03) :579-602