Sciweavers

337 search results - page 45 / 68
» On sensor selection in linked information networks
Sort
View
98
Voted
PERCOM
2006
ACM
15 years 10 months ago
Localized Sensor Area Coverage with Low Communication Overhead
We propose several localized sensor area coverage protocols, for arbitrary ratio of sensing and transmission radii. Sensors are assumed to be time synchronized, and active sensors...
Antoine Gallais, Jean Carle, David Simplot-Ryl, Iv...
CORR
2012
Springer
225views Education» more  CORR 2012»
13 years 6 months ago
The Filter-Placement Problem and its Application to Minimizing Information Multiplicity
In many information networks, data items – such as updates in social networks, news flowing through interconnected RSS feeds and blogs, measurements in sensor networks, route u...
Dóra Erdös, Vatche Ishakian, Andrei La...
CN
2010
183views more  CN 2010»
14 years 10 months ago
A learning automata based scheduling solution to the dynamic point coverage problem in wireless sensor networks
The dynamic point coverage problem in wireless sensor networks is to detect some moving target points in the area of the network using as little sensor nodes as possible. One way ...
Mehdi Esnaashari, Mohammad Reza Meybodi
KDD
2009
ACM
166views Data Mining» more  KDD 2009»
15 years 11 months ago
Measuring the effects of preprocessing decisions and network forces in dynamic network analysis
Social networks have become a major focus of research in recent years, initially directed towards static networks but increasingly, towards dynamic ones. In this paper, we investi...
Jerry Scripps, Pang-Ning Tan, Abdol-Hossein Esfaha...
94
Voted
MASS
2010
162views Communications» more  MASS 2010»
14 years 8 months ago
A metric for routing in delay-sensitive wireless sensor networks
Abstract--We present a new scheme to reduce the end-toend routing delay in the mission-critical applications of the wireless sensor networks (WSNs) under the duty cycle model. Whil...
Zhen Jiang, Jie Wu, Risa Ito