Please use this identifier to cite or link to this item: https://ir.swu.ac.th/jspui/handle/123456789/12222
ชื่อเรื่อง: Decode-and-Forward Relaying Protocol with Optimal Degrees of Freedom for Proactively Selective Wireless Relay Networks
ผู้แต่ง: Woradit K.
Keywords: Decoding
Degrees of freedom (mechanics)
Mobile telecommunication systems
Patents and inventions
Relay control systems
Signal to noise ratio
Conventional relaying
Decode-and-forward relaying
Ergodic capacity
Outage probability
Relay selection
Relaying protocols
Time and frequencies
Wireless relay networks
Internet protocols
วันที่เผยแพร่: 2019
บทคัดย่อ: This paper proposes a new decode-and-forward relaying protocol for wireless relay networks with relay selection to maximize the end-to-end instantaneous capacity. The main idea is to optimize the degrees of freedom, which may be time, frequency, or both time and frequency, and are unoptimized in the conventional decode-and-forward relaying protocol. Without loss of generality, we focus on optimizing the time of relaying phases, namely, the source-to-relay phase, and the relay-to-destination phase. We proved that the proposed protocol always yield greater end-to-end instantaneous capacity than or equal to that of the conventional protocol, and also proved that the proposed protocol sometimes select the relay node, different from the relay node selected by the conventional protocol. The conventional and the proposed protocols are compared in terms of ergodic capacity and outage probability by computer simulations. The comparisons show that the proposed relaying protocol performs better than the conventional relaying protocol in all signal-to-noise ratio regimes. © 2019 IEEE.
URI: https://ir.swu.ac.th/jspui/handle/123456789/12222
https://www.scopus.com/inward/record.uri?eid=2-s2.0-85093685381&doi=10.1109%2fRI2C48728.2019.8999878&partnerID=40&md5=d72865f5324ee64fb3d23b7e84622507
Appears in Collections:Scopus 1983-2021

Files in This Item:
There are no files associated with this item.


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