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

Multi-agent control of community and utility using Lagrangian relaxation based dual decomposition

ELECTRIC POWER SYSTEMS RESEARCH 2014年第0期110卷 45-54页

作者： Disfani, Vahid R. Fan, Lingling Piyasinghe, Lakshan Miao, Zhixin Univ S Florida Dept Elect Engn Tampa FL 33620 USA

In multi-agent based demand response program, communities and a utility make decisions independently and they interact with each other with limited information sharing. This paper presents the design of multi-agent based demand response program while considering ac network constraints. This project develops two types of information sharing and iterative decision making procedures for the utility and communities to reach Nash equilibrium. The distributed algorithms of decision making are based on Lagrangian relaxation, duality, and the concept of upper and lower bounds. The first algorithm is subgradient iteration based distributed decision making algorithm and the second algorithm is based on lower bound and upper bound switching. The two algorithms require different information flow between the utility and communities. With the adoption of distributed algorithms, the utility solves optimal power flow at each iteration while considering ac network constraints, and the communities also conduct optimization. Through information sharing, the utility and the communities update their decisions until convergence is reached. The decision making algorithms are tested against three test cases: a distribution network IEEE 399 system, two meshed networks (IEEE 30-bus system and IEEE 300-bus system). Fast convergence is observed in all three cases, which indicates the feasibility of the demand response design. (C) 2014 Elsevier B.V. All rights reserved.

关键词： Multi-agent system distributed algorithm Dual decomposition AC optimal power flow Lagrangian relaxation

来源：评论

学校读者我要写书评

暂无评论

Risk-Aware Day-Ahead Scheduling and Real-time Dispatch for Electric Vehicle Charging

引用

IEEE TRANSACTIONS ON SMART GRID 2014年第2期5卷 693-702页

作者： Yang, Lei Zhang, Junshan Poor, H. Vincent Arizona State Univ Sch Elect Comp & Energy Engn Tempe AZ 85287 USA Princeton Univ Sch Engn & Appl Sci Princeton NJ 08544 USA

This paper studies risk-aware day-ahead scheduling and real-time dispatch for electric vehicle (EV) charging, aiming to jointly optimize the EV charging cost and the risk of the load mismatch between the forecast and the actual EV loads, due to the random driving activities of EVs. It turns out that the consideration of the load mismatch risk in the objective function significantly complicates the risk-aware day-ahead scheduling problem (indeed it involves nonconvex optimization). A key step taken here is to utilize a hidden convexity structure to recast this problem as a two-stage stochastic linear program, and then solve it by using the L-shaped method. Since the computational complexity grows exponentially in the number of EVs, an estimation algorithm is developed based on importance sampling to mitigate the computational complexity. Further, a distributed risk-aware real-time dispatch algorithm is developed, in which the aggregator needs to compute only the shadow prices for each EV to optimize its own charging strategy in a distributed manner. It is shown, based on real data, that the proposed risk-aware day-ahead scheduling algorithm using importance sampling can significantly reduce the overall charging cost with a small number of samples.

关键词： distributed algorithm electric vehicles importance sampling smart charging smart grids

来源：评论

学校读者我要写书评

暂无评论

Consensus networks over finite fields

引用

AUTOMATICA 2014年第2期50卷 349-358页

作者： Pasqualetti, Fabio Borra, Dornenica Bullo, Francesco Univ Calif Riverside Dept Mech Engn Riverside CA 92521 USA Politecn Torino Dipartimento Sci Matemat Turin Italy Univ Calif Santa Barbara Ctr Control Dynam Syst & Computat Santa Barbara CA 93106 USA

This work studies consensus strategies for networks of agents with limited memory, computation, and communication capabilities. We assume that agents can process only values from a finite alphabet, and we adopt the framework of finite fields, where the alphabet consists of the integers {0,..., p - 1}, for some prime number p, and operations are performed modulo p. Thus, we define a new class of consensus dynamics, which can be exploited in certain applications such as pose estimation in capacity and memory constrained sensor networks. For consensus networks over finite fields, we provide necessary and sufficient conditions on the network topology and weights to ensure convergence. We show that consensus networks over finite fields converge in finite time, a feature that can be hardly achieved over the field of real numbers. For the design of finite-field consensus networks, we propose a general design method, with high computational complexity, and a network composition rule to generate large consensus networks from smaller components. Finally, we discuss the application of finite-field consensus networks to distributed averaging and pose estimation in sensor networks. Published by Elsevier Ltd.

关键词： Multi-agent system Consensus network Finite field distributed algorithm Graph theory

来源：评论

学校读者我要写书评

暂无评论

Efficient transceiver beamforming in multiple-input-multiple-output cognitive radio network

引用

IET COMMUNICATIONS 2014年第15期8卷 2729-2736页

作者： Zhu, Fangjun Guo, Yan Li, Ning PLA Univ Sci & Technol Coll Commun Engn Nanjing 210007 Jiangsu Peoples R China

Owing to the ability of improving spectrum utilisation and quality-of-service (QoS) in wireless communications, multiple-input-multiple-output (MIMO) cognitive radio (CR) network has been identified as an excellent choice for the next generation communication. To protect primary users (PUs) from excessive interference while ensuring a meaningful QoS of secondary users (SUs), one key challenge of such system is the joint design of transceiver beamforming for SUs. In this study, the authors investigate the beamforming in MIMO CR network, and two optimisation problems in terms of the minimisation of the total transmission power and the maximisation of the smallest received signal-to-interference-plus-noise ratio (SINR) are considered. The problems can be formulated as indefinite quadratic optimisation programs which are known to be non-convex NP-hard. Hence, a distributed algorithm based on semi-definite programming and minimum-mean-squared-error is proposed to achieve the optimal beamforming weight vector. The findings of this study demonstrated that the proposed algorithm outperforms the existing ones with respect to the total transmitted power and SUs SINR.

关键词： radio transceivers array signal processing MIMO communication cognitive radio quality of service minimisation computational complexity distributed algorithms least mean squares methods concave programming radio spectrum management radiofrequency interference quadratic programming multiple-input-multiple-output cognitive radio network spectrum utilisation quality-of-service QoS wireless communication MIMO CR network next generation communication primary user protection excessive interference secondary user transceiver beamforming efficiency optimisation problem total transmission power minimisation signal-to-interference-plus-noise ratio SINR maximisation indefinite quadratic optimisation program nonconvex NP-hard distributed algorithm semidefinite programming minimum-mean-squared-error optimal beamforming weight vector

来源：评论

学校读者我要写书评

暂无评论

Gathering on rings under the Look-Compute-Move model

引用

distributed COMPUTING 2014年第4期27卷 255-285页

作者： D'Angelo, Gianlorenzo Di Stefano, Gabriele Navarra, Alfredo Univ Perugia Dipartimento Matemat & Informat I-06123 Perugia Italy Gran Sasso Sci Inst I-67100 Laquila Italy Univ Aquila Dipartimento Ingn & Sci Informaz & Matemat I-67100 Laquila Italy

A set of robots arbitrarily placed on different nodes of an anonymous ring have to meet at one common node and there remain. This problem is known in the literature as the gathering. Anonymous and oblivious robots operate in Look-Compute-Move cycles;in one cycle, a robot takes a snapshot of the current configuration (Look), decides whether to stay idle or to move to one of its neighbors (Compute), and in the latter case makes the computed move instantaneously (Move). Cycles are asynchronous among robots. Moreover, each robot is empowered by the so called multiplicity detection capability, that is, it is able to detect during its Look operation whether a node is empty, or occupied by one robot, or occupied by an undefined number of robots greater than one. The described problem has been extensively studied during the last years. However, the known solutions work only for specific initial configurations and leave some open cases. In this paper, we provide an algorithm which solves the general problem but for few marginal and specific cases, and is able to detect all the ungatherable configurations. It is worth noting that our new algorithm makes use of some previous techniques and unifies them with new strategies in order to deal with any initial configuration, even those left open by previous works.

关键词： distributed algorithm Asynchronous system Gathering Oblivious robots

来源：评论

学校读者我要写书评

暂无评论

A simple Byzantine Generals protocol

引用

JOURNAL OF COMBINATORIAL OPTIMIZATION 2014年第3期27卷 541-544页

作者： Wang, Junxing Tsinghua Univ Inst Interdisciplinary Informat Sci Beijing 100084 Peoples R China

The Byzantine Generals Problem is a classical problem in distributed computing that models a system's resiliency against arbitrary adversarial faults. The existing solutions to this problem tend to be quite intricate and many of them employ some form of recursion. This paper gives a new algorithm that solves the problem in an exceptionally simple straight-line program.

关键词： Byzantine Generals problem distributed algorithm Fault tolerant

来源：评论

学校读者我要写书评

暂无评论

Formation of network coding coalitions for cooperative communications

引用

IET NETWORKS 2014年第2期3卷 97-109页

作者： Li, Dapeng Zhong, Wei Nanjing Univ Posts & Telecommun Dept Commun Engn Nanjing Jiangsu Peoples R China Nanjing Inst Commun Engn PLAUST Nanjing Jiangsu Peoples R China

Recent results have shown that employing NC may have an adverse effect and dimmish the advantage of NC in CC because of the existence of NC noise. The authors propose space network-coded cooperation (SNCC) in which sources transmit in turn, and relays overhear and process the data they have received from different sources. Then, they broadcast the coded data to corresponding destinations in a single time instance. In this spirit, NC can be viewed as being performed in the space, and each destination can average the NC noise that comes from different relays. The authors derive a closed-form expression for the NC noise of SNCC, and show that SNCC has a potential to significantly reduce the NC noise if sessions in the network are well organised into disjoint groups/coalitions to use SNCC. Towards the end, the formation of SNCC coalitions is interpreted as a coalition formation game. algorithms are proposed to get the solution of the game. Finally, through numerical simulations, the authors demonstrate the effectiveness of the proposed SNCC scheme and algorithms in achieving a high spectrum efficiency for CC.

关键词： distributed algorithms game theory numerical analysis network coding cooperative communication network coding coalition multisession cooperative communications NC capability time slot overhead reduction NC noise space network-coded cooperation disjoint group-coalition SNCC coalitions coalition formation game centralised algorithm distributed algorithm numerical simulation SNCC scheme spectrum efficiency

来源：评论

学校读者我要写书评

暂无评论

LARGE-SCALE VISUALIZATION OF SPARSE MATRICES

引用

SCALABLE COMPUTING-PRACTICE AND EXPERIENCE 2014年第1期15卷 21-31页

作者： Langr, D. Simecek, I. Tvrdiki, P. Dytrych, T. Czech Tech Univ Fac Informat Technol Dept Comp Syst Thakurova 9 Prague 16000 Czech Republic Louisiana State Univ Dept Phys & Astron Baton Rouge LA 70803 USA

An efficient algorithm for parallel acquisition of visualization data for large sparse matrices is presented and evaluated both analytically and empirically. The algorithm was designed to be application-independent, i.e., it works with any matrix-processors mapping and with any sparse storage format/scheme. The empirical scalability study of the algorithm was carried on using multiple modern HPC systems. In our largest experiment, we utilized 262144 processors for 73 seconds to gather and store to a file the visualization data for a matrix with 1.17 . 10(13) nonzero elements. Using the proposed algorithm, one can thus visualize large sparse matrices with a minimal runtime overhead imposed on executed HPC codes.

关键词： visualization sparse matrices parallel system distributed algorithm data acquisition

来源：评论

学校读者我要写书评

暂无评论

Location-based routing protocols in wireless sensor networks: a survey

引用

INTERNATIONAL JOURNAL OF INTERNET PROTOCOL TECHNOLOGY 2014年第4期8卷 200-213页

作者： Soni, Vaibhav Mallick, Dheeresh K. Birla Inst Technol Mesra Dept Comp Sci & Engn Ranchi 835215 Jharkhand India

Recent advances in micro electro-mechanical systems (MEMS), wireless sensor networks (WSNs) and digital electronics have provided low-cost, low-power, multi-functional but small in size sensors with capabilities of sensing various physical and environmental conditions, data processing and wireless communication within short range. In WSNs, sensors have limited power, processing, storage and communication capabilities. Hence, these networks require more effective and energy efficient schemes for routing of data and processing. In recent years, many location-based routing protocols have been proposed for WSNs where energy consideration is taken as an important constraint to extend the network lifetime. In this survey, we discuss the architecture of wireless sensor networks followed by challenges in designing routing protocols for these networks. Further, we present various location-based routing protocols proposed by numerous researcher and finally these protocols are compared on the basis of different parameters.

关键词： wireless sensor network WSN location-based routing protocol mobile ad hoc network MANET vehicular ad hoc networks VANETs geographic routing greedy routing distributed algorithm multipath multicast virtual grid recursive geographic forwarding enclosure graph relay region

来源：评论

学校读者我要写书评

暂无评论

ANALYSIS OF NON-BINARY FAULT TOLERANT EVENT DETECTION IN WIRELESS SENSOR NETWORKS

引用

INTERNATIONAL JOURNAL ON SMART SENSING AND INTELLIGENT SYSTEMS 2014年第3期7卷 1287-1309页

作者： Jancee, B. Victoria Radha, S. Das, Nandita St Josephs Coll Engn Dept Elect & Commun Engn Chennai Tamil Nadu India Sri Sivasubramaniya Nadar Coll Engn Dept Elect & Commun Engn Chennai Tamil Nadu India

A distributed non-binary fault tolerant event detection technique is proposed for a wireless sensor network (WSN) consisting of a large number of sensors. The sensor nodes may be faulty due to harsh environment and manufacturing reasons. In the existing works on event detection, the detection of event is decided by only one threshold level. The objective of this paper is to extend the fault recognition and correction algorithm for non-binary event detection. The analysis presented here takes into account both the symmetric and non-symmetric error in a straightforward manner. In addition, simulation is done for symmetric error and 75 percentage of the errors can be corrected. The theoretical analysis shows that more than 95 percentage of symmetric errors can be corrected and almost 92 percentage of non-symmetric errors can be corrected (for k=2, i.e. half of the neighbors give correct decision), even when as many as 10 percentage of the sensor nodes are faulty.

关键词： distributed algorithm fault-tolerance non-binary event detection non-symmetric error symmetric error wireless sensor networks

来源：评论

学校读者我要写书评

暂无评论

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案：

请选择收藏分类：

通借通还

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：