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

HVAC-Based Cooperative algorithms for Demand Side Management in a Microgrid

ENERGIES 2019年第22期12卷 4276-4276页

作者： Ma, Jie Ma, Xiandong Ilic, Suzana Univ Lancaster Dept Engn Lancaster LA1 4YW England Univ Lancaster Lancaster Environm Ctr Lancaster LA1 4YW England

The high penetration of renewable power generators and various loads have brought a great challenge for dispatching energy in a microgrid system. Heating ventilation air conditioning (HVAC) system, as a household appliance with high popularity, can be considered as an effective technology to alleviate energy dispatch issues. This paper presents novel distributed algorithms based on HVAC to solve the demand side management problem, where the microgrid system with HVAC units is considered as a multi-agent system (MAS). The approach provides a desirable operating frequency signal for each HVAC based on the power mismatch value occurring on each local bus. It utilizes demand response of the HVAC units to minimize the supply-demand mismatch, thus reducing the quantity and capacity of energy storage devices potentially to be required. Compared with existing approaches focusing on the distributed algorithms under a fixed communication network, this paper addresses a consensus problem under a switching topology by using the Lyapunov argument. It is verified that a jointly strong and connected topology is a sufficient condition in order to achieve an average consensus for a time-varying topology. A number of cases are studied to evaluate the effectiveness of the algorithms by taking into account its power constraints, dynamic behaviors, anti-damage characteristics and time-varying communication topology. Modelling these system interactions has demonstrated the feasibility of the proposed microgrid system.

关键词： demand side management HVAC (heating ventilation air conditioning) distributed algorithm multi-agent system microgrid

来源：评论

学校读者我要写书评

暂无评论

Anonymous obstruction-free (n, k)-set agreement with n - k+1 atomic read/write registers

引用

distributed COMPUTING 2018年第2期31卷 99-117页

作者： Bouzid, Zohir Raynal, Michel Sutra, Pierre Univ Rennes IRISA F-35042 Rennes France Inst Univ France Paris France Univ Paris Saclay Telecom SudParis Evry France Univ Paris Saclay CNRS Evry France

The k-set agreement problem is a generalization of the consensus problem. Namely, assuming that each process proposes a value, every non-faulty process must decide one of the proposed values, under the constraint that at most k different values are decided. This is a hard problem in the sense that it cannot be solved in a pure read/write asynchronous system, in which k or more processes may crash. One way to sidestep this impossibility result consists in weakening the termination property, requiring only that a process decides if it executes alone during a long enough period of time. This is the well-known obstruction-freedom progress condition. Consider a system of n anonymous asynchronous processes that communicate through atomic read/write registers, and such that any number of them may crash. This paper addresses and solves the challenging open problem of designing an obstruction-free k-set agreement algorithm with only atomic registers. From a shared memory cost point of view, our algorithm is the best algorithm known to date, thereby establishing a new upper bound on the number of registers needed to solve this problem. For the consensus case , the proposed algorithm is up to an additive factor of 1 close to the best known lower bound. Further, the paper extends this algorithm to obtain an x-obstruction-free solution to the k-set agreement problem that employs atomic registers (with ), as well as a space-optimal solution for the repeated version of k-set agreement. Using this last extension, we prove that n registers are enough for every colorless task that is obstruction-free solvable with identifiers and any number of registers.

关键词： Anonymous processes Asynchronous system Atomic read/write register Bounded number of registers Consensus distributed algorithm distributed computability Fault-tolerance k-set agreement Obstruction-freedom Process crash Repeated k-set agreement Upper bound Colorless task

来源：评论

学校读者我要写书评

暂无评论

Synchronization of linear systems via relative actuation

引用

SYSTEMS & CONTROL LETTERS 2019年 134卷 104527-000页

作者： Tuna, S. Emre Middle East Tech Univ Dept Elect & Elect Engn TR-06800 Ankara Turkey Univ Melbourne Dept Elect & Elect Engn Melbourne Vic 3010 Australia

Synchronization in networks of discrete-time linear time-invariant systems is considered under relative actuation. Neither input nor output matrices are assumed to be commensurable. A distributed algorithm that ensure... 详细信息

关键词： Synchronization Relative actuation Network control distributed algorithm

来源：评论

学校读者我要写书评

暂无评论

Performance Analysis of the Robust Diffusion Normalized Least Mean p-Power algorithm

引用

IEEE TRANSACTIONS ON CIRCUITS AND SYSTEMS II-EXPRESS BRIEFS 2018年第12期65卷 2047-2051页

作者： Lu, Lu Zhao, Haiquan Wang, Wenyuan Yu, Yi Sichuan Univ Sch Elect & Informat Engn Chengdu Sichuan Peoples R China Southwest Jiaotong Univ Sch Elect Engn Chengdu 610031 Sichuan Peoples R China

The diffusion least-mean p-power algorithm is presented for distributed estimation in impulsive noise environments, which aims to minimize the p-norm of the error. However, it suffers from slow convergence rate. In this brief, we propose a diffusion normalized least-mean p-power algorithm (DNLMP), motivated by the normalized-based algorithms. To further improve the performance of the DNLMP algorithm, a robust DNLMP (RDNLMP) algorithm is developed for distributed estimation. The RDNLMP algorithm considers the error signal in normalization factor, and therefore can diminish the significance of outliers under impulsive noise environments. Moreover, the steady-state analysis of the RDNLMP algorithm is provided. Both performance analysis and numerical simulations are given to verify the proposed algorithms.

关键词： distributed algorithm normalized version p-power error criterion impulsive interference

来源：评论

学校读者我要写书评

暂无评论

Leveraging Diversity for Achieving Resilient Consensus in Sparse Networks

引用

IFAC-PapersOnLine 2019年第20期52卷 339-344页

作者： Faiq Ghawash Waseem Abbas Information Technology University Lahore Pakistan

A networked system can be made resilient against adversaries and attacks if the underlying network graph is structurally robust. A typical approach to making networks structurally robust is to strategically add extra links between nodes, which might be prohibitively expensive. In this paper, we propose an alternative way of improving network’s robustness, that is by considering heterogeneity of nodes. Nodes in a network can be of different types and can have multiple variants. As a result, different nodes can have disjoint sets of vulnerabilities, which means that an attacker can only compromise a particular type of nodes by exploiting a particular vulnerability. We show that, by such a diversification of nodes, attacker’s ability to change the underlying network structure can be reduced significantly. Consequently, even a sparse network with heterogeneous nodes can exhibit the properties of a structurally robust network. Using these ideas, we propose a distributed control policy that utilizes heterogeneity in the network to achieve resilient consensus in adversarial environment. We extend the notion of (r,s)-robustness to incorporate the diversity of nodes and provide necessary and sufficient conditions to guarantee resilient distributed consensus in heterogeneous networks. Finally we study the properties and construction of robust graphs with heterogeneous nodes.

关键词： Resilient Consensus Network Robustness distributed algorithm

来源：评论

学校读者我要写书评

暂无评论

Multi-robot coordination for connectivity recovery after unpredictable environment changes

引用

IFAC-PapersOnLine 2019年第8期52卷 446-451页

作者： Yaroslav Marchukov Luis Montano Instituto de Investigación en Ingeniería de Aragon (I3A) University of Zaragoza Spain

In the present paper we develop a distributed method to reconnect a multi-robot team after connectivity failures, caused by unpredictable environment changes, i.e. appearance of new obstacles. After the changes, the team is divided into different groups of robots. The groups have a limited communication range and only a partial information in their field of view about the current scenario. Their objective is to form a chain from a static base station to a goal location. In the proposed distributed replanning approach, the robots predict new plans for the other groups from the new observed information by each robot in the changed scenario, to restore the connectivity with a base station and reach the initial joint objective. If a solution exists, the method achieves the reconnection of all the groups in a unique chain. The proposed method is compared with other two cases: 1) when all the agents have full information of the environment, and 2) when some robots must move to reach other waiting robots for reconnection. Numerical simulations are provided to evaluate the proposed approach in the presence of unpredictable scenario changes.

关键词： Multi-robot systems connectivity failures distributed algorithm communication recovery

来源：评论

学校读者我要写书评

暂无评论

Efficient Connected Dominating Set Construction with Maximum Lifetime in the Cognitive Radio Networks

引用

Procedia Computer Science 2019年 147卷 446-452页

作者： Manman Liu Jiguo Yu Dongxiao Yu Xiuzhen Cheng School of Information Science and Engineering Qufu Normal University Rizhao 276826 China School of Computer Science and Technology Shandong University Qingdao 266510 China Department of Computer Science The George Washington University Washington DC 20052 USA

Connected dominating set (CDS) is the most representative technology for constructing a virtual backbone in wireless networks and plays an important role in wireless applications including broadcasting, routing and so on. In a cognitive radio networks, the lifetime and efficiency are two important indices for measuring CDS algorithms due to the random activities of primary users (PUs). However, to the best of our knowledge, the existing algorithms for CDS construction in CRNs ignore the execution effectiveness instead of lifetime. In this paper, we propose a four-phase distributed algorithm to maximize the lifetime of CDS while guaranteeing the effectiveness of the algorithm. The proposed algorithm terminates in O(N 3 log N) timeslots, which is more effective than that of O(N 4 ).

关键词： the connected dominating set the cognitive radio networks the maximum lifetime distributed algorithm

来源：评论

学校读者我要写书评

暂无评论

Energy efficient with time synchronised and service coverage guarantee in wireless sensor networks

引用

INTERNATIONAL JOURNAL OF COMMUNICATION NETWORKS AND distributed SYSTEMS 2018年第1期21卷 56-79页

作者： Gherbi, Chirihane Aliouat, Zibouda Benmohammed, Mohamed Univ OEB Dept Math & Comp Sci Oum El Bouaghi Algeria Univ Ferhat Abbas Dept Comp Sci Lab LRSD Setif 1 Algeria Univ Constantine Dept Comp Sci Constantine Algeria

In this paper, a novel hierarchical approach called distributed energy efficient adaptive clustering protocol with data gathering, load-balancing and self-adaptation (ACP) is proposed for wireless sensor network. We have proposed (ACP) approach to reach the following objectives: reduce the overall network energy consumption, balance the energy consumption among the sensors and extend the lifetime of the network, the clustering must be completely distributed, the clustering should be efficient in complexity of message and time, the cluster-heads should be well-distributed across the network, the load balancing should be done well, the clustered WSN should be fully-connected. We consider the problem of conserving energy by turning off the node's radio for periods of a fixed time length. As a result transmission power of the node is reduced, which subsequently reduce the energy consumption of the node. Our proposed work is simulated through network simulator (NS-2). Simulations show that (ACP) clusters have good performance characteristics.

关键词： energy saving distributed algorithm load balancing cluster-based routing wireless sensor network

来源：评论

学校读者我要写书评

暂无评论

Multiple Energies Retailing Based on Stackelberg Game Model

引用

Energy Procedia 2019年 158卷 2695-2700页

作者： Yinghao Chen Zhaoxia Jing School of Electric Power Engineering South China University of Technology Guangzhou 510641 China

Gas-based distributed energy stations are supported by Chinese government and have significant commercial potential. Recently, Chines retail electricity market is reforming. Integrating distributed energy stations makes retailers transform into multi-energy providers (MEPs) and brings huge competitive advantages. A multi-leaders and multi-followers Stackelberg game between MEPs and energy consumers (ECs) is applied to simulate the dynamic behaviors of pricing, producing and consuming. MEPs as the leaders optimize the electricity and heat prices with the aim of maximizing their own income. ECs as the followers optimize the electricity and heat demands with the aim of maximizing their own consumer surplus based on the prices from different MEPs. In addition, the price set by a MEP also depends on the prices of other MEPs. Therefore, there is a non-cooperative game among MEPs. A distributed algorithm is executed by a virtual energy exchange center (VEEC) to solve the game equilibrium and analyze the joint pricing of multiple energy in the retail energy market. By analyzing the numerical results, we verify the validity of the Stackelberg game model, as well as the accuracy of the proposed algorithm and mathematical derivation.

关键词： multiple energies retailing Stackelberg game model multiple energies joint pricing distributed algorithm

来源：评论

学校读者我要写书评

暂无评论

distributed Dynamic Clustering in Wireless Networks with Capacity Constraint and Concealed Data

Distributed Dynamic Clustering in Wireless Networks with Cap...

引用

IEEE International Conference on Computer and Communication Engineering Technology (CCET)

作者： Liu Bing Ma Zhuang Zhang Yanshuo Cai Juliang Beijing Elect Sci & Technol Inst Informat Secur Dept Beijing 100070 Peoples R China

ISBN: (纸本)9781538674376

There are correlations of data in adjacent nodes in wireless sensor networks (WSNs), Internet of Things (IoT) and so on. Compression based on clustering is an effective way to reduce the communication cost and save the energy. Comparing with former schemes that are centrally controlled, a distributed dynamic clustering scheme is presented in this paper, with which the network can be partitioned to clusters adaptive to the topology and according to the local knowledge, to assure better energy property. This method also considers the capacity constraint in practical networks and the applications with concealed data. Analyses and simulations verify that the proposed scheme has higher efficiency and better practicability.

关键词： wireless networks clustering distributed algorithm capacity concealed data

来源：评论

学校读者我要写书评

暂无评论

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案：

请选择收藏分类：

通借通还

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：