liu.seSök publikationer i DiVA
Ändra sökning
RefereraExporteraLänk till posten
Permanent länk

Direktlänk
Referera
Referensformat
  • apa
  • harvard1
  • ieee
  • modern-language-association-8th-edition
  • vancouver
  • oxford
  • Annat format
Fler format
Språk
  • de-DE
  • en-GB
  • en-US
  • fi-FI
  • nn-NO
  • nn-NB
  • sv-SE
  • Annat språk
Fler språk
Utmatningsformat
  • html
  • text
  • asciidoc
  • rtf
Maximum Link Activation with Cooperative Transmission and Interference Cancellation in Wireless Networks
Linköpings universitet, Institutionen för teknik och naturvetenskap, Kommunikations- och transportsystem. Linköpings universitet, Tekniska fakulteten.ORCID-id: 0000-0002-6213-8561
Linköpings universitet, Institutionen för teknik och naturvetenskap, Kommunikations- och transportsystem. Linköpings universitet, Tekniska fakulteten.
Linköpings universitet, Institutionen för teknik och naturvetenskap, Kommunikations- och transportsystem. Linköpings universitet, Tekniska fakulteten. Department of Electrical and Computer Engineering, University of Maryland, USA.
2017 (Engelska)Ingår i: IEEE Transactions on Mobile Computing, ISSN 1536-1233, E-ISSN 1558-0660, Vol. 16, nr 2, s. 408-421Artikel i tidskrift (Refereegranskat) Published
Abstract [en]

We address the maximum link activation problem in wireless networks with new features, namely when the transmitters can perform cooperative transmission, and the receivers are able to perform successive interference cancellation. In this new problem setting, which transmitters should transmit and to whom, as well as the optimal cancellation patterns at the receivers, are strongly intertwined. We present contributions along three lines. First, we provide a thorough tractability analysis, proving the NP-hardness as well as identifying tractable cases. Second, for benchmarking purposes, we deploy integer linear programming for achieving global optimum using off-theshelf optimization methods. Third, to overcome the scalability issue of integer programming, we design a sub-optimal but efficient optimization algorithm for the problem in its general form, by embedding maximum-weighted bipartite matching into local search. Numerical results are presented for performance evaluation, to validate the benefit of cooperative transmission and interference cancellation for maximum link activation and to demonstrate the effectiveness of the proposed algorithm.

Ort, förlag, år, upplaga, sidor
IEEE , 2017. Vol. 16, nr 2, s. 408-421
Nationell ämneskategori
Kommunikationssystem Telekommunikation
Identifikatorer
URN: urn:nbn:se:liu:diva-112447DOI: 10.1109/TMC.2016.2546906ISI: 000393808500009OAI: oai:DiVA.org:liu-112447DiVA, id: diva2:766431
Konferens
2014 IEEE 25th Annual International Symposium on Personal, Indoor, and Mobile Radio Communications (PIMRC), September 2-5, Washington DC, DC, USA
Anmärkning

Funding agencies: Swedish Research Council; EU FP7 Marie Curie [324515, 329313]; National Science Foundation [CCF-0728966, CCF-1420651]; ONR [N000141410107]

Tillgänglig från: 2014-11-27 Skapad: 2014-11-27 Senast uppdaterad: 2018-08-14Bibliografiskt granskad
Ingår i avhandling
1. Revisiting Optimal Link Activation and Minimum-Time Scheduling in Wireless Networks
Öppna denna publikation i ny flik eller fönster >>Revisiting Optimal Link Activation and Minimum-Time Scheduling in Wireless Networks
2014 (Engelska)Licentiatavhandling, sammanläggning (Övrigt vetenskapligt)
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.

Ort, förlag, år, upplaga, sidor
Linköping: Linköping University Electronic Press, 2014. s. 24
Serie
Linköping Studies in Science and Technology. Thesis, ISSN 0280-7971 ; 1695
Nationell ämneskategori
Kommunikationssystem Telekommunikation
Identifikatorer
urn:nbn:se:liu:diva-112449 (URN)978-91-7519-172-0 (ISBN)
Handledare
Tillgänglig från: 2014-11-27 Skapad: 2014-11-27 Senast uppdaterad: 2018-08-14Bibliografiskt granskad
2. A Comprehensive Analysis of Optimal Link Scheduling for Emptying a Wireless Network
Öppna denna publikation i ny flik eller fönster >>A Comprehensive Analysis of Optimal Link Scheduling for Emptying a Wireless Network
2016 (Engelska)Doktorsavhandling, sammanläggning (Övrigt vetenskapligt)
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.

Ort, förlag, år, upplaga, sidor
Linköping: Linköping University Electronic Press, 2016. s. 40
Serie
Linköping Studies in Science and Technology. Dissertations, ISSN 0345-7524 ; 1786
Nationell ämneskategori
Systemvetenskap, informationssystem och informatik Datorteknik Matematik Datorsystem
Identifikatorer
urn:nbn:se:liu:diva-131359 (URN)10.3384/diss.diva-131359 (DOI)9789176856949 (ISBN)
Disputation
2016-10-18, TP2, Täppan, Campus Norrköping, Norrköping, 10:15 (Engelska)
Opponent
Handledare
Forskningsfinansiär
EU, FP7, Sjunde ramprogrammetVetenskapsrådeteLLIIT - The Linköping‐Lund Initiative on IT and Mobile Communications
Tillgänglig från: 2016-09-15 Skapad: 2016-09-15 Senast uppdaterad: 2018-08-14Bibliografiskt granskad

Open Access i DiVA

Fulltext saknas i DiVA

Övriga länkar

Förlagets fulltext

Personposter BETA

He, QingYuan, Di

Sök vidare i DiVA

Av författaren/redaktören
He, QingYuan, DiEphremides, Anthony
Av organisationen
Kommunikations- och transportsystemTekniska fakulteten
I samma tidskrift
IEEE Transactions on Mobile Computing
KommunikationssystemTelekommunikation

Sök vidare utanför DiVA

GoogleGoogle Scholar

doi
urn-nbn

Altmetricpoäng

doi
urn-nbn
Totalt: 391 träffar
RefereraExporteraLänk till posten
Permanent länk

Direktlänk
Referera
Referensformat
  • apa
  • harvard1
  • ieee
  • modern-language-association-8th-edition
  • vancouver
  • oxford
  • Annat format
Fler format
Språk
  • de-DE
  • en-GB
  • en-US
  • fi-FI
  • nn-NO
  • nn-NB
  • sv-SE
  • Annat språk
Fler språk
Utmatningsformat
  • html
  • text
  • asciidoc
  • rtf