dc.contributor.author | Chen, Xiaojing | |
dc.contributor.author | Ni, Wei | |
dc.contributor.author | Wang, Xin | |
dc.contributor.author | Sun, Yichuang | |
dc.date.accessioned | 2019-02-21T10:07:11Z | |
dc.date.available | 2019-02-21T10:07:11Z | |
dc.date.issued | 2016-01-19 | |
dc.identifier.citation | Chen , 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.issn | 1536-1276 | |
dc.identifier.uri | http://hdl.handle.net/2299/21127 | |
dc.description | XiaojingChen, 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.abstract | In 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.extent | 12 | |
dc.format.extent | 582213 | |
dc.language.iso | eng | |
dc.relation.ispartof | IEEE Transactions on Wireless Communications | |
dc.subject | convex optimization | |
dc.subject | Energy harvesting | |
dc.subject | non ideal circuit power | |
dc.subject | Computer Science Applications | |
dc.subject | Applied Mathematics | |
dc.subject | Electrical and Electronic Engineering | |
dc.title | Optimal Quality-of-Service Scheduling for Energy-Harvesting Powered Wireless Communications | en |
dc.contributor.institution | Smart Electronics Devices and Networks | |
dc.contributor.institution | Radio and Mobile Communication Systems | |
dc.contributor.institution | Centre for Engineering Research | |
dc.contributor.institution | School of Engineering and Technology | |
dc.description.status | Peer reviewed | |
dc.identifier.url | http://www.scopus.com/inward/record.url?scp=84969849801&partnerID=8YFLogxK | |
rioxxterms.versionofrecord | 10.1109/TWC.2016.2519411 | |
rioxxterms.type | Journal Article/Review | |
herts.preservation.rarelyaccessed | true | |