检索结果-内蒙古大学图书馆

Proceedings of the 2023 9th International Conference on Communication and Information Processing

作者： Xiaojian Gu Tianyu Kang Anshun Zhou Li Guo Engineering Research Center of Blockchain and Network Convergence Technology Ministry of Education Beijing University of Posts and Telecommunications China School of Artificial Intelligence Beijing University of Posts and Telecommunications China and National Engineering Research Center for Mobile Internet Security Technology Beijing University of Posts and Telecommunications China China Unicom (Hainan) Innovation Research Institute China

ISBN: (纸本)9798400708909

The PBFT algorithm is a consensus algorithm that reduces communication complexity to a polynomial level, addressing the inefficiency of traditional Byzantine fault tolerance mechanisms. It is commonly adopted in the consensus layer of blockchain systems. However, as the number of system nodes increases, the algorithm faces the challenge of rapidly increasing communication complexity. One solution to this problem is to use deterministic algorithms to select smaller consensus groups. However, in an open network, this approach is susceptible to Distributed Denial of Service (DDoS) attacks against the main nodes, posing a risk of system unavailability. Another solution involves using Verifiable Random Functions (VRF) technology to select consensus group nodes. However, this approach often introduces additional time overhead. To combine the advantages of both solutions, this paper proposes an improved PBFT algorithm based on a Dual-Random-Selection mechanism (DRS-BFT). The algorithm uses an unbiased random selection function and a verifiable random function to select consensus group members and the primary node. In situations with a large number of nodes, the algorithm enhances consensus efficiency by selecting a consensus group, minimizing additional communication overhead, and ensuring system security. Security analysis demonstrates that the system, under the assumption of security requirements, can guarantee data integrity, consistency, and availability. It can also prevent targeted attacks against the primary node that could lead to system unavailability. To validate the system's functionality and performance, the paper designs and develops a prototype system and establishes an experimental environment. The experiments show that the algorithm dynamically adjusts the consensus group range through the Dual-Random-Selection mechanism to adapt to changes in network conditions. Additionally, compared to traditional PBFT, the algorithm exhibits superior performance.

关键词： Practical Byzantine Fault Tolerance (PBFT) Verifiable Random Function (VRF) blockchain consensus algorithm

来源：评论

学校读者我要写书评

暂无评论

Tutorial: consensus algorithms from Classical to Blockchain: Quickly Program, Configure, Run, and Check

Tutorial: Consensus Algorithms from Classical to Blockchain:...

引用

International Conference on Distributed Computing Systems Workshop

作者： Yanhong A. Liu Scott D. Stoller Stony Brook University

ISBN: (数字)9798350354713

ISBN: (纸本)9798350354720

This tutorial examines well-known algorithms for distributed consensus problems, from classical consensus to blockchain consensus. We discuss exact algorithms that are high-level as in pseudocode and directly executable as programs at the same time, focusing on how to quickly program, configure, run, and check these algorithms as well as distributed algorithms and systems in general.

关键词： Conferences Focusing Tutorials consensus algorithm Blockchains Distributed computing Distributed algorithms

来源：评论

学校读者我要写书评

暂无评论

A consensus Blockchain-Based Credit Risk Evaluation and Credit Data Storage Using Novel Deep Learning Approach

引用

COMPUTATIONAL ECONOMICS 2025年 1-34页

作者： Amarnadh, Vadipina Rao, Moparthi Nageswara Anurag Univ Sch Engn Hyderabad India Amrita Vishwa Vidyapeetham Amrita Sch Comp Amaravati Campus Amaravati 522503 Andhra Pradesh India

In the present era, Credit Risk Evaluation (CRE) holds extreme technical significance and real-world use in banking sectors. Accurate and efficient credit risk assessment models are instantly essential because of the problems where data processing consumes more time to build and a huge number of data mining stages. In the field of CRE and data storage, blockchain technology along with deep learning models have been widely suggested for ensuring the privacy and security to the customer's credit data. However, the traditional approaches are not very interpretable. To this concern, this research introduces a Multi-layer Residual coordinate Boosted Sooty tern Attention Network (MRBSAN) with consensus-based blockchain technology for secure storage of evaluated customer's credit data in the banking sector. The introduced approach includes effective preprocessing of data, optimal selection of features by enhancing with pheromone concentration, evaluation of credit risk and secure storage of credit data by utilizing focal loss to achieve a remarkable output. The findings demonstrate that the proposed approach effectively assesses the customer's credit risk and stores the credit data securely. The proposed model has an average accuracy of 97.2%, precision of 98.6%, recall of 98.6%, and an F1-score of 98% using three datasets. These results surpass the performance of existing approaches.

关键词： Blockchain consensus algorithm Credit risk evaluation Deep learning Trust value Banking sector

来源：评论

学校读者我要写书评

暂无评论

Adaptive Probabilistic Methods for Boosting the Reliability of consensus algorithms in Distributed Systems

Adaptive Probabilistic Methods for Boosting the Reliability ...

引用

International Conference on Modern Problems of Radio Engineering, Telecommunications and Computer Science

作者： Stanislav Zhuravel Department of Telecommunication Lviv Polytechnic National University Lviv Ukraine

ISBN: (数字)9798331520564

ISBN: (纸本)9798331520571

consensus algorithms are essential for maintaining reliability and consistency in distributed systems. However, false positives—incorrectly identifying functional nodes as failed—pose significant challenges, leading to unnecessary leader re-elections, increased latency, and degraded system performance. This article explores the application of Bayes' theorem as a solution to the false positive problem in consensus algorithms. By utilizing Bayesian inference, systems can dynamically update the probability of node failure based on real-time evidence, reducing the likelihood of triggering false positives caused by transient issues, network delays, or strict timeout settings. The article presents a detailed methodology for integrating Bayesian reasoning into consensus mechanisms and eventually into distributed system. Additionally, the advantages of using Bayesian inference—such as reduced false positives, improved decision-making, and adaptability—are discussed. The article also addresses potential challenges, including computational complexity and the importance of developing modern fault detection mechanisms. By combining Bayesian inference with existing consensus strategies, this approach provides a more flexible and accurate way to enhance fault tolerance in distributed systems, mitigating the impact of false positives.

关键词： Accuracy Fault detection System performance consensus algorithm Reliability theory Probabilistic logic Real-time systems Hardware Bayes methods Reliability

来源：评论

学校读者我要写书评

暂无评论

A Study Framework for Blockchain consensus algorithms

A Study Framework for Blockchain Consensus Algorithms

引用

International Conference on Internet of Things and Applications (IoT)

作者： Maliheh Shahryari Sadegh Sohani Mohammad Allahbakhsh Haleh Amintoosi Faculty of Engineering Ferdowsi University of Mashhad Mashhad Iran

ISBN: (数字)9798350374674

ISBN: (纸本)9798350374681

Blockchain technology has demonstrated promising practical applications since its inception. From the early days of cryptocurrencies to the current era of smart contracts, blockchain technology has found applications in numerous fields. It effectively addresses trust issues in open networks through decentralized means. The consensus algorithm in blockchain ensures that nodes within a complex network environment can reach an agreement, thereby maintaining the immutability of the node state. This particular algorithm is a cornerstone technology in the realm of blockchain and plays a crucial role in continuous research within this domain. Within this investigation, we aim to clarify the fundamental principles underlying the consensus procedure while classifying diverse consensus algorithms. We delve into the research advancements made in the field of consensus algorithms, and ultimately, we evaluate their performance, discussing the challenges they face and outlining future research directions through a comparative analysis of existing protocols.

关键词： Smart cities Scalability Smart contracts Focusing consensus algorithm Blockchains Delays

来源：评论

学校读者我要写书评

暂无评论

Describing and verifying malicious fault-tolerant consensus algorithms using PlusCAL and C languages

Describing and verifying malicious fault-tolerant consensus ...

引用

Pacific Rim International Symposium on Dependable Computing

作者： Aoi Ono Tatsuhiro Tsuchiya Osaka University

Designing distributed algorithms is challenging owing to asynchrony and faults. In this study, we formally describe two malicious fault-tolerant consensus algorithms using two languages, PlusCAL and C, and perform mod... 详细信息

ISBN: (数字)9798331540746

ISBN: (纸本)9798331540753

关键词： Fault tolerance Fault tolerant systems C languages consensus algorithm Model checking Distributed algorithms

来源：评论

学校读者我要写书评

暂无评论

A consensus time synchronization protocol in wireless sensor network

引用

Journal of Systems Engineering and Electronics 2023年第6期34卷 1465-1472页

作者： CHEN Kesong ZHANG Yu School of Information and Communication Engineering University of Electronic Science and Technology of ChinaChengdu 611731China

Time synchronization is one of the base techniques in wireless sensor networks(WSNs).This paper proposes a novel time synchronization protocol which is a robust consensusbased algorithm in the existence of transmission delay and packet *** compensates for transmission delay and packet loss firstly,and then,estimates clock skew and clock offset in two *** and experiment results show that the proposed protocol can keep synchronization error below 2μs in the grid network of 10 nodes or the random network of 90 ***,the synchronization accuracy in the proposed protocol can keep constant when the WSN works up to a month.

关键词： time synchronization consensus algorithm transmission delay packet loss wireless sensor network(WSN).

来源：评论

学校读者我要写书评

暂无评论

Safe and Efficient Delegated Proof of Stake consensus Mechanism Based on Dynamic Credit in Electronic Transaction

引用

JOURNAL OF INTERNET TECHNOLOGY 2023年第1期24卷 123-133页

作者： Zhao, Mingjie Dai, Cheng Guo, Bing Sichuan Univ Coll Comp Sci Chengdu Peoples R China

The sector of electronic transactions based on blockchain technology is expanding quickly thanks to the reliability of the consensus mechanism, which offers a new technical path for developing the financial industry. The consensus algorithms cannot support the safety and efficiency required for electronic transaction scenarios as they are right now. We propose an enhanced DPoS algorithm based on dynamic credit (DC-DPoS) to address the aforementioned issue. It has a system for node classification, dynamic credit evaluation, and a consistency algorithm that combines voting and random selection. According to theoretical research and simulated experiments, our algorithm improves security while achieving reduced latency and greater throughput. It presents a fresh thought for enhancing the functionality of the blockchain system while also satisfying the fundamental technical criteria of electronic transactions.

关键词： Blockchain consensus algorithm Delegated Proof of Stake Electronic transaction Dynamic credit

来源：评论

学校读者我要写书评

暂无评论

A survey on scalable consensus algorithms for blockchain technology

Cyber Security and Applications

引用

Cyber Security and Applications 2025年 3卷

作者： Jain, Ankit Kumar Gupta, Nishant Gupta, Brij B. National Institute of Technology Kurukshetra India Department of Computer Science and Information Engineering Asia University Taiwan Taichung 413 China Symbiosis Centre for Information Technology (SCIT) Symbiosis International University Pune India Center for Interdisciplinary Research University of Petroleum and Energy Studies (UPES) Dehradun India

The process of reaching an agreement on a value within a distributed network, known as a consensus problem, is a defining feature of blockchain. This consensus problem can be seen in various applications like load balancing, transaction validation in blockchain, and distributed computing. In recent years, many researchers have provided solutions to this problem. Hence we have presented a survey in which we delved into blockchain consensus algorithms and conducted a comparative analysis of all the consensus algorithms to provide information about each protocol's advantages and drawbacks. This survey starts with the standard proof-of-work consensus protocol applied in bitcoin cryptocurrency and its limitations on the ground of the following parameters: throughput (transactions per second), latency, forks, fault tolerance, double spending attacks, and power consumption. The rest of the consensus algorithms in this paper have been systematically covered to address the limitations of proof-of-work. This paper also covered Raft and PBFT consensus algorithms suitable for permissioned networks. Although the PBFT consensus protocol has a high throughput and a low latency, it has limited node scalability. The PBFT has a low byzantine fault tolerant rate. This paper also covers PoEWAL for blockchain-based IoT applications and WBFT, which prevents corrupt nodes from taking part in consensus. A comparative analysis of the consensus algorithms provides an explicit knowledge of the present research, which also offers guidance for future study. © 2024

关键词： Blockchain technology Byzantine faults consensus algorithm Latency Throughput

来源：评论

学校读者我要写书评

暂无评论

Optimizing Node Communication in Vehicle-to-Vehicle Networks: A Relay Selection algorithm Based on Multi-Metric consensus Parameters

Optimizing Node Communication in Vehicle-to-Vehicle Networks...

引用

Science, Engineering and Business for Sustainable Development Goals (SEB-SDG), International Conference on

作者： Abidemi Adejumo Achonu Adejo Caroline Alenogeghene Chuks Ekweme Kehinde Ake Ronald Ajiboye Dept of Robotics UNICCON Group of Companies Abuja Nigeria Dept of Telecommunication Engineering Federal University of Technology Minna Niger State Nigeria Dept. of Robotics UNICCON Group of Companies Mabushi Abuja Nigeria

ISBN: (数字)9798350358155

ISBN: (纸本)9798350358162

Relay selection is one of the major challenges that affect Vehicle-to-Vehicle (V2V) communications. The inability to select the most important relay nodes during transmission has been a problem for many years. This has resulted to increased number of relay involvement, increased number of simulation runs and high cost of implementation, delay and data loss. This research proposed an intelligent algorithm called Multi-metric consensus algorithm. This algorithm considered position of the vehicles in a V2V network, distance and displacement angle of vehicles within the source node’s communication range. This algorithm involves some processes like distance matrix computation, adjacent matrix computation and the routing table computation. Based on the information of the nodes in the routing table, the relay node is selected. The simulation result of the Multi-metric consensus algorithm was compared with the conventional consensus algorithm. Multi-metric consensus algorithm performed better by about 20% and 40% for number of algorithm runs and number of relay nodes involved respectively. The centralised method, consensus based algorithm and multi-metric consensus algorithm were compared in terms of cost of implementation, the Multi-metric consensus was cheaper by 90% and 85% for centralised and conventional consensus respectively, when considered for a period of five years. The performance analysis shows that, Multi-metric consensus algorithm performs best when compared with conventional consensus algorithm and centralised method.

关键词： Costs Simulation Vehicular ad hoc networks consensus algorithm Routing Delays Performance analysis

来源：评论

学校读者我要写书评

暂无评论

建议与咨询留下您的常用邮箱和电话号码，以便我们向您反馈解决方案和替代方法

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案：

请选择收藏分类：

通借通还

建议与咨询 留下您的常用邮箱和电话号码，以便我们向您反馈解决方案和替代方法

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案： 新增检索档案 确定 取消

请选择收藏分类： 新增自定义分类 确定 取消

通借通还

建议与咨询留下您的常用邮箱和电话号码，以便我们向您反馈解决方案和替代方法

请选择保存的检索档案：

请选择收藏分类：