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

Performance optimization of agricultural traceability blockchain based on sharding technology

QUALITY ASSURANCE AND SAFETY OF CROPS & FOODS 2025年第2期17卷 213-231页

作者： Guo, Xiangdong Zhang, Yuting Yao, Jingfa Teng, Guifa Hebei Agr Univ Coll Mechatron & Elect Engn Baoding 071001 Peoples R China Hebei Agr Univ Coll Informat Sci & Technol Baoding 071001 Peoples R China Hebei Software Inst Software Engn Dept Baoding 071000 Peoples R China Hebei Coll Intelligent Interconnect Equipment & Mu Big Data Applicat Technol Res Dev Ctr Baoding 071000 Peoples R China Hebei Key Lab Agr Big Data Baoding 071001 Peoples R China Hebei Digital Agr Ind Technol Res Inst Shijiazhuang 056400 Peoples R China

With the increasing global concerns over food safety, ensuring the transparency and traceability of agricultural products throughout their entire production-to-consumption process has become a key issue of societal interest. Blockchain technology, due to its decentralized, immutable, and transparent nature, offers a novel solution for the traceability of agricultural products. However, traditional blockchain systems encounter performance bottlenecks when handling large-scale agricultural data, particularly under conditions of high data volume and frequent transactions, where issues such as processing delays and insufficient throughput commonly arise. Sharding technology, a critical approach for improving blockchain performance, has the potential to significantly enhance system throughput and response time by partitioning the blockchain network into multiple independent shards for parallel processing. However, the application of sharding technology in agricultural traceability systems faces several challenges, including shard load imbalance, communication delays between shards, and inefficiencies in consensus algorithms. To address these challenges, two innovative approaches were proposed in this study: firstly, to address the issue of uneven load distribution in sharding, a jump hash sharding algorithm was designed to optimize shard allocation strategies, thereby improving resource utilization and processing efficiency;secondly, to tackle the performance bottleneck of consensus algorithms, an enhanced consensus algorithm was introduced to improve consensus efficiency while maintaining security. Experimental results demonstrated that the proposed method significantly outperformed traditional blockchain-based traceability systems in terms of performance and scalability, providing a more efficient and reliable technological solution for the application of blockchain technology in the agricultural sector. This research not only offers a more efficient technological solu

关键词： agricultural product traceability blockchain consensus algorithm hump hash sharding algorithm performance optimization sharding technology

来源：评论

学校读者我要写书评

暂无评论

Lightweight Blockchain for Data Integrity and Traceability in IoT Networks

引用

IEEE ACCESS 2025年 13卷 81105-81117页

作者： Garcia, Laura Cancimance, Carlos Asorey-Cacheda, Rafael Zuniga-Canon, Claudia-Liliana Garcia-Sanchez, Antonio-Javier Garcia-Haro, Joan Univ Politecn Cartagena Dept Informat & Commun Technol Cartagena 30202 Spain Univ Santiago Cali Res Grp COMBA I D Cali 760035 Colombia

Data integrity and traceability are important challenges to provide security in the Internet of Things (IoT) networks, which are often vulnerable to data manipulation attacks due to their use of low-resource devices and wireless communication technologies. In this regard, blockchain is a promising solution to enhance IoT security, but the implementation of a conventional blockchain requires high computational and network connectivity resources that are not compatible with IoT networks. In this paper, we propose a lightweight blockchain for data integrity and traceability in IoT networks that adapts the Distributed Ledger Technology (DLT) feature of blockchain to the LoRaWAN wireless communication protocol. Our proposal offers data integrity without the need for complex consensus algorithms or cryptographic operations. We also have designed and implemented a logical LoRaWAN P2P topology that enables communication between the IoT nodes which comprise LoRaWAN's characteristic star topology. Finally, we evaluate our proposal and demonstrate its feasibility and performance in terms of data traceability, and network overhead.

关键词： Blockchains Internet of Things LoRaWAN Proposals Performance evaluation Security Distributed ledger Data integrity Wireless communication consensus algorithm Blockchain distributed ledger technology

来源：评论

学校读者我要写书评

暂无评论

Edge connectivity of a neutrosophic graph

引用

Neutrosophic Sets and Systems 2025年 81卷 729-740页

作者： Tripathy, Aparna Panada, Amaresh Chandra Behera, Siva Prasad Mohanty, Bhabani S. Department of Mathematics C.V. Raman Global University Odisha Bhubaneswar752054 India Department of Statistics and Applied Mathematics Central University of Tamil Nadu India

Neutosophic graphs are an extension of fuzzy and intuitionistic fuzzy graphs by including the uncertainty, vagueness, and indeterminacy that are normal in the real world. This paper looks into the edge connectivity of a neutrosophic graph, which is a basic parameter that shows how strong and fault-tolerant networks are that are modelled by these graphs. Edge connectivity, which is the smallest number of edges that need to be taken away from a graph to make it trivial or disconnected, is a key concept in figuring out how strong and resilient networks are in many situations. This paper also addresses computational challenges related to determining edge connectivity in neutrosophic graphs. We develop efficient algorithms that minimize computational overhead and ensure accuracy in identifying the critical edge sets. We analyze the performance of these algorithms through both theoretical complexity assessments and empirical evaluations on benchmark datasets. Some of the most important things that the study found were critical edges that, when removed, have a big effect on how connected the graph is and how indeterminacy affects the strength of networks. The research underscores the importance of incorporating neutrosophic parameters into graph connectivity studies to better model and analyse systems characterized by uncertainty and partial knowledge. © 2025, University of New Mexico. All rights reserved.

关键词： consensus algorithm

来源：评论

学校读者我要写书评

暂无评论

Collaborative Intrusion Detection Approach Based on Blockchain in Internet of Vehicles

引用

IEEE INTERNET OF THINGS JOURNAL 2025年第9期12卷 11965-11976页

作者： Xing, Rui Su, Zhou Wang, Yuntao Jingdezhen Ceram Univ Sch Informat Engn Jingdezhen 333403 Jiangxi Peoples R China Xi An Jiao Tong Univ Sch Cyber Sci & Engn Xian 710049 Shaanxi Peoples R China

As the Internet of Vehicles (IoV) advances, the security concerns surrounding vehicular networks have grown increasingly critical due to the openness of networking among vehicles, inadvertently creating more opportunities for adversaries to infiltrate and potentially disrupt vehicle operations. Intrusion detection systems (IDSs) stand as a promising solution, effectively mitigating the myriad of threats and security concerns that plague vehicles. In this article, we delve into the realm of IDSs within vehicular networks and propose an innovative collaborative intrusion detection framework based on blockchain technology and auction game. First, we integrate a vehicular blockchain into the IDS, offering a holistic approach to tackling both internal and external threats within vehicular networks. Second, we introduce a novel assistant-delegated Byzantine fault tolerance (A-DBFT) consensus algorithm, designed to bolster the efficiency of intrusion detection within the blockchain while maintaining the efficacy of the consensus mechanism. Third, we develop an auction game mechanism that incentivizes assistants and verifiers to actively initiate and participate in auctions, thereby enhancing the overall security of our intrusion detection scheme. Ultimately, we present simulation results that validate the superiority of our proposed scheme compared to conventional approaches.

关键词： Blockchains Intrusion detection Security Games Collaboration consensus algorithm Privacy Fault tolerant systems Fault tolerance Internet of Vehicles Assistant-delegated Byzantine fault tolerance (A-DBFT) blockchain Internet of Vehicles (IoV) intrusion detection

来源：评论

学校读者我要写书评

暂无评论

On Augmented Kaczmarz algorithm for the Solution of Inconsistent Linear Systems

IAENG International Journal of Computer Science

引用

IAENG International Journal of Computer Science 2025年第1期52卷 46-51页

作者： Wang, Jingya Wen, Bin Liu, Yong School of Mathematics and Statistics Changshu Institute of Technology Jiangsu Suzhou215500 China School of Mathematics and Statistics Changshu Institute of Technology Jiangsu Suzhou215500 China School of Mathematics and Statistics Changshu Institute of Technology Jiangsu Suzhou215500 China

The augmented Kaczmarz algorithm is devised to solve an inconsistent linear system by employing the classical Kaczmarz algorithm on a parameterized augmented linear system derived from the original inconsistent linear system. The convergence of the resulting algorithm is proved. Numerical results show that our algorithm exhibits superior performance compared to the greedy randomized augmented Kaczmarz algorithm in relation to the number of iterations and computational durations for ill-conditioned linear inconsistent systems. © (2025), (International Association of Engineers). All rights reserved.

关键词： consensus algorithm

来源：评论

学校读者我要写书评

暂无评论

CloudChain: A Cloud Blockchain Using Shared Memory consensus and RDMA

引用

IEEE TRANSACTIONS ON COMPUTERS 2022年第12期71卷 3242-3253页

作者： Xu, Minghui Liu, Shuo Yu, Dongxiao Cheng, Xiuzhen Guo, Shaoyong Yu, Jiguo Shandong Univ Sch Comp Sci & Technol Qingdao 266510 Peoples R China Beijing Univ Posts & Commun State Key Lab Networking & Switching Technol Beijing 100876 Peoples R China Qilu Univ Technol Shandong Acad Sci Jinan 250353 Shandong Peoples R China Natl Supercomp Ctr Jinan Shandong Comp Sci Ctr Jinan 250014 Shandong Peoples R China Shandong Lab Comp Networks Jinan 250014 Peoples R China

Blockchain technologies can enable secure computing environments among mistrusting parties. Permissioned blockchains are particularly enlightened by companies, enterprises, and government agencies due to their efficiency, customizability, and governance-friendly features. Obviously, seamlessly fusing blockchain and cloud computing can significantly benefit permissioned blockchains;nevertheless, most blockchains implemented on clouds are originally designed for loosely-coupled networks where nodes communicate asynchronously, failing to take advantages of the closely-coupled nature of cloud servers. In this paper, we propose an innovative cloud-oriented blockchain - CloudChain, which is a modularized three-layer system composed of the network layer, consensus layer, and blockchain layer. CloudChain is based on a shared-memory model where nodes communicate synchronously by direct memory accesses. We realize the shared-memory model with the Remote Direct Memory Access technology, based on which we propose a shared-memory consensus algorithm to ensure presistence and liveness, the two crucial blockchain security properties countering Byzantine nodes. We also implement a CloudChain prototype based on a RoCEv2-based testbed to experimentally validate our design, and the results verify the feasibility and efficiency of CloudChain.

关键词： Blockchains Cloud computing Computational modeling consensus algorithm Fabrics Protocols Kernel Blockchain cloudchain cloud computing shared memory remote direct memory access (RDMA)

来源：评论

学校读者我要写书评

暂无评论

RGPBFT: A Reputation-Based PBFT algorithm with Node Grouping Strategy

引用

ARABIAN JOURNAL FOR SCIENCE AND ENGINEERING 2024年 1-14页

作者： Zhu, Xutong Hu, Xiaoxuan Zhu, Waiming Hefei Univ Technol Sch Management Hefei 230009 Peoples R China Minist Educ Key Lab Proc Optimizat & Intelligent Decis Making Tunxi Rd Hefei 230009 Anhui Peoples R China Anhui Aerosp Syst Intelligent Management Engn Res Tunxi Rd Hefei 230009 Anhui Peoples R China

The practical Byzantine fault tolerance (PBFT) algorithm stands out as one of the most frequently employed consensus algorithms in consortium blockchains. However, due to the frequent global communication mechanism, the PBFT's communication overhead increases exponentially with the number of nodes, resulting in poor scalability. Therefore, the PBFT is typically used only in small networks. To improve the PBFT's efficiency in large-scale systems such as massive smart grids and the Internet of Things, we put forward a reputation-based PBFT algorithm with node grouping strategy (RGPBFT). Specifically, we firstly develop an improved consistency subprotocol based on node grouping strategy to improve the consensus efficiency and the scalability of the PBFT. Then, we propose a reputation-based strategy to enhance the reliability of the elected master node. The simulated test results show that the node grouping strategy could significantly improve the consensus efficiency of the PBFT, and the reputation-based strategy could reduce the impact of Byzantine nodes on the throughput and consensus latency. Overall, the test results demonstrate that the RGPBFT outperforms the PBFT in consensus latency, throughput, communication overhead, and fault tolerance. The RGPBFT exhibits high consensus efficiency in large-scale networks.

关键词： Practical byzantine fault tolerance consensus algorithm Consortium blockchain Node grouping Reputation-based strategy

来源：评论

学校读者我要写书评

暂无评论

ONLINE PRIMAL DUAL MEETS ONLINE MATCHING WITH STOCHASTIC REWARDS: CONFIGURATION LP TO THE RESCUE

引用

SIAM Journal on Computing 2024年第5期53卷 1217-1256页

作者： Huang, Zhiyi Zhang, Qiankun Department of Computer Science The University of Hong Kong Hong Kong School of Cyber Science and Engineering Huazhong University of Science and Technology Wuhan China

Mehta and Panigrahi (FOCS 2012, IEEE, Piscataway, NJ, 2012, pp. 728-737) introduce the problem of online matching with stochastic rewards, where edges are associated with success probabilities and a match succeeds with the probability of the corresponding edge. It is one of the few online matching problems that have defied the randomized online primal dual framework by Devanur, Jain, and Kleinberg (SODA 2013, SIAM, Philadelphia, 2013, pp. 101-107) thus far. This paper unlocks the power of randomized online primal dual in online matching with stochastic rewards by employing the configuration linear program rather than the standard matching linear program used in previous works. Our main result is a 0.572 competitive algorithm for the case of vanishing and unequal probabilities, improving the best previous bound of 0.534 by Mehta, Waggoner, and Zadimoghaddam (SODA 2015, SIAM, Philadelphia, 2015, pp. 1388-1404) and, in fact, is even better than the best previous bound of 0.567 by Mehta and Panigrahi (FOCS 2012, IEEE, Piscataway, NJ, 2012, pp. 728-737) for the more restricted case of vanishing and equal probabilities. For vanishing and equal probabilities, we get a better competitive ratio of 0.576. Our results further generalize to the vertex-weighted case due to the intrinsic robustness of the randomized online primal dual analysis. © 2024 Society for Industrial and Applied Mathematics.

关键词： consensus algorithm

来源：评论

学校读者我要写书评

暂无评论

Search for Locally Optimal Strategies in a Linear Game Problem with Favorable Situations

引用

Journal of Applied and Industrial Mathematics 2024年第3期18卷 489-502页

作者： Mamatov, A.R. Rashidov Samarkand State University Samarkand140104 Uzbekistan

Abstract: A linear game problem for two players is considered. The two players alternately choosetheir strategies from their respective sets. First, player 1 chooses his/her strategy, then player 2,knowing the strategy of player 1, does the same. The set of strategies of player 2 depends on thestrategy of player 1. The goal of player 1 is to choose a strategy to maximize a convex andpiecewise linear function (the minimum function of the strategy of player 2). The goal of player 2is to minimize the linear function. An algorithm is proposed that allows constructing strategies inthis problem, as well as strategies in the dual problem, that satisfy necessary "higher-order"optimality conditions. This algorithm uses a formula for the increment of the objective function inthe dual problem. Theorems that assert the finiteness of the proposed algorithm and itsmodification are proved. An example illustrating the operation of the algorithm is given. Theresults of a numerical experiment on the construction of strategies that satisfy the necessary"higher-order" optimality conditions in problems whose elements were generated by a randomnumber generator are also presented. Based on the results of the numerical experiment, we canconclude that with the proposed algorithm, it is often possible to switch from one locally optimalstrategy of player 1 to another one increasing the objective function. © Pleiades Publishing, Ltd. 2024.

关键词： consensus algorithm

来源：评论

学校读者我要写书评

暂无评论

MuSelect Chain: trusted decentralized mutual selection through blockchain

引用

COMPLEX & INTELLIGENT SYSTEMS 2024年第2期10卷 2515-2529页

作者： Shi, Xiaohu Chang, Ying Fu, Zhongqi Zhang, Yu Ma, Deyin Yang, Yi Jilin Univ Coll Software Qianjin St Changchun 130012 Jilin Peoples R China Jilin Univ Minist Educ Key Lab Symbol Computat & Knowledge Engn Qianjin St Changchun 130012 Jilin Peoples R China Jilin Univ Coll Comp Sci & Technol Qianjin St Changchun 130012 Jilin Peoples R China Jilin Univ Sch Business & Management Qianjin St Changchun 130012 Jilin Peoples R China Changchun Univ Technol Coll Comp Sci & Engn Yanan St Changchun 130012 Jilin Peoples R China

Mutual selection (the process of two types of objects choosing each other) often occurs in practical applications, such as those concerning financial credit. Considering the increasing demands for credibility, traditional artificial methods often cannot satisfy the corresponding requirements for security and transparency. Blockchain technology has the characteristics of decentralization, traceability, transparency, and being tamper-resistant, making it a potential method for solving the abovementioned problems. However, the existing consensus algorithms have some shortcomings in terms of efficiency, fault tolerance, security, and other relevant aspects, rendering them unsuitable for direct implementation in a mutual selection scenario. In this study, a system for mutual selection operations, denoted as "MuSelect Chain," is established. First, the institution information initialization method on blockchain is developed via a smart contract, ensuring the authenticity of information stored on the chain. Second, a mutual selection relationship confirmation algorithm is designed to ensure a reliable automated mutual selection process. Next, considering the characteristics of nodes participating in the network, a consensus algorithm called "Proof-of-Leadership" is proposed to ensure consistency of information stored by different nodes on the chain. Subsequently, an incentive mechanism is established with the focus on improving MuSelect Chain efficiency. Finally, a MuSelect Chain prototype is built. Simulation results prove that the proposed MuSelect Chain is secure with strong fault tolerance.

关键词： Blockchain Mutual select consensus algorithm Incentive mechanism Smart contract

来源：评论

学校读者我要写书评

暂无评论

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案：

请选择收藏分类：

通借通还

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：