Sciweavers

25316 search results - page 46 / 5064
» Computational sensor networks
Sort
View
INFOCOM
2010
IEEE
15 years 2 months ago
On Computing Compression Trees for Data Collection in Wireless Sensor Networks
We address the problem of efficiently gathering correlated data from a wireless sensor network, with the aim of designing algorithms with provable optimality guarantees, and unders...
Jian Li, Amol Deshpande, Samir Khuller
ALGOSENSORS
2006
Springer
15 years 6 months ago
Computing Bridges, Articulations, and 2-Connected Components in Wireless Sensor Networks
Abstract. This paper presents a simple distributed algorithm to determine the bridges, articulation points, and 2-connected components in asynchronous networks with an at least onc...
Volker Turau
DCOSS
2007
Springer
15 years 8 months ago
Efficient Computation of Minimum Exposure Paths in a Sensor Network Field
The exposure of a path p is a measure of the likelihood that an object traveling along p is detected by a network of sensors and it is formally defined as an integral over all poin...
Hristo Djidjev
ESA
2005
Springer
108views Algorithms» more  ESA 2005»
15 years 9 months ago
Bootstrapping a Hop-Optimal Network in the Weak Sensor Model
Sensor nodes are very weak computers that get distributed at random on a surface. Once deployed, they must wake up and form a radio network. Sensor network bootstrapping research t...
Martin Farach-Colton, Rohan J. Fernandes, Miguel A...
ICDE
2009
IEEE
223views Database» more  ICDE 2009»
16 years 5 months ago
Another Outlier Bites the Dust: Computing Meaningful Aggregates in Sensor Networks
Abstract-- Recent work has demonstrated that readings provided by commodity sensor nodes are often of poor quality. In order to provide a valuable sensory infrastructure for monito...
Antonios Deligiannakis, Yannis Kotidis, Vasilis Va...