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

Radioengineering - Czech Republic
doi 10.13164/re.2017.0601
Full Text
Abstract

Available in full text

Date
Authors
Publisher

Brno University of Technology

Related search

Secrecy in Untrusted Networks

Lecture Notes in Computer Science
Computer ScienceTheoretical Computer Science
2003English

Robust Destination Jamming Aided Secrecy Precoding for an AF MIMO Untrusted Relay System

Wireless Communications and Mobile Computing
Computer NetworksElectronic EngineeringInformation SystemsElectricalCommunications
2019English

On the Support of Matching Algorithms

Statistics and Probability Letters
UncertaintyStatisticsProbability
2017English

Maximizing Physical Layer Security in Relay-Assisted Multi-Carrier NOMA Transmission

Internet Technology Letters
2018English

Maximizing and Matching on Concurrent Ratio Schedules1

Journal of the Experimental Analysis of Behavior
Behavioral NeuroscienceExperimentalCognitive Psychology
1975English

Maximizing Rigidity: Optimal Matching Under Scaled-Orthography

Lecture Notes in Computer Science
Computer ScienceTheoretical Computer Science
2002English

Secrecy Outage Analysis for Cooperative NOMA Systems With Relay Selection Schemes

IEEE Transactions on Communications
Electronic EngineeringElectrical
2019English

Cancelable Biometrics With Perfect Secrecy for Correlation-Based Matching

Lecture Notes in Computer Science
Computer ScienceTheoretical Computer Science
2009English

Enhance the Efficiency of Heuristic Algorithms for Maximizing the modularityQ

Europhysics Letters
AstronomyPhysics
2009English

Amanote Research

Note-taking for researchers

Follow Amanote

© 2024 Amaplex Software S.P.R.L. All rights reserved.

Privacy PolicyRefund Policy