Resource allocation for two-hop communication with energy harvesting constraints

Baljon, Mohammed; Zhao, Lian

doi:10.1109/wcsp.2015.7341142

Cited by 4 publications

(9 citation statements)

References 8 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…In this section, we provide simulation results to evaluate the performance of the proposed offline and online resource allocation algorithms for both delay-tolerant and delay-limited networks. We set our parameter val- ues as the same as [13]. We consider a band-limited fading channel in the source-relay link and additive white Gaussian noise channel in the relay-destination link, with bandwidth (BW )= 1MHz and noise power spectral density N 0 = 10 −19 W/Hz.…”

Section: Simulation Resultsmentioning

confidence: 99%

“…In [12], throughput maximization problem for the two-hop communication system in case of an EH source with two energy arrivals has been solved using cumulative curve algorithm. In [13], a Recursive Geometric Water-Filling (RGWF) algorithm, which is used to obtain optimum power allocation for a single-hop transmission, was adopted to gain an efficient transmission policy for a two-hop communication with EH Source (EH-S) and conventional Non-EH Relay (NEH-R) over a fading channel for a delay-limited network.…”

mentioning

confidence: 99%

“…In this paper, we investigate optimal and suboptimal transmission policy of the same system model in [13] for DL relaying network as well as DT relaying network under deterministic (offline) and online setting based on RGWF algorithm. By comparing our work with the existing results, the contributions of this work are summarized as follows: • We present novel solutions to tackle the throughput maximization problem for the system model with EH-S and half-duplex NEH-R network over a fading channel, which has not been considered in the literature.…”

mentioning

confidence: 99%

See 2 more Smart Citations

Resource Allocation for Wireless Networks with Energy Harvesting Constraints Over Fading Channels

Baljon¹,

Zhao²

2016

JST

Self Cite

View full text Add to dashboard Cite

This research work considers the utilize of energy harvesters, instead of conventional time-invariant energy sources, in wireless communication. For the purpose of exposition, we study the traditional two-hop communication system for delay limited (DL) and delay tolerant (DT) relaying networks over fading channels, in which the source node transmits with power drawn from energy harvesting (EH) sources and the relay transmits with conventional non-EH sources. We address the throughput maximization problem for the proposed system model for DL and DT cases. We find that the optimal power allocation algorithm for the single-hop communication system with EH constraints, namely, recursive geometric water-filling (RGWF), can be utilized as a guideline for the design of the two-hop system. We first introduce RGWF algorithm and we show the advantages of the geometric approach in eliminating the complexity of the Karush-Kuhn-Tucker (KKT) condition as well as providing a closed-form and exact solutions to the proposed problem. Based on the RGWF algorithm, we propose offline joint power allocation and transmission time scheduling schemes for DL relaying network and DT relaying network. We also propose efficient online resource allocation schemes for both relays' cases. The performance of the proposed schemes is evaluated via simulation and the results demonstrate that a network with delay tolerant ability provides better performance in term of throughput.

show abstract

Section: Simulation Resultsmentioning

confidence: 99%

mentioning

confidence: 99%

mentioning

confidence: 99%

See 1 more Smart Citation

Resource Allocation for Wireless Networks with Energy Harvesting Constraints Over Fading Channels

Baljon¹,

Zhao²

2016

JST

Self Cite

View full text Add to dashboard Cite

show abstract

“…In [82], a Recursive Geometric Water-Filling (RGWF) algorithm, which is used to obtain optimum power allocation for a single-hop transmission, was adopted to gain an efficient transmission policy for a two-hop communication with EH Source (EH-S) and conventional Non-EH Relay (NEH-R) over a fading channel for a delay-limited network.…”

Section: Chapter 3 Resource Allocation For Two-hop Communication With Energy Harvesting Constraints Over Fading Channelsmentioning

confidence: 99%

“…Parts of Chapter 3 are presented at the IEEE International Conference on Wireless Communications Signal Processing (WCSP) in Nanjing, China [82], and published in the Journal Issue on Information and Communication Technology [83].…”

Section: Introductionmentioning

confidence: 99%

Resource Allocation for Energy Harvesting Communication Systems over Fading Channels

Baljon¹

2021

Preprint

View full text Add to dashboard Cite

Energy Harvesting (EH) is an emerging communications paradigm to defeat the limitation of network longevity by recharging the nodes by harvesting energy from the environment. The Energy Harvesting Network (EHN) requires a stable and efficient power control scheme like other conventional communication systems. It is more complicated than conventional communication networks, in that it should not only consider the quality of service requirements of the network but also adapt to the randomness of the energy arrival. In this thesis, several optimal offline and online resource allocation strategies for point-to-point and two-hop EH communication networks over wireless fading channels are investigated. As a first step, the RGWF (Recursive Geometric Water-filling) algorithm is introduced, which provides an optimal offline transmission policy for a point-to-point EH communication system. Next, a network composed of a source, a relay, and a destination, where the source is an EH node is considered. Joint time scheduling and power allocation problems are formulated to maximize the network throughput by considering conventional and bufferaided link adaptive relaying protocols. Based on the modified RGWF algorithm, the joint power allocation and transmission time scheduling problem are decoupled, and efficient offline schemes are proposed for a two-hop wireless network for delay-tolerant and delay sensitive applications. In the second part, the aim is to obtain the optimal transmission policy that maximizes the average total throughput of a point-to-point EH communication system with low and high data arrival rate in an online manner. The solution is obtained using dynamic programming by casting the proposed problem as a semi-Markov decision process (SMDP). In a delay-tolerant approach with high data rate, a cross-layer adaptation is considered, where the proposed policy chooses modulation constellation for EH networks dynamically, depending on battery state, data buffer state in addition to channel state. The proposed SMDP-based dynamic programming approach has proven to be dynamically adaptive to the change of the channel and/or buffer states that optimally satisfy the BER requirements at the physical layer, and the overflow requirements at the data-link layer.

show abstract

SMDP-Based Resource Allocation for Wireless Networks with Energy Harvesting Constraints

Baljon

Liang

et al. 2017

2017 IEEE 86th Vehicular Technology Conference (VTC-Fall)

View full text Add to dashboard Cite

Resource allocation for two-hop communication with energy harvesting constraints

Cited by 4 publications

References 8 publications

Resource Allocation for Wireless Networks with Energy Harvesting Constraints Over Fading Channels

Resource Allocation for Wireless Networks with Energy Harvesting Constraints Over Fading Channels

Resource Allocation for Energy Harvesting Communication Systems over Fading Channels

SMDP-Based Resource Allocation for Wireless Networks with Energy Harvesting Constraints

Contact Info

Product

Resources

About