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

distributed algorithm of certificate revocation for Ad Hoc network

Beijing Jiaotong Daxue Xuebao/Journal of Beijing Jiaotong University 2005年第2期29卷 44-46+68页

作者： Ning, Hong-Zhou Liu, Yun He, De-Quan Sch. of Electron. and Info. Eng. Beijing Jiaotong Univ. Beijing 100044 China

After analyzing the problem of security infrastructure of ad hoc network, a distributed algorithm of certificate revocation for ad hoc network is presented. In the algorithm, certificate revocation is parted into unconditional revocation and conditional revocation. With using revoking matrix (T) and weight vector W(T) to describe revoking relationship and creditability of network nodes, a revoking effect factor a is introduced to limit revoking strength of single node and increase united revoking strength in order to improve reliability of revoking. By using iterative equation of node weight, the node weight is updated continuously in network running. Finally, the reliability of the distributed algorithm of certificate revocation, the value of the revoking effect factor α and its effect on certificate revocation are analyzed quantitatively.

关键词： Ad Hoc network Certificate revocation algorithm distributed algorithm

来源：评论

学校读者我要写书评

暂无评论

distributed algorithm for ε-generalized Nash equilibria with uncertain coupled constraints

引用

AUTOMATICA 2021年 123卷 109313-109313页

作者： Chen, Guanpu Ming, Yang Hong, Yiguang Yi, Peng Chinese Acad Sci Acad Math & Syst Sci Key Lab Syst & Control Beijing Peoples R China Univ Chinese Acad Sci Sch Math Sci Beijing Peoples R China Tongji Univ Dept Control Sci & Engn Shanghai Peoples R China Tongji Univ Shanghai Inst Intelligent Sci & Technol Shanghai Peoples R China

In this paper, we design a distributed algorithm to seek generalized Nash equilibria with uncertain coupled constraints. It is hard to find the exact equilibria directly, because the parameters in the coupled constraint come from general convex sets, which may not have analytic expressions. To solve the problem, we first approximate general convex sets by inscribed polyhedrons and transform the approximate problem into a variational inequality by robust optimization. Then, with help of convex set geometry and metric spaces, we prove that the solution to the variational inequality induces an epsilon-generalized Nash equilibrium of the original game in the worst case. Furthermore, we propose a distributed algorithm to seek an epsilon-generalized Nash equilibrium, and show the convergence analysis with Lyapunov functions and variational inequalities. Finally, we illustrate the effectiveness of the distributed algorithm by a numerical example. (c) 2020 Published by Elsevier Ltd.

关键词： distributed algorithm Generalized Nash equilibrium Uncertainty Coupled constraint

来源：评论

学校读者我要写书评

暂无评论

distributed algorithm without iterations for an integrated energy system

引用

FRONTIERS IN ENERGY RESEARCH 2023年 10卷

作者： Tan, Jiaming Liu, Xinying Liaoning Tech Univ Fac Elect & Control Engn Huludao Peoples R China

Existing energy management methods for integrated energy systems are mostly in distributed communication and computation now, need a large number of iterations, and each time of iteration needs lots of communication and computation. For this reason, on one hand, the iteration may cause energy-delay. On the other hand, iteration will significantly increase the communication and computation burden. The integrated energy systems contain a variety of devices and energy resources (including renewable energy resources), so the communication and computation burden is already very high. If the communication and computation cannot be solved very well, the cost functions of each device need to be much easier to ensure the operation of the system and their systematic error will be much larger. For this reason, the result of optimization will be much worse because of the accuracy of cost functions. The greatest challenge of this issue is to establish an algorithm without iteration. For handling this issue, first, we adopt the theoretical demonstration to prove that if all prices of all devices are the same, the optimization will be realized and the instantaneous price is the one-order derivative. (we assume the relationship between the operating cost and the energy flow of each device as the convex cost functions.) Second, we reshape all cost functions. Third, we change the function to the total of the foregoing functions in the directed annular path and adopt the total function of the hole system to solve the energy price. Last, we use the price to ensure their operating condition. Our theoretical demonstration has already proved the optimization, convergence, the plug and play performance, scalability, and the emergency scheduling performance of the annular partial differential algorithm (APDA).

关键词： annular communication distributed algorithm integrated energy system iteration optimization we-energy

来源：评论

学校读者我要写书评

暂无评论

distributed algorithm based on consensus control strategy for dynamic economic dispatch problem

引用

INTERNATIONAL JOURNAL OF ELECTRICAL POWER & ENERGY SYSTEMS 2021年 129卷 106833-106833页

作者： Duan, Yuzhu He, Xing Zhao, You Southwest Univ Coll Elect & Informat Engn Chongqing Key Lab Nonlinear Circuits & Intelligen Chongqing 400715 Peoples R China Chongqing Univ Coll Comp Chongqing 400044 Peoples R China

In this paper, the dynamic economic dispatch problem (DEDP) of a hybrid power network is studied. The microgrid model is constructed with three types of non-renewable power sources, renewable energy and energy storage batteries. Meanwhile, the pollutant emission costs and benefit function are considered here to maximize the total welfare. Firstly, we transform the benefit-maximum problem into its equivalent minimization problem which the generators connected each other in a directed graph. Then, we introduced a distributed algorithm based on alternating direction method of multipliers (ADMM) to find the optimal solution of different generators within 24 h. To solve the sub-problem, the bisection method and the finite-time distributed algorithm are adopted here. Finally, the convergence of the distributed algorithm is analyzed. Moreover, our experimental results verify that the optimal solution satisfies the constraints of supply?demand balance equality constraint and capacity inequalities well in each time slot, and meanwhile satisfies the constraints of output threshold between different time slots, furthermore, we utilized a practical example to make a comparison with the existed literature, and the superiority of the algorithm is verified to a certain extent.

关键词： ADMM distributed algorithm Dynamic economic dispatch Micro-grid

来源：评论

学校读者我要写书评

暂无评论

A distributed algorithm to Schedule TSCH Links under the SINR Interference Model 7

A Distributed Algorithm to Schedule TSCH Links under the SIN...

引用

7th Brazilian Symposium on Computing Systems Engineering (SBESC)

作者： da Silva, Jose Carlos Assis, Flavio Univ Fed Sergipe Dept Informat Syst Sao Cristovao SE Brazil UFBA Fed Univ Bahia LaSiD Distributed Syst Lab PPGM Grad Program Mechatron Dept Comp Sci Salvador BA Brazil

ISBN: (纸本)9781538635902

Industrial environments are typically characterised by high levels of interference. Therefore, standards for industrial wireless sensor networks (WirelessHART, ISA 100.11a, and IEEE 802.15.4e) have defined a time division and multichannel-based mode of operation, in which time slots and channel pairs are assigned to links representing communication between nodes. In IEEE 802.15.4e this mode of operation is called Timed Slotted Channel Hopping (TSCH). In this paper we describe a distributed algorithm to define such an assignment for a given wireless network. In particular, the algorithm is efficient, scalable and was developed for the Signal-to-Interference-plus-Noise-Ratio (SINR) model, currently considered the most appropriate to develop and analyse algorithms for wireless networks when interference is taken into consideration. Previous approaches to this problem are mainly centralised, based on a simple (or none) interference model or do not consider multiple physical channels. The described algorithm applies also to the Internet of Things, characterised by high scale and presence of interference.

关键词： distributed algorithm industrial sensor networks link scheduling SINR TSCH

来源：评论

学校读者我要写书评

暂无评论

A distributed algorithm for the Economic Dispatch Problems in Power Systems 34

A Distributed Algorithm for the Economic Dispatch Problems i...

引用

34th Chinese Control Conference (CCC)

作者： Wang, Lu Xie, Jun Chen, Kaixuan Yue, Dong Yong, Taiyou Li, Yaping Nanjing Univ Posts & Telecommun Inst Adv Technol Nanjing 210023 Jiangsu Peoples R China Nanjing Univ Posts & Telecommun Inst Automat Nanjing 210023 Jiangsu Peoples R China China Elect Power Res Inst Nanjing 210003 Jiangsu Peoples R China

ISBN: (纸本)9789881563897

A distributed algorithm is presented to solve the economic dispatch problem in power systems. By selecting the incremental cost of each generation unit and the incremental benefit of each elastic load as the consensus variable, the proposed algorithm is able to solve the conventional centralized economic dispatch problem in a distributed manner. The proposed algorithm is a first-order consensus protocol modified by a correction term which uses an estimation of the system power mismatch to ensure the generation-demand equality. The results of several simulations demonstrate the effectiveness of the proposed methodology.

关键词： distributed algorithm Economic dispatch Consensus protocols Multi-agent system Smart grid

来源：评论

学校读者我要写书评

暂无评论

distributed algorithm for economic dispatch with transmission losses under digraph

引用

INTERNATIONAL JOURNAL OF ELECTRICAL POWER & ENERGY SYSTEMS 2023年第1期149卷

作者： Wang, Rui Li, Qi Zou, Juan Miao, Cuixia Qufu Normal Univ Sch Math Sci Jingxuan 57 Qufu 273100 Shan Dong Peoples R China

By taking transmission losses , directed communication into considered, a more practical scenario of economic dispatch problem is studied in the paper. It is formulated as a non-convex optimization problem. Using convex relaxation, the non-convex optimization problem is transformed into convex optimization problem , the conditions to ensure that they have the same solution are given. Then, a consensus-based distributed algorithm with time-varying feedback gains is presented, which can be used to the general directed communication networks. Especially, the convergence and optimality of the proposed algorithm are proved by using multi-parameter eigenvalue perturbation theory and graph theory. Finally, simulation results validate the theoretical results and illustrate the effectiveness and advantages of the proposed algorithm.

关键词： Economic dispatch problem distributed algorithm Consensus algorithm Transmission loss Smart grid

来源：评论

学校读者我要写书评

暂无评论

DMTF: A distributed algorithm for Multi-team Formation 12

DMTF: A Distributed Algorithm for Multi-team Formation

引用

12th International Conference on Agents and Artificial Intelligence (ICAART)

作者： Nath, Amar Arun, Ar Niyogi, Rajdeep IIT Roorkee Roorkee 247667 Uttar Pradesh India

ISBN: (纸本)9789897583957

Multi-team formation has received considerable attention in the last decade. Most existing approaches for team formation assume complete knowledge of the environment, and the problem is reduced to a combinatorial optimization problem. In a dynamic environmnt, the agents may be spatially distributed, have limited information, lack global knowledge, and update their knowledge by communicating with each other. In such a setting, it would be more appropriate for the agents to form teams by themselves in a distributed manner. In this paper, we suggest a distributed algorithm for multi-team formation (DMTF). The implementation of a distributed algorithm is quite challenging, and traditionally such algorithms are presented in a theoretical way. We implemented the proposed algorithm using a multi-robot simulator. The experimental results show the efficacy of the approach.

关键词： Multi-team Formation distributed algorithm Dynamic Environment Multi-agent Coordination and Cooperation

来源：评论

学校读者我要写书评

暂无评论

A distributed algorithm for Resource Allocation in OFDM Cognitive Radio Systems

A Distributed Algorithm for Resource Allocation in OFDM Cogn...

引用

68th IEEE Vehicular Technology Conference

作者： Zhang, Yonghong Leung, Cyril Univ British Columbia Vancouver BC V6T 1Z4 Canada

ISBN: (纸本)9781424417223;9781424417216

We study the problem of allocating subchannels, bits, and powers for variable rate services in an OFDM based cognitive radio (CR) system, in which available system resources are highly dynamic. In a resource-limited situation under which the nominal rate requirements of users cannot be satisfied, it is desirable to provide fair degradation among users. In a situation with abundant resources, we may choose to maximize system throughput while ensuring that user nominal rate requirements are met. The problem is formulated as a single objective non-linear optimization problem using techniques from goal programming. A distributed resource allocation algorithm is proposed and simulation results are obtained which show that the proposed distributed algorithm provides good fairness and aggregate bit rates close to (within 8% of) optimal values.

关键词： cognitive radio resource allocation distributed algorithm OFDM ad-hoc systems multi-cell systems goal programming

来源：评论

学校读者我要写书评

暂无评论

A distributed algorithm Based on Multi-agent Network for Solving Linear Algebraic Equation 15th

A Distributed Algorithm Based on Multi-agent Network for Sol...

引用

15th International Symposium on Neural Networks (ISNN)

作者： Liu, Qingshan Xiong, Jiang Zhong, Jing Ying, Hong Li, Kaixuan Southeast Univ Sch Math Nanjing 210096 Jiangsu Peoples R China Chongqing Three Gorges Univ Coll Comp Sci & Engn Chongqing 404000 Peoples R China Huazhong Univ Sci & Technol Sch Automat Wuhan 430074 Hubei Peoples R China

ISBN: (纸本)9783319925370;9783319925363

This paper presents a distributed discrete-time consensus algorithm based on multi-agent network to solve large-scale linear algebraic equation (LAE). The matrix in the LAE is divided into submatrices by the columns. Each agent in the network only has its own local data on the LAE and all the agents collaboratively find the solutions while they communicate with their neighbors. Based on the Lyapunov method for difference equation, the multi-agent network is analyzed to reach consensus at the solutions under some mild conditions. Compared with existing algorithms for LAE, the proposed algorithm is capable of solving large-scale distributed LAE problems with fixed step size.

关键词： Linear algebraic equation (LAE) distributed algorithm Multi-agent network Convergence

来源：评论

学校读者我要写书评

暂无评论

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案：

请选择收藏分类：

通借通还

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：