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

Direct link
Resource Scheduling to Jointly Minimize Receiving and Transmitting Energy in OFDMA Systems
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.
ASTAR, Singapore.
ASTAR, Singapore.
2014 (English)In: 2014 11TH INTERNATIONAL SYMPOSIUM ON WIRELESS COMMUNICATIONS SYSTEMS (ISWCS), IEEE , 2014, 187-191 p.Conference paper (Refereed)
Abstract [en]

Resource scheduling in orthogonal frequency division multiple access (OFDMA) for energy saving has attracted extensive attention. Most current research considers the reduction of energy at the transmitter or the receiver separately. In this paper, we focus on minimizing the energy consumption in both sides concurrently by formulating the problem of joint receiving and transmitting energy-efficient scheduling (RTEES) in OFDMA downlink. We show that this problem can be cast as a binary integer programme. We solve the RTEES problem by a computationally efficient algorithm. We proposed a specialized solution approach, named time-slot-oriented column generation (TSOCG) algorithm, for approaching and bounding the global optimality. Numerical studies show that the proposed algorithm solution is competitive and time-efficient to provide a close-to-optimum solution and a tight bound.

Place, publisher, year, edition, pages
IEEE , 2014. 187-191 p.
Keyword [en]
Energy saving; column generation; resource allocation; resource scheduling; OFDMA
National Category
Civil Engineering
Identifiers
URN: urn:nbn:se:liu:diva-123094ISI: 000363906500036ISBN: 978-1-4799-5863-4OAI: oai:DiVA.org:liu-123094DiVA: diva2:876411
Conference
11th International Symposium on Wireless Communications Systems (ISWCS)
Available from: 2015-12-03 Created: 2015-12-03 Last updated: 2016-04-08
In thesis
1. From Orthogonal to Non-orthogonal Multiple Access: Energy- and Spectrum-Efficient Resource Allocation
Open this publication in new window or tab >>From Orthogonal to Non-orthogonal Multiple Access: Energy- and Spectrum-Efficient Resource Allocation
2016 (English)Doctoral thesis, comprehensive summary (Other academic)
Abstract [en]

The rapid pace of innovations in information and communication technology (ICT) industry over the past decade has greatly improved people’s mobile communication experience. This, in turn, has escalated exponential growth in the number of connected mobile devices and data traffic volume in wireless networks. Researchers and network service providers have faced many challenges in providing seamless, ubiquitous, reliable, and high-speed data service to mobile users. Mathematical optimization, as a powerful tool, plays an important role in addressing such challenging issues.

This dissertation addresses several radio resource allocation problems in 4G and 5G mobile communication systems, in order to improve network performance in terms of throughput, energy, or fairness. Mathematical optimization is applied as the main approach to analyze and solve the problems. Theoretical analysis and algorithmic solutions are derived. Numerical results are obtained to validate our theoretical findings and demonstrate the algorithms’ ability of attaining optimal or near-optimal solutions.

Five research papers are included in the dissertation. In Paper I, we study a set of optimization problems of consecutive-channel allocation in single carrier-frequency division multiple access (SCFDMA) systems. We provide a unified algorithmic framework to optimize the channel allocation and improve system performance. The next three papers are devoted to studying energy-saving problems in orthogonal frequency division multiple access (OFDMA) systems. In Paper II, we investigate a problem of jointly minimizing energy consumption at both transmitter and receiver sides. An energy-efficient scheduling algorithm is developed to provide optimality bounds and near-optimal solutions. Next in Paper III, we derive fundamental properties for energy minimization in loadcoupled OFDMA networks. Our analytical results suggest that the maximal use of time-frequency resources can lead to the lowest network energy consumption. An iterative power adjustment algorithm is developed to obtain the optimal power solution with guaranteed convergence. In Paper IV, we study an energy minimization problem from the perspective of scheduling activation and deactivation of base station transmissions. We provide mathematical formulations and theoretical insights. For problem solution, a column generation approach, as well as a bounding scheme are developed. Finally, towards to 5G communication systems, joint power and channel allocation in non-orthogonal multiple access (NOMA) is investigated in Paper V in which an algorithmic solution is proposed to improve system throughput and fairness.

Place, publisher, year, edition, pages
Linköping: Linköping University Electronic Press, 2016. 45 p.
Series
Linköping Studies in Science and Technology. Dissertations, ISSN 0345-7524 ; 1752
National Category
Communication Systems Telecommunications Computational Mathematics Computer Engineering Signal Processing
Identifiers
urn:nbn:se:liu:diva-126937 (URN)10.3384/diss.diva-126937 (DOI)978-91-7685-804-2 (Print) (ISBN)
Public defence
2016-05-16, K3, Kåkenhus, Campus Norrköping, Norrköping, 13:15 (English)
Opponent
Supervisors
Available from: 2016-04-08 Created: 2016-04-08 Last updated: 2016-04-12Bibliographically approved

Open Access in DiVA

No full text

Search in DiVA

By author/editor
Lei, LeiYuan, Di
By organisation
Communications and Transport SystemsFaculty of Science & Engineering
Civil 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

Total: 47 hits
ReferencesLink to record
Permanent link

Direct link