Please use this identifier to cite or link to this item: https://repository.cihe.edu.hk/jspui/handle/cihe/440
DC FieldValueLanguage
dc.contributor.authorZhao, Yingchaoen_US
dc.contributor.otherWu, W.-
dc.contributor.otherLi, H.-
dc.contributor.otherShan, F.-
dc.date.accessioned2021-03-27T08:52:15Z-
dc.date.available2021-03-27T08:52:15Z-
dc.date.issued2017-
dc.identifier.urihttps://repository.cihe.edu.hk/jspui/handle/cihe/440-
dc.description.abstractDespite 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.en_US
dc.language.isoenen_US
dc.publisherMDPIen_US
dc.relation.ispartofSensorsen_US
dc.titleOptimal rate schedules with data sharing in energy harvesting communication systemsen_US
dc.typejournal articleen_US
dc.identifier.doi10.3390/s17122958-
dc.contributor.affiliationSchool of Computing and Information Sciencesen_US
dc.relation.issn1424-8220en_US
dc.description.volume17en_US
dc.description.issue12en_US
dc.cihe.affiliatedYes-
item.languageiso639-1en-
item.fulltextWith Fulltext-
item.openairetypejournal article-
item.grantfulltextopen-
item.openairecristypehttp://purl.org/coar/resource_type/c_6501-
item.cerifentitytypePublications-
crisitem.author.deptYam Pak Charitable Foundation School of Computing and Information Sciences-
crisitem.author.orcid0000-0001-8362-6735-
Appears in Collections:CIS Publication
Files in This Item:
File Description SizeFormat
View Online82 BHTMLView/Open
SFX Query Show simple item record

Google ScholarTM

Check

Altmetric

Altmetric


Items in DSpace are protected by copyright, with all rights reserved, unless otherwise indicated.