Energy-Efficient Leader Election Protocols for Single-Hop Radio Networks

Kardas, Marcin; Klonowski, Marek; Pająk, Dominik

doi:10.1109/icpp.2013.49

Cited by 22 publications

(9 citation statements)

References 17 publications

(19 reference statements)

Supporting

Mentioning

Contrasting

Order By: Relevance

“…For wireless radio networks (or equivalent/similar models) it has been described in many notable papers including [2,25,24,27,36,20]. In [17] authors discuss leader election in the context of energy consumption. A survey of classic leader election protocols for radio networks can be found in [26] or in Chapter 8 of [15].…”

Section: Related and Previous Workmentioning

confidence: 97%

Electing a Leader in Wireless Networks Quickly Despite Jamming

Klonowski

Pająk

2015

Proceedings of the 27th ACM Symposium on Parallelism in Algorithms and Architectures

Self Cite

View full text Add to dashboard Cite

In this paper we present a fast leader election protocol for single-hop wireless networks, provably robust against jamming by an external and powerful adversary. A (T, 1 − ε)-bounded adversary can jam at most (1 − ε)w out of any w ≥ T contiguous time slots, for 0 < ε < 1. The network consists of n stations that do not have knowledge of any global parameter n, T, ε. Each station can transmit or listen to the common communication channel. In each slot, all listeners are notified in which of the three states the communication channel is in the current slot: no transmitters, exactly one transmitter or at least two transmitters. To the listening stations, a jammed slot is indistinguishable from the case of at least two transmitters.Our protocol elects a leader, with high probability, in the presence of an arbitrary, adaptive (T, 1 − ε)-adversary. For any constant ε and T = O (log n), the protocol works in optimal time O (log n). The protocol also works for general T and ε in O log log(1/ε) ε 3 log n slots if T ≤ log n ε 3 log(1/ε) and O max log log T ε log n , log (1/ε) log log (1/ε) T otherwise.

show abstract

Section: Related and Previous Workmentioning

confidence: 97%

Electing a Leader in Wireless Networks Quickly Despite Jamming

Klonowski

Pająk

2015

Proceedings of the 27th ACM Symposium on Parallelism in Algorithms and Architectures

Self Cite

View full text Add to dashboard Cite

show abstract

“…See also [21,20,22,23,24]. Three-way tradeoffs between time, energy, and error probability were studied by Chang et al [11] and Kardas et al [27].…”

Section: The Modelmentioning

confidence: 99%

The Energy Complexity of BFS in Radio Networks

Chang

Dani²,

Hayes³

et al. 2020

Preprint

View full text Add to dashboard Cite

We consider a model of energy complexity in Radio Networks in which transmitting or listening on the channel costs one unit of energy and computation is free. This simplified model captures key aspects of battery-powered sensors: that battery-life is most influenced by transceiver usage, and that at low transmission powers, the actual cost of transmitting and listening are very similar.The energy complexity of tasks in single-hop (clique) networks are well understood [11,35,6,22]. Recent work of Chang et al. [10] considered energy complexity in multi-hop networks and showed that Broadcast admits an energy-efficient protocol, by which we mean each of the n nodes in the network spends O(polylog(n)) energy. This work left open the strange possibility that all natural problems in multi-hop networks might admit such an energy-efficient solution.In this paper we prove that the landscape of energy complexity is rich enough to support a multitude of problem complexities. Whereas Broadcast can be solved by an energy-efficient protocol, exact computation of Diameter cannot, requiring Ω(n) energy. Our main result is that BreadthFirstSearch has sub-polynomial energy complexity at most 2 O( √ log n log log n) = n o(1) ; whether it admits an efficient O(polylog(n))-energy protocol is an open problem.Our main algorithm involves recursively solving a generalized BFS problem on a "cluster graph" introduced by Miller, Peng, and Xu [34]. In this application, we make crucial use of a close relationship between distances in this cluster graph, and distances in the original network. This relationship is new and may be of independent interest.We also consider the problem of approximating the network Diameter. From our main result, it is immediate that Diameter can be 2-approximated using n o(1) energy per node. We observe that, for all ǫ > 0, approximating Diameter to within a (2 − ǫ) factor requires Ω(n) energy per node. However, this lower bound is only due to graphs of very small diameter; for large-diameter graphs, we prove that the diameter can be nearly 3/2-approximated using O(n 1/2+o(1) ) energy per node.

show abstract

“…Bender, Kopelowitz, Pettie, and Young [6] gave a randomized method for circuit-simulation in the CD model, which led to algorithms for LeaderElection and ApproximateCounting using O(log(log * n)) energy and n o (1) time, w.h.p. An earlier algorithm of Kardas et al [22] solves the problem in O(log n) time using O(log log log n) energy, but only in expectation. Chang et al [7] proved that for these problems, Θ(log(log * n)) and Θ(log * n) energy are optimal in CD and No-CD, respectively, for poly(n)-time algorithms.…”

Section: Related Workmentioning

confidence: 99%

“…Our Contribution. Previous work on energy complexity has focussed on fundamental problems in single-hop (clique) networks like LeaderElection and ApproximateCounting 3 [6,7,18,19,21,20,22,29], where it is typical to assume that n is unknown. In this paper we consider fundamental problems in arbitrary multi-hop network topologies, primarily Broadcast.…”

Section: Introductionmentioning

confidence: 99%

The Energy Complexity of Broadcast

Chang

Dani

Hayes

et al. 2018

Proceedings of the 2018 ACM Symposium on Principles of Distributed Computing

View full text Add to dashboard Cite

Energy is often the most constrained resource in networks of battery-powered devices, and as devices become smaller, they spend a larger fraction of their energy on communication (transceiver usage) not computation. As an imperfect proxy for true energy usage, we define energy complexity to be the number of time slots a device transmits/listens; idle time and computation are free.In this paper we investigate the energy complexity of fundamental communication primitives such as Broadcast in multi-hop radio networks. We consider models with collision detection (CD) and without (No-CD), as well as both randomized and deterministic algorithms. Some take-away messages from this work include:• The energy complexity of Broadcast in a multi-hop network is intimately connected to the time complexity of LeaderElection in a single-hop (clique) network. Many existing lower bounds on time complexity immediately transfer to energy complexity. For example, in the CD and No-CD models, we need Ω(log n) and Ω(log 2 n) energy, respectively.• The energy lower bounds above can almost be achieved, given sufficient (Ω(n)) time. In the CD and No-CD models we can solve Broadcast using O( log n log log n log log log n ) energy and O(log 3 n) energy, respectively. • The complexity measures of Energy and Time are in conflict, and it is an open problem whether both can be minimized simultaneously. We give a tradeoff showing it is possible to be nearly optimal in both measures simultaneously. For any constant > 0, Broadcast can be solved in O(D 1+ log O(1/ ) n) time with O(log O(1/ ) n) energy, where D is the diameter of the network.

show abstract

Energy-Efficient Leader Election Protocols for Single-Hop Radio Networks

Cited by 22 publications

References 17 publications

Electing a Leader in Wireless Networks Quickly Despite Jamming

Electing a Leader in Wireless Networks Quickly Despite Jamming

The Energy Complexity of BFS in Radio Networks

The Energy Complexity of Broadcast

Contact Info

Product

Resources

About