Ziyi Zhou;Oluwakayode Onireti;Xinyi Lin;Lei Zhang;Muhammad Ali Imran
{"title":"在蜂窝网络上实施实用的拜占庭容错技术","authors":"Ziyi Zhou;Oluwakayode Onireti;Xinyi Lin;Lei Zhang;Muhammad Ali Imran","doi":"10.1109/OJCOMS.2024.3477930","DOIUrl":null,"url":null,"abstract":"Blockchain has shown significant potential as a key enabler in privacy and security in the forthcoming 6G wireless network, due to its distributed and decentralized characteristics. Practical Byzantine fault tolerance (PBFT) emerges as a prominent technology for deployment in wireless networks due to its attributes of low latency, high throughput, and minimal computational requirements. However, the high complexity of communication is the bottleneck of PBFT for achieving high scalability. To tackle this problem, this paper proposes a novel framework of PBFT, where the inter-node communication during the normal case operation is completed through base stations. The uplink and downlink communication between the base station and nodes are modelled based on the signal-to-interference-plus-noise ratio (SINR) threshold. A novel ‘timeout’ mechanism is incorporated to reduce the communication complexity. The performance is evaluated by metrics including consensus success probability, communication complexity, view change delay, view change occurrence probability, consensus delay, consensus throughput and energy consumption. The numerical results show that the proposed scheme achieves higher consensus success probability and throughput, lower communication complexity and consensus delay compared to the conventional PBFT. The results of view change delay and view change occurrence probability and the optimal configuration provide analytical guidance for the deployment of wireless PBFT networks.","PeriodicalId":33803,"journal":{"name":"IEEE Open Journal of the Communications Society","volume":null,"pages":null},"PeriodicalIF":6.3000,"publicationDate":"2024-10-10","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"https://ieeexplore.ieee.org/stamp/stamp.jsp?tp=&arnumber=10713236","citationCount":"0","resultStr":"{\"title\":\"Implementing Practical Byzantine Fault Tolerance Over Cellular Networks\",\"authors\":\"Ziyi Zhou;Oluwakayode Onireti;Xinyi Lin;Lei Zhang;Muhammad Ali Imran\",\"doi\":\"10.1109/OJCOMS.2024.3477930\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"Blockchain has shown significant potential as a key enabler in privacy and security in the forthcoming 6G wireless network, due to its distributed and decentralized characteristics. Practical Byzantine fault tolerance (PBFT) emerges as a prominent technology for deployment in wireless networks due to its attributes of low latency, high throughput, and minimal computational requirements. However, the high complexity of communication is the bottleneck of PBFT for achieving high scalability. To tackle this problem, this paper proposes a novel framework of PBFT, where the inter-node communication during the normal case operation is completed through base stations. The uplink and downlink communication between the base station and nodes are modelled based on the signal-to-interference-plus-noise ratio (SINR) threshold. A novel ‘timeout’ mechanism is incorporated to reduce the communication complexity. The performance is evaluated by metrics including consensus success probability, communication complexity, view change delay, view change occurrence probability, consensus delay, consensus throughput and energy consumption. The numerical results show that the proposed scheme achieves higher consensus success probability and throughput, lower communication complexity and consensus delay compared to the conventional PBFT. The results of view change delay and view change occurrence probability and the optimal configuration provide analytical guidance for the deployment of wireless PBFT networks.\",\"PeriodicalId\":33803,\"journal\":{\"name\":\"IEEE Open Journal of the Communications Society\",\"volume\":null,\"pages\":null},\"PeriodicalIF\":6.3000,\"publicationDate\":\"2024-10-10\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"https://ieeexplore.ieee.org/stamp/stamp.jsp?tp=&arnumber=10713236\",\"citationCount\":\"0\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"IEEE Open Journal of the Communications Society\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://ieeexplore.ieee.org/document/10713236/\",\"RegionNum\":0,\"RegionCategory\":null,\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"Q1\",\"JCRName\":\"ENGINEERING, ELECTRICAL & ELECTRONIC\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"IEEE Open Journal of the Communications Society","FirstCategoryId":"1085","ListUrlMain":"https://ieeexplore.ieee.org/document/10713236/","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"Q1","JCRName":"ENGINEERING, ELECTRICAL & ELECTRONIC","Score":null,"Total":0}
Implementing Practical Byzantine Fault Tolerance Over Cellular Networks
Blockchain has shown significant potential as a key enabler in privacy and security in the forthcoming 6G wireless network, due to its distributed and decentralized characteristics. Practical Byzantine fault tolerance (PBFT) emerges as a prominent technology for deployment in wireless networks due to its attributes of low latency, high throughput, and minimal computational requirements. However, the high complexity of communication is the bottleneck of PBFT for achieving high scalability. To tackle this problem, this paper proposes a novel framework of PBFT, where the inter-node communication during the normal case operation is completed through base stations. The uplink and downlink communication between the base station and nodes are modelled based on the signal-to-interference-plus-noise ratio (SINR) threshold. A novel ‘timeout’ mechanism is incorporated to reduce the communication complexity. The performance is evaluated by metrics including consensus success probability, communication complexity, view change delay, view change occurrence probability, consensus delay, consensus throughput and energy consumption. The numerical results show that the proposed scheme achieves higher consensus success probability and throughput, lower communication complexity and consensus delay compared to the conventional PBFT. The results of view change delay and view change occurrence probability and the optimal configuration provide analytical guidance for the deployment of wireless PBFT networks.
期刊介绍:
The IEEE Open Journal of the Communications Society (OJ-COMS) is an open access, all-electronic journal that publishes original high-quality manuscripts on advances in the state of the art of telecommunications systems and networks. The papers in IEEE OJ-COMS are included in Scopus. Submissions reporting new theoretical findings (including novel methods, concepts, and studies) and practical contributions (including experiments and development of prototypes) are welcome. Additionally, survey and tutorial articles are considered. The IEEE OJCOMS received its debut impact factor of 7.9 according to the Journal Citation Reports (JCR) 2023.
The IEEE Open Journal of the Communications Society covers science, technology, applications and standards for information organization, collection and transfer using electronic, optical and wireless channels and networks. Some specific areas covered include:
Systems and network architecture, control and management
Protocols, software, and middleware
Quality of service, reliability, and security
Modulation, detection, coding, and signaling
Switching and routing
Mobile and portable communications
Terminals and other end-user devices
Networks for content distribution and distributed computing
Communications-based distributed resources control.