Sciweavers

242 search results - page 24 / 49
» Deterministic small-world communication networks
Sort
View
WDAG
2007
Springer
92views Algorithms» more  WDAG 2007»
15 years 5 months ago
Self-stabilizing Counting in Mobile Sensor Networks with a Base Station
Abstract. Distributed computing must adapt its techniques to networks of mobile agents. Indeed, we are facing new problems like the small size of memory and the lack of computation...
Joffroy Beauquier, Julien Clement, Stéphane...
GLOBECOM
2007
IEEE
15 years 6 months ago
Probe Station Placement for Fault Diagnosis
— Probe stations are specially instrumented nodes from where probes can be sent to monitor the network. Probe station locations affect probing efficiency, monitoring capability,...
Maitreya Natu, Adarshpal S. Sethi
DC
2006
14 years 11 months ago
Performing work in broadcast networks
We consider the problem of how to schedule t similar and independent tasks to be performed in a synchronous distributed system of p stations communicating via multiple-access chan...
Bogdan S. Chlebus, Dariusz R. Kowalski, Andrzej Li...
INFOCOM
2011
IEEE
14 years 3 months ago
The resilience of WDM networks to probabilistic geographical failures
—Telecommunications networks, and in particular optical WDM networks, are vulnerable to large-scale failures of their physical infrastructure, resulting from physical attacks (su...
Pankaj K. Agarwal, Alon Efrat, Shashidhara K. Ganj...
STOC
2001
ACM
104views Algorithms» more  STOC 2001»
16 years 2 days ago
Spatial gossip and resource location protocols
The dynamic behavior of a network in which information is changing continuously over time requires robust and efficient mechanisms for keeping nodes updated about new information. ...
David Kempe, Jon M. Kleinberg, Alan J. Demers