2190 search results - page 34 / 438 » Distributed algorithms for dynamic coverage in sensor networ... |
MOBICOM
2003
ACM
14 years 27 days ago
2003
ACM
We develop distributed algorithms for self-organizing sensor networks that respond to directing a target through a region. The sensor network models the danger levels sensed acros...
INFOCOM
2012
IEEE
11 years 10 months ago
2012
IEEE
—When a large amount of sensors are randomly deployed into a field, how can we make a sleep/activate schedule for sensors to maximize the lifetime of target coverage in the fie...
MOBIHOC
2009
ACM
14 years 8 months ago
2009
ACM
We consider a high density of sensors randomly placed in a geographical area for event monitoring. The monitoring regions of the sensors may have significant overlap, and a subset...
DCOSS
2011
Springer
12 years 7 months ago
2011
Springer
—In many application scenarios sensors need to calculate the average of some local values, e.g. of local measurements. A possible solution is to rely on consensus algorithms. In ...
MOBIHOC
2004
ACM
14 years 7 months ago
2004
ACM
Greedy geographic routing is attractive in wireless sensor networks due to its efficiency and scalability. However, greedy geographic routing may incur long routing paths or even ...