Double-integrator multi-agent systems(MASs)might not achieve dynamical consensus,even if only partial agents suffer from self-sensing function failures(SSFFs).SSFFs might be asynchronous in real engineering applicatio...Double-integrator multi-agent systems(MASs)might not achieve dynamical consensus,even if only partial agents suffer from self-sensing function failures(SSFFs).SSFFs might be asynchronous in real engineering application.The existing fault-tolerant dynamical consensus protocol suitable for synchronous SSFFs cannot be directly used to tackle fault-tolerant dynamical consensus of double-integrator MASs with partial agents subject to asynchronous SSFFs.Motivated by these facts,this paper explores a new fault-tolerant dynamical consensus protocol suitable for asynchronous SSFFs.First,multi-hop communication together with the idea of treating asynchronous SSFFs as multiple piecewise synchronous SSFFs is used for recovering the connectivity of network topology among all normal agents.Second,a fault-tolerant dynamical consensus protocol is designed for double-integrator MASs by utilizing the history information of an agent subject to SSFF for computing its own state information at the instants when its minimum-hop normal neighbor set changes.Then,it is theoretically proved that if the strategy of network topology connectivity recovery and the fault-tolerant dynamical consensus protocol with proper time-varying gains are used simultaneously,double-integrator MASs with all normal agents and all agents subject to SSFFs can reach dynamical consensus.Finally,comparison numerical simulations are given to illustrate the effectiveness of the theoretical results.展开更多
Intelligent blockchain is an emerging field that integrates Artificial Intelligence(AI)techniques with blockchain networks,with a particular emphasis on improving the performance of blockchain,especially in cryptocurr...Intelligent blockchain is an emerging field that integrates Artificial Intelligence(AI)techniques with blockchain networks,with a particular emphasis on improving the performance of blockchain,especially in cryptocurrencies exchanges.Meanwhile,arbitrage bots are widely deployed and increasing in intelligent blockchain.These bots exploit the characteristics of cryptocurrencies exchanges to engage in frontrunning,generating substantial profits at the expense of ordinary users.In this paper,we address this issue by proposing a more efficient asynchronous Byzantine ordered consensus protocol,which can be used to prevent arbitrage bots from changing the order of the transactions for profits in intelligent blockchain-based cryptocurrencies.Specifically,we present two signal asynchronous common subset protocols,the more optimal one with only constant time complexity.We implement both our protocol and the optimal existing solution Chronos with Go language in the same environment.The experiment results indicate that our protocols achieve a threefold improvement over Chronos in consensus latency and nearly a tenfold increase in throughput.展开更多
With the development of the energy Internet, more distributed generators are connected to the power grid, resulting in numerous heterogeneous energy networks. However, different energy networks cannot perform efficien...With the development of the energy Internet, more distributed generators are connected to the power grid, resulting in numerous heterogeneous energy networks. However, different energy networks cannot perform efficient energy trading in the centralized management mode, this deeply affecting the complementary ability of heterogeneous energy, resulting in the islanded energy phenomenon. In this model, the same energy on the chain is traded within the chain, and the heterogeneous energy on different chains is traded across chains. To trade energy between heterogeneous energy networks more efficiently, the blockchain-based cross-chain model is proposed based on the existing infrastructure. Heterogeneous energy nodes are assigned to different energy sub-chains and cross-chain energy transactions are performed through a relay-chain, which utilizes the improved Boneh–Lynn–Shacham signature scheme consensus algorithm based on the proof-of-stake and practical Byzantine fault tolerance. The experimental simulations on energy trading efficiency, throughput, and security, show its superiority over existing systems. Further, the simulation results provide a reference for the application of cross-chain technology in energy interconnection.展开更多
In this study,we discuss how multi-agent systems(MASs)with a leader can achieve distributed bipartite tracking consensus using asynchronous impulsive control strategies.The proposed asynchronous impulsive control appr...In this study,we discuss how multi-agent systems(MASs)with a leader can achieve distributed bipartite tracking consensus using asynchronous impulsive control strategies.The proposed asynchronous impulsive control approach does not require the impulse to occur simultaneously for all agents.The communication links between neighboring nodes of MASs are antagonistic.When the leader’s control input is non-zero,sufficient conditions are obtained to achieve bipartite asynchronous impulsive tracking consensus in closed-loop MASs.More extensive ranges of asynchronous impulsive effects are discussed,and the designed controller’s feedback can effectively work against adverse impulsive permutation.Simple algebraic conditions for estimating the impulsive gain boundary and asynchronous impulsive interval are presented.Theoretical results are demonstrated with illustrative examples.展开更多
Generally,the distributed bundle adjustment(DBA)method uses multiple worker nodes to solve the bundle adjustment problems and overcomes the computation and memory storage limitations of a single computer.However,the p...Generally,the distributed bundle adjustment(DBA)method uses multiple worker nodes to solve the bundle adjustment problems and overcomes the computation and memory storage limitations of a single computer.However,the performance considerably degrades owing to the overhead introduced by the additional block partitioning step and synchronous waiting.Therefore,we propose a low-overhead consensus framework.A partial barrier based asynchronous method is proposed to early achieve consensus with respect to the faster worker nodes to avoid waiting for the slower ones.A scene summarization procedure is designed and integrated into the block partitioning step to ensure that clustering can be performed on the small summarized scene.Experiments conducted on public datasets show that our method can improve the worker node utilization rate and reduce the block partitioning time.Also,sample applications are demonstrated using our large-scale culture heritage datasets.展开更多
在综合能源系统(Integrated energy systems,IESs)经济调度问题的分布式优化框架中,节点协同机制的拓扑设计必然受到信息交互方式的约束。现有研究主要分为两类通信协议、同步通信和异步通信。然而,同步通信需要满足时序一致性,等待各...在综合能源系统(Integrated energy systems,IESs)经济调度问题的分布式优化框架中,节点协同机制的拓扑设计必然受到信息交互方式的约束。现有研究主要分为两类通信协议、同步通信和异步通信。然而,同步通信需要满足时序一致性,等待各通信者之间达成同步响应或确认后才能执行后续操作,这在大规模网络环境中很难实现。该文首先基于Gossip算法的异步特点,提出了一种基于Gossip的异步通信分布式经济调度算法。利用矩阵扰动理论和特征值定理,严格证明了算法的收敛性。进一步地,考虑了两种典型的网络攻击模型,拒绝服务攻击(denial of service,DoS)和虚假数据攻击(false data injection,FDI),设计了一种弹性安全策略以缓解网络攻击对最优经济调度的影响。最后,基于IEEE39-32节点的IES进行算例分析,结合不同的调度场景、攻击者的表现以及同步通信方式的对比,从多个角度验证了所提策略在通信方式和网络安全方面的有效性和优越性。展开更多
The blockchain trilemma—balancing decentralization,security,and scalability—remains a critical challenge in distributed ledger technology.Despite significant advancements,achieving all three attributes simultaneousl...The blockchain trilemma—balancing decentralization,security,and scalability—remains a critical challenge in distributed ledger technology.Despite significant advancements,achieving all three attributes simultaneously continues to elude most blockchain systems,often forcing trade-offs that limit their real-world applicability.This review paper synthesizes current research efforts aimed at resolving the trilemma,focusing on innovative consensus mechanisms,sharding techniques,layer-2 protocols,and hybrid architectural models.We critically analyze recent breakthroughs,including Directed Acyclic Graph(DAG)-based structures,cross-chain interoperability frameworks,and zero-knowledge proof(ZKP)enhancements,which aimto reconcile scalability with robust security and decentralization.Furthermore,we evaluate the trade-offs inherent in these approaches,highlighting their practical implications for enterprise adoption,decentralized finance(DeFi),and Web3 ecosystems.By mapping the evolving landscape of solutions,this review identifies gaps in currentmethodologies and proposes future research directions,such as adaptive consensus algorithms and artificial intelligence-driven(AI-driven)governance models.Our analysis underscores that while no universal solution exists,interdisciplinary innovations are progressively narrowing the trilemma’s constraints,paving the way for next-generation blockchain infrastructures.展开更多
The communication efficiency optimization,censorship resilience,and generation of shared randomness are inseparable from the threshold cryptography in the existing Byzantine Fault Tolerant(BFT)consensus.The membership...The communication efficiency optimization,censorship resilience,and generation of shared randomness are inseparable from the threshold cryptography in the existing Byzantine Fault Tolerant(BFT)consensus.The membership in consensus in a blockchain scenario supports dynamic changes,which effectively prevents the corruption of consensus participants.Especially in cross-chain protocols,the dynamic access to different blockchains will inevitably bring about the demand for member dynamic.Most existing threshold cryptography schemes rely on redefined key shares,leading to a static set of secret sharing participants.In this paper,we propose a general approach to coupling blockchain consensus and dynamic secret sharing.The committee performs consensus confirmation of both dynamic secret sharing and transaction proposals.Our scheme facilitates threshold cryptography membership dynamic,thus underlying support for membership dynamic of threshold cryptographybased BFT consensus schemes.We instantiate a dynamic HotStuff consensus to demonstrate the effectiveness of the scheme.After the correctness and security proof,our scheme achieves the secrecy and integrity of the threshold key shares while ensuring consensus liveness and safety.Experimental results prove that our scheme obtains dynamic membership with negligible overhead.展开更多
基金National Natural Science Foundation of China(No.61876073)Fundamental Research Funds for the Central Universities of China(No.JUSRP21920)。
文摘Double-integrator multi-agent systems(MASs)might not achieve dynamical consensus,even if only partial agents suffer from self-sensing function failures(SSFFs).SSFFs might be asynchronous in real engineering application.The existing fault-tolerant dynamical consensus protocol suitable for synchronous SSFFs cannot be directly used to tackle fault-tolerant dynamical consensus of double-integrator MASs with partial agents subject to asynchronous SSFFs.Motivated by these facts,this paper explores a new fault-tolerant dynamical consensus protocol suitable for asynchronous SSFFs.First,multi-hop communication together with the idea of treating asynchronous SSFFs as multiple piecewise synchronous SSFFs is used for recovering the connectivity of network topology among all normal agents.Second,a fault-tolerant dynamical consensus protocol is designed for double-integrator MASs by utilizing the history information of an agent subject to SSFF for computing its own state information at the instants when its minimum-hop normal neighbor set changes.Then,it is theoretically proved that if the strategy of network topology connectivity recovery and the fault-tolerant dynamical consensus protocol with proper time-varying gains are used simultaneously,double-integrator MASs with all normal agents and all agents subject to SSFFs can reach dynamical consensus.Finally,comparison numerical simulations are given to illustrate the effectiveness of the theoretical results.
基金supported by the National Key R&D Program of China under Grant(2022YFB2702702)in part by the National Natural Science Foundation of China under Grants(62372020,72031001)+1 种基金in part by the Beijing Natural Science Foundation under Grants(L222050)in part by the Fundamental Research Funds for the Central Universities under Grant(YWF-23-L-1032).
文摘Intelligent blockchain is an emerging field that integrates Artificial Intelligence(AI)techniques with blockchain networks,with a particular emphasis on improving the performance of blockchain,especially in cryptocurrencies exchanges.Meanwhile,arbitrage bots are widely deployed and increasing in intelligent blockchain.These bots exploit the characteristics of cryptocurrencies exchanges to engage in frontrunning,generating substantial profits at the expense of ordinary users.In this paper,we address this issue by proposing a more efficient asynchronous Byzantine ordered consensus protocol,which can be used to prevent arbitrage bots from changing the order of the transactions for profits in intelligent blockchain-based cryptocurrencies.Specifically,we present two signal asynchronous common subset protocols,the more optimal one with only constant time complexity.We implement both our protocol and the optimal existing solution Chronos with Go language in the same environment.The experiment results indicate that our protocols achieve a threefold improvement over Chronos in consensus latency and nearly a tenfold increase in throughput.
基金supported by the Fundamental Research Funds for the Central Universities of Ministry of Education (2018 ZD06)。
文摘With the development of the energy Internet, more distributed generators are connected to the power grid, resulting in numerous heterogeneous energy networks. However, different energy networks cannot perform efficient energy trading in the centralized management mode, this deeply affecting the complementary ability of heterogeneous energy, resulting in the islanded energy phenomenon. In this model, the same energy on the chain is traded within the chain, and the heterogeneous energy on different chains is traded across chains. To trade energy between heterogeneous energy networks more efficiently, the blockchain-based cross-chain model is proposed based on the existing infrastructure. Heterogeneous energy nodes are assigned to different energy sub-chains and cross-chain energy transactions are performed through a relay-chain, which utilizes the improved Boneh–Lynn–Shacham signature scheme consensus algorithm based on the proof-of-stake and practical Byzantine fault tolerance. The experimental simulations on energy trading efficiency, throughput, and security, show its superiority over existing systems. Further, the simulation results provide a reference for the application of cross-chain technology in energy interconnection.
基金the National Natural Science Foundation of China(No.61973078)the “333 Engineering” Foundation of Jiangsu Province,China(No.BRA2019260)the Zhejiang Provincial Natural Science Foundation of China(No.LR20F020002)。
文摘In this study,we discuss how multi-agent systems(MASs)with a leader can achieve distributed bipartite tracking consensus using asynchronous impulsive control strategies.The proposed asynchronous impulsive control approach does not require the impulse to occur simultaneously for all agents.The communication links between neighboring nodes of MASs are antagonistic.When the leader’s control input is non-zero,sufficient conditions are obtained to achieve bipartite asynchronous impulsive tracking consensus in closed-loop MASs.More extensive ranges of asynchronous impulsive effects are discussed,and the designed controller’s feedback can effectively work against adverse impulsive permutation.Simple algebraic conditions for estimating the impulsive gain boundary and asynchronous impulsive interval are presented.Theoretical results are demonstrated with illustrative examples.
基金Project supported by the Key R&D Program of Zhejiang Province,China(No.2018C03051)the Key Scientific Research Base for Digital Conservation of Cave Temples of the National Cultural Heritage Administration,China。
文摘Generally,the distributed bundle adjustment(DBA)method uses multiple worker nodes to solve the bundle adjustment problems and overcomes the computation and memory storage limitations of a single computer.However,the performance considerably degrades owing to the overhead introduced by the additional block partitioning step and synchronous waiting.Therefore,we propose a low-overhead consensus framework.A partial barrier based asynchronous method is proposed to early achieve consensus with respect to the faster worker nodes to avoid waiting for the slower ones.A scene summarization procedure is designed and integrated into the block partitioning step to ensure that clustering can be performed on the small summarized scene.Experiments conducted on public datasets show that our method can improve the worker node utilization rate and reduce the block partitioning time.Also,sample applications are demonstrated using our large-scale culture heritage datasets.
文摘在综合能源系统(Integrated energy systems,IESs)经济调度问题的分布式优化框架中,节点协同机制的拓扑设计必然受到信息交互方式的约束。现有研究主要分为两类通信协议、同步通信和异步通信。然而,同步通信需要满足时序一致性,等待各通信者之间达成同步响应或确认后才能执行后续操作,这在大规模网络环境中很难实现。该文首先基于Gossip算法的异步特点,提出了一种基于Gossip的异步通信分布式经济调度算法。利用矩阵扰动理论和特征值定理,严格证明了算法的收敛性。进一步地,考虑了两种典型的网络攻击模型,拒绝服务攻击(denial of service,DoS)和虚假数据攻击(false data injection,FDI),设计了一种弹性安全策略以缓解网络攻击对最优经济调度的影响。最后,基于IEEE39-32节点的IES进行算例分析,结合不同的调度场景、攻击者的表现以及同步通信方式的对比,从多个角度验证了所提策略在通信方式和网络安全方面的有效性和优越性。
文摘The blockchain trilemma—balancing decentralization,security,and scalability—remains a critical challenge in distributed ledger technology.Despite significant advancements,achieving all three attributes simultaneously continues to elude most blockchain systems,often forcing trade-offs that limit their real-world applicability.This review paper synthesizes current research efforts aimed at resolving the trilemma,focusing on innovative consensus mechanisms,sharding techniques,layer-2 protocols,and hybrid architectural models.We critically analyze recent breakthroughs,including Directed Acyclic Graph(DAG)-based structures,cross-chain interoperability frameworks,and zero-knowledge proof(ZKP)enhancements,which aimto reconcile scalability with robust security and decentralization.Furthermore,we evaluate the trade-offs inherent in these approaches,highlighting their practical implications for enterprise adoption,decentralized finance(DeFi),and Web3 ecosystems.By mapping the evolving landscape of solutions,this review identifies gaps in currentmethodologies and proposes future research directions,such as adaptive consensus algorithms and artificial intelligence-driven(AI-driven)governance models.Our analysis underscores that while no universal solution exists,interdisciplinary innovations are progressively narrowing the trilemma’s constraints,paving the way for next-generation blockchain infrastructures.
基金supported by the National Key R&D Program of China(2020YFB1005600)the Beijing Natural Science Foundation(M21031)+3 种基金the Natural Science Foundation of China through projects(U21A20467,61932011,62002011,61972019)the Populus euphratica found(CCF-HuaweiBC2021009)the Open Research Fund of Key Laboratory of Cryptography of Zhejiang Province(ZCL21007)the Youth Top Talent Support Program of Beihang University(YWF-22-L-1272).
文摘The communication efficiency optimization,censorship resilience,and generation of shared randomness are inseparable from the threshold cryptography in the existing Byzantine Fault Tolerant(BFT)consensus.The membership in consensus in a blockchain scenario supports dynamic changes,which effectively prevents the corruption of consensus participants.Especially in cross-chain protocols,the dynamic access to different blockchains will inevitably bring about the demand for member dynamic.Most existing threshold cryptography schemes rely on redefined key shares,leading to a static set of secret sharing participants.In this paper,we propose a general approach to coupling blockchain consensus and dynamic secret sharing.The committee performs consensus confirmation of both dynamic secret sharing and transaction proposals.Our scheme facilitates threshold cryptography membership dynamic,thus underlying support for membership dynamic of threshold cryptographybased BFT consensus schemes.We instantiate a dynamic HotStuff consensus to demonstrate the effectiveness of the scheme.After the correctness and security proof,our scheme achieves the secrecy and integrity of the threshold key shares while ensuring consensus liveness and safety.Experimental results prove that our scheme obtains dynamic membership with negligible overhead.
