Low complexity user pairing algorithm for in-band full-duplex networks with power control

Sanghwa Lee; Minho Yang; Tae Woo Kim; Dong Ku Kim

doi:10.23919/APCC.2017.8304055

Low complexity user pairing algorithm for in-band full-duplex networks with power control

Sanghwa Lee, Minho Yang, Tae Woo Kim, Dong Ku Kim

Department of Electrical and Electronic Engineering

Research output: Chapter in Book/Report/Conference proceeding › Conference contribution

Abstract

Full Duplex(FD) network is considered as efficient scheme which could service both downlink(DL) and uplink(UL) users by same resource while HD can serve only DL or UL user for each resource. By optimized user scheduling with power control, optimal spectral efficiency could be achieved but optimization problem is non-linear and complex thus it is hard to implement. Low complexity relaxed optimization problem is proposed to solve resource allocation to minimize the transmission completion time in FD network. By adopting proposed scheme, suboptimal solution can be found in linear problem with significantly lower complexity.

Original language	English
Title of host publication	2017 23rd Asia-Pacific Conference on Communications
Subtitle of host publication	Bridging the Metropolitan and the Remote, APCC 2017
Publisher	Institute of Electrical and Electronics Engineers Inc.
Pages	1-5
Number of pages	5
ISBN (Electronic)	9781740523905
DOIs	https://doi.org/10.23919/APCC.2017.8304055
Publication status	Published - 2018 Feb 27
Event	23rd Asia-Pacific Conference on Communications, APCC 2017 - Perth, Australia Duration: 2017 Dec 11 → 2017 Dec 13

Publication series

Name	2017 23rd Asia-Pacific Conference on Communications: Bridging the Metropolitan and the Remote, APCC 2017
Volume	2018-January

Other

Other	23rd Asia-Pacific Conference on Communications, APCC 2017
Country	Australia
City	Perth
Period	17/12/11 → 17/12/13

All Science Journal Classification (ASJC) codes

Computer Networks and Communications
Signal Processing

Access to Document

10.23919/APCC.2017.8304055

Fingerprint Dive into the research topics of 'Low complexity user pairing algorithm for in-band full-duplex networks with power control'. Together they form a unique fingerprint.

Cite this

Lee, S., Yang, M., Kim, T. W., & Kim, D. K. (2018). Low complexity user pairing algorithm for in-band full-duplex networks with power control. In 2017 23rd Asia-Pacific Conference on Communications: Bridging the Metropolitan and the Remote, APCC 2017 (pp. 1-5). (2017 23rd Asia-Pacific Conference on Communications: Bridging the Metropolitan and the Remote, APCC 2017; Vol. 2018-January). Institute of Electrical and Electronics Engineers Inc.. https://doi.org/10.23919/APCC.2017.8304055

Lee, Sanghwa ; Yang, Minho ; Kim, Tae Woo ; Kim, Dong Ku. / Low complexity user pairing algorithm for in-band full-duplex networks with power control. 2017 23rd Asia-Pacific Conference on Communications: Bridging the Metropolitan and the Remote, APCC 2017. Institute of Electrical and Electronics Engineers Inc., 2018. pp. 1-5 (2017 23rd Asia-Pacific Conference on Communications: Bridging the Metropolitan and the Remote, APCC 2017).

@inproceedings{387dad82898849dd8ee637ba4f2e2a0f,

title = "Low complexity user pairing algorithm for in-band full-duplex networks with power control",

abstract = "Full Duplex(FD) network is considered as efficient scheme which could service both downlink(DL) and uplink(UL) users by same resource while HD can serve only DL or UL user for each resource. By optimized user scheduling with power control, optimal spectral efficiency could be achieved but optimization problem is non-linear and complex thus it is hard to implement. Low complexity relaxed optimization problem is proposed to solve resource allocation to minimize the transmission completion time in FD network. By adopting proposed scheme, suboptimal solution can be found in linear problem with significantly lower complexity.",

author = "Sanghwa Lee and Minho Yang and Kim, {Tae Woo} and Kim, {Dong Ku}",

year = "2018",

month = feb,

day = "27",

doi = "10.23919/APCC.2017.8304055",

language = "English",

series = "2017 23rd Asia-Pacific Conference on Communications: Bridging the Metropolitan and the Remote, APCC 2017",

publisher = "Institute of Electrical and Electronics Engineers Inc.",

pages = "1--5",

booktitle = "2017 23rd Asia-Pacific Conference on Communications",

address = "United States",

note = "23rd Asia-Pacific Conference on Communications, APCC 2017 ; Conference date: 11-12-2017 Through 13-12-2017",

}

Lee, S, Yang, M, Kim, TW & Kim, DK 2018, Low complexity user pairing algorithm for in-band full-duplex networks with power control. in 2017 23rd Asia-Pacific Conference on Communications: Bridging the Metropolitan and the Remote, APCC 2017. 2017 23rd Asia-Pacific Conference on Communications: Bridging the Metropolitan and the Remote, APCC 2017, vol. 2018-January, Institute of Electrical and Electronics Engineers Inc., pp. 1-5, 23rd Asia-Pacific Conference on Communications, APCC 2017, Perth, Australia, 17/12/11. https://doi.org/10.23919/APCC.2017.8304055

Low complexity user pairing algorithm for in-band full-duplex networks with power control. / Lee, Sanghwa; Yang, Minho; Kim, Tae Woo; Kim, Dong Ku.

2017 23rd Asia-Pacific Conference on Communications: Bridging the Metropolitan and the Remote, APCC 2017. Institute of Electrical and Electronics Engineers Inc., 2018. p. 1-5 (2017 23rd Asia-Pacific Conference on Communications: Bridging the Metropolitan and the Remote, APCC 2017; Vol. 2018-January).

Research output: Chapter in Book/Report/Conference proceeding › Conference contribution

TY - GEN

T1 - Low complexity user pairing algorithm for in-band full-duplex networks with power control

AU - Lee, Sanghwa

AU - Yang, Minho

AU - Kim, Tae Woo

AU - Kim, Dong Ku

PY - 2018/2/27

Y1 - 2018/2/27

N2 - Full Duplex(FD) network is considered as efficient scheme which could service both downlink(DL) and uplink(UL) users by same resource while HD can serve only DL or UL user for each resource. By optimized user scheduling with power control, optimal spectral efficiency could be achieved but optimization problem is non-linear and complex thus it is hard to implement. Low complexity relaxed optimization problem is proposed to solve resource allocation to minimize the transmission completion time in FD network. By adopting proposed scheme, suboptimal solution can be found in linear problem with significantly lower complexity.

AB - Full Duplex(FD) network is considered as efficient scheme which could service both downlink(DL) and uplink(UL) users by same resource while HD can serve only DL or UL user for each resource. By optimized user scheduling with power control, optimal spectral efficiency could be achieved but optimization problem is non-linear and complex thus it is hard to implement. Low complexity relaxed optimization problem is proposed to solve resource allocation to minimize the transmission completion time in FD network. By adopting proposed scheme, suboptimal solution can be found in linear problem with significantly lower complexity.

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

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

U2 - 10.23919/APCC.2017.8304055

DO - 10.23919/APCC.2017.8304055

M3 - Conference contribution

AN - SCOPUS:85050601999

T3 - 2017 23rd Asia-Pacific Conference on Communications: Bridging the Metropolitan and the Remote, APCC 2017

SP - 1

EP - 5

BT - 2017 23rd Asia-Pacific Conference on Communications

PB - Institute of Electrical and Electronics Engineers Inc.

T2 - 23rd Asia-Pacific Conference on Communications, APCC 2017

Y2 - 11 December 2017 through 13 December 2017

ER -

Lee S, Yang M, Kim TW, Kim DK. Low complexity user pairing algorithm for in-band full-duplex networks with power control. In 2017 23rd Asia-Pacific Conference on Communications: Bridging the Metropolitan and the Remote, APCC 2017. Institute of Electrical and Electronics Engineers Inc. 2018. p. 1-5. (2017 23rd Asia-Pacific Conference on Communications: Bridging the Metropolitan and the Remote, APCC 2017). https://doi.org/10.23919/APCC.2017.8304055