Search
Now showing items 1-5 of 5
Distributed House-Hunting in Ant Colonies
(Association for Computing Machinery (ACM), 2015-07)
We introduce the study of the ant colony house-hunting problem from a distributed computing perspective. When an ant colony's nest becomes unsuitable due to size constraints or damage, the colony relocates to a new nest. ...
The cost of radio network broadcast for different models of unreliable links
(Association for Computing Machinery, 2013-07)
We study upper and lower bounds for the global and local broadcast problems in the dual graph model combined with different strength adversaries. The dual graph model is a generalization of the standard graph-based radio ...
Bounds on Contention Management in Radio Networks
(Springer-Verlag, 2012)
The local broadcast problem assumes that processes in a wireless network are provided messages, one by one, that must be delivered to their neighbors. In this paper, we prove tight bounds for this problem in two well-studied ...
Multi-message broadcast with abstract MAC layers and unreliable links
(Association for Computing Machinery (ACM), 2014-07)
We study the multi-message broadcast problem using abstract MAC layer models of wireless networks. These models capture the key guarantees of existing MAC layers while abstracting away low-level details such as signal ...
Leader election using loneliness detection
(Springer-Verlag, 2012-06-26)
We consider the problem of leader election (LE) in single-hop radio networks with synchronized time slots for transmitting and receiving messages. We assume that the actual number n of processes is unknown, while the size ...