scispace - formally typeset
Search or ask a question
Topic

Distributed algorithm

About: Distributed algorithm is a research topic. Over the lifetime, 20416 publications have been published within this topic receiving 548109 citations.


Papers
More filters
Proceedings ArticleDOI
03 Oct 1999
TL;DR: An algorithm is proposed that guarantees delivery to highly mobile agents using a technique similar to a distributed snapshot, and the very structure of the algorithm makes it amenable not only to guarantee message delivery to a specific mobile agent, but also to provide multicast communication to a group of agents.
Abstract: The provision of a reliable communication infrastructure for mobile agents is still an open research issue. The challenge to reliability we address in this work does not come from the possibility of faults, but rather from the mere presence of mobility, which slightly complicates the problem of ensuring the delivery of information, even in a fault-free network. For instance, the asynchronous nature of message passing and agent migration may cause situations where messages forever chase a mobile agent that moves frequently from one host to another. Current solutions rely on conventional technologies that either do not provide a solution for the aforementioned problem, because they were not designed with mobility in mind, or enforce continuous connectivity with the message source, which in many cases defeats the very purpose of using mobile agents. In this paper, we propose an algorithm that guarantees delivery to highly mobile agents using a technique that is similar to a distributed snapshot. A number of enhancements to this basic idea are discussed, which limit the scope of message delivery by allowing dynamic creation of the connectivity graph. Notably, the very structure of our algorithm makes it amenable not only to guarantee message delivery to a given mobile agent, but also to provide multicast communication to a group of agents-another open problem in research on mobile agents. After presenting our algorithm and its properties, we discuss its implementability by analyzing the requirements on the underlying mobile agent platform, and we argue about its applicability.

123 citations

Journal ArticleDOI
TL;DR: This paper shows strong unconditional lower bounds on the time-approximation trade-off of the distributed minimum spanning tree problem, and shows some of its variants.
Abstract: The design of distributed approximation protocols is a relatively new and rapidly developing area of research. However, so far, little progress has been made in the study of the hardness of distributed approximation. In this paper we initiate the systematic study of this subject and show strong unconditional lower bounds on the time-approximation trade-off of the distributed minimum spanning tree problem, and show some of its variants.

123 citations

Proceedings ArticleDOI
24 Apr 2005
TL;DR: This paper presents and analyze a suite of randomized distributed algorithms to efficiently and robustly compute aggregates and uses the eigen-structure of the underlying graph in a novel way to show convergence and to bound the running time of the algorithms.
Abstract: A wireless sensor network consists of a large number of small, resource-constrained devices and usually operates in hostile environments that are prone to link and node failures. Computing aggregates such as average, minimum, maximum and sum is fundamental to various primitive functions of a sensor network like system monitoring, data querying, and collaborative information processing. In this paper we present and analyze a suite of randomized distributed algorithms to efficiently and robustly compute aggregates. Our distributed random grouping (DRG) algorithm is simple and natural and uses probabilistic grouping to progressively converge to the aggregate value. DRG is local and randomized and is naturally robust against dynamic topology changes from link/node failures. Although our algorithm is natural and simple, it is nontrivial to show that it converges to the correct aggregate value and to bound the time needed for convergence. Our analysis uses the eigen-structure of the underlying graph in a novel way to show convergence and to bound the running time of our algorithms. We also present simulation results of our algorithm and compare its performance to various other known distributed algorithms. Simulations show that DRG needs much less transmissions than other distributed localized schemes, namely gossip and broadcast flooding.

122 citations

Book
01 Feb 1988
TL;DR: This book attempts to provide a clear, practical and up-to-date guide to distributed algoriths and protocols in the area of control and describes the algorithms to solve it.
Abstract: The use of distributed algorithms offers the prospect of great advances in computing speed. This book attempts to provide a clear, practical and up-to-date guide to distributed algoriths and protocols in the area of control. The first chapter lays the foundations; subsequent chapters, which can be studied independently of each other, consider different aspects of control. Each chapter consists of an analysis of the problem, followed by descriptions of the algorithms to solve it, with proofs of correctness. The book will be of use for undergraduate and graduate students in computer science, and also researchers and software engineers.

122 citations

Journal ArticleDOI
TL;DR: This paper proposes and analyze the performance of two schemes: a distributed nearest neighbor relay assignment in which users can act as relays, and an infrastructure-based relay-assignment protocol in which fixed relay nodes are deployed in the network to help the users forward their data.
Abstract: One important application of cooperative communications is to extend coverage area in wireless networks without increasing infrastructure. However, a crucial challenge in implementing cooperation protocols is how to select relay-source pairs. In this paper, we address this problem based on the knowledge of the users' spatial distribution which determines the channel statistics. We consider two scenarios at the destination node, when the receiver uses MRC and when no-MRC is used. First, we characterize the optimal relay location to minimize the outage probability. Then, we propose and analyze the performance of two schemes: a distributed nearest neighbor relay assignment in which users can act as relays, and an infrastructure-based relay-assignment protocol in which fixed relay nodes are deployed in the network to help the users forward their data. The outage probabilities of these two schemes are derived. We also derive universal lower bounds on the performance of relay-assignment protocols to serve as a benchmark for our proposed protocols. Numerical results reveal significant gains when applying the proposed simple distributed algorithms over direct transmission in terms of coverage area, transmit power, and spectral efficiency. At 1 percent outage probability, more than 200 percent increase in coverage area can be achieved, 7 dBW savings in the transmitted power, and the system can operate at 2 b/s/Hz higher spectral efficiency.

122 citations


Network Information
Related Topics (5)
Server
79.5K papers, 1.4M citations
94% related
Scheduling (computing)
78.6K papers, 1.3M citations
91% related
Network packet
159.7K papers, 2.2M citations
91% related
Wireless network
122.5K papers, 2.1M citations
91% related
Wireless sensor network
142K papers, 2.4M citations
89% related
Performance
Metrics
No. of papers in the topic in previous years
YearPapers
202381
2022135
2021583
2020759
2019876
2018845