Energy is often the most constrained resource for battery-powered wireless devices, and
most of the energy is often spent on transceiver usage (ie, transmitting and receiving …

We present randomized distributed algorithms for the maximal independent set problem
(MIS) that, while keeping the time complexity nearly matching the best known, reduce the …

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 …

We provide a deterministic scheme for solving any decidable problem in the distributed
{sleeping model}. The sleeping model is a generalization of the standard message-passing …

Recent work has shown that it is sometimes feasible to significantly reduce the energy
usage of some radio-network algorithms by adaptively powering down the radio receiver …

We study the distributed minimum spanning tree (MST) problem, a fundamental problem in
distributed computing. It is well-known that distributed MST can be solved in Õ (D+√ n) …

Maximal Independent Set (MIS) is one of the fundamental and most well-studied problems in
distributed graph algorithms. Even after four decades of intensive research, the best known …

In this paper, we present a low-diameter decomposition algorithm in the LOCAL model of
distributed computing that succeeds with probability 1− 1/poly (n). Specifically, we show how …

We consider networks of small, autonomous devices that communicate with each other
wirelessly. Minimizing energy usage is an important consideration in designing algorithms …

Maximal Independent Set (MIS) is one of the fundamental and most well-studied problems in
distributed graph algorithms. Even after four decades of intensive research, the best-known …