QC2LinQ: QoS and Channel-Aware Distributed Link Scheduler for D2D Communication

Hyun Suk Lee, Jang-Won Lee

Research output: Contribution to journalReview article

1 Citation (Scopus)

Abstract

We study a distributed link scheduling problem for device-to-device (D2D) communication considering the quality-of-service (QoS) requirements and time-varying channel conditions of D2D links. To this end, we first study an optimal centralized link scheduling problem maximizing the total average sum-rate while satisfying the QoS requirements of D2D links. We then abstract the important scheduling principles of the optimal link scheduling, i.e., giving more chance to be scheduled to the links which have a good channel condition and do not satisfy the QoS requirement, in order to utilize them to develop distributed link scheduling algorithms. With the scheduling principles, we develop a procedure with which D2D links can share their degree of QoS unsatisfaction and channel condition with each other and generate their scheduling priorities according to the shared information in a distributed manner. We also develop a novel distributed link scheduling criterion with which D2D links determine their link scheduling. By using them, we propose distributed link scheduling algorithms, QCLinQ and QC2 LinQ, which have significantly smaller signaling overhead and low computational complexity compared with the centralized optimal link scheduling algorithm. Moreover, they closely meet the QoS requirements of D2D links while achieving significant sum-rate improvement over conventional distributed algorithms.

Original languageEnglish
Article number7587807
Pages (from-to)8565-8579
Number of pages15
JournalIEEE Transactions on Wireless Communications
Volume15
Issue number12
DOIs
Publication statusPublished - 2016 Dec 1

Fingerprint

Scheduler
Quality of Service
Quality of service
Scheduling
Communication
Scheduling Algorithm
Scheduling algorithms
Requirements
Scheduling Problem
Time-varying Channels
Distributed Algorithms
Low Complexity
Computational Complexity
Parallel algorithms
Computational complexity

All Science Journal Classification (ASJC) codes

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

Cite this

@article{ad77b861bba3411d8f864bcc57a46292,
title = "QC2LinQ: QoS and Channel-Aware Distributed Link Scheduler for D2D Communication",
abstract = "We study a distributed link scheduling problem for device-to-device (D2D) communication considering the quality-of-service (QoS) requirements and time-varying channel conditions of D2D links. To this end, we first study an optimal centralized link scheduling problem maximizing the total average sum-rate while satisfying the QoS requirements of D2D links. We then abstract the important scheduling principles of the optimal link scheduling, i.e., giving more chance to be scheduled to the links which have a good channel condition and do not satisfy the QoS requirement, in order to utilize them to develop distributed link scheduling algorithms. With the scheduling principles, we develop a procedure with which D2D links can share their degree of QoS unsatisfaction and channel condition with each other and generate their scheduling priorities according to the shared information in a distributed manner. We also develop a novel distributed link scheduling criterion with which D2D links determine their link scheduling. By using them, we propose distributed link scheduling algorithms, QCLinQ and QC2 LinQ, which have significantly smaller signaling overhead and low computational complexity compared with the centralized optimal link scheduling algorithm. Moreover, they closely meet the QoS requirements of D2D links while achieving significant sum-rate improvement over conventional distributed algorithms.",
author = "Lee, {Hyun Suk} and Jang-Won Lee",
year = "2016",
month = "12",
day = "1",
doi = "10.1109/TWC.2016.2616340",
language = "English",
volume = "15",
pages = "8565--8579",
journal = "IEEE Transactions on Wireless Communications",
issn = "1536-1276",
publisher = "Institute of Electrical and Electronics Engineers Inc.",
number = "12",

}

QC2LinQ : QoS and Channel-Aware Distributed Link Scheduler for D2D Communication. / Lee, Hyun Suk; Lee, Jang-Won.

In: IEEE Transactions on Wireless Communications, Vol. 15, No. 12, 7587807, 01.12.2016, p. 8565-8579.

Research output: Contribution to journalReview article

TY - JOUR

T1 - QC2LinQ

T2 - QoS and Channel-Aware Distributed Link Scheduler for D2D Communication

AU - Lee, Hyun Suk

AU - Lee, Jang-Won

PY - 2016/12/1

Y1 - 2016/12/1

N2 - We study a distributed link scheduling problem for device-to-device (D2D) communication considering the quality-of-service (QoS) requirements and time-varying channel conditions of D2D links. To this end, we first study an optimal centralized link scheduling problem maximizing the total average sum-rate while satisfying the QoS requirements of D2D links. We then abstract the important scheduling principles of the optimal link scheduling, i.e., giving more chance to be scheduled to the links which have a good channel condition and do not satisfy the QoS requirement, in order to utilize them to develop distributed link scheduling algorithms. With the scheduling principles, we develop a procedure with which D2D links can share their degree of QoS unsatisfaction and channel condition with each other and generate their scheduling priorities according to the shared information in a distributed manner. We also develop a novel distributed link scheduling criterion with which D2D links determine their link scheduling. By using them, we propose distributed link scheduling algorithms, QCLinQ and QC2 LinQ, which have significantly smaller signaling overhead and low computational complexity compared with the centralized optimal link scheduling algorithm. Moreover, they closely meet the QoS requirements of D2D links while achieving significant sum-rate improvement over conventional distributed algorithms.

AB - We study a distributed link scheduling problem for device-to-device (D2D) communication considering the quality-of-service (QoS) requirements and time-varying channel conditions of D2D links. To this end, we first study an optimal centralized link scheduling problem maximizing the total average sum-rate while satisfying the QoS requirements of D2D links. We then abstract the important scheduling principles of the optimal link scheduling, i.e., giving more chance to be scheduled to the links which have a good channel condition and do not satisfy the QoS requirement, in order to utilize them to develop distributed link scheduling algorithms. With the scheduling principles, we develop a procedure with which D2D links can share their degree of QoS unsatisfaction and channel condition with each other and generate their scheduling priorities according to the shared information in a distributed manner. We also develop a novel distributed link scheduling criterion with which D2D links determine their link scheduling. By using them, we propose distributed link scheduling algorithms, QCLinQ and QC2 LinQ, which have significantly smaller signaling overhead and low computational complexity compared with the centralized optimal link scheduling algorithm. Moreover, they closely meet the QoS requirements of D2D links while achieving significant sum-rate improvement over conventional distributed algorithms.

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

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

U2 - 10.1109/TWC.2016.2616340

DO - 10.1109/TWC.2016.2616340

M3 - Review article

AN - SCOPUS:85006833563

VL - 15

SP - 8565

EP - 8579

JO - IEEE Transactions on Wireless Communications

JF - IEEE Transactions on Wireless Communications

SN - 1536-1276

IS - 12

M1 - 7587807

ER -