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

Distributed Event-Triggered algorithms for Finite-Time Privacy-Preserving Quantized Average consensus

IEEE TRANSACTIONS ON CONTROL OF NETWORK SYSTEMS 2023年第1期10卷 38-50页

作者： Rikos, Apostolos I. Charalambous, Themistoklis Johansson, Karl Henrik Hadjicostis, Christoforos N. KTH Royal Inst Technol Div Decis & Control Syst S-11428 Stockholm Sweden Digital Futures SE-10044 Stockholm Sweden Univ Cyprus Sch Engn Dept Elect & Comp Engn CY-1678 Nicosia Cyprus Aalto Univ Sch Elect Engn Dept Elect Engn & Automat Espoo 02150 Finland Univ Cyprus Dept Elect & Comp Engn CY-1678 Nicosia Cyprus

In this article, we consider the problem of privacy preservation in the average consensus problem when communication among nodes is quantized. More specifically, we consider a setting where nodes in the network can be curious, while certain nodes in the network want to ensure that their initial states cannot be inferred exactly by these curious nodes. Curious nodes are not malicious, i.e., they try to identify the initial states of other nodes based on the data they receive during their operation (and some of them might even collude) but do not interfere in the computation in any other way. Each node in the network (including curious nodes) can opt to execute a privacy-preserving algorithm (so as not to reveal the initial state it contributes to the average calculation) or its underlying (plain) average consensus algorithm (if privacy is not a concern). We propose two privacy-preserving event-triggered quantized average consensus algorithms. Under certain topological conditions, both the proposed algorithms allow the nodes that adopt privacy-preserving protocols to preserve their privacy and at the same time to obtain, after a finite number of steps, the exact average of the initial states while processing and transmitting quantized information. We also present illustrative examples and comparisons of our algorithms against other algorithms in the existing literature and discuss a motivating application in which smart meters in a smart grid collect real-time demands in a privacy-preserving manner.

关键词： Privacy Convergence Heuristic algorithms Network systems consensus algorithm Topology Smart meters Finite-time convergence privacy-preserv- ing average consensus quantized communication

来源：评论

学校读者我要写书评

暂无评论

Proof-of-Monitoring (PoM): A Novel consensus Mechanism for Blockchain-Based Secure Service Level Agreement Management

引用

IEEE TRANSACTIONS ON NETWORK AND SERVICE MANAGEMENT 2023年第3期20卷 2783-2803页

作者： Weerasinghe, Nisita Mishra, Raaj Porambage, Pawani Liyanage, Madhusanka Ylianttila, Mika Univ Oulu Ctr Wireless Commun Oulu 90014 Finland Dell Technol Digital Licensing & Fulfillment Bengaluru 751010 India VTT Tech Res Ctr 5G & Networks Oulu 90571 Finland Univ Oulu Fac Informat Technol & Elect Engn Ctr Wireless Commun Oulu 90014 Finland Univ Coll Dublin Sch Comp Sci Dublin D04 V1W8 4 Ireland

In the current 5th Generation (5G) networking paradigm, the enforcement of Service Level Agreements (SLAs) is a non-trivial measure to ensure the scope and the quality of services and standards between tenants and service providers (SPs). On top of this, Secure Service Level Agreements (SSLA) are introduced to ensure that SPs deliver the most critical and required security-related standards defined in the contract, such as integrity, confidentiality, availability, non-repudiation, and privacy assurance. However, with the tendency for more distributed and multi-stakeholder networking architectures in next-generation networks, the management process of such SSLAs will be challenging due to the diversified security vulnerabilities and complexity of underlying technologies. Although blockchain is emerging as a platform to facilitate such distributed SSLA/SLA management frameworks, its currently available consensus mechanisms are more generic. Still, they need to improve in terms of applying in multi-stakeholder networks. Therefore, this paper presents a novel consensus mechanism called Proof-of-Monitoring (PoM) for a blockchain-based novel SSLA management framework. Moreover, we provide details about the prototype implementation of our proposed consensus algorithm and SSLA management framework. It is proven by comparing our proposal with the other existing solutions that our solution outperforms in many aspects, such as energy consumption, computation cost, and security features.

关键词： Blockchain secure service level agreements consensus algorithm network monitoring smart contracts

来源：评论

学校读者我要写书评

暂无评论

Privacy-Preserving Distributed Economic Dispatch of Microgrids: A Dynamic Quantization-Based consensus Scheme With Homomorphic Encryption

引用

IEEE TRANSACTIONS ON SMART GRID 2023年第1期14卷 701-713页

作者： Chen, Wei Liu, Lu Liu, Guo-Ping City Univ Hong Kong Shenzhen Res Inst Shenzhen 518057 Peoples R China City Univ Hong Kong Dept Mech & Biomed Engn Hong Kong Peoples R China Southern Univ Sci & Technol Ctr Control Sci & Technol Shenzhen 518055 Peoples R China

This paper is concerned with the privacy-preserving distributed economic dispatch problem (ED) of microgrids. A homomorphically encrypted consensus algorithm is developed in the absence of a third party to achieve optimal power distribution with the least cost while preventing sensitive information leakage during the entire communication process. For ease of data encryption, a novel estimator-like dynamic quantizer is first constructed, where the information to be transmitted is converted into a series of finite-level codewords. Then, a sufficient condition is derived, taking advantage of mathematical induction and the properties of matrix norms, to ensure that the quantization output is unsaturated and exact consensus is reached. Furthermore, by means of the additive homomorphic property of the Paillier algorithm to embed secrecy in pairwise interaction dynamics, the confidential communication strategy is adopted to ensure that the distributed algorithm converges to the optimal value without disclosing private or sensitive state information of agents. Finally, case studies are provided to illustrate the feasibility and validity of the adopted privacy-preserving ED scheme in IEEE 39-bus power systems.

关键词： Microgrids Quantization (signal) Cryptography Convergence Heuristic algorithms Privacy Distributed algorithms Microgrids economic dispatch consensus algorithm privacy preservation dynamic quantization homomorphic cryptography

来源：评论

学校读者我要写书评

暂无评论

consensus decision-making in artificial swarms via entropy-based local negotiation and preference updating

引用

SWARM INTELLIGENCE 2023年第4期17卷 283-303页

作者： Zheng, Chuanqi Lee, Kiju Texas A&M Univ Dept Mech Engn College Stn TX 77843 USA Texas A&M Univ Dept Engn Technol & Ind Distribut College Stn TX 77843 USA

This paper presents an entropy-based consensus algorithm for a swarm of artificial agents with limited sensing, communication, and processing capabilities. Each agent is modeled as a probabilistic finite state machine with a preference for a finite number of options defined as a probability distribution. The most preferred option, called exhibited decision, determines the agent's state. The state transition is governed by internally updating this preference based on the states of neighboring agents and their entropy-based levels of certainty. Swarm agents continuously update their preferences by exchanging the exhibited decisions and the certainty values among the locally connected neighbors, leading to consensus towards an agreed-upon decision. The presented method is evaluated for its scalability over the swarm size and the number of options and its reliability under different conditions. Adopting classical best-of-N target selection scenarios, the algorithm is compared with three existing methods, the majority rule, frequency-based method, and k-unanimity method. The evaluation results show that the entropy-based method is reliable and efficient in these consensus problems.

关键词： consensus algorithm Swarm robotics Distributed decision-making

来源：评论

学校读者我要写书评

暂无评论

A Switched Systems Approach to Multiagent System consensus: A Relay-Explorer Perspective

引用

IEEE TRANSACTIONS ON ROBOTICS 2023年第1期39卷 605-624页

作者： Zegers, Federico M. Deptula, Patryk Chen, Hsi-Yuan Isaly, Axton Dixon, Warren E. Univ Florida Dept Mech & Aerosp Engn Gainesville FL 32611 USA Charles Stark Draper Lab Inc Cambridge MA 02139 USA Amazon Robot North Reading MA 01864 USA

The rendezvous or position consensus problem is a fundamental topic within the multiagent system (MAS) literature and has numerous engineering applications. The majority of recent results that solve the position consensus problem rely on communication networks and each agent's ability to obtain position information via direct measurements and communication. Distributed coordination strategies for MASs that are network free and have agents that cannot directly measure position information are scarce. In this work, we develop a relay-explorer strategy to achieve position consensus at a common, desired location. In particular, a group of explorer agents, lacking global position sensors, use open-loop estimators of their position to independently dead reckon toward the desired location. To prevent the difference between the estimated and true position of each explorer from growing beyond a user-defined threshold, a mobile information service provider (relay agent) that is capable of measuring its position in the global coordinate frame, intermittently visits each explorer to provide position information as determined by a maximum dwell-time condition. The relay agent has a position estimator for each explorer, and each estimator is synchronized with the corresponding explorer. The relay agent uses these position estimators to locate each explorer, maneuver to them, and provide position feedback. The contribution of this work over our precursory results is the consideration of uncertain explorer agent dynamics, which are estimated online using recurrent neural networks and integral concurrent learning. The estimated dynamics serve as feed-forward model approximations in the position estimators used by the explorers and relay agent, which generate more accurate position estimates once a finite excitation condition is satisfied. The MAS is modeled as a switched system, and a Lyapunov-based analysis is used to derive a maximum dwell-time condition for each explorer, prove t

关键词： Relays Switches Switched systems Trajectory Regulation Multi-agent systems Information services Adaptive control consensus algorithm Lyapunov methods multiagent systems network control

来源：评论

学校读者我要写书评

暂无评论

Hierarchical Hybrid Control for Scaled consensus and Its Application to Secondary Control for DC Microgrid

引用

IEEE TRANSACTIONS ON CYBERNETICS 2023年第7期53卷 4446-4458页

作者： Mo, Shuangye Chen, Wu-Hua Lu, Xiaomei Guangxi Univ Sch Elect Engn Nanning 530004 Peoples R China Guangxi Univ Key Lab Disaster Prevent & Struct Safety Minist Educ Nanning 530004 Peoples R China Guangxi Univ Sch Math & Informat Sci Nanning 530004 Peoples R China Guangxi Univ Guangxi Key Lab Disaster Prevent & Engn Safety Nanning 530004 Peoples R China

This article addresses the scaled consensus problem for a class of heterogeneous multiagent systems (MASs) with a cascade-type two-layer structure. It is assumed that the information of the upper layer state components is intermittently exchangeable through a strongly connected communication network among the agents. A distributed hierarchical hybrid control framework is proposed, which consists of a lower layer controller and an upper layer one. The lower layer controller is a decentralized continuous feedback controller, which makes the lower layer state components converge to their target values. The upper layer controller is a distributed impulsive controller, which enforces a scaled consensus for the upper layer state components. It is proved that the two layer controllers can be designed separately. By considering the dwell-time condition of impulses and the feature of the strongly connected Laplacian matrix, a novel weighted discontinuous function is constructed for scaled consensus analysis. By using the Lyapunov function, a sufficient condition for scaled consensus of the MAS is derived in terms of linear matrix inequalities. As an application of the proposed distributed hybrid control strategy, a relaxed distributed hybrid secondary control algorithm for dc microgrid is obtained, by which the balance requirement on the communication digraph is removed, and an improved current sharing condition is obtained.

关键词： Microgrids Symmetric matrices Voltage control Linear matrix inequalities Protocols Laplace equations consensus algorithm Dc microgrid distributed hybrid control hierarchical control multiagent system (MAS) scaled consensus

来源：评论

学校读者我要写书评

暂无评论

Distributed consensus in Wireless Networks With Probabilistic Broadcast Scheduling

引用

IEEE SIGNAL PROCESSING LETTERS 2023年 30卷 41-45页

作者： Herrera, Daniel Perez Chen, Zheng Larsson, Erik G. Linkoping Univ Dept Elect Engn SE-58183 Linkoping Sweden

We consider distributed average consensus in a wireless network with partial communication to reduce the number of transmissions in every iteration/round. Considering the broadcast nature of wireless channels, we propose a probabilistic approach that schedules a subset of nodes for broadcasting information to their neighbors in every round. We compare several heuristic methods for assigning the node broadcast probabilities under a fixed number of transmissions per round. Furthermore, we introduce a pre-compensation method to correct the bias between the consensus value and the average of the initial values, and suggest possible extensions for our design. Our results are particularly relevant for developing communication-efficient consensus protocols in a wireless environment with limited frequency/time resources.

关键词： Convergence Broadcasting Probabilistic logic Wireless networks Signal processing algorithms Topology consensus algorithm Average consensus broadcast transmission scheduling wireless networks

来源：评论

学校读者我要写书评

暂无评论

Nonfragile Memory-Based PD-Like Sampled-Data consensus Control for Nonlinear Multiagent Systems With Time-Varying Communication Delays

引用

IEEE TRANSACTIONS ON SYSTEMS MAN CYBERNETICS-SYSTEMS 2023年第7期53卷 4370-4380页

作者： Yang, Jin Zhong, Qishui Wang, Yang Shi, Kaibo Zhong, Shouming Univ Elect Sci & Technol China Sch Aeronaut & Astronaut Chengdu 611731 Peoples R China Univ Elect Sci & Technol China Aircraft Swarm Intelligent Sensing & Cooperat Cont Chengdu 611731 Peoples R China Univ Elect Sci & Technol China Yangtze Delta Reg Inst Huzhou Huzhou 313001 Peoples R China China North Vehicle Res Inst Unmanned Syst Dev Beijing 100072 Peoples R China Chengdu Univ Sch Elect Informat & Elect Engn Chengdu 610106 Peoples R China Chengdu Univ Technol Geomath Key Lab Sichuan Prov Chengdu 610059 Peoples R China Univ Elect Sci & Technol China Guangdong Inst Elect & Informat Engn Guangzhou 523808 Peoples R China Univ Elect Sci & Technol China Sch Math Sci Chengdu 611731 Peoples R China

In this article, the consensus problem of nonlinear multiagent systems (MASs) with time-varying communication delays (TVCDs) is addressed by proposing a novel nonfragile memory-based sampled-data control approach. Different from the existing sampled-data control schemes, an improved memory-based proportional derivative like a sampled-data control scheme based on the information of neighbors is proposed. Besides, considering the inaccuracy and perturbation of controller, a nonfragile control method is also adopted to design the controller. Then, instead of the general quadratic type of the Lyapunov-Krasovskii functional, a delay-product-type quadratic is presented by taking full advantage of the information of TVCDs, and the positive definite constraint in the entire time domain is weakened to the sampled instants on account of adopting the two-sided looped-functional approach. Furthermore, less-conservative consensus criteria for MASs are developed. By solving linear matrix inequalities, the desired control gain matrices and larger sampled-data periods are achieved. Finally, illustrative examples are employed to demonstrate the effectiveness of the designed control strategy.

关键词： Delays Time-varying systems Symmetric matrices consensus algorithm Stability criteria Multi-agent systems Germanium consensus problem memory-based PD-like control nonfragile sampled-data control nonlinear multiagent system (MAS) time-varying communication delays (TVCDs)

来源：评论

学校读者我要写书评

暂无评论

A comparative study on consensus mechanism with security threats and future scopes: Blockchain

引用

COMPUTER COMMUNICATIONS 2023年第1期201卷 102-115页

作者： Yadav, Ashok Kumar Singh, Karan Amin, Ali H. Almutairi, Laila Alsenani, Theyab R. Ahmadian, Ali Rajkiya Engn Coll Azamgarh Uttar Pradesh India Jawaharlal Nehru Univ Sch Comp & Syst Sci New Delhi India Umm Al Qura Univ Deanship Sci Res Mecca 21955 Saudi Arabia Majmaah Univ Coll Comp & Informat Sci Dept Comp Engn Al Majmaah 11952 Saudi Arabia Prince Sattam Bin Abdulaziz Univ Coll Engn Al Kharj Dept Elect Engn Al Kharj 11942 Saudi Arabia Mediterranea Univ Reggio Calabria Decis Lab Reggio Di Calabria Italy Lebanese Amer Univ Dept Comp Sci & Math Beirut Lebanon Near East Univ Dept Math Mersin Turkiye

Recently, blockchain has emerged as a peer-to-peer (P2P) immutable distributed ledger technology-based network, and its consensus mechanism is playing an important role in managing decentralized data. The use of the consensus process for open blockchains, on the other hand, has revitalized the industry and spurred new architectures. As part of this research, we have analyzed and categorized a wide range of consensus mechanisms in order to contribute to the process of developing blockchain applications and determining the extent of their influence. Critical technical considerations regarding performance, scalability, and other quality aspects that a blockchain-based system must possess may be assisted by this scientific categorization and comprehensive comparison of consensus algorithms. In this paper, we have mainly depicted: (i) proof-of-work (PoW) along with its enhancement rules like greedy heaviest-observed sub-tree (GHOST) and Bitcoin NG (next generation);(ii) proof-of-Stake (PoS) along with chain-based PoS, committee-based PoS, byzantine fault tolerance (BFT) based extended proof-of-stake (EPoS), and delegated proof of stake (DPoS), i.e. energy-efficient alternative to PoW;(iii) BFT consensus to handle crash fault and Byzantine fault;and (iv) hybrid protocols, which are a combination of the best features of PoW, PoS, and BFT consensus mechanism. To evaluate the performance, scalability, security, and design properties of the system, we have considered five components of consensus algorithms.

关键词： P2P network Blockchain consensus algorithm Security Privacy

来源：评论

学校读者我要写书评

暂无评论

Evolution of Blockchain and consensus mechanisms & its real-world applications

引用

MULTIMEDIA TOOLS AND APPLICATIONS 2023年第22期82卷 34363-34408页

作者： Yadav, Amrendra Singh Singh, Nikita Kushwaha, Dharmender Singh Atal Bihari Vajpayee Indian Inst Informat Technol Dept Comp Sci & Engn Gwalior Madhya Pradesh India RV Univ Sch Comp Sci & Engn Bangalore India Motilal Nehru Natl Inst Technol Allahabad Dept Comp Sci & Engn Prayagraj India

Distributed Ledger Technology (DLT) and blockchain are two terms that have been used interchangeably for the longest of time ever since the concept of the bitcoin cryptocurrency system was introduced by Satoshi Nakamoto in 2008. DLT can be thought of as an umbrella term that encompasses the blockchain and other type of distributed ledgers. It is a decentralized, permisionless, distributed database where each participant maintains its own copy of the distributed ledger and the records are distributed as a chain of blocks across a peer-to-peer network. This implies that a replicated database is maintained and it does not rely on a single party or an intermediary for its operation. This also happens to be the most ground breaking feature of this technology. Bitcoin blockchain can be understood as the first fully functional DLT that exists. Blockchain is rapidly evolving as the next disruptive innovation in secure connectivity, with the potential to fundamentally alter how we work and live in the twenty-first century. The key components of this technology include the miner, the consensus protocols, hashing and an asymmetric cryptography system to encrypt the data through the use of the public and the private key. All transaction in the blockchain is recorded in the form of chain of blocks. Each block contains a unique header which is mathematically and cryptographically computed and to this feature is attributed the immutable nature of the blockchain. This computed hash commits to the header of the previous block, storing the contents of the block in the form of a hash function. All the transactions in the blockchain are recorded in a block that contains a unique header which is cryptographically computed and this attributes to the immutability of the blockchain. This computed hash is stored in the header of the next block. Before a transaction is committed to the ledger, it has to be agreed upon by the active participants of the network in order to guarantee the trustw

关键词： Blockchain consensus algorithm Bitcoin Real-world application

来源：评论

学校读者我要写书评

暂无评论

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案：

请选择收藏分类：

通借通还

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：