Sciweavers

528 search results - page 30 / 106
» Approximation algorithm for minimal convergecast time proble...
Sort
View
DMSN
2004
ACM
14 years 1 months ago
Approximately uniform random sampling in sensor networks
Recent work in sensor databases has focused extensively on distributed query problems, notably distributed computation of aggregates. Existing methods for computing aggregates bro...
Boulat A. Bash, John W. Byers, Jeffrey Considine
ALGOSENSORS
2010
Springer
13 years 6 months ago
Lifetime Maximization of Monitoring Sensor Networks
We study the problem of maximizing the lifetime of a sensor network assigned to monitor a given area. Our main result is a linear time dual approximation algorithm that comes arbit...
Peter Sanders, Dennis Schieferdecker
ICC
2008
IEEE
162views Communications» more  ICC 2008»
14 years 2 months ago
Self-Orienting Wireless Multimedia Sensor Networks for Maximizing Multimedia Coverage
— The performance of a wireless multimedia sensor network (WMSN) is tightly coupled with the pose of individual multimedia sensors. In particular, orientation of an individual mu...
Nurcan Tezcan, Wenye Wang
IPPS
2009
IEEE
14 years 2 months ago
Minimizing total busy time in parallel scheduling with application to optical networks
—We consider a scheduling problem in which a bounded number of jobs can be processed simultaneously by a single machine. The input is a set of n jobs J = {J1, . . . , Jn}. Each j...
Michele Flammini, Gianpiero Monaco, Luca Moscardel...
MOBIHOC
2001
ACM
14 years 7 months ago
Localized algorithms in wireless ad-hoc networks: location discovery and sensor exposure
The development of practical, localized algorithms is probably the most needed and most challenging task in wireless ad-hoc sensor networks (WASNs). Localized algorithms are a spe...
Seapahn Meguerdichian, Sasha Slijepcevic, Vahag Ka...