Distributed Matching Algorithms: Maximizing Secrecy in the Presence of Untrusted Relay

Simple item page
dc.contributor.authorAli, Bakhtiar
dc.contributor.authorZamir, Nida
dc.contributor.authorNg, Soon Xin
dc.contributor.authorButt, Muhammad Fasih Uddin
dc.coverage.issue2cs
dc.coverage.volume26cs
dc.date.accessioned2017-07-25T08:20:37Z
dc.date.available2017-07-25T08:20:37Z
dc.date.issued2017-06cs
dc.description.abstractIn 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.en
dc.formattextcs
dc.format.extent601-610cs
dc.format.mimetypeapplication/pdfen
dc.identifier.citationRadioengineering. 2017 vol. 26, č. 2, s. 601-610. ISSN 1210-2512cs
dc.identifier.doi10.13164/re.2017.0601en
dc.identifier.issn1210-2512
dc.identifier.urihttp://hdl.handle.net/11012/69277
dc.language.isoencs
dc.publisherSpolečnost pro radioelektronické inženýrstvícs
dc.relation.ispartofRadioengineeringcs
dc.relation.urihttps://www.radioeng.cz/fulltexts/2017/17_02_0601_0610.pdfcs
dc.rightsCreative Commons Attribution 4.0 International Licenseen
dc.rights.accessopenAccessen
dc.rights.urihttp://creativecommons.org/licenses/by/4.0/en
dc.subjectPhysical Layer Securityen
dc.subjectSpectrum Matchingen
dc.subjectGame Theoryen
dc.subjectSpectrum Sharingen
dc.subjectCognitive Radio Networks.en
dc.titleDistributed Matching Algorithms: Maximizing Secrecy in the Presence of Untrusted Relayen
dc.type.driverarticleen
dc.type.statusPeer-revieweden
dc.type.versionpublishedVersionen
eprints.affiliatedInstitution.facultyFakulta eletrotechniky a komunikačních technologiícs
Files
Original bundle
Now showing 1 - 1 of 1
Thumbnail Image
Name:
17_02_0601_0610.pdf
Size:
1.62 MB
Format:
Adobe Portable Document Format
Description:
Download
Collections
2017/2