Throughput-Efficient Blockchain for Internet-of-Vehicles

Weiquan Ni, Alia Asheralieva, C. Maple, Md. Monjurul Karim, D. Niyato, Qiang Yan
{"title":"Throughput-Efficient Blockchain for Internet-of-Vehicles","authors":"Weiquan Ni, Alia Asheralieva, C. Maple, Md. Monjurul Karim, D. Niyato, Qiang Yan","doi":"10.1109/GCWkshps52748.2021.9681973","DOIUrl":null,"url":null,"abstract":"Internet-of-Vehicle (IoV) is empowering smart vehicles with data collection and sharing capabilities, and blockchains have been introduced to manage the IoV data due to many advantages, including decentralization, security, reliability, and scalability. Nevertheless, existing IoV blockchain models suffer from poor security against collusion attacks instigated by malicious blockchain miners typically represented by roadside units (RSUs). To address this problem, additional block verifiers, e.g., vehicles, can be recruited during block verification, which enhances security but also can lead to the reduced throughput. Therefore, in this paper, we propose a resource management scheme for IoV blockchains to enhance the system security while maximizing the throughput by optimizing contributed computing resources from RSUs and recruited vehicles. We show that the optimal strategies of RSUs and vehicles can be found through the Karush-Kuhn-Tucker (KKT) conditions and verify (using simulations) that our scheme achieves the higher throughput with enhanced security compared to the existing IoV blockchains.","PeriodicalId":6802,"journal":{"name":"2021 IEEE Globecom Workshops (GC Wkshps)","volume":"16 1","pages":"1-6"},"PeriodicalIF":0.0000,"publicationDate":"2021-12-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"0","resultStr":null,"platform":"Semanticscholar","paperid":null,"PeriodicalName":"2021 IEEE Globecom Workshops (GC Wkshps)","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/GCWkshps52748.2021.9681973","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 0

Abstract

Internet-of-Vehicle (IoV) is empowering smart vehicles with data collection and sharing capabilities, and blockchains have been introduced to manage the IoV data due to many advantages, including decentralization, security, reliability, and scalability. Nevertheless, existing IoV blockchain models suffer from poor security against collusion attacks instigated by malicious blockchain miners typically represented by roadside units (RSUs). To address this problem, additional block verifiers, e.g., vehicles, can be recruited during block verification, which enhances security but also can lead to the reduced throughput. Therefore, in this paper, we propose a resource management scheme for IoV blockchains to enhance the system security while maximizing the throughput by optimizing contributed computing resources from RSUs and recruited vehicles. We show that the optimal strategies of RSUs and vehicles can be found through the Karush-Kuhn-Tucker (KKT) conditions and verify (using simulations) that our scheme achieves the higher throughput with enhanced security compared to the existing IoV blockchains.
高效的车联网区块链
车联网(IoV)正在赋予智能汽车数据收集和共享能力,区块链因其去中心化、安全性、可靠性和可扩展性等诸多优势而被引入管理车联网数据。然而,现有的车联网区块链模型在抵御恶意区块链矿工(通常以路边单元(rsu)为代表)发起的共谋攻击方面的安全性较差。为了解决这个问题,可以在区块验证期间招募额外的区块验证者,例如车辆,这增强了安全性,但也可能导致吞吐量降低。因此,在本文中,我们提出了一种车联网区块链资源管理方案,通过优化rsu和招募车辆的贡献计算资源,在提高系统安全性的同时,最大限度地提高吞吐量。我们表明,可以通过Karush-Kuhn-Tucker (KKT)条件找到rsu和车辆的最佳策略,并验证(使用模拟)与现有的IoV区块链相比,我们的方案实现了更高的吞吐量和增强的安全性。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
求助全文
约1分钟内获得全文 求助全文
来源期刊
自引率
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学术官方微信