Opportunistic scheduling and incentive mechanism for OFDMA networks with D2D relaying

Jee Hun Song, Hee Tae Roh, Jang Won Lee

Research output: Contribution to journalArticle

3 Citations (Scopus)

Abstract

The device-to-device (D2D) relaying is considered one of promising technologies to improve the spectral efficiency and extend the coverage of the cellular system with low additional costs. In the system with D2D relaying, some of user equipments (UEs) can act as relay stations (RSs) that forward other UEs' data from/to the base station (BS). Compared with the RS, the D2D relaying has several advantages such as low deployment costs and high flexibility. We study an opportunistic subchannel scheduling problem in the OFDMA cellular network with D2D relaying in this paper. We formulate a stochastic optimization problem to maximize the sum-rate of the system with D2D relaying while satisfying the minimum average data rate requirement for each UE, and then develop an opportunistic scheduling algorithm by solving it. Due to a high computational complexity of the optimal scheduling algorithm, we also propose a heuristic algorithm with a lower computational complexity. In addition, since UEs that participate in D2D relaying sacrifice their resources to relay other UEs' data, we also study incentive mechanisms to compensate their sacrifices. Through simulation results, we show the performance of our algorithms and the effects of our incentive mechanisms.

Original languageEnglish
Pages (from-to)772-787
Number of pages16
JournalComputer Networks
Volume91
DOIs
Publication statusPublished - 2015 Nov 14

Fingerprint

Scheduling
Scheduling algorithms
Computational complexity
Heuristic algorithms
Base stations
Costs

All Science Journal Classification (ASJC) codes

  • Computer Networks and Communications

Cite this

@article{2f3e8a6b507941ef9921fd3aa3c6f702,
title = "Opportunistic scheduling and incentive mechanism for OFDMA networks with D2D relaying",
abstract = "The device-to-device (D2D) relaying is considered one of promising technologies to improve the spectral efficiency and extend the coverage of the cellular system with low additional costs. In the system with D2D relaying, some of user equipments (UEs) can act as relay stations (RSs) that forward other UEs' data from/to the base station (BS). Compared with the RS, the D2D relaying has several advantages such as low deployment costs and high flexibility. We study an opportunistic subchannel scheduling problem in the OFDMA cellular network with D2D relaying in this paper. We formulate a stochastic optimization problem to maximize the sum-rate of the system with D2D relaying while satisfying the minimum average data rate requirement for each UE, and then develop an opportunistic scheduling algorithm by solving it. Due to a high computational complexity of the optimal scheduling algorithm, we also propose a heuristic algorithm with a lower computational complexity. In addition, since UEs that participate in D2D relaying sacrifice their resources to relay other UEs' data, we also study incentive mechanisms to compensate their sacrifices. Through simulation results, we show the performance of our algorithms and the effects of our incentive mechanisms.",
author = "Song, {Jee Hun} and Roh, {Hee Tae} and Lee, {Jang Won}",
year = "2015",
month = "11",
day = "14",
doi = "10.1016/j.comnet.2015.08.045",
language = "English",
volume = "91",
pages = "772--787",
journal = "Computer Networks",
issn = "1389-1286",
publisher = "Elsevier",

}

Opportunistic scheduling and incentive mechanism for OFDMA networks with D2D relaying. / Song, Jee Hun; Roh, Hee Tae; Lee, Jang Won.

In: Computer Networks, Vol. 91, 14.11.2015, p. 772-787.

Research output: Contribution to journalArticle

TY - JOUR

T1 - Opportunistic scheduling and incentive mechanism for OFDMA networks with D2D relaying

AU - Song, Jee Hun

AU - Roh, Hee Tae

AU - Lee, Jang Won

PY - 2015/11/14

Y1 - 2015/11/14

N2 - The device-to-device (D2D) relaying is considered one of promising technologies to improve the spectral efficiency and extend the coverage of the cellular system with low additional costs. In the system with D2D relaying, some of user equipments (UEs) can act as relay stations (RSs) that forward other UEs' data from/to the base station (BS). Compared with the RS, the D2D relaying has several advantages such as low deployment costs and high flexibility. We study an opportunistic subchannel scheduling problem in the OFDMA cellular network with D2D relaying in this paper. We formulate a stochastic optimization problem to maximize the sum-rate of the system with D2D relaying while satisfying the minimum average data rate requirement for each UE, and then develop an opportunistic scheduling algorithm by solving it. Due to a high computational complexity of the optimal scheduling algorithm, we also propose a heuristic algorithm with a lower computational complexity. In addition, since UEs that participate in D2D relaying sacrifice their resources to relay other UEs' data, we also study incentive mechanisms to compensate their sacrifices. Through simulation results, we show the performance of our algorithms and the effects of our incentive mechanisms.

AB - The device-to-device (D2D) relaying is considered one of promising technologies to improve the spectral efficiency and extend the coverage of the cellular system with low additional costs. In the system with D2D relaying, some of user equipments (UEs) can act as relay stations (RSs) that forward other UEs' data from/to the base station (BS). Compared with the RS, the D2D relaying has several advantages such as low deployment costs and high flexibility. We study an opportunistic subchannel scheduling problem in the OFDMA cellular network with D2D relaying in this paper. We formulate a stochastic optimization problem to maximize the sum-rate of the system with D2D relaying while satisfying the minimum average data rate requirement for each UE, and then develop an opportunistic scheduling algorithm by solving it. Due to a high computational complexity of the optimal scheduling algorithm, we also propose a heuristic algorithm with a lower computational complexity. In addition, since UEs that participate in D2D relaying sacrifice their resources to relay other UEs' data, we also study incentive mechanisms to compensate their sacrifices. Through simulation results, we show the performance of our algorithms and the effects of our incentive mechanisms.

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

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

U2 - 10.1016/j.comnet.2015.08.045

DO - 10.1016/j.comnet.2015.08.045

M3 - Article

AN - SCOPUS:84943652671

VL - 91

SP - 772

EP - 787

JO - Computer Networks

JF - Computer Networks

SN - 1389-1286

ER -