Sciweavers

661 search results - page 1 / 133
» Local Approximation Algorithms for Scheduling Problems in Se...
Sort
View
ALGOSENSORS
2007
Springer
13 years 10 months ago
Local Approximation Algorithms for Scheduling Problems in Sensor Networks
Patrik Floréen, Petteri Kaski, Topi Musto, ...
WINET
2010
159views more  WINET 2010»
13 years 2 months ago
Approximation algorithm for minimal convergecast time problem in wireless sensor networks
In this paper we consider how to collect data from sensors deployed in the Euclidean plane in a timeefficient way. We assume that all sensors could adjust their transmission range...
Weiping Shang, Peng-Jun Wan, Xiaodong Hu
ADHOC
2010
292views more  ADHOC 2010»
13 years 4 months ago
Sleep/wake scheduling for multi-hop sensor networks: Non-convexity and approximation algorithm
We investigate the problem of sleep/wake scheduling for low duty cycle sensor networks. Our work differs from prior work in that we explicitly consider the effect of synchronizati...
Yan Wu, Sonia Fahmy, Ness B. Shroff
DCOSS
2006
Springer
13 years 8 months ago
Approximation Algorithms for Power-Aware Scheduling of Wireless Sensor Networks with Rate and Duty-Cycle Constraints
We develop algorithms for finding the minimum energy transmission schedule for duty-cycle and rate constrained wireless sensor nodes transmitting over an interference channel. Sinc...
Rajgopal Kannan, Shuangqing Wei
IPCCC
2007
IEEE
13 years 11 months ago
O(log n)-Localized Algorithms on the Coverage Problem in Heterogeneous Sensor Networks
In this paper, we study the Maximum lifetime Target Coverage problem (MTC), which is to maximize the network lifetime while guaranteeing the complete coverage of all the targets. ...
My T. Thai, Yingshu Li, Feng Wang 0002