SLNR-based User scheduling for MISO downlink cellular systems

Minki Ahn, Kilbom Lee, Kwangwon Lee, Inkyu Lee

Research output: Chapter in Book/Report/Conference proceedingConference contribution

4 Citations (Scopus)

Abstract

In this paper, we consider a user scheduling problem which maximizes the weighted sum-rate (WSR) in multicell multiple input single output (MISO) downlink systems. Since an exhaustive search algorithm requires high computational complexity, we propose a low complexity algorithm which finds a user set in terms of WSR maximization. We first consider a greedy user selection algorithm which almost achieves the system performance of the exhaustive search algorithm in high SNR regime. Next, a distributed user scheduling algorithm is proposed by employing the maximized signal-to-leakage-and-noise ratio (SLNR) in the selection criteria. This leads to a reduction of the system overhead of exchanging channel state information and computational complexity. From simulation results, we show that the performance of our proposed scheme is very close to the conventional greedy user scheme with lower overhead.

Original languageEnglish
Title of host publicationIEEE Vehicular Technology Conference
DOIs
Publication statusPublished - 2013 Dec 1
Event2013 IEEE 77th Vehicular Technology Conference, VTC Spring 2013 - Dresden, Germany
Duration: 2013 Jun 22013 Jun 5

Other

Other2013 IEEE 77th Vehicular Technology Conference, VTC Spring 2013
CountryGermany
CityDresden
Period13/6/213/6/5

Fingerprint

Cellular Systems
Leakage
Scheduling
Output
Exhaustive Search
Computational complexity
Weighted Sums
Search Algorithm
Computational Complexity
Channel state information
Scheduling algorithms
Channel State Information
Scheduling Algorithm
Low Complexity
Scheduling Problem
System Performance
Maximise
Simulation

ASJC Scopus subject areas

  • Electrical and Electronic Engineering
  • Computer Science Applications
  • Applied Mathematics

Cite this

Ahn, M., Lee, K., Lee, K., & Lee, I. (2013). SLNR-based User scheduling for MISO downlink cellular systems. In IEEE Vehicular Technology Conference [6692757] https://doi.org/10.1109/VTCSpring.2013.6692757

SLNR-based User scheduling for MISO downlink cellular systems. / Ahn, Minki; Lee, Kilbom; Lee, Kwangwon; Lee, Inkyu.

IEEE Vehicular Technology Conference. 2013. 6692757.

Research output: Chapter in Book/Report/Conference proceedingConference contribution

Ahn, M, Lee, K, Lee, K & Lee, I 2013, SLNR-based User scheduling for MISO downlink cellular systems. in IEEE Vehicular Technology Conference., 6692757, 2013 IEEE 77th Vehicular Technology Conference, VTC Spring 2013, Dresden, Germany, 13/6/2. https://doi.org/10.1109/VTCSpring.2013.6692757
Ahn M, Lee K, Lee K, Lee I. SLNR-based User scheduling for MISO downlink cellular systems. In IEEE Vehicular Technology Conference. 2013. 6692757 https://doi.org/10.1109/VTCSpring.2013.6692757
Ahn, Minki ; Lee, Kilbom ; Lee, Kwangwon ; Lee, Inkyu. / SLNR-based User scheduling for MISO downlink cellular systems. IEEE Vehicular Technology Conference. 2013.
@inproceedings{53ab454a505f41fcbe8164ce07f5f320,
title = "SLNR-based User scheduling for MISO downlink cellular systems",
abstract = "In this paper, we consider a user scheduling problem which maximizes the weighted sum-rate (WSR) in multicell multiple input single output (MISO) downlink systems. Since an exhaustive search algorithm requires high computational complexity, we propose a low complexity algorithm which finds a user set in terms of WSR maximization. We first consider a greedy user selection algorithm which almost achieves the system performance of the exhaustive search algorithm in high SNR regime. Next, a distributed user scheduling algorithm is proposed by employing the maximized signal-to-leakage-and-noise ratio (SLNR) in the selection criteria. This leads to a reduction of the system overhead of exchanging channel state information and computational complexity. From simulation results, we show that the performance of our proposed scheme is very close to the conventional greedy user scheme with lower overhead.",
author = "Minki Ahn and Kilbom Lee and Kwangwon Lee and Inkyu Lee",
year = "2013",
month = "12",
day = "1",
doi = "10.1109/VTCSpring.2013.6692757",
language = "English",
isbn = "9781467363372",
booktitle = "IEEE Vehicular Technology Conference",

}

TY - GEN

T1 - SLNR-based User scheduling for MISO downlink cellular systems

AU - Ahn, Minki

AU - Lee, Kilbom

AU - Lee, Kwangwon

AU - Lee, Inkyu

PY - 2013/12/1

Y1 - 2013/12/1

N2 - In this paper, we consider a user scheduling problem which maximizes the weighted sum-rate (WSR) in multicell multiple input single output (MISO) downlink systems. Since an exhaustive search algorithm requires high computational complexity, we propose a low complexity algorithm which finds a user set in terms of WSR maximization. We first consider a greedy user selection algorithm which almost achieves the system performance of the exhaustive search algorithm in high SNR regime. Next, a distributed user scheduling algorithm is proposed by employing the maximized signal-to-leakage-and-noise ratio (SLNR) in the selection criteria. This leads to a reduction of the system overhead of exchanging channel state information and computational complexity. From simulation results, we show that the performance of our proposed scheme is very close to the conventional greedy user scheme with lower overhead.

AB - In this paper, we consider a user scheduling problem which maximizes the weighted sum-rate (WSR) in multicell multiple input single output (MISO) downlink systems. Since an exhaustive search algorithm requires high computational complexity, we propose a low complexity algorithm which finds a user set in terms of WSR maximization. We first consider a greedy user selection algorithm which almost achieves the system performance of the exhaustive search algorithm in high SNR regime. Next, a distributed user scheduling algorithm is proposed by employing the maximized signal-to-leakage-and-noise ratio (SLNR) in the selection criteria. This leads to a reduction of the system overhead of exchanging channel state information and computational complexity. From simulation results, we show that the performance of our proposed scheme is very close to the conventional greedy user scheme with lower overhead.

UR - http://www.scopus.com/inward/record.url?scp=84893523276&partnerID=8YFLogxK

UR - http://www.scopus.com/inward/citedby.url?scp=84893523276&partnerID=8YFLogxK

U2 - 10.1109/VTCSpring.2013.6692757

DO - 10.1109/VTCSpring.2013.6692757

M3 - Conference contribution

AN - SCOPUS:84893523276

SN - 9781467363372

BT - IEEE Vehicular Technology Conference

ER -