z-logo
open-access-imgOpen Access
Survey on half‐ and full‐duplex relay based cooperative communications and its potential challenges and open issues using Markov chains
Author(s) -
Kumar Rajeev,
Hossain Ashraf
Publication year - 2019
Publication title -
iet communications
Language(s) - English
Resource type - Journals
SCImago Journal Rank - 0.355
H-Index - 62
eISSN - 1751-8636
pISSN - 1751-8628
DOI - 10.1049/iet-com.2018.5823
Subject(s) - relay , computer science , wireless , spectral efficiency , computer network , physical layer , fading , markov chain , interference (communication) , channel (broadcasting) , relay channel , telecommunications , power (physics) , physics , quantum mechanics , machine learning
In this study, the authors address a brief survey on the half‐duplex (HD) and full duplex (FD) relay based cooperative communications. Some nodes in wireless communication acting as relays can share their resource with other nodes by exploiting relaying technologies to achieve cooperative communications. Generally, the buffer‐less HD relaying (HDR) limits the performance of a wireless system when the worst condition of transmitting and receiving channels of the relay occurs. The HDR is affected by pre‐log factor one‐half that reduces the spectral‐efficiency of the wireless system. Significantly, advanced technologies in self‐interference cancellation enable the FD relaying (FDR) in the cooperative wireless system to achieve high spectral efficiency. Recently, the buffer‐aided FDR provides significant performance gains by exploring the concepts of Markov chain of queuing theory at relay as compared to either buffer‐aided or buffer‐less HDR. Finally, they outline several research challenges associated with small size, interference management, and fading channel for FDR. In addition, some research challenges remain for further investigation that is related to physical‐layer security, FDR with a cross‐layer approach and two‐way buffer‐aided FDR.

The content you want is available to Zendy users.

Already have an account? Click here to sign in.
Having issues? You can contact us here