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

Information dissemination in mobile social networks with gossip algorithms

INTERNATIONAL JOURNAL OF AD HOC AND UBIQUITOUS COMPUTING 2016年第4期21卷 259-265页

作者： Yang, Bo Liu, Demin Zhang, Wenfeng NRIEE Nanjing 210007 Jiangsu Peoples R China

This paper studies the information dissemination problem in the mobile social network, which comprises a set of smart phones and works in a distributed manner. gossip algorithms are used to spread information over the mobile social network with simplicity and robustness. Two typical scenarios of information dissemination are analysed. The corresponding upper bounds on the convergence time are derived, which show the relationship between mobility of users and convergence rate of gossip algorithms. The performances of gossip algorithms are examined in both scenarios. Simulation results indicate that the growth of communication cost is almost linear when the scale of mobile social networks becomes larger, which is a quite encouraging result for application.

关键词： distributed information dissemination mobile social network gossip algorithms random walk

来源：评论

学校读者我要写书评

暂无评论

The Impact of Speed on the Convergence of gossip algorithms with Mobility in Wireless Sensor Networks

引用

IEEE COMMUNICATIONS LETTERS 2014年第2期18卷 221-224页

作者： Yang, Bo Zhu, Guangxi Wu, Weimin Huazhong Univ Sci & Technol Wuhan Peoples R China

This work presents two speed based mobility models for gossip algorithms in wireless sensor networks. The corresponding upper bounds on the convergence time are derived, which show the relationship between speed of agents and convergence rate of gossip algorithms. The influences of speed are examined under both mobility models. Simulation results indicate that the speed based mobility model can offer more precise estimates of communication cost, which provide useful references for large-scale sensor network planning.

关键词： Wireless sensor network distributed average consensus gossip algorithms mobility

来源：评论

学校读者我要写书评

暂无评论

Broadcast gossip algorithms for Consensus

引用

IEEE TRANSACTIONS ON SIGNAL PROCESSING 2009年第7期57卷 2748-2761页

作者： Aysal, Tuncer Can Yildiz, Mehmet Ercan Sarwate, Anand D. Scaglione, Anna Cornell Univ Commun Res Signal Proc Grp Sch Elect & Comp Engn Ithaca NY 14853 USA Univ Calif Berkeley Sensory Informat Proc & Commun Grp Dept Elect Engn & Comp Sci Berkeley CA 94720 USA

Motivated by applications to wireless sensor, peer-to-peer, and ad hoe networks, we study distributed broadcasting algorithms for exchanging information and computing in an arbitrarily connected network of nodes. Specifically, we study a broadcasting-based gossiping algorithm to compute the (possibly weighted) average of the initial measurements of the nodes at every node in the network. We show that the broadcast gossip algorithm converges almost surely to a consensus. We prove that the random consensus value is, in expectation, the average of initial node measurements and that it can be made arbitrarily close to this value in mean squared error sense, under a balanced connectivity model and by trading off convergence speed with accuracy of the computation. We provide theoretical and numerical results on the mean square error performance, on the convergence rate and study the effect of the "mixing parameter" on the convergence rate of the broadcast gossip algorithm. The results indicate that the mean squared error strictly decreases through iterations until the consensus is achieved. Finally, we assess and compare the communication cost of the broadcast gossip algorithm to achieve a given distance to consensus through theoretical and numerical results.

关键词： Broadcasting distributed average consensus gossip algorithms sensor networks

来源：评论

学校读者我要写书评

暂无评论

Local Interference Can Accelerate gossip algorithms

引用

IEEE JOURNAL OF SELECTED TOPICS IN SIGNAL PROCESSING 2011年第4期5卷 876-887页

作者： Nazer, Bobak Dimakis, Alexandros G. Gastpar, Michael Boston Univ Dept Elect & Comp Engn Boston MA 02215 USA Univ So Calif Dept Elect Engn Syst Los Angeles CA 90089 USA Univ Calif Berkeley Dept Elect Engn & Comp Sci Berkeley CA 94720 USA Ecole Polytech Fed EPFL Sch Comp & Commun Sci CH-1015 Lausanne Switzerland

In this paper, we show how interference can be exploited to perform gossip computations for average-based consensus over a larger local neighborhood, rather than only pairs of nodes. We use a new channel coding technique called computation coding to compute sums reliably over the wireless medium. Since many nodes can simultaneously average in a single round, our neighborhood gossip algorithm converges faster than the standard nearest neighbor gossip algorithm. For a network with n nodes and size m neighborhoods, neighborhood gossip requires O(n(2)/m(2)) rounds while standard gossip requires circle dot(n(2)) rounds. Furthermore, we show that if the power path loss coefficient is less than 4, the total transmit energy employed by neighborhood gossip is polynomially smaller than that employed by standard gossip.

关键词： Distributed signal processing gossip algorithms interference multiaccess communication wireless sensor networks

来源：评论

学校读者我要写书评

暂无评论

Performance Analysis of gossip algorithms for Large Scale Wireless Sensor Networks

IEEE OPEN JOURNAL OF THE COMPUTER SOCIETY

引用

IEEE OPEN JOURNAL OF THE COMPUTER SOCIETY 2024年第1期5卷 290-302页

作者： Dhuli, Sateeshkrishna Atik, Fouzul Chhabra, Anamika Singh, Prem Cenkeramaddi, Linga Reddy SRM Univ AP Dept Elect & Commun Engn Amaravati 522502 Andhra Pradesh India SRM Univ AP Dept Math Amaravati 522502 Andhra Pradesh India IIT Madras Chennai 600036 Tamil Nadu India IIIT Bangalore Bengaluru 560100 Karnataka India Univ Agder Dept Informat & Commun Technol ACPS Res Grp N-4630 Kristiansand Norway

gossip algorithms are often considered suitable for wireless sensor networks (WSNs) because of their simplicity, fault tolerance, and adaptability to network changes. They are based on the idea of distributed information dissemination, where each node in the network periodically sends its information to randomly selected neighbors, leading to a rapid spread of information throughout the network. This approach helps reduce the communication overhead and ensures robustness against node failures. They have been commonly employed in WSNs owing to their low communication overheads and scalability. The time required for every node in the network to converge to the average of its initial value is called the average time. The average time is defined in terms of the second-largest eigenvalue of a stochastic matrix. Thus, estimating and analyzing the average time required for large-scale WSNs is computationally complex. This study derives explicit expressions of average time for WSNs and studies the effect of various network parameters such as communication link failures, topology changes, long-range links, network dimension, node transmission range, and network size. Our theoretical expressions substantially reduced the computational complexity of computing the average time to O(n(-3)). Furthermore, numerical results reveal that the long-range links and node transmission range of WSNs can significantly reduce average time, energy consumption, and absolute error for gossip algorithms.

关键词： Wireless sensor networks Network topology Convergence Topology Energy consumption Heuristic algorithms Eigenvalues and eigenfunctions gossip algorithms large-scale WSNs computational complexity average time

来源：评论

学校读者我要写书评

暂无评论

The method of saving data integrity for decentralized network of group of UAV using quantized gossip algorithms

引用

IFAC-PapersOnLine 2016年第13期49卷 259-264页

作者： Tyushev, Kirill Amelin, Konstantin Andrievsky, Boris St. Petersburg State University St. Petersburg Russia Norwegian University of Science and Technology Department of Engineering Cybernetics Trondheim Norway Institute for Problems of Mechanical Engineering of RAS Russia

In this work the method of communication and maintenance of integrity of data in the decentralized network of autonomous mobile robots is suggested. The software and hardware feasibility of such method is proposed. For collective storage and maintain integrity of data in decentralized group of mobile robots the algorithm of checksum calculations is proposed. Quantized gossip algorithms are considered as basis of checksum calculations algorithm. The local voting protocol is used for load balancing of mobile robots. For the programming implementation of the communication of data multi-agent technology is used. An ultra light, unmanned aerial vehicle (UAV) is considered as the mobile robot. © 2016

关键词： Digital storage Antennas Mobile robots Multi agent systems Resource allocation Security of data Unmanned aerial vehicles (UAV) Autonomous Mobile Robot consensus achievement Data storage Decentralized networks gossip algorithms Multi agent technologies Multiagent networks Software and hardwares

来源：评论

学校读者我要写书评

暂无评论

Corrected gossip algorithms for Fast Reliable Broadcast on Unreliable Systems 31

Corrected Gossip Algorithms for Fast Reliable Broadcast on U...

引用

31st IEEE International Parallel and Distributed Processing Symposium (IPDPS)

作者： Hoefler, Torsten Barak, Amnon Shiloh, Amnon Drezner, Zvi Swiss Fed Inst Technol Dept Comp Sci Zurich Switzerland Hebrew Univ Jerusalem Dept Comp Sci IL-91904 Jerusalem Israel Calif State Univ Fullerton Coll Business & Econ Fullerton CA 92834 USA

ISBN: (纸本)9781538639146

Large-scale parallel programming environments and algorithms require efficient group-communication on computing systems with failing nodes. Existing reliable broadcast algorithms either cannot guarantee that all nodes are reached or are very expensive in terms of the number of messages and latency. This paper proposes Corrected-gossip, a method that combines Monte Carlo style gossiping with a deterministic correction phase, to construct a Las Vegas style reliable broadcast that guarantees reaching all the nodes at low cost. We analyze the performance of this method both analytically and by simulations and show how it reduces the latency and network load compared to existing algorithms. Our method improves the latency by 20% and the network load by 53% compared to the fastest known algorithm on 4,096 nodes. We believe that the principle of corrected-gossip opens an avenue for many other reliable group communication operations.

关键词： gossip algorithms reliable broadcast

来源：评论

学校读者我要写书评

暂无评论

Randomized gossip algorithms for Solving Laplacian Systems

Randomized Gossip Algorithms for Solving Laplacian Systems

引用

European Control Conference (ECC)

作者： Zouzias, Anastasios Freris, Nikolaos M. IBM Res Zurich Dept Math & Computat Sci Ruschlikon Switzerland New York Univ Abu Dhabi Div Engn Abu Dhabi U Arab Emirates

ISBN: (纸本)9783952426937

We consider the problem of solving a Laplacian system of equations Lx = b in a distributed fashion, where L is the Laplacian of the communication graph. Solving Laplacian systems arises in a number of applications including consensus, distributed control, clock synchronization, localization and calculating effective resistances, to name a few. We leverage our analysis on a randomized variant of Kaczmarz's algorithm to propose a distributed asynchronous gossip algorithm with expected exponential convergence. We quantify the convergence rate depending solely on properties of the network topology, and further propose an accelerated version that scales favorably for larger networks. Our approach naturally extends to least-squares estimation of general linear systems where each row/column is assigned to nodes of a given network. Last but not least, we show that average consensus is a special case in our framework.

关键词： gossip algorithms Laplacian systems Consensus Distributed algorithms Cyberphysical systems Randomized algorithms Clock synchronization

来源：评论

学校读者我要写书评

暂无评论

On Message Reachability of gossip algorithms in Degree-Biased Peer-to-Peer Networks 20

On Message Reachability of Gossip Algorithms in Degree-Biase...

引用

20th IEEE International Conference on Parallel and Distributed Systems (ICPADS)

作者： Yamamasu, Daisuke Hayashibara, Naohiro Kyoto Sangyo Univ Grad Sch Frontier Informat Kyoto 6038555 Japan Kyoto Sangyo Univ Fac Comp Sci & Engn Kyoto 6038555 Japan

ISBN: (纸本)9781479976157

In peer-to-peer networks, each node directly connects to other nodes without access points. This type of network system is useful for information sharing by using mobile devices (e.g., smart phones). On message delivery over the network, it is very difficult to assume the static routing if each node is assumed to move. In this paper, we suppose to use gossip-style epidemic message dissemination and show the performance evaluation of several gossip algorithms in terms of network topology. Specifically, we focus on the distribution of links in the network. Our results clarified the characteristics of those algorithms on the topologies that are biased the degree distribution locally.

关键词： gossip algorithms peer-to-peer network ad hoc network network topology degree distribution performance comparison

来源：评论

学校读者我要写书评

暂无评论

Broadcast gossip algorithms

Broadcast gossip algorithms

引用

IEEE Information Theory Workshop

作者： Aysal, Tuncer C. Yildiz, Mehmet E. Scaglione, Anna Cornell Univ Sch Elect & Comp Engn Ithaca NY 14853 USA

ISBN: (纸本)9781424422692

Motivated by applications to wireless sensor, peer-to-peer, and ad hoc networks, we study distributed broadcasting algorithms for exchanging information and for computing in an arbitrarily connected network of nodes. Specifically, we propose a broadcasting-based gossiping algorithm to compute the (possibly weighted) average of the initial measurements of the nodes at every node in the network. We show that the broadcast gossip algorithms almost surely converge to a consensus. In addition, the random consensus value is, in expectation, equal to the desired value, i.e., the average of initial node measurements. However, the broadcast gossip algorithms do not converge to the initial average in absolute sense because of the fact that the sum is not preserved at every iteration. We provide theoretical results on the mean square error performance of the broadcast gossip algorithms. The results indicate that the mean square error strictly decreases through iterations until the consensus is achieved. Finally, we assess and compare the communication cost of the broadcast gossip algorithms required to achieve a given distance to consensus through numerical simulations.

关键词： distributed average consensus broadcasting sensor networks gossip algorithms

来源：评论

学校读者我要写书评

暂无评论

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案：

请选择收藏分类：

通借通还

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：