This is the authors' abstract. We don't add key points for this paper.
A great number of efficient methods to improve the performance of the networks have been proposed in physical-layer security for wireless communications. So far, the security and privacy in wireless communications is optimized based on a fixed assumption about the trustworthiness or trust degrees (TD) of certain wireless nodes. The nodes are often classified into different types such as eavesdroppers, untrusted relays, and trusted cooperative nodes. Wireless nodes in different networks do not completely trust each other when cooperating or relaying information for each other. Optimizing the network based on trust degrees plays an important role in improving the security and privacy for the modern wireless network. We proposed a novel algorithm to find the route with the smallest total transmission time from the source to the destination and still guarantee that the accumulated TD is larger than a trust degree threshold. Simulation results are presented to analyze the affects of the transmit SNR, node density, and TD threshold on different network performance elements.
Answers are grounded in this paper and cite their sources.
No takes yet. Share an insight, caveat, or question.
Thai et al. (2020) studied this question.
Synapse has enriched 10 related papers. Consider them for comparative context: