Labeling Schemes for Deterministic Radio Multi-Broadcast

  title={Labeling Schemes for Deterministic Radio Multi-Broadcast},
  author={Colin Krisko and Avery Miller},
We consider the multi-broadcast problem in arbitrary connected radio networks consisting of n nodes. There are k designated source nodes for some fixed k ∈ {1, . . . , n}, and each source node has a distinct piece of information that it wants to share with all nodes in the network. When k = 1, this is known as the broadcasting problem, and when k = n, this is known as the gossiping problem. We consider the feasibility of solving multi-broadcast deterministically in radio networks. It is known… 
1 Citations

Deterministic Size Discovery and Topology Recognition in Radio Networks with Short Labels

It turns out that the optimal length of labeling schemes for both problems depends on the maximum degree Δ of the graph, and it is proved that topology recognition in the class of arbitrary radio networks requires labeling schemes of length Ω(logΔ).



Constant-Length Labelling Schemes for Faster Deterministic Radio Broadcast

This paper shows that storing only a small constant number of additional bits, it is possible to broadcast significantly faster when the source eccentricity of the network is o(n), and defines a class of broadcast algorithms that includes both these algorithms and proves that any algorithm in this class requires Ω(√nD) rounds.

Deterministic Radio Broadcasting

Three new deterministic distributed algorithms are developed for broadcasting in radio networks: one node of the network knows a message that needs to be learned by all the remaining nodes, and one of these algorithms improves the performance for general networks running in time O(n3/2).

Distributed broadcast in radio networks of unknown topology

Constant-Length Labeling Schemes for Deterministic Radio Broadcast

Every radio network can be labeled using 2 bits in such a way that broadcast can be accomplished by some universal deterministic algorithm that does not know the network topology nor any bound on its size.

Efficient Distributed Communication in Ad-Hoc Radio Networks

For k = O(n), the results simultaneously decrease the complexity gaps for these four problems from polynomial to polylogarithmic in the size of the graph, and improves over the best previously known randomized algorithm of time O(k log n + n log2 n).

Optimal Deterministic Broadcasting in Known Topology Radio Networks

A deterministic polynomial algorithm is given which produces a broadcast scheme of length D, for every n-node graph of diameter D, thus improving a result of Gąsieniec et al. (PODC 2005) and solving a problem stated there.

Lower and upper bounds for deterministic convergecast with labeling schemes

This paper focuses on deterministic convergecast algorithms enhanced with labeling schemes, and proves that O(log(n) communication time slots is required, and provides solutions that are optimal in the worst case scenarios, in terms of labeling and communication.

Faster communication in known topology radio networks

A new (efficiently computable) deterministic schedule that uses 2D + Δlog n +-O(log3n) time units to complete the gossiping task in any radio network with size n, diameter D and max-degree Δ is proposed.

Time efficient centralized gossiping in radio networks

On Broadcasting in Radio Networks - Problem Analysis and Protocol Design

A polynomial time algorithm is proposed under which a channel is assigned to nodes from global, multiple-source broadcasting considerations, and it is shown that the problem of finding an optimal protocol is NP-hard.