Graph theory based max-min path selection for a secure DF relaying system
Jinxi Li, Chensi Zhang, He Wang, Zeyu Xia · 2017
The use of graph theory to improve the secrecy performance of a wireless multi-hop relaying system is investigated. Particularly, we consider a wireless wiretap network with multi-relay and multi-eavesdropper. A secrecy graph is first established according to the network topology. After building the weight of each edge, an efficient max-min path selection (MM-PS) criterion is then proposed to select an appropriate path for relaying based on shortest path algorithm. Simulation results verified the effectiveness and efficiency of the proposed MM-PS criterion and show that cooperative relaying can bring considerable performance improvement.