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

Index Geographic gossip algorithm for Information Dissemination over Regular Graphs

Chinese Journal of Electronics 2019年第2期28卷 386-391页

作者： WANG Gang LIN Zun WANG Fuxiang School of Electrical and Information Engineering Beihang University China Mobile Communications Group Co.Ltd

An Index geographic gossip(IGG)algorithm is proposed. Relay nodes participate in information exchange and updating. The cumulative number of times these nodes participate is characterized by an index number, which can be used to accelerate information updating. The convergence property of the IGG algorithm is theoretically analyzed in ring and grid network topologies. The IGG algorithm improves the standard gossip algorithm by a gain of O(n) in both convergence time and communication cost. Compared to the geographic gossip algorithm, the IGG algorithm has a gain on the order of O(n) and O(n1/2) in the average hop count for information exchange and communication cost, respectively. Finally, the proposed IGG algorithm is compared with various baselines through simulations,and it is shown that significant performance gain can be achieved.

关键词： Information dissemination gossip algorithm Node mobility Geography

来源：评论

学校读者我要写书评

暂无评论

GoDisco plus plus : A gossip algorithm for information dissemination in multi-dimensional community networks

引用

PERVASIVE AND MOBILE COMPUTING 2013年第2期9卷 324-335页

作者： Sharma, Rajesh Datta, Anwitaman Nanyang Technol Univ Sch Comp Engn Singapore 639798 Singapore

In this paper we propose GoDisco++, a gossip based approach for information dissemination in online social community networks. GoDiscoo++ uses local information available to nodes-that is information associated with a node and its neighbors. The algorithm exploits multiple relations which may exist between nodes, and applies social principles and behavior inspired decentralized mechanisms for targeted dissemination. The dissemination process works with the dual aims of (i) maximizing the spread among relevant nodes (high recall) and (ii) minimizing spamming among non-relevant nodes (high precision). Such a designed dissemination scheme can have interesting applications like probabilistic publish/subscribe, decentralized recommendation and contextual advertisement systems, to name a few. We validate the proposed approach with simulation experiments performed using real and synthetic datasets. (C) 2012 Elsevier B.V. All rights reserved.

关键词： gossip algorithm Community networks Selective dissemination Egocentric social network

来源：评论

学校读者我要写书评

暂无评论

Quantized Consensus by Means of gossip algorithm

引用

IEEE TRANSACTIONS ON AUTOMATIC CONTROL 2012年第1期57卷 19-32页

作者： Lavaei, Javad Murray, Richard M. CALTECH Dept Control & Dynam Syst Pasadena CA 91106 USA

This paper deals with the distributed averaging problem over a connected network of agents, subject to a quantization constraint. It is assumed that at each time update, only a pair of agents can update their own states in terms of the quantized data being exchanged. The agents are also required to communicate with one another in a stochastic fashion. It is shown that a quantized consensus is reached for an arbitrary quantizer by means of the stochastic gossip algorithm proposed in a recent paper. The expected value of the time at which a quantized consensus is reached is lower and upper bounded in terms of the topology of the graph for a uniform quantizer. In particular, it is shown that these bounds are related to the principal submatrices of the weighted Laplacian matrix. A convex optimization is also proposed to determine a set of probabilities used to pick a pair of agents that leads to a fast convergence of the gossip algorithm.

关键词： Distributed computation gossip algorithm network quantization

来源：评论

学校读者我要写书评

暂无评论

Controllable load operation in microgrids using control scheme based on gossip algorithm

引用

APPLIED ENERGY 2018年 210卷 1336-1346页

作者： Mateska, Aleksandra Krkoleva Borozan, Vesna Krstevski, Petar Taleski, Rubin Ss Cyril & Methodius Univ Fac Elect Engn & Informat Technol Skopje Macedonia

The paper presents a novel control scheme for thermostatically controllable devices (TCDs) for application in Microgrids (MGs). It is implemented assuming that household controllable load is connected and interfaced with appropriate, commercially available equipment that allows communication. The work presented in this paper provides an integrated solution for continuous control of TCDs operation under normal MG operation as well as controlled change of TCDs states upon request of MG operator or aggregator. The solution is based on gossip algorithm (GSA) adapted for implementation in MGs. The simulation results of the proposed scheme show that its implementation facilitates MG operation control. The simulation, results also show that it allows fast control message dissemination and adequate changes of operation of TCDs according the request of MG operator or an aggregator. The proposed control scheme also considers customer's comfort and does not require customer's continuous involvement in the control process. (C) 2017 Elsevier Ltd. All rights reserved.

关键词： gossip algorithm Load control Microgrid Thermostatically controlled devices

来源：评论

学校读者我要写书评

暂无评论

Distributed average consensus via gossip algorithm with real-valued and quantized data for 0 <q <1

引用

SYSTEMS & CONTROL LETTERS 2010年第9期59卷 536-542页

作者： Yuan, Deming Xu, Shengyuan Zhao, Huanyu Chu, Yuming Nanjing Univ Sci & Technol Sch Automat Nanjing 210094 Jiangsu Peoples R China Huzhou Teachers Coll Dept Math Huzhou 313000 Zhejiang Peoples R China

This paper studies the problem of the gossip consensus algorithm with real-valued and quantized data. We study the effect of the mixing parameter on the convergence rate of the proposed gossip consensus algorithm, and show when the proposed bounds are optimized with respect to the mixing parameter. For a gossip consensus algorithm with quantized data, we prove that it can achieve the consensus almost surely, and the expected value of the final states is equal to the average of the initial states. Moreover, we provide a result characterizing the convergence performance of the distance from consensus and make a comparison with the non-quantized gossip consensus algorithm. Finally, simulation results are provided to evaluate the effectiveness of the proposed algorithm. (C) 2010 Elsevier B.V. All rights reserved.

关键词： Average consensus gossip algorithm Probabilistic quantization

来源：评论

学校读者我要写书评

暂无评论

A Column Generation-Based gossip algorithm for Home Healthcare Routing and Scheduling Problems

引用

IEEE TRANSACTIONS ON AUTOMATION SCIENCE AND ENGINEERING 2019年第1期16卷 127-137页

作者： Riazi, Sarmad Wigstrom, Oskar Bengtsson, Kristofer Lennartson, Bengt Chalmers Univ Technol Dept Signals & Syst Automat Res Grp SE-41296 Gothenburg Sweden

Home healthcare (HHC) is a service that dispatches caregivers to people in need of healthcare who live in the home. The task assignment and route generation for caregivers can be formulated as an extension of the well-known vehicle routing problem with time windows (VRPTW). Currently, the most successful exact algorithms for VRPTW are based on a framework combining column generation (CG) and branching. Although such methods could be successful for HHC routing and scheduling problem (HHCRSP) as well, fast approximate algorithms are appealing, especially for large problems. In an early version of this paper, we employed a heuristic distributed gossip algorithm to solve HHCRSP. In this paper, we integrate the gossip algorithm with a local solver based on CG, which makes it an effective algorithm for larger problem instances. As it will be shown with extensive numerical experiments, for large problem instances, gossip-CG performs better than the pure CG. Note to Practitioners-The task of routing and scheduling caregivers for HHC providers can be formulated as a mathematical problem that is theoretically challenging to solve to optimality for large-scale problems involving many clients and caregivers. Although extensive research and tools for tackling this problem already exist, in practice, even in developed countries, it is still common to rely on schedules generated manually by staff. What we present in this paper is the summary of our theoretical work on tackling such problems. The benefit of the framework that we propose, the CG-based gossip method, is that it can be preempted at any time if the staff requires to obtain a good schedule as soon as possible. If ample time is available, one can let our algorithm to run for a longer period of time to generate even shorter routes.

关键词： Column generation (CG) gossip algorithm home healthcare (HHC) vehicle routing problem

来源：评论

学校读者我要写书评

暂无评论

On-Line Learning gossip algorithm in Multi-Agent Systems with Local Decision Rules

On-Line Learning Gossip Algorithm in Multi-Agent Systems wit...

引用

IEEE International Conference on Big Data (Big Data)

作者： Bianchi, Pascal Clemencon, Stephan Morral, Gemma Jakubowicz, J. Telecom ParisTech LTCI UMR 5141 Inst Mines Telecom L37-39 Rue Dareau F-75014 Paris France Inst Mines Telecom SAMOVAR UMR 5157 Telecom SudParis F-91000 Evry France CNRS F-91000 Evry France

ISBN: (纸本)9781479912926;9781479912933

This paper is devoted to investigate binary classification in a distributed and on-line setting. In the Big Data era, datasets can be so large that it may be impossible to process them using a single processor. The framework considered accounts for situations where both the training and test phases have to be performed by taking advantage of a network architecture by the means of local computations and exchange of limited information between neighbor nodes. An online learning gossip algorithm (OLGA) is introduced, together with a variant which implements a node selection procedure. Beyond a discussion of the practical advantages of the algorithm we promote, the paper proposes an asymptotic analysis of the accuracy of the rules it produces, together with preliminary experimental results.

关键词： online statistical learning distributed learning algorithm gossip algorithm

来源：评论

学校读者我要写书评

暂无评论

Decentralized Optimization for Economic Operation of Islanding Microgrids Based on gossip algorithm

Decentralized Optimization for Economic Operation of Islandi...

引用

Chinese Automation Congress (CAC)

作者： Mao, Meiqin Xu, Rui Chang, Liuchen Hefei Univ Technol Res Ctr Photovolta Syst Engn Minist Educ Hefei 230009 Anhui Peoples R China Univ New Brunswick Dept Elect & Comp Engn Fredericton NB Canada

ISBN: (纸本)9781538635247

The economic operation of islanding microgrids is getting more and more attention. In view of the problems of information burden and high cost of communication, poor expansion in the centralized control, a fully distributed optimization method for the economic operation of islanding microgrids is proposed. The proposed method is decentralized based on the gossip algorithm, in which only through exchanging the information of respective micro incremental rates between neighboring nodes, can the microgrids achieve optimal economic operation. The robustness of the proposed method is verified by MATLAB and two cases: the normal operation and abnormal operation considering the change of the communication topology caused by the exit of specific nodes. The simulation results show that the economic optimal operation of the islanding microgrids can be realized by the proposed decentralized optimization method, meanwhile making the power supply and demand balance, and effectively improve the performance of plug and play feature of microgrids.

关键词： islandingmicrogrids economic operation method gossip algorithm micro incremental rates communication topology

来源：评论

学校读者我要写书评

暂无评论

Time synchronization for large scale wireless sensor networks based on multi-broadcast gossip algorithm

Time synchronization for large scale wireless sensor network...

引用

International Conference on Mechatronics and Semiconductor Materials (ICMSCM 2013)

作者： Shi, Chao Qiu, Hongbing Wang, Yunyi Xidian Univ Sch Telecommun Engn Xian 710071 Peoples R China Guilin Univ Elect Technol Informat & Commun Coll Guilin 541004 Peoples R China

ISBN: (纸本)9783037859391

A scheme of time synchronization for large scale wireless sensor networks based on multi-broadcast gossip algorithm is proposed in this paper. It is allowed multiple nodes can broadcast their time information simultaneously. In order to avoid communication collisions and receiving confusion, according to graph theory the distance between any two broadcasting nodes is restricted as 3. It is proved for convergence performance of this scheme by using stochastic matrix theory. The performance for this scheme is discussed. The computer simulations are given to test and verify the theoretical analysis.

关键词： Time Synchronization Multi-broadcast gossip algorithm Wireless Sensor Networks

来源：评论

学校读者我要写书评

暂无评论

A Synchronous gossip algorithm with Exponential Backoff 4

A Synchronous Gossip Algorithm with Exponential Backoff

引用

IEEE SmartWorld, Ubiquitous Intelligence & Computing, Advanced & Trusted Computing, Scalable Computing & Communications, Cloud & Big Data Computing, Internet of People and Smart City Innovation (SmartWorld/SCALCOM/UIC/ATC/CBDCom/IOP/SCI)

作者： Zhang Lei Cheng Weiqing Hou Yinglin Nanjing Univ Posts & Telecommun Sch Comp Sci Nanjing Jiangsu Peoples R China Southeast Univ Key Lab Comp Network & Informat Integrat Nanjing Jiangsu Peoples R China

ISBN: (纸本)9781538693803

In large-scale distributed systems, gossip protocols are often used to disseminate information. In this paper, an improved gossip algorithm that integrates binary exponential backoff used in computer network into the classic gossip algorithm is proposed to reduce the network load in the process of information dissemination. The improved gossip algorithm applies an exponential backoff messaging strategy to spread information among nodes, i.e. the more often a node receives a certain information, the less likely it is to spread information in the following rounds. The Markov chain is used to analyze this model. We analyze the performance of this proposed algorithm both analytically and by simulations and show how it reduces network load compared to the classic gossip algorithm. Our method reduces the network load by 28% compared to the classic algorithm on 10,000 nodes.

关键词： Exponential backoff gossip algorithm Markov chain

来源：评论

学校读者我要写书评

暂无评论

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案：

请选择收藏分类：

通借通还

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：