Date Added: Dec 2011
The authors focus on efficient algorithms for resource allocation problems in large wireless networks. They first investigate the link scheduling problem and identify the properties that make it possible to compute solutions efficiently. They, then show that the node on-off scheduling problem shares these features and is amenable to the same type of solution method. Numerical results confirm the efficiency of their technique for large scale problems. They also extend the technique to the case where the objective function is nonlinear showing that their technique blends smoothly with a sequential linear programming approach.