Secrecy Rate of Resource-Constrained Mobile Relay Model under Two-Way Wiretap Channel

Relay communication is emerging as a promising solution to improving the reliability of long-distance communication systems. However, transmitting data in a secure way is challenging due to the possibility of eavesdroppers wiretapping such systems. To address the challenge, this paper proposes a joint secure transmission and graph mobility model. With the proposed model, the secrecy rate of the resource-constrained two-way wiretap channel mobile relay system is formulated as a mixed integer nonlinear programming (MINLP) problem. Furthermore, efficient algorithms that achieve a local optimal solution are derived. Numerical results are provided to validate the performance of the proposed algorithms.