SwePub
Sök i LIBRIS databas

  Extended search

WFRF:(You Lei)
 

Search: WFRF:(You Lei) > Efficient Minimum-E...

Efficient Minimum-Energy Scheduling with Machine-Learning Based Predictions for Multiuser MISO Systems

You, Lei (author)
Uppsala universitet,Datalogi,Optimisation,Uppsala University, Sweden
Vu, Thang X (author)
University of Luxembourg, Luxembourg,Univ Luxembourg, Interdisciplinary Ctr Secur Reliabil & Trust SnT, Esch Sur Alzette, Luxembourg
You, Lei (author)
Uppsala University, Sweden
show more...
Fowler, Scott (author)
Linköpings universitet,Kommunikations- och transportsystem,Tekniska fakulteten,Linkoping Univ, Dept Sci & Technol, Linkoping, Sweden
Yuan, Di (author)
Uppsala universitet,Datalogi,Optimisation,Uppsala University, Sweden
Lei, Lei (author)
University of Luxembourg, Luxembourg
show less...
 (creator_code:org_t)
IEEE, 2018
2018
English.
In: 2018 IEEE International Conference on Communications (ICC). - : IEEE. - 9781538631805 - 9781538631812 ; , s. 1-6
  • Conference paper (peer-reviewed)
Abstract Subject headings
Close  
  • We address an energy-efficient scheduling problem for practical multiple-input single-output (MISO) systems with stringent execution-time requirements. Optimal user-group scheduling is adopted to enable timely and energy-efficient data transmission, such that all the users' demand can be delivered within a limited time. The high computational complexity in optimal iterative algorithms limits their applications in real-time network operations. In this paper, we rethink the conventional optimization algorithms, and embed machine-learning based predictions in the optimization process, aiming at improving the computational efficiency and meeting the stringent execution-time limits in practice, while retaining competitive energy-saving performance for the MISO system. Numerical results demonstrate that the proposed method, i.e., optimization with machine- learning predictions (OMLP), is able to provide a time-efficient and high-quality solution for the considered scheduling problem. Towards online scheduling in real-time communications, OMLP is of high computational efficiency compared to conventional optimal iterative algorithms. OMLP guarantees the optimality as long as the machine- learning based predictions are accurate.

Subject headings

TEKNIK OCH TEKNOLOGIER  -- Elektroteknik och elektronik -- Kommunikationssystem (hsv//swe)
ENGINEERING AND TECHNOLOGY  -- Electrical Engineering, Electronic Engineering, Information Engineering -- Communication Systems (hsv//eng)

Keyword

computational complexity;energy conservation;iterative methods;learning (artificial intelligence);MISO communication;multi-access systems;optimisation;telecommunication computing;telecommunication power management;telecommunication scheduling;efficient minimum-energy scheduling;multiuser MISO systems;energy-efficient scheduling problem;multiple-input single-output systems;stringent execution-time requirements;optimal user-group scheduling;energy-efficient data transmission;high computational complexity;real-time network operations;optimization process;competitive energy-saving performance;MISO system;OMLP;high-quality solution;real-time communications;high computational efficiency;conventional optimal iterative algorithms;optimization algorithms;scheduling problem;optimization with machine learning predictions;Processor scheduling;Optimal scheduling;Scheduling;Machine learning;Data communication;Real-time systems

Publication and Content Type

ref (subject category)
kon (subject category)

Find in a library

To the university's database

Find more in SwePub

By the author/editor
You, Lei
Vu, Thang X
Fowler, Scott
Yuan, Di
Lei, Lei
About the subject
ENGINEERING AND TECHNOLOGY
ENGINEERING AND ...
and Electrical Engin ...
and Communication Sy ...
Articles in the publication
2018 IEEE Intern ...
By the university
Linköping University
Uppsala University

Search outside SwePub

Kungliga biblioteket hanterar dina personuppgifter i enlighet med EU:s dataskyddsförordning (2018), GDPR. Läs mer om hur det funkar här.
Så här hanterar KB dina uppgifter vid användning av denna tjänst.

 
pil uppåt Close

Copy and save the link in order to return to this view