基于博弈论的vanet交通拥堵优化机制

Khalilollah Raeisi Lejjy, Esmaeil Amiri, Emad Alizadeh, Mohammad Hossein Rezvani
{"title":"基于博弈论的vanet交通拥堵优化机制","authors":"Khalilollah Raeisi Lejjy, Esmaeil Amiri, Emad Alizadeh, Mohammad Hossein Rezvani","doi":"10.1109/ICWR49608.2020.9122324","DOIUrl":null,"url":null,"abstract":"One of the key issues in Vehicular Ad-hoc networks (VANETs) is to optimize the traffic congestion. Cooperation in these networks is a challenging issue due to their specific characteristics. In this paper, a non-cooperative game theory-based approach is introduced for packet forwarding. Through extensive mathematical analyses and also experimental validation, we prove that the proposed non-cooperative game mechanism attains the Nash equilibrium point. Our designed mechanism encourages all vehicles to collaborate with each other in packet forwarding operations. This, in turn, results in decreasing the payments by nodes to the network side and also results in optimizing traffic congestion. The simulation results established the robustness of the proposed mechanism in terms of cost-related criteria.","PeriodicalId":231982,"journal":{"name":"2020 6th International Conference on Web Research (ICWR)","volume":"2 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2020-04-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"1","resultStr":"{\"title\":\"A Game Theory-based Mechanism to Optimize the Traffic Congestion in VANETs\",\"authors\":\"Khalilollah Raeisi Lejjy, Esmaeil Amiri, Emad Alizadeh, Mohammad Hossein Rezvani\",\"doi\":\"10.1109/ICWR49608.2020.9122324\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"One of the key issues in Vehicular Ad-hoc networks (VANETs) is to optimize the traffic congestion. Cooperation in these networks is a challenging issue due to their specific characteristics. In this paper, a non-cooperative game theory-based approach is introduced for packet forwarding. Through extensive mathematical analyses and also experimental validation, we prove that the proposed non-cooperative game mechanism attains the Nash equilibrium point. Our designed mechanism encourages all vehicles to collaborate with each other in packet forwarding operations. This, in turn, results in decreasing the payments by nodes to the network side and also results in optimizing traffic congestion. The simulation results established the robustness of the proposed mechanism in terms of cost-related criteria.\",\"PeriodicalId\":231982,\"journal\":{\"name\":\"2020 6th International Conference on Web Research (ICWR)\",\"volume\":\"2 1\",\"pages\":\"0\"},\"PeriodicalIF\":0.0000,\"publicationDate\":\"2020-04-01\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"1\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"2020 6th International Conference on Web Research (ICWR)\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://doi.org/10.1109/ICWR49608.2020.9122324\",\"RegionNum\":0,\"RegionCategory\":null,\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"\",\"JCRName\":\"\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"2020 6th International Conference on Web Research (ICWR)","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/ICWR49608.2020.9122324","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 1

摘要

车辆自组织网络(vanet)的关键问题之一是优化交通拥塞。由于这些网络的特点,合作是一个具有挑战性的问题。本文提出了一种基于非合作博弈论的分组转发方法。通过大量的数学分析和实验验证,我们证明了所提出的非合作博弈机制达到了纳什均衡点。我们设计的机制鼓励所有车辆在数据包转发操作中相互协作。这反过来又会导致节点对网络端的支付减少,也会导致流量拥堵的优化。仿真结果证明了该机制在成本相关准则方面的鲁棒性。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
A Game Theory-based Mechanism to Optimize the Traffic Congestion in VANETs
One of the key issues in Vehicular Ad-hoc networks (VANETs) is to optimize the traffic congestion. Cooperation in these networks is a challenging issue due to their specific characteristics. In this paper, a non-cooperative game theory-based approach is introduced for packet forwarding. Through extensive mathematical analyses and also experimental validation, we prove that the proposed non-cooperative game mechanism attains the Nash equilibrium point. Our designed mechanism encourages all vehicles to collaborate with each other in packet forwarding operations. This, in turn, results in decreasing the payments by nodes to the network side and also results in optimizing traffic congestion. The simulation results established the robustness of the proposed mechanism in terms of cost-related criteria.
求助全文
通过发布文献求助,成功后即可免费获取论文全文。 去求助
来源期刊
自引率
0.00%
发文量
0
×
引用
GB/T 7714-2015
复制
MLA
复制
APA
复制
导出至
BibTeX EndNote RefMan NoteFirst NoteExpress
×
提示
您的信息不完整,为了账户安全,请先补充。
现在去补充
×
提示
您因"违规操作"
具体请查看互助需知
我知道了
×
提示
确定
请完成安全验证×
copy
已复制链接
快去分享给好友吧!
我知道了
右上角分享
点击右上角分享
0
联系我们:info@booksci.cn Book学术提供免费学术资源搜索服务,方便国内外学者检索中英文文献。致力于提供最便捷和优质的服务体验。 Copyright © 2023 布克学术 All rights reserved.
京ICP备2023020795号-1
ghs 京公网安备 11010802042870号
Book学术文献互助
Book学术文献互助群
群 号:481959085
Book学术官方微信