Abstract:
We consider link scheduling in wireless networks for emptying the queues of the source nodes, and provide a unified mathematical formulation that accommodates all meaning...Show MoreMetadata
Abstract:
We consider link scheduling in wireless networks for emptying the queues of the source nodes, and provide a unified mathematical formulation that accommodates all meaningful settings of link transmission rates and network configurations. We prove that, any scheduling problem is equivalent to solving a convex problem defined over the convex hull of the rate region. Based on the fundamental insight, a general optimality condition is derived, that yields a unified treatment of optimal scheduling. Furthermore, we demonstrate the implications and usefulness of the result. Specifically, by applying the theoretical insight to optimality characterization and complexity analysis of scheduling problems, we can both unify and extend previously obtained results.
Date of Conference: 10-15 July 2016
Date Added to IEEE Xplore: 11 August 2016
ISBN Information:
Electronic ISSN: 2157-8117