Distributed Matching Algorithms: Maximizing Secrecy in the Presence of Untrusted Relay
Loading...
Date
2017-06
ORCID
Advisor
Referee
Mark
Journal Title
Journal ISSN
Volume Title
Publisher
Společnost pro radioelektronické inženýrství
Altmetrics
Abstract
In this paper, we propose a secrecy sum-rate maximization based matching algorithm between primary transmitters and secondary cooperative jammers in the presence of an eavesdropper. More explicitly, we consider an untrusted relay scenario, where the relay is a potential eavesdropper. We first show the achievable secrecy regions employing a friendly jammer in a cooperative scenario with employing an untrusted relay. Then, we provide results for the secrecy regions for two scenarios, where in the first case we consider no direct transmission between the source and the destination, while in the second case we include a source to destination direct link in our communication system. Furthermore, a friendly jammer helps to send a noise signal during the first phase of the cooperative transmission, for securing the information transmitted from the source. In our matching algorithm, the selected cooperative jammer or the secondary user, is rewarded with the spectrum allocation for a fraction of time slot from the source which is the primary user. The Conventional Distributed Algorithm (CDA) and the Pragmatic Distributed Algorithm (PDA), which were originally designed for maximising the user’s sum rate, are modified and adapted for maximizing the secrecy sum-rate for the primary user. Instead of assuming perfect modulation and/or perfect channel coding, we have also investigated our proposed schemes when practical channel coding and modulation schemes are invoked.
Description
Citation
Radioengineering. 2017 vol. 26, č. 2, s. 601-610. ISSN 1210-2512
https://www.radioeng.cz/fulltexts/2017/17_02_0601_0610.pdf
https://www.radioeng.cz/fulltexts/2017/17_02_0601_0610.pdf
Document type
Peer-reviewed
Document version
Published version
Date of access to the full text
Language of document
en