Abstract

Despite the abundant research on energy-efficient rate scheduling polices in energy harvesting communication systems, few works have exploited data sharing among multiple applications to further enhance the energy utilization efficiency, considering that the harvested energy from environments is limited and unstable. In this paper, to overcome the energy shortage of wireless devices at transmitting data to a platform running multiple applications/requesters, we design rate scheduling policies to respond to data requests as soon as possible by encouraging data sharing among data requests and reducing the redundancy. We formulate the problem as a transmission completion time minimization problem under constraints of dynamical data requests and energy arrivals. We develop offline and online algorithms to solve this problem. For the offline setting, we discover the relationship between two problems: the completion time minimization problem and the energy consumption minimization problem with a given completion time. We first derive the optimal algorithm for the min-energy problem and then adopt it as a building block to compute the optimal solution for the min-completion-time problem. For the online setting without future information, we develop an event-driven online algorithm to complete the transmission as soon as possible. Simulation results validate the efficiency of the proposed algorithm.

Highlights

  • Energy harvesting from environments has been explored and implemented as an alternative to supplement or even replace batteries in modern wireless communication systems [1]

  • We investigate the optimal rate scheduling policies by exploiting the data sharing for energy harvesting communication devices so as to transmit the required data of requests with the minimum completion time

  • Yang et al are among the first group to develop packet transmission policies that take into account the dynamic arrivals of data packets in energy harvesting communication systems [15,16]

Read more

Summary

Introduction

Energy harvesting from environments has been explored and implemented as an alternative to supplement or even replace batteries in modern wireless communication systems [1]. The remaining data amount of request J1 is satisfied by transmitting 2x sensed data in time interval [τ + 1, 2τ ] This schedule reduces the completion time by exploiting data sharing, it is not the optimal one. We investigate the optimal rate scheduling policies by exploiting the data sharing for energy harvesting communication devices so as to transmit the required data of requests with the minimum completion time. This paper introduces a rate scheduling problem for energy harvesting wireless devices that transmit required data of requests with the goal of minimizing the completion time.

Rate-Adaptive Transmission
Data Sharing
System Model
Problem Formulation
Overview of Our Solutions
Min-Energy Rate Schedule under a Given Deadline
Basic Properties of Optimal Rate Schedule
Problem Decomposition
The Bottleneck-Select Algorithm
Optimal Rate Schedule for Min-T Problem
Online Rate Schedule
Simulations
Conclusions
Full Text
Published version (Free)

Talk to us

Join us for a 30 min session where you can share your feedback and ask us any queries you have

Schedule a call