279 search results - page 9 / 56 » Randomized k-Coverage Algorithms For Dense Sensor Networks |
MSN
2005
Springer
14 years 29 days ago
2005
Springer
In mobile wireless sensor networks, sensors move in the monitored area at any direction and at any speed. Unlike many other networking hosts, sensor nodes do not have global addres...
AUTOMATICA
2006
13 years 7 months ago
2006
In this note we consider the following problem. Suppose a set of sensors is jointly trying to estimate a process. One sensor takes a measurement at every time step and the measure...
ICASSP
2009
IEEE
13 years 5 months ago
2009
IEEE
The average consensus in wireless sensor networks is achieved under assumptions of symmetric or balanced topology at every time instant. However, communication and/or node failure...
DMSN
2004
ACM
14 years 27 days ago
2004
ACM
Recent work in sensor databases has focused extensively on distributed query problems, notably distributed computation of aggregates. Existing methods for computing aggregates bro...
ALGOSENSORS
2006
Springer
13 years 11 months ago
2006
Springer
Abstract. We consider the self-deployment problem in a ring for a network of identical sensors: starting from some initial random placement in the ring, the sensors in the network ...