Energy-Efficient Routing and Link Adaptation for Two-Dimensional Wireless Relay Networks in the Wideband Regime

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

Research output: Contribution to journalArticle

2 Citations (Scopus)

Abstract

We discuss the globally optimal energy-efficient design of a two-dimensional 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 languageEnglish
JournalIEEE Transactions on Wireless Communications
DOIs
Publication statusAccepted/In press - 2018 Aug 28

Fingerprint

Link Adaptation
Relay Networks
Energy Efficient
Telecommunication links
Wireless Networks
Routing
Exhaustive Search
Energy Efficiency
Energy efficiency
Energy Saving
Routing Protocol
Routing protocols
Low Complexity
Relay
Energy conservation
Global Optimality
Minimal Energy
Fading Channels
Fading channels
Power Consumption

All Science Journal Classification (ASJC) codes

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

Cite this

@article{238a9a679bff4bfb97c4843803047bec,
title = "Energy-Efficient Routing and Link Adaptation for Two-Dimensional Wireless Relay Networks in the Wideband Regime",
abstract = "We discuss the globally optimal energy-efficient design of a two-dimensional 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",
year = "2018",
month = "8",
day = "28",
doi = "10.1109/TWC.2018.2866422",
language = "English",
journal = "IEEE Transactions on Wireless Communications",
issn = "1536-1276",
publisher = "Institute of Electrical and Electronics Engineers Inc.",

}

Energy-Efficient Routing and Link Adaptation for Two-Dimensional Wireless Relay Networks in the Wideband Regime. / Kwon, Younggap; Park, Hyunsung; Oh, Jintaek; Miao, Guowang; Hwang, Taewon.

In: IEEE Transactions on Wireless Communications, 28.08.2018.

Research output: Contribution to journalArticle

TY - JOUR

T1 - Energy-Efficient Routing and Link Adaptation for Two-Dimensional Wireless Relay Networks in the Wideband Regime

AU - Kwon, Younggap

AU - Park, Hyunsung

AU - Oh, Jintaek

AU - Miao, Guowang

AU - Hwang, Taewon

PY - 2018/8/28

Y1 - 2018/8/28

N2 - We discuss the globally optimal energy-efficient design of a two-dimensional 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 two-dimensional 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

JO - IEEE Transactions on Wireless Communications

JF - IEEE Transactions on Wireless Communications

SN - 1536-1276

ER -