Repository logo
  • Research Outputs
  • Researchers
  • Schools
    Felizberta Lo Padilla Tong School of Social SciencesIp Ying To Lee Yu Yee School of Humanities and LanguagesRita Tong Liu School of Business and Hospitality ManagementS.K. Yee School of Health SciencesYam Pak Charitable Foundation School of Computing and Information Sciences
  • Help
Repository logo
  1. Home
  2. Computing and Information Sciences
  3. CIS Publication
  4. Optimal rate schedules with data sharing in energy harvesting communication systems
 
  • Details

Optimal rate schedules with data sharing in energy harvesting communication systems

Author(s)
Zhao, Yingchao  
Author(s)
Wu, W.
Li, H.
Shan, F.
Date Issued
2017
Publisher
MDPI
Journal
Sensors
Volume
17
Issue
12
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.
URI
https://repository.sfu.edu.hk/handle/sfu/440
DOI
10.3390/s17122958
SFU Affiliated Publication
Yes
Availability at SFU Library

No database links found.

Responsible Use of E‑Resources | Privacy Policy | Disclaimer
© SFU Library. All Rights Reserved.
SFU Library