Sciweavers

242 search results - page 44 / 49
» Deterministic small-world communication networks
Sort
View
ICDCN
2009
Springer
15 years 4 months ago
Byzantine-Resilient Convergence in Oblivious Robot Networks
Given a set of robots with arbitrary initial location and no agreement on a global coordinate system, convergence requires that all robots asymptotically approach the exact same, ...
Zohir Bouzid, Maria Gradinariu Potop-Butucaru, S&e...
SRDS
2010
IEEE
14 years 7 months ago
Crash-Tolerant Collision-Free Data Aggregation Scheduling for Wireless Sensor Networks
Data aggregation scheduling, or convergecast, is a fundamental pattern of communication in wireless sensor networks (WSNs), where sensor nodes aggregate and relay data to a sink no...
Arshad Jhumka
GLOBECOM
2008
IEEE
15 years 4 months ago
Aerial Platform Placement Algorithm to Satisfy Connectivity and Capacity Constraints in Wireless Ad-Hoc Networks
—In this paper, we address the problem of establishing full connectivity and satisfying required traffic capacity between disconnected clusters in large wireless ad-hoc ground n...
Senni Perumal, John S. Baras
SIGMETRICS
2009
ACM
182views Hardware» more  SIGMETRICS 2009»
15 years 4 months ago
The age of gossip: spatial mean field regime
Disseminating a piece of information, or updates for a piece of information, has been shown to benefit greatly from simple randomized procedures, sometimes referred to as gossipi...
Augustin Chaintreau, Jean-Yves Le Boudec, Nikodin ...
SIGMOD
2009
ACM
175views Database» more  SIGMOD 2009»
15 years 9 months ago
Ranking distributed probabilistic data
Ranking queries are essential tools to process large amounts of probabilistic data that encode exponentially many possible deterministic instances. In many applications where unce...
Feifei Li, Ke Yi, Jeffrey Jestes