Optimal throughput of time power switching relaying protocol with imperfect channel state information
Identifikátory výsledku
Kód výsledku v IS VaVaI
<a href="https://www.isvavai.cz/riv?ss=detail&h=RIV%2F61989100%3A27240%2F17%3A10236477" target="_blank" >RIV/61989100:27240/17:10236477 - isvavai.cz</a>
Nalezeny alternativní kódy
RIV/61989100:27740/17:10236477
Výsledek na webu
<a href="https://www.taylorfrancis.com/books/e/9781498779456/chapters/10.1201%2F9781315375083-40" target="_blank" >https://www.taylorfrancis.com/books/e/9781498779456/chapters/10.1201%2F9781315375083-40</a>
DOI - Digital Object Identifier
—
Alternativní jazyky
Jazyk výsledku
angličtina
Název v původním jazyce
Optimal throughput of time power switching relaying protocol with imperfect channel state information
Popis výsledku v původním jazyce
There are a lot of analysis on Wireless Powered Communication Networks (WPCN) that has become research tendency for 5th generation networks. It helps wireless devices to enhance battery life and reliability. In this paper, we illustrate two transmission modes that are delay-tolerant and delay-limited which look after two functions of wireless data and power transfer. We also depict the optimal tradeoff into minimum outage probability or maximum throughput that is produced by an energy harvesting plan. However, the change of energy harvesting can remarkably rely on the correctness of the channel estimation algorithm that is used for data and energy transfer. In addition, we present the throughput and outage probability during a WPCN. Finally, this paper analyzes the Time Power Switching Relaying (TPSR) schemes performance of the dedication of power sources that the ergodic capacity and delay-limited capacity might be maximized. The results in numerical analysis show the accuracy of the derivative of expressions, giving the design insights into WPCNs and depicts the importance of optimal throughput during a huge amount of channel estimation error.
Název v anglickém jazyce
Optimal throughput of time power switching relaying protocol with imperfect channel state information
Popis výsledku anglicky
There are a lot of analysis on Wireless Powered Communication Networks (WPCN) that has become research tendency for 5th generation networks. It helps wireless devices to enhance battery life and reliability. In this paper, we illustrate two transmission modes that are delay-tolerant and delay-limited which look after two functions of wireless data and power transfer. We also depict the optimal tradeoff into minimum outage probability or maximum throughput that is produced by an energy harvesting plan. However, the change of energy harvesting can remarkably rely on the correctness of the channel estimation algorithm that is used for data and energy transfer. In addition, we present the throughput and outage probability during a WPCN. Finally, this paper analyzes the Time Power Switching Relaying (TPSR) schemes performance of the dedication of power sources that the ergodic capacity and delay-limited capacity might be maximized. The results in numerical analysis show the accuracy of the derivative of expressions, giving the design insights into WPCNs and depicts the importance of optimal throughput during a huge amount of channel estimation error.
Klasifikace
Druh
D - Stať ve sborníku
CEP obor
—
OECD FORD obor
20203 - Telecommunications
Návaznosti výsledku
Projekt
—
Návaznosti
S - Specificky vyzkum na vysokych skolach
Ostatní
Rok uplatnění
2017
Kód důvěrnosti údajů
S - Úplné a pravdivé údaje o projektu nepodléhají ochraně podle zvláštních právních předpisů
Údaje specifické pro druh výsledku
Název statě ve sborníku
Communication, Management and Information Technology - Proceedings of the International Conference on Communication, Management and Information Technology, ICCMIT 2016
ISBN
978-1-315-37508-3
ISSN
—
e-ISSN
neuvedeno
Počet stran výsledku
8
Strana od-do
261-268
Název nakladatele
CRC Press
Místo vydání
Leiden
Místo konání akce
Cosenza
Datum konání akce
26. 4. 2016
Typ akce podle státní příslušnosti
WRD - Celosvětová akce
Kód UT WoS článku
—