ML p(r)ior | Distributed Online Data Aggregation in Dynamic Graphs

Distributed Online Data Aggregation in Dynamic Graphs

2016-02-02
1602.01065 | cs.DC

Highlights - Most important sentences from the article

Related Articles

2018-11-28
1811.11331 | cs.NI

We consider ad-hoc networks consisting of $n$ wireless nodes that are located on the plane. Any two … show more

Highlights - Most important sentences from the article

2018-12-01
1812.00134 | cs.DS

In this paper we introduce the \emph{semi-online} model that generalizes the classical online comput… show more

Highlights - Most important sentences from the article

2018-11-05
1811.01643 | cs.DC

A graph is weakly $2$-colored if the nodes are labeled with colors black and white such that each bl… show more

Highlights - Most important sentences from the article

2018-05-18
1805.07294 | cs.DC

In this paper, we study distributed graph algorithms in networks in which the nodes have a limited c… show more

Highlights - Most important sentences from the article

2015-10-26
1510.07357 | cs.DC

We consider wireless networks with the SINR model of interference when nodes have very limited indiv… show more

Highlights - Most important sentences from the article

2016-05-06
1605.01903 | cs.DC

Leader election is, together with consensus, one of the most central problems in distributed computi… show more

Highlights - Most important sentences from the article

2018-09-02
1809.00273 | cs.DC

This paper focuses on studying the message complexity of implicit leader election in synchronous dis… show more

Highlights - Most important sentences from the article

2019-01-02
1901.00342 | cs.DC

In this paper, we look at the problem of randomized leader election in synchronous distributed netwo… show more

Highlights - Most important sentences from the article

2016-11-19
1611.06343 | cs.DC

Consider the classical problem of information dissemination: one (or more) nodes in a network have s… show more

Highlights - Most important sentences from the article

2016-07-11
1607.02951 | cs.DC

We consider networks of processes which interact with beeps. In the basic model defined by Cornejo a… show more

Highlights - Most important sentences from the article

2018-09-10
1809.03141 | cs.CC

The diffusion of information has been widely modeled as stochastic diffusion processes on networks. … show more

Highlights - Most important sentences from the article

2014-04-09
1404.2387 | cs.NI

We introduce collision free layerings as a powerful way to structure radio networks. These layerings… show more

Highlights - Most important sentences from the article

2012-07-08
1207.1836 | cs.NI

We consider the local broadcasting problem in the SINR model, which is a basic primitive for gatheri… show more

Highlights - Most important sentences from the article

2013-02-15
1302.3828 | cs.DM

Randomized gossip is one of the most popular way of disseminating information in large scale network… show more

Highlights - Most important sentences from the article

2013-08-13
1308.2954 | cs.DS

The network inference problem consists of reconstructing the edge set of a network given traces repr… show more

Highlights - Most important sentences from the article

2013-07-05
1307.1690 | cs.DS