بهبود امنیت پلاتون در شبکه های خودرویی

با رشد روزافزون خودروها و افزایش شبکه های حمل و نقل و به تبع آن نیاز به یک سیستم امن تر و کارآمدتر، شبکه های خودرویی مورد توجه واقع شده اند. در همین راستا برای مدیریت بهینه و ساده تر سیستم های حمل و نقل، دسته بندی خودروها به پلاتون پیشنهاد شده است. هرچند شبکه های خودرویی و پروتکل ارتباطی استاندارد ieee 802.11p ابزار کلیدی برای توسعه برنامه های کاربردی پلاتون هستند، اما همکاری بین خودروها در این پروتکل براساس یک ساختار ارتباطی قابل اعتماد نیست؛ و ظهور ناگهانی یک حمله مخرب می تواند باعث به خطر افتادن صحت جریان ترافیک داده ها گردد. هرچند برای مقابله با مشکلات مطرح شده الگوریتم رای گیری پیشنهاد شده بود اما به دلیل نیاز خودروها به دریافت اطلاعات از حداقل دو خودرو جهت انجام رای گیری، در اغلب توپولوژی ها از کارایی لازم برخوردار نبود؛ و سبب کاهش اثر حمله دست کاری برای خودرو قربانی نگردیده بود. در این پژوهش جهت رفع مشکلات الگوریتم رای گیری، راه کار مناسبی با استفاده از تغییرات فاصله هر خودرو نسبت به خودرو رهبر و همچنین بهترین سرعت خودروی مخرب نسبت به سرعت رهبر پیشنهاد شده است. شبیه سازی راه کار پیشنهادی نشان می دهد که این پژوهش نسبت به حملات دست کاری در زمان 0.43 ثانیه و نسبت به حملات جعل پیام در زمان 0.48 ثانیه واکنش نشان می دهد. همچنین مشکلات الگوریتم رای گیری را برطرف کرده است.

improve the security of the platoon in vehicular networking

the growth of vehicles and the increase in urban traffic have led to the need for safe, secure and efficient intelligent transportation systems (its). improving the efficiency of its needs an efficient communication system. to this end, vehicular networks have been considered as a communication infrastructure in its. one of the mechanisms to manage vehicles in its is to categorize vehicles into platoon. platoon is proposed as a way to increase road capacity, improve safety, minimize travel time, increase fuel efficiency, reduce environmental impact, lower-traffic jams and facilitate driving. to create a platoon through autonomous cooperative driving, vehicles must be able to communicate wirelessly, which is possible through vehicular networks. wireless communications in vehicular networks suffer from three major problems, which are: limited range of radiofrequency, high data transmission over the wireless network, as well as security problems. using omnidirectional antennas and utilizing dsrc channels in the lower layers are the base solutions to overcome these issues but, omnidirectional antennas spread the vulnerability to all nodes within the signal propagation range and congestion challenges in the dsrc channel intensify the collision of packets. such issues decrease the platoon’s stability and security. recent studies on vehicular networks security have focused on presenting solutions to reduce vulnerabilities at the level of communications. however, while the security of communications has been extensively explored in previous work, the security of platoons has recently been considered by researchers. in vehicular networks, an attack can pose a threat to the security and privacy of the platoon, so the security of the platoon has received a great deal of attention.  to improve the security of the platoon, the sp-vlc solution is proposed. this method uses asymmetric encryption and the transmission of information through visible light communications (vlc) to overcome security challenges. in intra-platoon attacks, the attacker is a member of the platoon and has access to all keys and encrypted information, so this solution is not effective against platoon’s internal attacks. moreover, the sp-vlc solution uses only the data flow topology of predecessor-following to transfer data. another solution which fixes internal attack problem of sp-vlc solution is voting method. but this solution does not work well for the predecessor-following information flow topology because vehicles in the voting process need to receive information from at least two vehicles, while in the mentioned topology, vehicles receive information only from the vehicle in front.   therefore, the voting solution does not have the required efficiency in predecessor-following topology.to overcome the challenges of the voting method, a new solution has been proposed that takes advantage of changes in the distance of each vehicle from the leader vehicle and the best speed of the malicious vehicle compared to the leader speed before the attack. also, in order to evaluate the efficiency of the proposed solution, evaluation in bidirectional-leader (bdl) and predecessor-leader following (plf) topologies has been performed as a representative of other information flow topologies. the performance of the proposed solution has been evaluated using omnet ++, sumo, and plexe tools. to measure the efficiency of the proposed method, the parameters of position error, speed error and control effort have been used. the simulation of the proposed solution shows that this study responds to spoofing attack in 0.43 seconds and to message falsification attack in 0.48 seconds.