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 …

Computing a Maximal Independent Set (MIS) is a central problem in distributed graph
algorithms. This paper presents an improved randomized distributed algorithm for …

We present a randomized distributed algorithm that in radio networks with collision detection
broadcasts a single message in O (D+ log6 n) rounds, with high probability. This time …

Energy is often the most constrained resource in networks of batterypowered devices, and
as devices become smaller, they spend a larger fraction of their energy on communication …

Bee** models are models for networks of weak devices, such as sensor networks or
biological networks. In these networks, nodes are allowed to communicate only via emitting …

The bee** model is an extremely restrictive broadcast communication model that relies
only on carrier sensing. In this model, we solve the leader election problem with an …

We study deterministic leader election in multi-hop radio networks in the bee** model.
More specifically, we address explicit leader election: One node is elected as the leader, the …

We consider a communication channel in which the only available mode of communication
is transmitting beeps. A beep transmitted by a station attached to the channel reaches all the …

We propose the first stationary and deterministic protocol for the leader election problem for
non-simply connected particle systems in the geometric Amoebot model in which particles …

The beep model is a very weak communications model in which devices in a network can
communicate only via beeps and silence. As a result of its weak assumptions, it has broad …