Optimization of Rate Fairness in Multi-Pair Wireless-Powered Relaying Systems
DC Field | Value | Language |
---|---|---|
dc.contributor.author | Bui V.-P. | - |
dc.contributor.author | Nguyen V.-D. | - |
dc.contributor.author | Nguyen H.V. | - |
dc.contributor.author | Dobre O.A. | - |
dc.contributor.author | Shin O.-S. | - |
dc.date.available | 2020-03-30T08:20:07Z | - |
dc.date.created | 2020-03-30 | - |
dc.date.issued | 2020-03 | - |
dc.identifier.issn | 1089-7798 | - |
dc.identifier.uri | http://scholarworks.bwise.kr/ssu/handle/2018.sw.ssu/35769 | - |
dc.description.abstract | This letter considers a multi-pair decode-and-forward relay network where a power-splitting (PS) protocol is adopted at the energy-constrained relay to provide simultaneous wireless information and energy harvesting (EH). To achieve higher efficiency of EH, we propose a new PS-based EH architecture at the relay by incorporating an alternating current (AC) computing logic, which is employed to directly use the wirelessly harvested AC energy for computational blocks. Under a nonlinear EH circuit, our goal is to maximize the fairness of end-to-end rate among user pairs subject to power constraints, resulting in a non-convex problem. We propose an iterative algorithm to achieve a suboptimal and efficient solution to this challenging problem by leveraging the inner approximation framework. Numerical results demonstrate that the proposed algorithm outperforms the traditional direct current computing and other baseline schemes. © 1997-2012 IEEE. | - |
dc.language | 영어 | - |
dc.language.iso | en | - |
dc.publisher | Institute of Electrical and Electronics Engineers Inc. | - |
dc.relation.isPartOf | IEEE Communications Letters | - |
dc.title | Optimization of Rate Fairness in Multi-Pair Wireless-Powered Relaying Systems | - |
dc.type | Article | - |
dc.identifier.doi | 10.1109/LCOMM.2019.2960350 | - |
dc.type.rims | ART | - |
dc.identifier.bibliographicCitation | IEEE Communications Letters, v.24, no.3, pp.603 - 607 | - |
dc.description.journalClass | 1 | - |
dc.identifier.wosid | 000521175200029 | - |
dc.identifier.scopusid | 2-s2.0-85081922250 | - |
dc.citation.endPage | 607 | - |
dc.citation.number | 3 | - |
dc.citation.startPage | 603 | - |
dc.citation.title | IEEE Communications Letters | - |
dc.citation.volume | 24 | - |
dc.contributor.affiliatedAuthor | Shin O.-S. | - |
dc.type.docType | Article | - |
dc.description.isOpenAccess | N | - |
dc.subject.keywordAuthor | Inner approximation | - |
dc.subject.keywordAuthor | relay network | - |
dc.subject.keywordAuthor | simultaneous wireless information and power transfer (SWIPT) | - |
dc.subject.keywordPlus | Approximation algorithms | - |
dc.subject.keywordPlus | Computation theory | - |
dc.subject.keywordPlus | Electric impedance measurement | - |
dc.subject.keywordPlus | Energy harvesting | - |
dc.subject.keywordPlus | Energy transfer | - |
dc.subject.keywordPlus | Iterative methods | - |
dc.subject.keywordPlus | Mobile telecommunication systems | - |
dc.subject.keywordPlus | Relay control systems | - |
dc.subject.keywordPlus | Alternating current | - |
dc.subject.keywordPlus | Decode-and-forward relay | - |
dc.subject.keywordPlus | Energy-constrained | - |
dc.subject.keywordPlus | Information and power transfers | - |
dc.subject.keywordPlus | Inner approximation | - |
dc.subject.keywordPlus | Iterative algorithm | - |
dc.subject.keywordPlus | Nonconvex problem | - |
dc.subject.keywordPlus | Relay network | - |
dc.subject.keywordPlus | Wireless power transfer | - |
dc.description.journalRegisteredClass | scie | - |
dc.description.journalRegisteredClass | scopus | - |
Items in ScholarWorks are protected by copyright, with all rights reserved, unless otherwise indicated.
Soongsil University Library 369 Sangdo-Ro, Dongjak-Gu, Seoul, Korea (06978)02-820-0733
COPYRIGHT ⓒ SOONGSIL UNIVERSITY, ALL RIGHTS RESERVED.
Certain data included herein are derived from the © Web of Science of Clarivate Analytics. All rights reserved.
You may not copy or re-distribute this material in whole or in part without the prior written consent of Clarivate Analytics.