Near Optimal Leader Election in Multi-Hop Radio Networks

@inproceedings{Ghaffari2013NearOL,
  title={Near Optimal Leader Election in Multi-Hop Radio Networks},
  author={Mohsen Ghaffari and Bernhard Haeupler},
  booktitle={SODA},
  year={2013}
}
We design leader election protocols for multi-hop radio networks that elect a leader in almost the same time TBC that it takes for broadcasting one message (one ID). For the setting without collision detection our algorithm runs whp. in O(D log n/D + log3 n) · min{log log n, log n/D} rounds on any n-node network with diameter D. Since TBC = Θ(D log n/D + log2 n) is a lower bound, our upper bound is optimal up to a factor of at most log log n and the extra log n factor on the additive term. Our… 

Figures from this paper

Leader Election on Multi-hop Networks with No Collision Detection
  • Computer Science
  • 2020
TLDR
Given an undirected multi-hop radio network without collision detection of size n and diameter D, this paper designs an algorithm electing a leader in almost optimal O(D log (n/D) + log n) time slots with a probability of at least 1−O(1/ log n).
Brief Announcement: Optimal Leader Election in Multi-Hop Radio Networks
TLDR
An algorithm which operates on undirected radio networks with collision detection and elects a leader in O(D + log n) expected time is presented, which is the fastest leader election algorithm to achieve a high-probability bound therein.
Exploiting Spontaneous Transmissions for Broadcasting and Leader Election in Radio Networks
TLDR
A new and faster algorithm is given that completes broadcasting in O(D log n/log D + logO(1) n) time, succeeding with high probability and yields the first optimal O( D)-time broadcasting algorithm whenever n is polynomial in D.
Exploiting Spontaneous Transmissions for Broadcasting and Leader Election in Radio Networks
TLDR
A new and faster algorithm is given that completes broadcasting in O(D(log n)/(log D) + logO(1)n) time, with high probability, which yields the first optimal O( D)-time broadcasting algorithm whenever D is polynomial in n.
Beeping a Deterministic Time-Optimal Leader Election
TLDR
This work solves the leader election problem with an asymptotically optimal round complexity of O(D+logn), for a network of unknown size n and unknown diameter D, and proposes a deterministic leader election algorithm for anonymous networks.
Leader election with constant energy complexity Ny
TLDR
This paper designs randomized leader election algorithm with poly-logarithmic time complexity, log-high probability of success and constant energy complexity, which holds even as all nodes are aware of a polynomial upper bound of n.
Randomized broadcast in radio networks with collision detection
TLDR
A randomized distributed algorithm that in radio networks with collision detection broadcasts a single message in O(D + klog n + \log ^6 n) rounds, with high probability, which is optimal modulo the additive O(log6n) term.
Transmitting once to Elect a Leader on Wireless Networks
TLDR
The energy complexity of leader election is focused on, a fundamental problem in distributed computing where the size of messages can impact on the energy consumption, and it is highlighted that algorithms have almost optimal time complexities.
...
1
2
3
4
5
...

References

SHOWING 1-10 OF 58 REFERENCES
Uniform leader election protocols for radio networks
  • K. Nakano, S. Olariu
  • Computer Science
    International Conference on Parallel Processing, 2001.
  • 2001
TLDR
A uniform leader election protocol that terminates, with probability exceeding 1-1/f for every f/spl ges/1, in log log n+o(log log n)+O(log f) time slots is proposed and simulation results show that the leader election outperforms Willard's protocol in practice.
Electing a Leader in Multi-hop Radio Networks
TLDR
This work considers the task of electing a leader in a distributed manner in ad hoc multi-hop radio networks, and shows how to perform gossiping with combined messages in \(\mathcal{O}(n\log^{3/2} n \sqrt{\log\log n})\) time by a deterministic algorithm, and in expected time by an randomized algorithm.
Broadcasting algorithms in radio networks with unknown topology
On the time-complexity of broadcast in radio networks: an exponential gap between determinism randomization
TLDR
It is shown that any deterministic broadcast protocol requires 8(n) time-slots, even if the network has diameter 3, and n is known to all processors, which demonstrates an exponential gap in complexity between randomization and determinism.
Leader election in ad hoc radio networks: A keen ear helps
Multiple Communication in Multihop Radio Networks
Two tasks of communication in a multihop synchronous radio network are considered: Point-to-point communication and broadcast (sending a message to all nodes of a network). Efficient protocols for
Gossiping with Bounded Size Messages in ad hoc Radio Networks
We study deterministic algorithms for the gossiping problem in ad hoc radio networks under the assumption that each combined message contains at most b(n) single messages or bits of auxiliary
Multiple communication in multi-hop radio networks
Two tasks of communication in a multi-hop synchronous radio network are considered: point-to-point communication and broadcast (sending a message to all nodes of a network). Efficient protocols for
Randomized broadcast in radio networks with collision detection
TLDR
A randomized distributed algorithm that in radio networks with collision detection broadcasts a single message in O(D + klog n + \log ^6 n) rounds, with high probability, which is optimal modulo the additive O(log6n) term.
Faster communication in known topology radio networks
TLDR
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.
...
1
2
3
4
5
...