Anzeige
Erschienen in:
2014 | OriginalPaper | Buchkapitel
Approximate Local Sums and Their Applications in Radio Networks
verfasst von : Zhiyu Liu, Maurice Herlihy
Erschienen in: Distributed Computing
Verlag: Springer Berlin Heidelberg
Aktivieren Sie unsere intelligente Suche, um passende Fachinhalte oder Patente zu finden.
Wählen Sie Textabschnitte aus um mit Künstlicher Intelligenz passenden Patente zu finden. powered by
Markieren Sie Textabschnitte, um KI-gestützt weitere passende Inhalte zu finden. powered by
Although any problem in a radio network can be solved using broadcast algorithms, some problems can be solved substantially more efficiently by more specialized algorithms. This paper presents two new approximate algorithms for the
local sum
problem, in which each node computes a (1±
ε
)-approximation to the sum of the values held by its incoming neighbors (nodes that have outgoing edges to the node). We propose algorithms both with and without collision detection, as well as for the beeping model, with round complexity
$O({\log^{2} n + \log n\log m \over \epsilon^2})$
, where
n
is the number of nodes and the value held by each node is a real number in {0} ∪ [1,
m
]. We then show how these algorithms can be used as building blocks to construct applications such as approximate random walk distribution, PageRank, and global sum.