Search
Now showing items 1-6 of 6
Trade-offs between selection complexity and performance when searching the plane without communication
(Association for Computing Machinery (ACM), 2014-07)
We argue that in the context of biology-inspired problems in computer science, in addition to studying the time complexity of solutions it is also important to study the selection complexity, a measure of how likely a given ...
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 ...
Engineering the Virtual Node Layer for Reactive MANET Routing
(2011-08)
The VNLayer approach simplifies software development for MANET by providing the developers an abstraction of a network divided into fixed geographical regions, each containing a virtual server for network services. In this ...
A (Truly) Local Broadcast Layer for Unreliable Radio Networks
(Association for Computing Machinery (ACM), 2015-07)
In this paper, we implement an efficient local broadcast service for the dual graph model, which describes communication in a radio network with both reliable and unreliable links. Our local broadcast service offers ...