4,327 research outputs found
Faster Gossiping in Bidirectional Radio Networks with Large Labels
We consider unknown ad-hoc radio networks, when the underlying network is
bidirectional and nodes can have polynomially large labels. For this model, we
present a deterministic protocol for gossiping which takes rounds. This improves upon the previous best result for deterministic
gossiping for this model by [Gasienec, Potapov, Pagourtizis, Deterministic
Gossiping in Radio Networks with Large labels, ESA (2002)], who present a
protocol of round complexity for this problem. This
resolves open problem posed in [Gasienec, Efficient gossiping in radio
networks, SIROCCO (2009)], who cite bridging gap between lower and upper bounds
for this problem as an important objective. We emphasize that a salient feature
of our protocol is its simplicity, especially with respect to the previous best
known protocol for this problem
Latency Optimal Broadcasting in Noisy Wireless Mesh Networks
In this paper, we adopt a new noisy wireless network model introduced very
recently by Censor-Hillel et al. in [ACM PODC 2017, CHHZ17]. More specifically,
for a given noise parameter any sender has a probability of
of transmitting noise or any receiver of a single transmission in its
neighborhood has a probability of receiving noise.
In this paper, we first propose a new asymptotically latency-optimal
approximation algorithm (under faultless model) that can complete
single-message broadcasting task in time units/rounds in any
WMN of size and diameter . We then show this diameter-linear
broadcasting algorithm remains robust under the noisy wireless network model
and also improves the currently best known result in CHHZ17 by a
factor.
In this paper, we also further extend our robust single-message broadcasting
algorithm to multi-message broadcasting scenario and show it can broadcast
messages in time rounds. This new robust
multi-message broadcasting scheme is not only asymptotically optimal but also
answers affirmatively the problem left open in CHHZ17 on the existence of an
algorithm that is robust to sender and receiver faults and can broadcast
messages in time rounds.Comment: arXiv admin note: text overlap with arXiv:1705.07369 by other author
Message and time efficient multi-broadcast schemes
We consider message and time efficient broadcasting and multi-broadcasting in
wireless ad-hoc networks, where a subset of nodes, each with a unique rumor,
wish to broadcast their rumors to all destinations while minimizing the total
number of transmissions and total time until all rumors arrive to their
destination. Under centralized settings, we introduce a novel approximation
algorithm that provides almost optimal results with respect to the number of
transmissions and total time, separately. Later on, we show how to efficiently
implement this algorithm under distributed settings, where the nodes have only
local information about their surroundings. In addition, we show multiple
approximation techniques based on the network collision detection capabilities
and explain how to calibrate the algorithms' parameters to produce optimal
results for time and messages.Comment: In Proceedings FOMC 2013, arXiv:1310.459
Deterministic Communication in Radio Networks
In this paper we improve the deterministic complexity of two fundamental
communication primitives in the classical model of ad-hoc radio networks with
unknown topology: broadcasting and wake-up. We consider an unknown radio
network, in which all nodes have no prior knowledge about network topology, and
know only the size of the network , the maximum in-degree of any node
, and the eccentricity of the network .
For such networks, we first give an algorithm for wake-up, based on the
existence of small universal synchronizers. This algorithm runs in
time, the
fastest known in both directed and undirected networks, improving over the
previous best -time result across all ranges of parameters, but
particularly when maximum in-degree is small.
Next, we introduce a new combinatorial framework of block synchronizers and
prove the existence of such objects of low size. Using this framework, we
design a new deterministic algorithm for the fundamental problem of
broadcasting, running in time. This is
the fastest known algorithm for the problem in directed networks, improving
upon the -time algorithm of De Marco (2010) and the
-time algorithm due to Czumaj and Rytter (2003). It is also the
first to come within a log-logarithmic factor of the lower
bound due to Clementi et al.\ (2003).
Our results also have direct implications on the fastest \emph{deterministic
leader election} and \emph{clock synchronization} algorithms in both directed
and undirected radio networks, tasks which are commonly used as building blocks
for more complex procedures
- β¦