661 search results - page 2 / 133 » Local Approximation Algorithms for Scheduling Problems in Se... |
SSS
2009
Springer
13 years 11 months ago
2009
Springer
We consider setting up sleep scheduling in sensor networks. We formulate the problem as an instance of the fractional domatic partition problem and obtain a distributed approximati...
INFOCOM
2012
IEEE
11 years 7 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...
INFOCOM
2009
IEEE
13 years 11 months ago
2009
IEEE
Abstract—This paper presents a new desynchronization algorithm aimed at providing collision-free transmission scheduling for single-hop and acyclic multi-hop wireless sensor netw...
SIGMETRICS
2010
ACM
13 years 9 months ago
2010
ACM
This paper addresses the problem of determining the node locations in ad-hoc sensor networks when only connectivity information is available. In previous work, we showed that the ...
IPSN
2004
Springer
13 years 10 months ago
2004
Springer
In this paper we develop algorithms for distributed computation of a broad range of estimation and detection tasks over networks with arbitrary but fixed connectivity. The distri...