Fair Connectivity-Oriented Allocation for Combined Resources in VCC Networks

Binal Tejani, R. E. Grande
{"title":"Fair Connectivity-Oriented Allocation for Combined Resources in VCC Networks","authors":"Binal Tejani, R. E. Grande","doi":"10.1109/ISCC55528.2022.9912984","DOIUrl":null,"url":null,"abstract":"The allocation and management of vehicular resources are essential in enabling services in Vehicular Cloud networks. Combined Resource Units (CRUs) allow for relaxed resource management by utilizing vehicular resources clustered in virtualized units and easing the fulfillment of service requests. Previous works have used mobility-based models such as SMDP and MDP for resource allocation. However, these models have presented significant system overhead, which has impacted the network's performance. Therefore, this work proposes a game theory model for assigning CRUs to satisfy service requests. The utility function of CRUs is maximized by playing a non-cooperative game between service requests. Two different game models are implemented based on exhaustive search and pruning methods. These models use distinct utility functions, which differ in terms of distance and signal strength of the CRUs. Comparing the performance of the two models, the pruning model offers a 90% success rate towards satisfying service requests.","PeriodicalId":309606,"journal":{"name":"2022 IEEE Symposium on Computers and Communications (ISCC)","volume":null,"pages":null},"PeriodicalIF":0.0000,"publicationDate":"2022-06-30","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"0","resultStr":null,"platform":"Semanticscholar","paperid":null,"PeriodicalName":"2022 IEEE Symposium on Computers and Communications (ISCC)","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/ISCC55528.2022.9912984","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 0

Abstract

The allocation and management of vehicular resources are essential in enabling services in Vehicular Cloud networks. Combined Resource Units (CRUs) allow for relaxed resource management by utilizing vehicular resources clustered in virtualized units and easing the fulfillment of service requests. Previous works have used mobility-based models such as SMDP and MDP for resource allocation. However, these models have presented significant system overhead, which has impacted the network's performance. Therefore, this work proposes a game theory model for assigning CRUs to satisfy service requests. The utility function of CRUs is maximized by playing a non-cooperative game between service requests. Two different game models are implemented based on exhaustive search and pruning methods. These models use distinct utility functions, which differ in terms of distance and signal strength of the CRUs. Comparing the performance of the two models, the pruning model offers a 90% success rate towards satisfying service requests.
查看原文
分享 分享
微信好友 朋友圈 QQ好友 复制链接
本刊更多论文
面向连通性的VCC网络组合资源公平分配
车辆资源的分配和管理对于实现车辆云网络中的服务至关重要。组合资源单元(cru)通过利用集群在虚拟化单元中的车辆资源,简化服务请求的实现,从而简化了资源管理。以前的工作使用基于移动性的模型,如SMDP和MDP进行资源分配。然而,这些模型带来了巨大的系统开销,从而影响了网络的性能。因此,本工作提出了一个分配cru以满足服务请求的博弈论模型。通过在服务请求之间进行非合作博弈,使cru的效用函数最大化。基于穷举搜索和剪枝方法实现了两种不同的博弈模型。这些模型使用不同的效用函数,它们在cru的距离和信号强度方面有所不同。比较两种模型的性能,修剪模型对满足服务请求的成功率为90%。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
求助全文
约1分钟内获得全文 去求助
来源期刊
自引率
0.00%
发文量
0
期刊最新文献
Convergence-Time Analysis for the HTE Link Quality Estimator OCVC: An Overlapping-Enabled Cooperative Computing Protocol in Vehicular Fog Computing Non-Contact Heart Rate Signal Extraction and Identification Based on Speckle Image Active Eavesdroppers Detection System in Multi-hop Wireless Sensor Networks A Comparison of Machine and Deep Learning Models for Detection and Classification of Android Malware Traffic
×
引用
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