车用云网络中最优服务供给建模方法

Farhoud Jafari Kaleibar, M. Abbaspour
{"title":"车用云网络中最优服务供给建模方法","authors":"Farhoud Jafari Kaleibar, M. Abbaspour","doi":"10.1109/IKT51791.2020.9345638","DOIUrl":null,"url":null,"abstract":"In recent years, the development of the Internet of things has also extended to transportation networks, affecting smart transportation networks. There are many vehicles in the city that do not use their resources (storage, processing and bandwidth) and therefore there is a good potential to use these resources as a cloud. However, the mobility of vehicles poses a challenge in providing and receiving services available in the cloud. On the other hand, service requests are not predictable and require the use of dynamic approaches for service provisioning. In this paper, we try to reduce the effect of these challenges by modeling the existing problem with the customized mathematical model of maximum coverage, and by using the approximate heuristic algorithm in this field. The simulation performed by the heuristic algorithm shows an improvement in terms of service delivery rate and resource efficiency compared to the random allocation mode.","PeriodicalId":382725,"journal":{"name":"2020 11th International Conference on Information and Knowledge Technology (IKT)","volume":"43 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2020-12-22","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"0","resultStr":"{\"title\":\"An approach to model the optimal service provisioning in vehicular cloud networks\",\"authors\":\"Farhoud Jafari Kaleibar, M. Abbaspour\",\"doi\":\"10.1109/IKT51791.2020.9345638\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"In recent years, the development of the Internet of things has also extended to transportation networks, affecting smart transportation networks. There are many vehicles in the city that do not use their resources (storage, processing and bandwidth) and therefore there is a good potential to use these resources as a cloud. However, the mobility of vehicles poses a challenge in providing and receiving services available in the cloud. On the other hand, service requests are not predictable and require the use of dynamic approaches for service provisioning. In this paper, we try to reduce the effect of these challenges by modeling the existing problem with the customized mathematical model of maximum coverage, and by using the approximate heuristic algorithm in this field. The simulation performed by the heuristic algorithm shows an improvement in terms of service delivery rate and resource efficiency compared to the random allocation mode.\",\"PeriodicalId\":382725,\"journal\":{\"name\":\"2020 11th International Conference on Information and Knowledge Technology (IKT)\",\"volume\":\"43 1\",\"pages\":\"0\"},\"PeriodicalIF\":0.0000,\"publicationDate\":\"2020-12-22\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"0\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"2020 11th International Conference on Information and Knowledge Technology (IKT)\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://doi.org/10.1109/IKT51791.2020.9345638\",\"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 11th International Conference on Information and Knowledge Technology (IKT)","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/IKT51791.2020.9345638","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 0

摘要

近年来,物联网的发展也延伸到交通网络,影响智能交通网络。城市中有许多车辆没有使用它们的资源(存储、处理和带宽),因此有很好的潜力将这些资源用作云。然而,车辆的移动性在提供和接收云中的可用服务方面提出了挑战。另一方面,服务请求是不可预测的,需要使用动态方法来提供服务。在本文中,我们试图通过最大覆盖的定制数学模型对现有问题进行建模,并使用该领域的近似启发式算法来减少这些挑战的影响。启发式算法的仿真结果表明,与随机分配模式相比,启发式算法在服务交付率和资源效率方面都有提高。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
查看原文
分享 分享
微信好友 朋友圈 QQ好友 复制链接
本刊更多论文
An approach to model the optimal service provisioning in vehicular cloud networks
In recent years, the development of the Internet of things has also extended to transportation networks, affecting smart transportation networks. There are many vehicles in the city that do not use their resources (storage, processing and bandwidth) and therefore there is a good potential to use these resources as a cloud. However, the mobility of vehicles poses a challenge in providing and receiving services available in the cloud. On the other hand, service requests are not predictable and require the use of dynamic approaches for service provisioning. In this paper, we try to reduce the effect of these challenges by modeling the existing problem with the customized mathematical model of maximum coverage, and by using the approximate heuristic algorithm in this field. The simulation performed by the heuristic algorithm shows an improvement in terms of service delivery rate and resource efficiency compared to the random allocation mode.
求助全文
通过发布文献求助,成功后即可免费获取论文全文。 去求助
来源期刊
自引率
0.00%
发文量
0
期刊最新文献
A New Sentence Ordering Method using BERT Pretrained Model Classical-Quantum Multiple Access Wiretap Channel with Common Message: One-Shot Rate Region Business Process Improvement Challenges: A Systematic Literature Review The risk prediction of heart disease by using neuro-fuzzy and improved GOA Distributed Learning Automata-Based Algorithm for Finding K-Clique in Complex Social Networks
×
引用
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