Scheduling with rate and duty-cycle constraints for wireless networks over an interference channel
We consider the problem of finding a minimum energy transmission schedule for duty-cycle and rate constrained nodes transmitting over a AWGN interference channel. Since traditional optimization methods using Lagrange multipliers do not work well and are computationally expensive given the non-convex constraints, we develop polynomial time approximation schemes for finding optimal rate and duty-cycle constrained energy schedule by considering a restricted version of the problem using discrete power levels. We first show a simple dynamic programming solution that optimally solves the restricted problem using two fixed power levels. We then find a 2-factor approximation to the problem of finding the optimal fixed power level that generates the optimal (minimum) energy schedule. We then develop a (2, β)-FPAS (fully polynomial time approximation scheme) for the problem that approximates the optimal power consumption and rate constraints to within factors of 2 and arbitrarily close β, respectively. The running time of the FPAS is polynomial in 1//β. © 2006 IEEE.
Publication Source (Journal or Book title)
2006 IEEE Conference on Information Sciences and Systems, CISS 2006 - Proceedings
Kannan, R., & Wei, S. (2007). Scheduling with rate and duty-cycle constraints for wireless networks over an interference channel. 2006 IEEE Conference on Information Sciences and Systems, CISS 2006 - Proceedings, 1378-1384. https://doi.org/10.1109/CISS.2006.286680