Sciweavers

DC
2008
13 years 11 months ago
Contention-free MAC protocols for asynchronous wireless sensor networks
A MAC protocol specifies how nodes in a sensor network access a shared communication channel. Desired properties of a MAC protocol are: it should be contention-free (avoid collisio...
Costas Busch, Malik Magdon-Ismail, Fikret Sivrikay...
DC
2008
14 years 8 days ago
Fast computation by population protocols with a leader
Fast algorithms are presented for performing computations in a probabilistic population model. This is a variant of the standard population protocol model--in which finite-state ag...
Dana Angluin, James Aspnes, David Eisenstat
DC
2008
14 years 8 days ago
On implementing omega in systems with weak reliability and synchrony assumptions
We study the feasibility and cost of implementing --a fundamental failure detector at the core of many algorithms--in systems with weak reliability and synchrony assumptions. Intui...
Marcos Kawazoe Aguilera, Carole Delporte-Gallet, H...
DC
2008
14 years 8 days ago
Checking sequences for distributed test architectures
This study addresses the construction of a preset checking sequence that will not pose controllability (synchronization) and observability (undetectable output shift) problems whe...
Robert M. Hierons, Hasan Ural
DC
2008
14 years 8 days ago
Consensus and collision detectors in radio networks
Gregory Chockler, Murat Demirbas, Seth Gilbert, Na...
DC
2008
14 years 8 days ago
Approximate distributed top- k queries
We consider a distributed system where each node keeps a local count for items (similar to elections where nodes are ballot boxes and items are candidates). A top-k query in such ...
Boaz Patt-Shamir, Allon Shafrir
DC
2008
14 years 8 days ago
Solo-valency and the cost of coordination
This paper introduces solo-valency, a variation on the valency proof technique originated by Fischer, Lynch, and Paterson. The new technique focuses on critical events that influe...
Danny Hendler, Nir Shavit
DC
2008
14 years 8 days ago
The weakest failure detectors to boost obstruction-freedom
This paper determines necessary and sufficient conditions to implement wait-free and non-blocking contention managers in a shared memory system. The necessary conditions hold even...
Rachid Guerraoui, Michal Kapalka, Petr Kouznetsov