A general optimality condition of link scheduling for emptying a wireless network
2016 (English)Conference paper (Refereed)
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.
Place, publisher, year, edition, pages
IEEE , 2016. 1446-1450 p.
, IEEE International Symposium on Information Theory. Proceedings, ISSN 2157-8095 (Print), 2157-8117 (online) ; 2016
convex programming;radio links;radio networks;telecommunication scheduling;convex hull;convex problem;general optimality condition;link scheduling;link transmission rates;network configurations;optimal scheduling;source nodes;wireless network;Complexity theory;Information theory;Interference;Optimal scheduling;Processor scheduling;Scheduling;Wireless networks;complexity;optimality;scheduling;wireless networks
Computer Engineering Information Systems Software Engineering
IdentifiersURN: urn:nbn:se:liu:diva-131357DOI: 10.1109/ISIT.2016.7541538OAI: oai:DiVA.org:liu-131357DiVA: diva2:970916
IEEE International Symposium on Information Theory (ISIT), 2016, Universitat Pompeu Fabra, Barcelona, Spain, July l0-l5, 2016