34,651 research outputs found
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
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
- …