New Gateway Selection Algorithm Based on Multi-Objective Integer Programming and Reinforcement Learning

Pub Date : 2022-01-01 DOI:10.36244/icj.2022.4.1
Hasanain Alabbas, Árpád Huszák
{"title":"New Gateway Selection Algorithm Based on Multi-Objective Integer Programming and Reinforcement Learning","authors":"Hasanain Alabbas, Árpád Huszák","doi":"10.36244/icj.2022.4.1","DOIUrl":null,"url":null,"abstract":"Connecting vehicles to the infrastructure and benefiting from the services provided by the network is one of the main objectives to increase safety and provide well-being for passengers. Providing such services requires finding suitable gateways to connect the source vehicles to the infrastructure. The major feature of using gateways is to decrease the load of the network infrastructure resources so that each gateway is responsible for a group of vehicles. Unfortunately, the implementation of this goal is facing many challenges, including the highly dynamic topology of VANETs, which causes network instability, and the deployment of applications with high bandwidth demand that can cause network congestion, particularly in urban areas with a high-density vehicle. This work introduces a novel gateway selection algorithm for vehicular networks in urban areas, consisting of two phases. The first phase identifies the best gateways among the deployed vehicles using multi-objective integer programming. While in the second phase, reinforcement learning is employed to select a suitable gateway for any vehicular node in need to access the VANET infrastructure. The proposed model is evaluated and compared to other existing solutions. The obtained results show the efficiency of the proposed system in identifying and selecting the gateways.","PeriodicalId":0,"journal":{"name":"","volume":null,"pages":null},"PeriodicalIF":0.0,"publicationDate":"2022-01-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"0","resultStr":null,"platform":"Semanticscholar","paperid":null,"PeriodicalName":"","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.36244/icj.2022.4.1","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 0

Abstract

Connecting vehicles to the infrastructure and benefiting from the services provided by the network is one of the main objectives to increase safety and provide well-being for passengers. Providing such services requires finding suitable gateways to connect the source vehicles to the infrastructure. The major feature of using gateways is to decrease the load of the network infrastructure resources so that each gateway is responsible for a group of vehicles. Unfortunately, the implementation of this goal is facing many challenges, including the highly dynamic topology of VANETs, which causes network instability, and the deployment of applications with high bandwidth demand that can cause network congestion, particularly in urban areas with a high-density vehicle. This work introduces a novel gateway selection algorithm for vehicular networks in urban areas, consisting of two phases. The first phase identifies the best gateways among the deployed vehicles using multi-objective integer programming. While in the second phase, reinforcement learning is employed to select a suitable gateway for any vehicular node in need to access the VANET infrastructure. The proposed model is evaluated and compared to other existing solutions. The obtained results show the efficiency of the proposed system in identifying and selecting the gateways.
查看原文
分享 分享
微信好友 朋友圈 QQ好友 复制链接
基于多目标整数规划和强化学习的网关选择新算法
将车辆连接到基础设施并从网络提供的服务中受益是提高安全性和为乘客提供福祉的主要目标之一。提供此类服务需要找到合适的网关来将源车辆连接到基础设施。使用网关的主要特点是减少网络基础设施资源的负载,使每个网关负责一组车辆。不幸的是,这一目标的实现面临着许多挑战,包括vanet的高度动态拓扑结构,这会导致网络不稳定,以及具有高带宽需求的应用程序的部署可能导致网络拥塞,特别是在具有高密度车辆的城市地区。本文介绍了一种新的城市车辆网络网关选择算法,该算法分为两个阶段。第一阶段使用多目标整数规划在部署的车辆中确定最佳网关。而在第二阶段,采用强化学习为需要访问VANET基础设施的任何车辆节点选择合适的网关。对所提出的模型进行了评估,并与其他现有的解决方案进行了比较。仿真结果表明,该系统在网关识别和选择方面具有较高的效率。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
求助全文
约1分钟内获得全文 去求助
×
引用
GB/T 7714-2015
复制
MLA
复制
APA
复制
导出至
BibTeX EndNote RefMan NoteFirst NoteExpress
×
×
提示
您的信息不完整,为了账户安全,请先补充。
现在去补充
×
提示
您因"违规操作"
具体请查看互助需知
我知道了
×
提示
现在去查看 取消
×
提示
确定
0
微信
客服QQ
Book学术公众号 扫码关注我们
反馈
×
意见反馈
请填写您的意见或建议
请填写您的手机或邮箱
已复制链接
已复制链接
快去分享给好友吧!
我知道了
×
扫码分享
扫码分享
Book学术官方微信
Book学术文献互助
Book学术文献互助群
群 号:481959085
Book学术
文献互助 智能选刊 最新文献 互助须知 联系我们:info@booksci.cn
Book学术提供免费学术资源搜索服务,方便国内外学者检索中英文文献。致力于提供最便捷和优质的服务体验。
Copyright © 2023 Book学术 All rights reserved.
ghs 京公网安备 11010802042870号 京ICP备2023020795号-1