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

Topology Control algorithms for Wireless Sensor Networks: A Review

WIRELESS PERSONAL COMMUNICATIONS 2020年第4期113卷 2363-2385页

作者： Singla, Pallavi Munjal, Amit Thapar Inst Engn & Technol Patiala Punjab India

Wireless sensor networks (WSN) are widely used in various domains such as military, health applications, environmental applications, structural monitoring, agriculture sectors etc. In WSN Topology control is fundamental approach in which link establishment is in such a way that energy consumption is minimized. This helps in increasing the network lifetime. In this paper, we have attempted to present a review of different existing topology control algorithms in literature. We have summarized all these existing on the basis of different performance metrics such as energy consumption, network lifetime, delay, energy cost etc. Finally this paper supports the reader an idea to select the topology control for the desired application.

关键词： Centralized algorithm distributed algorithm Direction based Location based Topology control

来源：评论

学校读者我要写书评

暂无评论

Leader-Follower Network Aggregative Game With Stochastic Agents' Communication and Activeness

引用

IEEE TRANSACTIONS ON AUTOMATIC CONTROL 2020年第12期65卷 5496-5502页

作者： Shokri, Mohammad Kebriaei, Hamed Univ Tehran Coll Engn Sch Elect & Comp Engn Tehran 131451384 Iran Inst Res Fundamental Sci IPM Sch Comp Sci Tehran 193955746 Iran

This article presents a leader-follower scheme for network aggregative games. The followers and leader are selfish cost minimizing agents. The cost function of each follower is affected by its own strategy, the strategy of leader and the aggregate strategy of its neighbors through a communication graph. Also, the leader's cost function depends on its own strategy and the aggregate strategy of all the followers. The leader infinitely often wakes up, receives the aggregate strategy of the followers, updates its decision value, and broadcasts it to all the followers. Then, the followers apply the updated strategy of the leader into their cost functions. The establishment of information exchange between each neighboring pair of followers, and also, decision updating by a follower at each iteration, that is to say the activeness of the follower in that iteration, are both considered to be drawn from two arbitrary distributions. Moreover, a distributed algorithm based on subgradient method is proposed for updating the strategies of leader and followers. The convergence of the proposed algorithm to the unique Stackelberg equilibrium point of the game is proven in both almost sure and mean square senses.

关键词： Cost function Games distributed algorithms Aggregates Artificial neural networks Convergence Stochastic processes distributed algorithm leader– follower network aggregative game (NAG) stochastic network subgradient method

来源：评论

学校读者我要写书评

暂无评论

Covert communications with friendly jamming in Internet of vehicles

引用

VEHICULAR COMMUNICATIONS 2022年 35卷

作者： Zhang, Hongruo Zou, Yifei Yu, Dongxiao Yu, Jiguo Cheng, Xiuzhen Shandong Univ Sch Comp Sci & Technol Qingdao 266200 Peoples R China Qilu Univ Technol Big Data Inst Shandong Acad Sci Jinan 250353 Peoples R China Shandong Lab Comp Networks Jinan 250014 Peoples R China

The Internet of Vehicles (IoV) provides an important platform for various applications in diverse vehicular sectors such as the safety, energy-saving, decision-making, routing, and entertainment, which makes vehicular transportation safer, greener, and easier. While providing convenient and efficient communications between vehicles, the wireless channel in IoV also faces an eavesdropping problem in the security area due to its open and shared nature. Different from the previous works under asymmetric assumptions, this paper studies a covert communication problem within symmetrical assumption, to prevent the eavesdropper from sensing the vehicular communications when the vehicles and eavesdropper have the same ability. Firstly, by dividing the network area into the safe area, dangerous area, and gray area, we show that with the help of a friendly jamming, all vehicular communications in the safe area can be covert. Secondly, by presenting a distributed jammer election algorithm with asymptotically optimal running time, we give an approach to obtain a friendly jammer from the vehicles for the covert communications. Finally, a comprehensive framework is presented, to convert the vehicular algorithms without covert communications into the ones only consisting of covert communications with their time complexity constant times increased as the trade-off. Empirical results validate the time efficiency of our covert communication algorithms with jammer election on running time.(C) 2022 Elsevier Inc. All rights reserved.

关键词： Covert communications Friendly jamming Internet of vehicles distributed algorithm SINR model

来源：评论

学校读者我要写书评

暂无评论

Replacing email protocols with blockchain-based smart contracts

引用

CLUSTER COMPUTING-THE JOURNAL OF NETWORKS SOFTWARE TOOLS AND APPLICATIONS 2020年第3期23卷 1795-1801页

作者： Chamadoira Gonzalez, Jose Garcia-Diaz, Vicente Rolando Nunez-Valdez, Edward Gomez Gomez, Alberto Crespo, Ruben Gonzalez Univ Oviedo Dept Comp Sci Oviedo Spain Univ Oviedo Dept Business Adm Gijon Spain Int Univ La Rioja Dept Comp Sci Madrid Spain

Email services nowadays are flooded by spam and phishing attacks. Email service providers build their own email filters to protect the final users from such attacks resulting in an overall better experience. However, the attacks come mainly from the same problem in the email protocols, i.e., the lack of authentication mechanism. In this work, we attempt to minimize some of the most common problems identified in email services such as spam, phishing, spoofing, lack of encryption, repudiation and centralization by implementing a smart contract over the Ethereum protocol. The proposal involves a decentralized system, a smart contract, a file system and two applications used as proof of concept.

关键词： Blockchain distributed algorithm Email protocol Ethereum Smart contract

来源：评论

学校读者我要写书评

暂无评论

Polynomial Silent Self-Stabilizing p-Star Decomposition

引用

COMPUTER JOURNAL 2020年第2期63卷 254-266页

作者： Haddad, Mohammed Johnen, Colette Koehler, Sven Univ Claude Bernard Lyon 1 Villeurbanne France Univ Bordeaux Talence France Univ Freiburg Freiburg Germany

We present a silent self-stabilizing distributed algorithm computing a maximal p-star decomposition of the underlying communication network. Under the unfair distributed scheduler, the most general scheduler model, the algorithm converges in at most 12 Delta m+O(m+n) moves, where m is the number of edges, n is the number of nodes and Delta is the maximum node degree. Regarding the time complexity, we obtain the following results: our algorithm outperforms the previously known best algorithm by a factor of Delta with respect to the move complexity. While the round complexity for the previous algorithm was unknown, we show a 5[n/p+1]+5 bound for our algorithm.

关键词： distributed algorithm self-stabilization graph decomposition p-star decomposition move complexity round complexity

来源：评论

学校读者我要写书评

暂无评论

Recurrent averaging inequalities in multi-agent control and social dynamics modeling

引用

ANNUAL REVIEWS IN CONTROL 2020年 49卷 95-112页

作者： Proskurnikov, Anton, V Calafiore, Giuseppe C. Cao, Ming Politecn Torino Dept Elect & Telecommun Turin Italy Russian Acad Sci IPME RAS Inst Problems Mech Engn St Petersburg Russia Univ Groningen Fac Sci & Engn Groningen Netherlands

Many multi-agent control algorithms and dynamic agent-based models arising in natural and social sciences are based on the principle of iterative averaging. Each agent is associated to a value of interest, which may represent, for instance, the opinion of an individual in a social group, the velocity vector of a mobile robot in a flock, or the measurement of a sensor within a sensor network. This value is updated, at each iteration, to a weighted average of itself and of the values of the adjacent agents. It is well known that, under natural assumptions on the network's graph connectivity, this local averaging procedure eventually leads to global consensus, or synchronization of the values at all nodes. Applications of iterative averaging include, but are not limited to, algorithms for distributed optimization, for solution of linear and nonlinear equations, for multi-robot coordination and for opinion formation in social groups. Although these algorithms have similar structures, the mathematical techniques used for their analysis are diverse, and conditions for their convergence and differ from case to case. In this paper, we review many of these algorithms and we show that their properties can be analyzed in a unified way by using a novel tool based on recurrent averaging inequalities (RAIs). We develop a theory of RAIs and apply it to the analysis of several important multi-agent algorithms recently proposed in the literature. (C) 2020 Elsevier Ltd. All rights reserved.

关键词： distributed algorithm Opinion dynamics Multi-agent control Consensus

来源：评论

学校读者我要写书评

暂无评论

Toward a Retail Market for Distribution Grids

引用

IEEE TRANSACTIONS ON SMART GRID 2020年第6期11卷 4891-4905页

作者： Haider, Rabab Baros, Stefanos Wasa, Yasuaki Romvary, Jordan Uchida, Kenko Annaswamy, Anuradha M. MIT Dept Mech Engn Cambridge MA 02139 USA Waseda Univ Dept Elect Engn & Biosci Tokyo 1698555 Japan

Modern active distribution grids are characterized by the increasing penetration of distributed energy resources (DERs). Proper coordination and scheduling of these DERs requires a local retail market which can operate at the distribution grid level. In this paper, we propose a retail market for optimally managing and scheduling DERs, and coordinating ancillary services in a distribution grid. Our proposed retail market leverages a recently proposed distributed proximal atomic coordination (PAC) algorithm which has several advantages over other distributed algorithms, with reduced local computational effort and enhanced privacy. We describe how the market can be implemented using a Distribution System Operator (DSO), whose representatives are located at the primary feeder level and workers are located at the substation level, and how the DSO will interact with the Wholesale Electricity Market. Finally, we extensively validate the performance of the proposed retail market via simulations of three networks: a real distribution grid in Tokyo, a balanced IEEE 123-bus distribution grid, and a modified IEEE 13-bus network. Our results show that the proposed market is practical and can be easily implemented in distribution grids, resulting in optimal real-time scheduling of DERs and compensation in the form of distributed locational marginal prices.

关键词： Reactive power Privacy Energy management Peer-to-peer computing Substations Couplings Decision feedback equalizers Distribution grid market optimal power flow distributed algorithm ancillary market

来源：评论

学校读者我要写书评

暂无评论

Equilibrium Analysis of Electricity Market With Demand Response Exchange to Counterbalance Bid Deviations of Renewable Generators

引用

IEEE SYSTEMS JOURNAL 2020年第2期14卷 2713-2724页

作者： Wang, Xian Zhang, Kai Zhang, Shaohua Wu, Lei Shanghai Univ Dept Automat Shanghai 200444 Peoples R China Stevens Inst Technol Dept Elect & Comp Engn Hoboken NJ 07030 USA

Because of severe uncertainty and poor dispatchability of renewable energy, when renewable generators (RGs) bid in the day-ahead (DA) wholesale electricity market, how to tackle the deviations between their actual outputs and cleared quantities from the market is one of the important topics in the design of electricity markets with the RGs. In this paper, a demand response exchange (DRX) market is introduced to counterbalance the deviations, where both upward and downward DR resources are considered and the DRX market price is determined by the bids of DR customers. In addition, to examine impacts of the DRX market on strategic behaviors of participants in the DA market, a joint equilibrium model of the DA market and the DRX market is proposed. Specifically, in the DRX market, DR customers compete by submitting their bids in the form of supply functions when the RGs' total actual output is less than the cleared quantity from the DA market, while the demand function bid mode is applied for DR customers when the RGs' total actual output is greater than the cleared quantity from the DA market. Monte Carlo simulation and scenario reduction techniques are employed to deal with uncertainties of the actual output of RGs. Moreover, the equilibrium model is converted into a convex optimization problem for the solution, and the existence and uniqueness of Nash equilibrium for the DA market and DRX market are theoretically demonstrated. Due to information asymmetry in practice, a distributed algorithm is applied to find equilibrium outcomes. Finally, numerical examples are presented to verify the reasonableness and effectiveness of the proposed model and algorithms.

关键词： Electricity supply industry Generators distributed algorithms Uncertainty Renewable energy sources Load management Numerical models Bid deviation day-ahead (DA) wholesale electricity market demand response exchange (DRX) market distributed algorithm equilibrium model

来源：评论

学校读者我要写书评

暂无评论

Resilient consensus in multi-agent systems with state constraints

引用

AUTOMATICA 2020年 122卷 109288-109288页

作者： Shang, Yilun Northumbria Univ Dept Comp & Informat Sci Newcastle Upon Tyne NE1 8ST Tyne & Wear England

This paper investigates resilient consensus problems over directed networks with state constraints. Cooperative agents in the network can potentially be influenced by uncooperative neighbors, who are knowledgeable, anonymous and able to spread misinformation. We formulate the resilient constrained consensus problem for high-dimensional multi-agent systems. A projection based resilient constrained consensus protocol is presented so that the agent's state will be pushed back to the constraint set when it approaches the boundary. We show that resilient constrained consensus can be reached for robust networks when the constraint sets are convex and share a non-empty overlap. The proposed algorithm is of low complexity, purely distributed, and can be performed in tandem with a max-consensus process to estimate the allowed number of uncooperative neighbors. (c) 2020 Elsevier Ltd. All rights reserved.

关键词： Resilient consensus State constraint Network distributed algorithm Multi-agent system

来源：评论

学校读者我要写书评

暂无评论

Gradient-Based Multi-Area Distribution System State Estimation

引用

IEEE TRANSACTIONS ON SMART GRID 2020年第6期11卷 5325-5338页

作者： Zhou, Xinyang Liu, Zhiyuan Guo, Yi Zhao, Changhong Huang, Jianqiao Chen, Lijun Natl Renewable Energy Lab Power Syst Engn Dept Golden CO 80401 USA Univ Colorado Dept Comp Sci Boulder CO 80309 USA Univ Texas Richardson Dept Mech Engn Richardson TX 75080 USA Chinese Univ Hong Kong Dept Informat Engn Hong Kong Peoples R China IIT Dept Elect & Comp Engn Chicago IL 60616 USA

The increasing distributed and renewable energy resources and controllable devices in distribution systems make fast distribution system state estimation (DSSE) crucial in system monitoring and control. We consider a large multi-phase distribution system and formulate DSSE as a weighted least squares (WLS) problem. We divide the large distribution system into smaller areas of subtree structure, and by jointly exploring the linearized power flow model and the network topology, we propose a gradient-based multi-area algorithm to exactly and efficiently solve the WLS problem. The proposed algorithm enables distributed and parallel computation of the state estimation problem without compromising any performance. Numerical results on a 4,521-node test feeder show that the designed algorithm features fast convergence and accurate estimation results. Comparison with traditional Gauss-Newton method shows that the proposed method has much better performance in distribution systems with a limited amount of reliable measurement. The real-time implementation of the algorithm tracks time-varying system states with high accuracy.

关键词： State estimation Voltage measurement Reliability Distribution networks Monitoring Real-time systems Distribution system state estimation multi-area state estimation distributed algorithm multi-phase system large system simulation

来源：评论

学校读者我要写书评

暂无评论

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案：

请选择收藏分类：

通借通还

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：