Wake up and Join Me! an Energy-Efficient Algorithm for Maximal Matching in Radio Networks

  title={Wake up and Join Me! an Energy-Efficient Algorithm for Maximal Matching in Radio Networks},
  author={Varsha Dani and Aayush Gupta and Thomas P. Hayes and Seth Pettie},
We consider networks of small, autonomous devices that communicate with each other wirelessly. Minimizing energy usage is an important consideration in designing algorithms for such networks, as battery life is a crucial and limited resource. Working in a model where both sending and listening for messages deplete energy, we consider the problem of finding a maximal matching of the nodes in a radio network of arbitrary and unknown topology. We present a distributed randomized algorithm that… 

Figures from this paper

How to Wake Up Your Neighbors: Safe and Nearly Optimal Generic Energy Conservation in Radio Networks

This work presents a new general way to modify arbitrary radio-network algorithms in an attempt to save energy, and proves that it can provably reduce the energy usage to an extent that is provably nearly optimal within a certain class of general-purpose algorithms.

Sleeping is Superefficient: MIS in Exponentially Better Awake Complexity

The results show that an MIS in an awake complexity that is exponentially better compared to the best known round complexity of O (log n ) in the traditional model and bypassing its Ω ( cid:16)q log n loglog n (cid:17) lower bound.

The Energy Complexity of Las Vegas Leader Election

This work considers the time and energy complexities of randomized leader election in a multiple-access channel, where the number of devices n ≥ 2 is unknown.



The Energy Complexity of Broadcast

This paper investigates the energy complexity of fundamental communication primitives such as Broadcast in multi-hop radio networks, and shows that it is possible to achieve near optimality in time complexity with only poly logn energy cost.

Maximal independent sets in radio networks

The result shows that the harsh radio network model imposes merely an additional O(log n) factor compared to Luby's MIS algorithm in the message passing model, which has important implications in the context of ad hoc and sensor networks whose characteristics are closely captured by the radio network models.

The Energy Complexity of BFS in Radio Networks

It is proved that the landscape of energy complexity is rich enough to support a multitude of problem complexities, and BreadthFirstSearch has sub-polynomial energy complexity at most.

Energy-Efficient Size Approximation of Radio Networks with No Collision Detection

This work designs an efficient randomized algorithm for a single-hop radio network that approximately counts the number of its active stations and improves the previous O(log n) bound for energy.

Energy-Efficient Initialization Protocols for Single-Hop Radio Networks with No Collision Detection

This work proposes energy-efficient randomized initialization protocols for single-hop RNs lacking collision detection capabilities and shows that if the number n of stations is known beforehand, the single-channel RN can be initialized by a protocol that terminates, with probability exceeding 1-/sup 1///sub n/ in O(n) time slots, with no station being awake for more than O(log log n)Time slots.

Sleeping is Efficient: MIS in O(1)-rounds Node-averaged Awake Complexity

The main result is that MIS can be solved in (expected) O(1) rounds under node-averaged awake complexity measure in the sleeping model, and a randomized distributed algorithm for MIS is presented that has expected O( 1)-rounds node-aversed awake complexity and, with high probability, has O(log n) worst-case awake complexity.

Near-Optimal Time-Energy Trade-Offs for Deterministic Leader Election

This work shows that the optimal deterministic energy complexity of leader election is Θ(log log N) if each device can simultaneously transmit and listen, but still leaving the problem of determining the optimal time complexity under any given energy constraint.

Exponential Separations in the Energy Complexity of Leader Election

A new upper bound on the time-energy tradeoff curve for randomized algorithms is provided, which is a new deterministic Leader Election algorithm for dense instances, when n = Θ(N), with inverse Ackermann energy complexity.

Efficient algorithms for leader election in radio networks

A deterministic solution with sublogarithmic energy cost and a randomized algorithm with energy consumption O(log* n) that yields a result with high probability are presented and it is proved that this lower bound holds in a randomized case.