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

Direct link
Cite
Citation style
  • apa
  • harvard1
  • ieee
  • modern-language-association-8th-edition
  • vancouver
  • oxford
  • Other style
More styles
Language
  • de-DE
  • en-GB
  • en-US
  • fi-FI
  • nn-NO
  • nn-NB
  • sv-SE
  • Other locale
More languages
Output format
  • html
  • text
  • asciidoc
  • rtf
Polynomial Complexity Minimum-Time Scheduling in a Class of Wireless Networks
Linköping University, Department of Science and Technology, Communications and Transport Systems. Linköping University, The Institute of Technology.
Linköping University, Department of Science and Technology. Linköping University, The Institute of Technology.
Linköping University, Department of Science and Technology, Communications and Transport Systems. Linköping University, The Institute of Technology. Department of Electrical and Computer Engineering, University of Maryland, USA.
Linköping University, Department of Science and Technology, Communications and Transport Systems. Linköping University, The Institute of Technology. Department of Electrical and Computer Engineering, University of Maryland, USA.
2015 (English)In: IEEE Transactions on Control of Network Systems, ISSN 2325-5870, Vol. 3, no 3, 322-331 p.Article in journal (Other academic) Published
Abstract [en]

We consider a wireless network with a set of transmitter-receiver pairs, or links, that share a common channel, and address the problem of emptying finite traffic volume from the transmitters in minimum time. This, so called, minimum-time scheduling problem has been proved to be NP-hard in general. In this paper, we study a class of minimum-time scheduling problems in which the link rates have a particular structure. We show that global optimality can be reached in polynomial time and derive optimality conditions. Then we consider a more general case in which we apply the same approach and obtain an approximation as well as lower and upper bounds to the optimal solution. Simulation results confirm and validate our approach.

Place, publisher, year, edition, pages
Institute of Electrical and Electronics Engineers (IEEE), 2015. Vol. 3, no 3, 322-331 p.
Keyword [en]
algorithm, interference, optimality, scheduling, wireless networks
National Category
Communication Systems Telecommunications
Identifiers
URN: urn:nbn:se:liu:diva-112446DOI: 10.1109/TCNS.2015.2512678OAI: oai:DiVA.org:liu-112446DiVA: diva2:766429
Note

At the time for thesis presentation publication was in status: Manuscript

Available from: 2014-11-27 Created: 2014-11-27 Last updated: 2016-11-25Bibliographically approved
In thesis
1. Revisiting Optimal Link Activation and Minimum-Time Scheduling in Wireless Networks
Open this publication in new window or tab >>Revisiting Optimal Link Activation and Minimum-Time Scheduling in Wireless Networks
2014 (English)Licentiate thesis, comprehensive summary (Other academic)
Abstract [en]

With the popularity of wireless communications in the last two decades, data traffic is exponentially increasing and requests high speed transmission. However, the resources, in particular, spectrum and energy, are limited. Therefore, network optimization with the objective of utilizing radio resource as efficiently as possible is crucial to the sustainable development of wireless communications.

Link activation and scheduling are two classic problems of access coordination and resource allocation for multiple links that share a common channel. The problems originate from the broadcast nature of wireless media and are of significance in more complicated cross-layer optimization problems. Although there is a rich amount of literature, the problems remain challenging and are extended by novel setups incorporating new interference management technologies.

In this thesis, we revisit these two fundamental problems with the main methods of mathematical modelling and applied optimization. The first two papers address the scheduling problem that amounts to emptying a given amount of data in minimum time. We derive theoretical insights including problem complexity, optimality conditions, as well as problem approximation and algorithmic framework, in general and for a class of networks with a particular structure. In the third paper, we incorporate cooperative transmission and interference cancellation with maximum link activation. Theoretical results and algorithm development are provided. Simulation study shows the new setup brings significant performance gain in comparison with the conventional approach.

Place, publisher, year, edition, pages
Linköping: Linköping University Electronic Press, 2014. 24 p.
Series
Linköping Studies in Science and Technology. Thesis, ISSN 0280-7971 ; 1695
National Category
Communication Systems Telecommunications
Identifiers
urn:nbn:se:liu:diva-112449 (URN)978-91-7519-172-0 (ISBN)
Supervisors
Available from: 2014-11-27 Created: 2014-11-27 Last updated: 2014-11-27Bibliographically approved
2. 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 (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

Authority records BETA

He, QingAngelakis, VangelisEphremides, AnthonyYuan, Di

Search in DiVA

By author/editor
He, QingAngelakis, VangelisEphremides, AnthonyYuan, Di
By organisation
Communications and Transport SystemsThe Institute of TechnologyDepartment of Science and Technology
Communication SystemsTelecommunications

Search outside of DiVA

GoogleGoogle Scholar

doi
urn-nbn

Altmetric score

doi
urn-nbn
Total: 88 hits
CiteExportLink to record
Permanent link

Direct link
Cite
Citation style
  • apa
  • harvard1
  • ieee
  • modern-language-association-8th-edition
  • vancouver
  • oxford
  • Other style
More styles
Language
  • de-DE
  • en-GB
  • en-US
  • fi-FI
  • nn-NO
  • nn-NB
  • sv-SE
  • Other locale
More languages
Output format
  • html
  • text
  • asciidoc
  • rtf