车辆边缘计算网络的隐私保护数字孪生

Yi Yang, Wenqiang Ma, Wenqiao Sun, Haibin Zhang t, Zhiqiang Liu, Lexi Xu, Ye Zhu
{"title":"车辆边缘计算网络的隐私保护数字孪生","authors":"Yi Yang, Wenqiang Ma, Wenqiao Sun, Haibin Zhang t, Zhiqiang Liu, Lexi Xu, Ye Zhu","doi":"10.1109/SmartWorld-UIC-ATC-ScalCom-DigitalTwin-PriComp-Metaverse56740.2022.00318","DOIUrl":null,"url":null,"abstract":"As an emerging technology, digital twin (DT) has great potential to address the challenges posed by the dynamics and complexity of vehicles in vehicular edge computing (VEC) networks. By mapping the VEC network to the virtual space, DT can monitor vehicles, road side units (RSUs), channels, and resource usage in real time, further bringing comprehensive and accurate network analysis to the VEC network. However, the real-world implement of DT-empowered VEC networks cannot avoid the collection of privacy-sensitive information of participants. An incentive mechanism is necessitated to identify the qualities of participants without prior information and incent them to participate in DT modeling, so as to realize the requirement of privacy preserving while improving the DT modeling efficiency. In this paper, We propose a combined multi-armed bandit-based auction (CMABA) incentive mechanism that can identify the quality of clients in the VEC network without revealing sensitive and private information, and achieve the optimal performance of the model under budget constraints. The simulation results show that this scheme can significantly incent high-quality clients to participate in DT modeling under the requirement of privacy preserving and the constraint of limited budget, and improve the accuracy of DT modeling.","PeriodicalId":43791,"journal":{"name":"Scalable Computing-Practice and Experience","volume":null,"pages":null},"PeriodicalIF":0.9000,"publicationDate":"2022-12-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"0","resultStr":"{\"title\":\"Privacy-Preserving Digital Twin for Vehicular Edge Computing Networks\",\"authors\":\"Yi Yang, Wenqiang Ma, Wenqiao Sun, Haibin Zhang t, Zhiqiang Liu, Lexi Xu, Ye Zhu\",\"doi\":\"10.1109/SmartWorld-UIC-ATC-ScalCom-DigitalTwin-PriComp-Metaverse56740.2022.00318\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"As an emerging technology, digital twin (DT) has great potential to address the challenges posed by the dynamics and complexity of vehicles in vehicular edge computing (VEC) networks. By mapping the VEC network to the virtual space, DT can monitor vehicles, road side units (RSUs), channels, and resource usage in real time, further bringing comprehensive and accurate network analysis to the VEC network. However, the real-world implement of DT-empowered VEC networks cannot avoid the collection of privacy-sensitive information of participants. An incentive mechanism is necessitated to identify the qualities of participants without prior information and incent them to participate in DT modeling, so as to realize the requirement of privacy preserving while improving the DT modeling efficiency. In this paper, We propose a combined multi-armed bandit-based auction (CMABA) incentive mechanism that can identify the quality of clients in the VEC network without revealing sensitive and private information, and achieve the optimal performance of the model under budget constraints. The simulation results show that this scheme can significantly incent high-quality clients to participate in DT modeling under the requirement of privacy preserving and the constraint of limited budget, and improve the accuracy of DT modeling.\",\"PeriodicalId\":43791,\"journal\":{\"name\":\"Scalable Computing-Practice and Experience\",\"volume\":null,\"pages\":null},\"PeriodicalIF\":0.9000,\"publicationDate\":\"2022-12-01\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"0\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"Scalable Computing-Practice and Experience\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://doi.org/10.1109/SmartWorld-UIC-ATC-ScalCom-DigitalTwin-PriComp-Metaverse56740.2022.00318\",\"RegionNum\":0,\"RegionCategory\":null,\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"Q4\",\"JCRName\":\"COMPUTER SCIENCE, SOFTWARE ENGINEERING\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"Scalable Computing-Practice and Experience","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/SmartWorld-UIC-ATC-ScalCom-DigitalTwin-PriComp-Metaverse56740.2022.00318","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"Q4","JCRName":"COMPUTER SCIENCE, SOFTWARE ENGINEERING","Score":null,"Total":0}
引用次数: 0

摘要

作为一项新兴技术,数字孪生(DT)在解决车辆边缘计算(VEC)网络中车辆动态和复杂性带来的挑战方面具有巨大潜力。通过将VEC网络映射到虚拟空间,DT可以实时监控车辆、路侧单元(rsu)、通道和资源使用情况,进一步为VEC网络带来全面、准确的网络分析。然而,在现实世界中,基于dt的VEC网络无法避免对参与者隐私敏感信息的收集。需要一种激励机制来识别没有先验信息的参与者的素质,激励他们参与DT建模,从而在提高DT建模效率的同时实现隐私保护的要求。在本文中,我们提出了一种联合多臂强盗拍卖(CMABA)激励机制,该机制可以在不泄露敏感和私有信息的情况下识别VEC网络中的客户质量,并在预算约束下实现模型的最优性能。仿真结果表明,该方案在隐私保护要求和有限预算约束下,能显著激励优质客户参与DT建模,提高了DT建模的精度。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
查看原文
分享 分享
微信好友 朋友圈 QQ好友 复制链接
本刊更多论文
Privacy-Preserving Digital Twin for Vehicular Edge Computing Networks
As an emerging technology, digital twin (DT) has great potential to address the challenges posed by the dynamics and complexity of vehicles in vehicular edge computing (VEC) networks. By mapping the VEC network to the virtual space, DT can monitor vehicles, road side units (RSUs), channels, and resource usage in real time, further bringing comprehensive and accurate network analysis to the VEC network. However, the real-world implement of DT-empowered VEC networks cannot avoid the collection of privacy-sensitive information of participants. An incentive mechanism is necessitated to identify the qualities of participants without prior information and incent them to participate in DT modeling, so as to realize the requirement of privacy preserving while improving the DT modeling efficiency. In this paper, We propose a combined multi-armed bandit-based auction (CMABA) incentive mechanism that can identify the quality of clients in the VEC network without revealing sensitive and private information, and achieve the optimal performance of the model under budget constraints. The simulation results show that this scheme can significantly incent high-quality clients to participate in DT modeling under the requirement of privacy preserving and the constraint of limited budget, and improve the accuracy of DT modeling.
求助全文
通过发布文献求助,成功后即可免费获取论文全文。 去求助
来源期刊
Scalable Computing-Practice and Experience
Scalable Computing-Practice and Experience COMPUTER SCIENCE, SOFTWARE ENGINEERING-
CiteScore
2.00
自引率
0.00%
发文量
10
期刊介绍: The area of scalable computing has matured and reached a point where new issues and trends require a professional forum. SCPE will provide this avenue by publishing original refereed papers that address the present as well as the future of parallel and distributed computing. The journal will focus on algorithm development, implementation and execution on real-world parallel architectures, and application of parallel and distributed computing to the solution of real-life problems.
期刊最新文献
A Deep LSTM-RNN Classification Method for Covid-19 Twitter Review Based on Sentiment Analysis Flexible English Learning Platform using Collaborative Cloud-Fog-Edge Networking Computer Malicious Code Signal Detection based on Big Data Technology Analyzing Spectator Emotions and Behaviors at Live Sporting Events using Computer Vision and Sentiment Analysis Techniques Spacecraft Test Data Integration Management Technology based on Big Data Platform
×
引用
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