Premium
Tight upper bounds on average detection probability in cooperative relay networks with selection combiner
Author(s) -
Mughal M.O.,
Razi A.,
Kim J.M.
Publication year - 2015
Publication title -
transactions on emerging telecommunications technologies
Language(s) - English
Resource type - Journals
SCImago Journal Rank - 0.366
H-Index - 47
ISSN - 2161-3915
DOI - 10.1002/ett.2649
Subject(s) - relay , selection (genetic algorithm) , probability density function , series (stratigraphy) , detector , computer science , function (biology) , upper and lower bounds , representation (politics) , energy (signal processing) , cognitive radio , mathematics , outage probability , algorithm , statistics , telecommunications , artificial intelligence , fading , wireless , power (physics) , mathematical analysis , physics , law , biology , paleontology , quantum mechanics , evolutionary biology , political science , politics , decoding methods
Abstract In this study, the detection probability for amplify–forward‐based cooperative relay networks, where the destination is equipped with a selection combiner and energy detector, is analysed. The probability density function method and an alternative series representation of the generalized Marcum‐Q function are used to obtain two upper bounds for the average detection probability. The error bounds resulting from truncating an infinite summation series to finite terms are also calculated because the derived expressions were in the form of an infinite summation series. Finally, the analysis are validated by simulations. These results are expected to assist in future studies of communication technologies, such as cognitive radios. Copyright © 2013 John Wiley & Sons, Ltd.