Scribd
Upload
41 views2 pages

Distributed Algorithem

1) Distributed algorithms can handle large amounts of distributed data across networks without needing to send all data to a central processor, avoiding bottlenecks. 2) Common distributed algorithms include multilateration, where each sensor estimates its location using ranges to reference nodes, and successive refinement methods, where sensors iteratively update their estimates until convergence. 3) Bayesian networks provide another distributed method where each sensor stores a conditional density on its location based on its own measurements and neighbors' estimates. These distributed algorithms are important for applications without centralized references.

Uploaded by

Firas Rahimeh
Copyright
© © All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as DOCX, PDF, TXT or read online on Scribd
41 views2 pages

Distributed Algorithem

1) Distributed algorithms can handle large amounts of distributed data across networks without needing to send all data to a central processor, avoiding bottlenecks. 2) Common distributed algorithms include multilateration, where each sensor estimates its location using ranges to reference nodes, and successive refinement methods, where sensors iteratively update their estimates until convergence. 3) Bayesian networks provide another distributed method where each sensor stores a conditional density on its location based on its own measurements and neighbors' estimates. These distributed algorithms are important for applications without centralized references.

Uploaded by

Firas Rahimeh
Copyright
© © All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as DOCX, PDF, TXT or read online on Scribd
You are on page 1/ 2

Distributed algorithm database

Abstract

Nowadays, we are living in the midst of a data explosion and seeing a massive growth in
databases so with the wide availability of huge amounts of data; necessarily we are
become in need for turning this data into useful information and knowledge, where Data
mining uncovers interesting patterns and relationships hidden in a large volume of raw
data and big data is a new term used to identify the datasets that are of large size and have
grater complexity. The knowledge gained from data can be used for applications such as
market analysis, customer retention and production control. Data mining is a massive
computing task that deals with huge amount of stored data in a centralized or distributed
system to extract useful information or knowledge. In this paper, we will discuss
Distributed Data Mining systems, approaches, Techniques and algorithms to deal with
distributed data to discover knowledge from distributed data in an effective and efficient
way.

Distributed Algorithms

Distributed algorithms have two advantages. First, for some applications, no central
processor is available to handle the calculations. Second, when a large network must
forward all measurement data to a single central processor, there is a communication
bottleneck and higher energy drain at and near the central processor. Distributed
algorithms for cooperative localization generally fall into one of two schemes.

1- Classical multilateration: Each sensor estimates its multihop range to the nearest
land–reference nodes. These ranges can be estimated via the shortest path between
the node and reference nodes, that is, proportional to the number of hops or the
sum of measured ranges along the shortest path. Note that the shortest path
algorithm is already executed in a distributed manner across the network. When
each node has multiple range estimates to known positions, its coordinates are
calculated locally via multilateration.
2- Successive refinement: These algorithms try to find the optimum of a global cost
function (e.g., LS, WLS, or ML). Each node estimates its location and then
transmits that assertion to its neighbors . Neighbors must then recalculate their
location and transmit again, until convergence. A device starting without any
coordinates can begin with its own local coordinate system and later merge it with
neighboring coordinate systems . Typically, better statistical performance is
achieved by successive refinement compared to network multilateration, but
convergence issues must be addressed.

Bayesian networks provide another distributed successive refinement method to estimate


the probability density of sensor network parameters. These methods are particularly
promising for position localization. Here each node stores a conditional density on its
own coordinates based on its measurements and the conditional density of its neighbors.
These algorithms are important given the lack of infrastructure that provides beacons or
landmarks as references.

References :

1. Lynch, Nancy (2015). Distributed Algorithms


(https://archive.org/details/distributedalgor0000lyn

2. San Francisco, CA: Morgan Kaufmann Publishers. ISBN 978-1-55860-348-6.

3.Christian Cachin; Rachid Guerraoui; Luís Rodrigues (2011), Introduction to Reliable


and

Secure Distributed Programming (2. ed.), Springer, ISBN 978-3-642-15259-7

4. Rodríguez, M. Villagra and B. Barán, Asynchronous team algorithms for Boolean


Satisfiability (https://doi.org/10.1109%2FBIMNICS.2007.4610083), Bionetics2007, pp.
66–69,

2019.

You might also like

pFad - Phonifier reborn

Pfad - The Proxy pFad of © 2024 Garber Painting. All rights reserved.

Note: This service is not intended for secure transactions such as banking, social media, email, or purchasing. Use at your own risk. We assume no liability whatsoever for broken pages.


Alternative Proxies:

Alternative Proxy

pFad Proxy

pFad v3 Proxy

pFad v4 Proxy