Energy-efficient routing and link adaptation for 2d wireless relay networks in the wideband regime

Younggap Kwon; Hyunsung Park; Jintaek Oh; Guowang Miao; Taewon Hwang

doi:10.1109/TWC.2018.2866422

Energy-efficient routing and link adaptation for 2d wireless relay networks in the wideband regime

Younggap Kwon, Hyunsung Park, Jintaek Oh, Guowang Miao, Taewon Hwang

Department of Electrical and Electronic Engineering

Research output: Contribution to journal › Article › peer-review

4 Citations (Scopus)

Abstract

We discuss the globally optimal energy-efficient design of a 2D relay network. Different from the existing routing protocols on energy saving, which finds the minimal energy route for a given data rate, the proposed algorithm jointly optimizes routing and data rate to maximize energy efficiency (EE) defined as the achievable data rate per power consumption. We propose a low-complexity algorithm to circumvent the huge complexity of the exhaustive search for the network EE maximization and prove its global optimality. Moreover, the proposed algorithm is implemented in a distributed fashion because each relay needs to send its routing information only to the relays in its adjacent tiers, which significantly reduces the signaling overhead of the centralized implementation. Our analysis on the worst-case complexity in a fading channel shows that the complexity of the proposed algorithm increases linearly while that of the exhaustive search increases exponentially as the tier index increases. Simulation results confirm that the proposed algorithm outperforms the existing routing protocols on energy saving and achieves the globally optimal network EE at a significantly lower complexity than the exhaustive search.

Original language	English
Article number	8449330
Pages (from-to)	7325-7339
Number of pages	15
Journal	IEEE Transactions on Wireless Communications
Volume	17
Issue number	11
DOIs	https://doi.org/10.1109/TWC.2018.2866422
Publication status	Published - 2018 Nov

Bibliographical note

Funding Information:
Manuscript received April 5, 2017; revised September 29, 2017 and March 12, 2018; accepted August 9, 2018. Date of publication August 28, 2018; date of current version November 9, 2018. This work was supported by the Basic Science Research Program through the National Research Foundation of Korea through the Ministry of Education under Grant 2016R1D1A1A09916968. The associate editor coordinating the review of this paper and approving it for publication was N. Prasad. (Corresponding author: Taewon Hwang.) Y. Kwon was with the School of Electrical and Electronic Engineering, Yonsei University, Seoul 120-749, South Korea. He is now with the Agency for Defense Development, Daejeon 305-600, South Korea (e-mail: thinggap@ yonsei.ac.kr).

Publisher Copyright:
© 2002-2012 IEEE.

All Science Journal Classification (ASJC) codes

Computer Science Applications
Electrical and Electronic Engineering
Applied Mathematics

UN SDGs

This output contributes to the following UN Sustainable Development Goals (SDGs)

Access to Document

10.1109/TWC.2018.2866422

Cite this

@article{238a9a679bff4bfb97c4843803047bec,

title = "Energy-efficient routing and link adaptation for 2d wireless relay networks in the wideband regime",

abstract = "We discuss the globally optimal energy-efficient design of a 2D relay network. Different from the existing routing protocols on energy saving, which finds the minimal energy route for a given data rate, the proposed algorithm jointly optimizes routing and data rate to maximize energy efficiency (EE) defined as the achievable data rate per power consumption. We propose a low-complexity algorithm to circumvent the huge complexity of the exhaustive search for the network EE maximization and prove its global optimality. Moreover, the proposed algorithm is implemented in a distributed fashion because each relay needs to send its routing information only to the relays in its adjacent tiers, which significantly reduces the signaling overhead of the centralized implementation. Our analysis on the worst-case complexity in a fading channel shows that the complexity of the proposed algorithm increases linearly while that of the exhaustive search increases exponentially as the tier index increases. Simulation results confirm that the proposed algorithm outperforms the existing routing protocols on energy saving and achieves the globally optimal network EE at a significantly lower complexity than the exhaustive search.",

author = "Younggap Kwon and Hyunsung Park and Jintaek Oh and Guowang Miao and Taewon Hwang",

note = "Funding Information: Manuscript received April 5, 2017; revised September 29, 2017 and March 12, 2018; accepted August 9, 2018. Date of publication August 28, 2018; date of current version November 9, 2018. This work was supported by the Basic Science Research Program through the National Research Foundation of Korea through the Ministry of Education under Grant 2016R1D1A1A09916968. The associate editor coordinating the review of this paper and approving it for publication was N. Prasad. (Corresponding author: Taewon Hwang.) Y. Kwon was with the School of Electrical and Electronic Engineering, Yonsei University, Seoul 120-749, South Korea. He is now with the Agency for Defense Development, Daejeon 305-600, South Korea (e-mail: thinggap@ yonsei.ac.kr). Publisher Copyright: {\textcopyright} 2002-2012 IEEE.",

year = "2018",

month = nov,

doi = "10.1109/TWC.2018.2866422",

language = "English",

volume = "17",

pages = "7325--7339",

journal = "IEEE Transactions on Wireless Communications",

issn = "1536-1276",

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

number = "11",

}

TY - JOUR

T1 - Energy-efficient routing and link adaptation for 2d wireless relay networks in the wideband regime

AU - Kwon, Younggap

AU - Park, Hyunsung

AU - Oh, Jintaek

AU - Miao, Guowang

AU - Hwang, Taewon

N1 - Funding Information: Manuscript received April 5, 2017; revised September 29, 2017 and March 12, 2018; accepted August 9, 2018. Date of publication August 28, 2018; date of current version November 9, 2018. This work was supported by the Basic Science Research Program through the National Research Foundation of Korea through the Ministry of Education under Grant 2016R1D1A1A09916968. The associate editor coordinating the review of this paper and approving it for publication was N. Prasad. (Corresponding author: Taewon Hwang.) Y. Kwon was with the School of Electrical and Electronic Engineering, Yonsei University, Seoul 120-749, South Korea. He is now with the Agency for Defense Development, Daejeon 305-600, South Korea (e-mail: thinggap@ yonsei.ac.kr). Publisher Copyright: © 2002-2012 IEEE.

PY - 2018/11

Y1 - 2018/11

N2 - We discuss the globally optimal energy-efficient design of a 2D relay network. Different from the existing routing protocols on energy saving, which finds the minimal energy route for a given data rate, the proposed algorithm jointly optimizes routing and data rate to maximize energy efficiency (EE) defined as the achievable data rate per power consumption. We propose a low-complexity algorithm to circumvent the huge complexity of the exhaustive search for the network EE maximization and prove its global optimality. Moreover, the proposed algorithm is implemented in a distributed fashion because each relay needs to send its routing information only to the relays in its adjacent tiers, which significantly reduces the signaling overhead of the centralized implementation. Our analysis on the worst-case complexity in a fading channel shows that the complexity of the proposed algorithm increases linearly while that of the exhaustive search increases exponentially as the tier index increases. Simulation results confirm that the proposed algorithm outperforms the existing routing protocols on energy saving and achieves the globally optimal network EE at a significantly lower complexity than the exhaustive search.

AB - We discuss the globally optimal energy-efficient design of a 2D relay network. Different from the existing routing protocols on energy saving, which finds the minimal energy route for a given data rate, the proposed algorithm jointly optimizes routing and data rate to maximize energy efficiency (EE) defined as the achievable data rate per power consumption. We propose a low-complexity algorithm to circumvent the huge complexity of the exhaustive search for the network EE maximization and prove its global optimality. Moreover, the proposed algorithm is implemented in a distributed fashion because each relay needs to send its routing information only to the relays in its adjacent tiers, which significantly reduces the signaling overhead of the centralized implementation. Our analysis on the worst-case complexity in a fading channel shows that the complexity of the proposed algorithm increases linearly while that of the exhaustive search increases exponentially as the tier index increases. Simulation results confirm that the proposed algorithm outperforms the existing routing protocols on energy saving and achieves the globally optimal network EE at a significantly lower complexity than the exhaustive search.

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

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

U2 - 10.1109/TWC.2018.2866422

DO - 10.1109/TWC.2018.2866422

M3 - Article

AN - SCOPUS:85052649060

VL - 17

SP - 7325

EP - 7339

JO - IEEE Transactions on Wireless Communications

JF - IEEE Transactions on Wireless Communications

SN - 1536-1276

IS - 11

M1 - 8449330

ER -

Energy-efficient routing and link adaptation for 2d wireless relay networks in the wideband regime

Abstract

Bibliographical note

All Science Journal Classification (ASJC) codes

UN SDGs

Access to Document

Other files and links

Fingerprint

Cite this