Show simple item record

dc.contributor.authorChen, Xiaojing
dc.contributor.authorNi, Wei
dc.contributor.authorWang, Xin
dc.contributor.authorSun, Yichuang
dc.date.accessioned2019-02-21T10:07:11Z
dc.date.available2019-02-21T10:07:11Z
dc.date.issued2016-01-19
dc.identifier.citationChen , X , Ni , W , Wang , X & Sun , Y 2016 , ' Optimal Quality-of-Service Scheduling for Energy-Harvesting Powered Wireless Communications ' , IEEE Transactions on Wireless Communications , vol. 15 , no. 5 , 7386686 , pp. 3269-3280 . https://doi.org/10.1109/TWC.2016.2519411
dc.identifier.issn1536-1276
dc.identifier.otherPURE: 10614168
dc.identifier.otherPURE UUID: 8ccda8b7-4154-4d4d-90e1-9d4f0b464fcd
dc.identifier.otherScopus: 84969849801
dc.identifier.urihttp://hdl.handle.net/2299/21127
dc.descriptionXiaojingChen, Wei Ni, Xin Wang, YichuangSun, “Optimal Quality-of-Service Scheduling for Energy-Harvesting Powered Wireless Communications”, IEEE Transactions on Wireless Communications, Vol. 15 (5): 3269-3280, January 2016. © 2016 IEEE. Personal use of this material is permitted. Permission from IEEE must be obtained for all other uses, in any current or future media, including reprinting/republishing this material for advertising or promotional purposes, creating new collective works, for resale or redistribution to servers or lists, or reuse of any copyrighted component of this work in other works.
dc.description.abstractIn this paper, a new dynamic string tautening algorithm is proposed to generate the most energy-efficient off-line schedule for delay-limited traffic of transmitters with non-negligible circuit power. The algorithm is based on two key findings that we derive through judicious convex formulation and resultant optimality conditions, specifies a set of simple but optimal rules, and generates the optimal schedule with a low complexity of O(N2) in the worst case. The proposed algorithm is also extended to on-line scenarios, where the transmit schedule is generated on-the-fly. Simulation shows that the proposed algorithm requires substantially lower average complexity by almost two orders of magnitude to retain optimality than general convex solvers. The effective transmit region, specified by the tradeoff of the data arrival rate and the energy harvesting rate, is substantially larger using our algorithm than using other existing alternatives. Significantly more data or less energy can be supported in the proposed algorithm.en
dc.format.extent12
dc.language.isoeng
dc.relation.ispartofIEEE Transactions on Wireless Communications
dc.rightsOpen
dc.subjectconvex optimization
dc.subjectEnergy harvesting
dc.subjectnon ideal circuit power
dc.subjectComputer Science Applications
dc.subjectApplied Mathematics
dc.subjectElectrical and Electronic Engineering
dc.titleOptimal Quality-of-Service Scheduling for Energy-Harvesting Powered Wireless Communicationsen
dc.contributor.institutionSmart Electronics Devices and Networks
dc.contributor.institutionRadio and Mobile Communication Systems
dc.contributor.institutionCentre for Engineering Research
dc.contributor.institutionSchool of Engineering and Technology
dc.contributor.institutionUniversity of Hertfordshire
dc.description.statusPeer reviewed
dc.identifier.urlhttp://www.scopus.com/inward/record.url?scp=84969849801&partnerID=8YFLogxK
dc.relation.schoolSchool of Engineering and Technology
dc.description.versiontypeFinal Accepted Version
dcterms.dateAccepted2016-01-19
rioxxterms.versionAM
rioxxterms.versionofrecordhttps://doi.org/10.1109/TWC.2016.2519411
rioxxterms.typeJournal Article/Review
herts.preservation.rarelyaccessedtrue
herts.rights.accesstypeOpen


Files in this item

Thumbnail

This item appears in the following Collection(s)

Show simple item record