Sciweavers

Share
DCOSS
2006
Springer

Approximation Algorithms for Power-Aware Scheduling of Wireless Sensor Networks with Rate and Duty-Cycle Constraints

11 years 10 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. Since traditional optimization methods using Lagrange multipliers do not work well and are computationally expensive given the non-convex constraints, we develop fully polynomial approximation schemes (FPAS) for finding optimal schedules by considering restricted versions of the problem using multiple discrete power levels. We first show a simple dynamic programming solution that optimally solves the restricted problem. For two fixed transmit power levels (0 and P), we then develop a 2-factor approximation for finding the optimal fixed transmission power level per time slot, Popt, that generates the optimal (minimum) energy schedule. This can then be used to develop a (2, 1 + )-FPAS that approximates the optimal power consumption and rate constraints to within factors of 2 and arbitrarily small > 0, respective...
Rajgopal Kannan, Shuangqing Wei
Added 22 Aug 2010
Updated 22 Aug 2010
Type Conference
Year 2006
Where DCOSS
Authors Rajgopal Kannan, Shuangqing Wei
Comments (0)
books