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

Agent-based distributed and economic automatic generation control for droop-controlled AC microgrids

IET GENERATION TRANSMISSION & DISTRIBUTION 2016年第14期10卷 3622-3630页

作者： Li, Zhongwen Zang, Chuanzhi Zeng, Peng Yu, Haibin Li, Shuhui Chinese Acad Sci Shenyang Inst Automat Lab Networked Control Syst Shenyang 110016 Peoples R China Univ Chinese Acad Sci Beijing 100049 Peoples R China Univ Alabama Dept Elect & Comp Engn Tuscaloosa AL 35487 USA

Microgrids (MGs) are presented as a cornerstone of smart grid, which can integrate renewable energy sources environmentally, friendly, and reliably. Hierarchical control strategies, i.e. primary droop control, second automatic generation control (AGC), and tertiary economic dispatch (ED), are widely used to control and optimise an MG. However, the gap between large time-scale ED and small time-scale AGC may decrease the economical efficiency of an MG. To address this problem, this study proposes a distributed economic AGC (EAGC) algorithm. The algorithm is fully distributed, as each distributed generator is assigned with an agent and the agents only require the local measurements and communication with its neighbours. Compared with centralised algorithms, the distributed control algorithm is easy to fulfil the plug-and-play requirements and reduces costs to modify the architecture of an MG. Furthermore, the proposed EAGC algorithm is suitable for all possible operation modes of an MG, i.e. islanded mode, grid-connected mode, and transition mode. To improve the robustness against agent loss or communication link fault, the topology of agents' communication network is designed to satisfy the N - 1 rule. The effectiveness of the proposed algorithm is demonstrated through the simulation tests which involve plenty of case studies.

关键词： distributed power generation power generation economics power generation control smart power grids cost reduction power generation faults distributed control agent-based distributed generation control droop-controlled AC microgrid MG smart grid renewable energy source primary droop control second automatic generation control tertiary economic dispatch ED EAGC algorithm distributed economic automatic generation control centralised algorithm plug-and-play requirement islanded mode grid-connected mode transition mode agent loss robustness communication link fault N-1 rule cost reduction

来源：评论

学校读者我要写书评

暂无评论

Solving coverage problems in wireless sensor networks using cover sets

引用

AD HOC NETWORKS 2010年第4期8卷 400-415页

作者： Zorbas, Dimitrios Glynos, Dimitris Kotzanikolaou, Panayiotis Douligeris, Christos Univ Piraeus Dept Informat Piraeus 18534 Greece

To achieve power efficient monitoring of targets by sensor networks, various coverage algorithms have been proposed. These algorithms divide the sensor nodes into cover sets, where each cover set is capable of monitoring all targets. Generating the maximum number of cover sets has been proven to be an NP-complete problem and, thus, algorithms producing sub-optimal solutions have been proposed. In this paper we present a novel and efficient coverage algorithm, that can produce both disjoint cover sets, i.e. cover sets with no common sensor nodes, as well as non-disjoint cover sets. While searching for the best sensor to include in a cover set, our algorithm uses a cost function that takes into account the monitoring capabilities of a sensor, its association with Poorly monitored targets, but also the sensor's remaining battery life. Through simulations, we show that the proposed algorithm outperforms similar heuristic algorithms found in the literature, producing collections of cover sets of optimal (or near-optimal) size. The increased availability offered by these cover sets along with the short execution time of the proposed algorithm make it desirable for a wide range of node deployment environments. (C) 2009 Elsevier B.V. All rights reserved.

关键词： Wireless sensor networks Target coverage Cover sets centralised algorithm

来源：评论

学校读者我要写书评

暂无评论

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

来源：评论

学校读者我要写书评

暂无评论

Localisation of wireless nodes with partial connectivity in wireless sensor systems

引用

IET WIRELESS SENSOR SYSTEMS 2020年第6期10卷 299-307页

作者： Waqas Khan, Muhammad Khan, Maryam Hafeez, Abdul Univ Lincoln Sch Comp Sci Lincoln Ctr Autonomous Syst Lincoln England Univ Engn & Technol Dept Comp Sci Univ Rd Peshawar Pakistan

Owing to their short communication range, wireless nodes in wireless sensor networks (WSNs) can exchange information with devices in their vicinity only. Thus, in sparse networks, the full connectivity of the network is rarely achieved. This renders a centralised approach towards localisation in WSNs useless. Moreover, the exploitation of a centralised algorithm for localisation compromises the scalability in dense networks. Thus, a decentralised, location-aware network with partial connectivity and hybrid (range and direction) measurements obtained between known sensors (reference sensors) and sensors at unknown locations (target sensors) is under focus. The decentralised location estimation is obtained using a linear least squares (LLS) approach and performance enhancements are achieved by introducing a weighing strategy to produce weighted least squares (WLS) estimates. This distributed estimation is made possible by designing a map stitching technique that forms the global map of the network from individual local maps of the wireless nodes without compromising the distributed nature of the network. In the analytical section of the study, theoretical mean squares error expression is derived for LLS estimation, and a Cramer-Rao lower bound is derived to bind the performance of the WLS solution. The algorithm's performance validation is conducted both theoretically and via simulations.

关键词： least squares approximations wireless sensor networks sensor placement wireless nodes wireless sensor networks sparse networks centralised algorithm dense networks decentralised location-aware network partial connectivity known sensors reference sensors unknown locations target sensors decentralised location estimation linear least squares approach distributed estimation LLS estimation wireless sensor systems short communication range weighing strategy Cramer-Rao lower bound WSN localisation

来源：评论

学校读者我要写书评

暂无评论

Increasing the amount of collected data using network coding and continuous movement of mobile sinks in wireless sensor networks

引用

IET NETWORKS 2020年第3期9卷 128-138页

作者： Kharati, Ehsan Khalily-Dermany, Mohammad Karmajani, Hamidreza Islamic Azad Univ Dept Comp Engn Qom Branch Qom Iran Islamic Azad Univ Khomein Branch Young Researchers & Elite Club Khomein Iran Islamic Azad Univ Dept Comp Engn Tuyserkan Branch Tuyserkan Iran

This study uses the network coding (NC) and mobile sinks (MSs) for collecting coded data (CCD) of sensor nodes (SNs). MSs move on a steady, direct and predetermined path with constant velocity in wireless sensor networks. The authors present an optimisation model for CCD problem which is a generalisation of the previous works and an optimisation model based on the integrated linear programming model. Solving this problem in polynomial time is not possible. In this model for CCD, each SN and MS are assigned a time slice, and two conditions are presented for transmission range of SNs and at most number time slices for CCD. Then a centralised algorithm with polynomial time complexity is presented in proposed conditions for the problem solving. Finally, by simulating, different sets of SNs are deployed randomly with a fixed position, which was evaluated by influence of the number of SNs, travelled distance of MS at each time slice, the duration of time slice, velocity of MS on delay, the total amount of CCD and network efficiency. The simulation results represent scalability and performance superiority of the proposed algorithm compared to methods with no NC such as C-Schedule and GAP-based approximation algorithms.

关键词： computational complexity wireless sensor networks linear programming telecommunication scheduling network coding network coding continuous movement mobile sinks wireless sensor networks MSs coded data sensor nodes SNs steady path direct path predetermined path constant velocity optimisation model CCD problem integrated linear programming model number time slices polynomial time complexity network efficiency centralised algorithm

来源：评论

学校读者我要写书评

暂无评论

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案：

请选择收藏分类：

通借通还

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：