Sciweavers

862 search results - page 128 / 173
» Random Information Spread in Networks
Sort
View
CORR
2010
Springer
177views Education» more  CORR 2010»
14 years 8 months ago
AntiJam: Efficient Medium Access despite Adaptive and Reactive Jamming
Abstract--Intentional interference constitutes a major threat for communication networks operating over a shared medium where availability is imperative. Jamming attacks are often ...
Andréa W. Richa, Christian Scheideler, Stef...
WWW
2011
ACM
14 years 6 months ago
Counting triangles and the curse of the last reducer
The clustering coefficient of a node in a social network is a fundamental measure that quantifies how tightly-knit the community is around the node. Its computation can be reduce...
Siddharth Suri, Sergei Vassilvitskii
ADHOC
2005
143views more  ADHOC 2005»
14 years 11 months ago
Active query forwarding in sensor networks
While sensor networks are going to be deployed in diverse application specific contexts, one unifying view is to treat them essentially as distributed databases. The simplest mech...
Narayanan Sadagopan, Bhaskar Krishnamachari, Ahmed...
CISS
2007
IEEE
15 years 6 months ago
Collector Receiver Design for Data Collection and Localization in Sensor-driven Networks
— We consider a sensor network in which the sensors communicate at will when they have something to report, without prior coordination with other sensors or with data collection ...
Bharath Ananthasubramaniam, Upamanyu Madhow
TMC
2008
125views more  TMC 2008»
14 years 11 months ago
Distributed Algorithm for Efficient Construction and Maintenance of Connected k-Hop Dominating Sets in Mobile Ad Hoc Networks
A k-hop dominating set is a subset of nodes such that each node not in the set can be reached within k hops from at least one node in the set. A connected k-hop dominating set can ...
Hong-Yen Yang, Chia-Hung Lin, Ming-Jer Tsai