基于轻量级物理层认证的边缘网络区块链共识机制

IF 4.7 2区 计算机科学 Q1 COMPUTER SCIENCE, INFORMATION SYSTEMS
C. Venkatesan;S. Jeevanantham;B. Rebekka
{"title":"基于轻量级物理层认证的边缘网络区块链共识机制","authors":"C. Venkatesan;S. Jeevanantham;B. Rebekka","doi":"10.1109/TNSM.2024.3492234","DOIUrl":null,"url":null,"abstract":"With the surging magnification of IoT applications, the low latency and security are the major challenges. To counteract these challenges, the integration of blockchain in edge network is mandated to offer reduced network overhead, transparency, decentralization and fault tolerance. The respective network nodes are capable of collaborating effectively through blockchain consensus mechanism. However, the major bottleneck is the complexity of consensus mechanism. Hence, to perform efficient realization of blockchain in edge network, we propose an exclusive idea of integrating Physical Layer Authentication (PLA) with consensus to put forth Proof-of-Physical-Layer-Authentication (PoPLA) consensus mechanism. Also, we propose a Byzantine Likelihood Filtering (BLF) approach to deliver Byzantine tolerance with reduced communication complexity. The experimental evaluation of PoPLA is performed on Long Range (LoRa) Wide Area Network (WAN). The PoPLA reduces the mining time by 76.25%, 42.13% and 30.05% in comparison with Proof of Work (PoW), Practical Byzantine Fault Tolerance (PBFT) and RAFT respectively. The BLF enables PoPLA to outperform PBFT by reducing communication complexity from <inline-formula> <tex-math>$O(N^{2})$ </tex-math></inline-formula> to O(N) while increasing Byzantine Fault Tolerance (BFT) level from 33% to 50% faulty nodes. The cryptanalysis showcases that the PoPLA is resistant to security attacks in blockchain network at edge.","PeriodicalId":13423,"journal":{"name":"IEEE Transactions on Network and Service Management","volume":"22 2","pages":"1594-1607"},"PeriodicalIF":4.7000,"publicationDate":"2024-11-06","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"0","resultStr":"{\"title\":\"A Lightweight Physical Layer Authentication-Based Blockchain Consensus Mechanism for Edge Networks\",\"authors\":\"C. Venkatesan;S. Jeevanantham;B. Rebekka\",\"doi\":\"10.1109/TNSM.2024.3492234\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"With the surging magnification of IoT applications, the low latency and security are the major challenges. To counteract these challenges, the integration of blockchain in edge network is mandated to offer reduced network overhead, transparency, decentralization and fault tolerance. The respective network nodes are capable of collaborating effectively through blockchain consensus mechanism. However, the major bottleneck is the complexity of consensus mechanism. Hence, to perform efficient realization of blockchain in edge network, we propose an exclusive idea of integrating Physical Layer Authentication (PLA) with consensus to put forth Proof-of-Physical-Layer-Authentication (PoPLA) consensus mechanism. Also, we propose a Byzantine Likelihood Filtering (BLF) approach to deliver Byzantine tolerance with reduced communication complexity. The experimental evaluation of PoPLA is performed on Long Range (LoRa) Wide Area Network (WAN). The PoPLA reduces the mining time by 76.25%, 42.13% and 30.05% in comparison with Proof of Work (PoW), Practical Byzantine Fault Tolerance (PBFT) and RAFT respectively. The BLF enables PoPLA to outperform PBFT by reducing communication complexity from <inline-formula> <tex-math>$O(N^{2})$ </tex-math></inline-formula> to O(N) while increasing Byzantine Fault Tolerance (BFT) level from 33% to 50% faulty nodes. The cryptanalysis showcases that the PoPLA is resistant to security attacks in blockchain network at edge.\",\"PeriodicalId\":13423,\"journal\":{\"name\":\"IEEE Transactions on Network and Service Management\",\"volume\":\"22 2\",\"pages\":\"1594-1607\"},\"PeriodicalIF\":4.7000,\"publicationDate\":\"2024-11-06\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"0\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"IEEE Transactions on Network and Service Management\",\"FirstCategoryId\":\"94\",\"ListUrlMain\":\"https://ieeexplore.ieee.org/document/10745634/\",\"RegionNum\":2,\"RegionCategory\":\"计算机科学\",\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"Q1\",\"JCRName\":\"COMPUTER SCIENCE, INFORMATION SYSTEMS\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"IEEE Transactions on Network and Service Management","FirstCategoryId":"94","ListUrlMain":"https://ieeexplore.ieee.org/document/10745634/","RegionNum":2,"RegionCategory":"计算机科学","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"Q1","JCRName":"COMPUTER SCIENCE, INFORMATION SYSTEMS","Score":null,"Total":0}
引用次数: 0

摘要

随着物联网应用的激增,低延迟和安全性是主要挑战。为了应对这些挑战,区块链在边缘网络中的集成被要求提供更低的网络开销、透明度、去中心化和容错性。各网络节点能够通过区块链共识机制进行有效协作。然而,主要的瓶颈是共识机制的复杂性。因此,为了在边缘网络中高效实现区块链,我们提出了将物理层认证(PLA)与共识相结合的独特想法,提出了证明-物理层认证(PoPLA)共识机制。此外,我们提出了一种拜占庭可能性过滤(BLF)方法,以降低通信复杂性来提供拜占庭容错性。在远程(LoRa)广域网(WAN)上对poppla进行了实验评估。与工作量证明(PoW)、实际拜占庭容错(PBFT)和RAFT相比,popa的挖矿时间分别缩短了76.25%、42.13%和30.05%。通过将通信复杂度从$ 0 (N^{2})$降低到O(N) $,同时将拜占庭容错(BFT)水平从33%提高到50%,BLF使popa优于PBFT。密码分析表明,在b区块链边缘网络中,popa能够抵抗安全攻击。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
A Lightweight Physical Layer Authentication-Based Blockchain Consensus Mechanism for Edge Networks
With the surging magnification of IoT applications, the low latency and security are the major challenges. To counteract these challenges, the integration of blockchain in edge network is mandated to offer reduced network overhead, transparency, decentralization and fault tolerance. The respective network nodes are capable of collaborating effectively through blockchain consensus mechanism. However, the major bottleneck is the complexity of consensus mechanism. Hence, to perform efficient realization of blockchain in edge network, we propose an exclusive idea of integrating Physical Layer Authentication (PLA) with consensus to put forth Proof-of-Physical-Layer-Authentication (PoPLA) consensus mechanism. Also, we propose a Byzantine Likelihood Filtering (BLF) approach to deliver Byzantine tolerance with reduced communication complexity. The experimental evaluation of PoPLA is performed on Long Range (LoRa) Wide Area Network (WAN). The PoPLA reduces the mining time by 76.25%, 42.13% and 30.05% in comparison with Proof of Work (PoW), Practical Byzantine Fault Tolerance (PBFT) and RAFT respectively. The BLF enables PoPLA to outperform PBFT by reducing communication complexity from $O(N^{2})$ to O(N) while increasing Byzantine Fault Tolerance (BFT) level from 33% to 50% faulty nodes. The cryptanalysis showcases that the PoPLA is resistant to security attacks in blockchain network at edge.
求助全文
通过发布文献求助,成功后即可免费获取论文全文。 去求助
来源期刊
IEEE Transactions on Network and Service Management
IEEE Transactions on Network and Service Management Computer Science-Computer Networks and Communications
CiteScore
9.30
自引率
15.10%
发文量
325
期刊介绍: IEEE Transactions on Network and Service Management will publish (online only) peerreviewed archival quality papers that advance the state-of-the-art and practical applications of network and service management. Theoretical research contributions (presenting new concepts and techniques) and applied contributions (reporting on experiences and experiments with actual systems) will be encouraged. These transactions will focus on the key technical issues related to: Management Models, Architectures and Frameworks; Service Provisioning, Reliability and Quality Assurance; Management Functions; Enabling Technologies; Information and Communication Models; Policies; Applications and Case Studies; Emerging Technologies and Standards.
×
引用
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学术官方微信