liu.seSearch for publications in DiVA
Change search
ReferencesLink to record
Permanent link

Direct link
A general optimality condition of link scheduling for emptying a wireless network
Linköping University, Department of Science and Technology, Communications and Transport Systems. Linköping University, Faculty of Science & Engineering.
Linköping University, Department of Science and Technology, Communications and Transport Systems. Linköping University, Faculty of Science & Engineering.
Linköping University, Department of Science and Technology, Communications and Transport Systems. Linköping University, Faculty of Science & Engineering.
2016 (English)Conference paper (Refereed)
Abstract [en]

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.
Series
, IEEE International Symposium on Information Theory. Proceedings, ISSN 2157-8095 (Print), 2157-8117 (online) ; 2016
Keyword [en]
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
National Category
Computer Engineering Information Systems Software Engineering
Identifiers
URN: urn:nbn:se:liu:diva-131357DOI: 10.1109/ISIT.2016.7541538OAI: oai:DiVA.org:liu-131357DiVA: diva2:970916
Conference
IEEE International Symposium on Information Theory (ISIT), 2016, Universitat Pompeu Fabra, Barcelona, Spain, July l0-l5, 2016
Available from: 2016-09-15 Created: 2016-09-15 Last updated: 2016-09-15Bibliographically approved
In thesis
1. A Comprehensive Analysis of Optimal Link Scheduling for Emptying a Wireless Network
Open this publication in new window or tab >>A Comprehensive Analysis of Optimal Link Scheduling for Emptying a Wireless Network
2016 (English)Doctoral thesis, comprehensive summary (Other academic)
Abstract [en]

Wireless communications have become an important part of modern life. The ubiquitous wireless networks and connectivities generate exponentially increasing data traffic. In view of this, wireless network optimization, which aims at utilizing the limited resource, especially spectrum and energy, as efficiently as possible from a network perspective, is essential for performance improvement and sustainable development of wireless communications.

In the dissertation, we focus on a fundamental problem of wireless network optimization, link scheduling, as well as its subproblem, link activation. The problem type arises because of the nature of wireless media and hence it is of relevance to a wide range of networks with multiple access. We freshen these classic problems up by novel extensions incorporating new technologies of interference management or with new performance metrics. We also revisit the problems in their classic setup to gain new theoretical results and insights for problem-solving. Throughout the study, we consider the problems with a general setup, such that the insights presented in this dissertation are not constrained to a specific technology or network type. Since link activation and scheduling are key elements of access coordination in wireless communications, the study opens up new approaches that significantly improve network performance, and eventually benefit practical applications.

The dissertation consists of five research papers. The first paper addresses maximum link activation with cooperative transmission and interference cancellation. Papers II and III investigate the minimum-time link scheduling problem in general and a particular class of networks, respectively. In Paper IV, we consider the scheduling problem of emptying a network in its broad form and provide a general optimality condition. In Paper V, we study the scheduling problem with respect to age of information.

Place, publisher, year, edition, pages
Linköping: Linköping University Electronic Press, 2016. 40 p.
Series
Linköping Studies in Science and Technology. Dissertations, ISSN 0345-7524 ; 1786
National Category
Information Systems Computer Engineering Mathematics Computer Systems
Identifiers
urn:nbn:se:liu:diva-131359 (URN)10.3384/diss.diva-131359 (DOI)9789176856949 (Print) (ISBN)
Public defence
2016-10-18, TP2, Täppan, Campus Norrköping, Norrköping, 10:15 (English)
Opponent
Supervisors
Funder
EU, FP7, Seventh Framework ProgrammeSwedish Research CouncileLLIIT - The Linköping‐Lund Initiative on IT and Mobile Communications
Available from: 2016-09-15 Created: 2016-09-15 Last updated: 2016-09-16Bibliographically approved

Open Access in DiVA

No full text

Other links

Publisher's full text

Search in DiVA

By author/editor
He, QingYuan, DiEphremides, Anthony
By organisation
Communications and Transport SystemsFaculty of Science & Engineering
Computer EngineeringInformation SystemsSoftware Engineering

Search outside of DiVA

GoogleGoogle Scholar
The number of downloads is the sum of all downloads of full texts. It may include eg previous versions that are now no longer available

Altmetric score

Total: 6 hits
ReferencesLink to record
Permanent link

Direct link