Physical Layer Security in Multi-hop Relay Networks with Modified Dijkstra's Routing Algorithms

The paper studies the physical layer security in multi-hop relay networks with multiple relaying nodes in which two of decode-and-forward (DF) scheme and decode-and- forward and amplify-and-forward (DFAF) scheme are considered. In the schemes, we also consider the presence of an eavesdropper overhearing in the transmission. In addition, we propose a novel algorithm for all of two schemes to find the best route networks from the source to the destination. The routes have to guarantee that the total transmission time is the smallest and the accumulated trust degrees (TD) is larger than a given trust degree threshold. To evaluate the system performance, we analyze the successful delivery ratio (SDR), the average delivery time (ADT) and the average number of regenerative hops (ANRH) for all two schemes. The numerical results show that the system performance of DFAF scheme is better than that of DF scheme due to the better secrecy rate.