In this paper we investigate the secure throughput of selective decode-and-forward relaying where the legitimate transmitter has no knowledge of the instantaneous channel state information with respect to neither the legitimate receiver nor the eavesdropper. Moreover, we assume a delay-critical scenario, such as in some applications of machine- to-machine communications, so that users communicate with a finite and short blocklength. The performance of direct and selective decode- and-forward cooperative communication strategies are compared. Our results show that the optimization of the blocklength, subject to a maximum length imposed by the particular application, yields important gains in terms of the secure throughput, while cooperative communications is shown to outperform direct non- cooperative transmission.
Secure Throughput Optimization of Selective Decode-and-Forward with Finite Blocklength
2018-06-01
219140 byte
Aufsatz (Konferenz)
Elektronische Ressource
Englisch