Secrecy Rate of Resource-Constrained Mobile Relay Model under Two-Way Wiretap Channel
Source abstract
Abstract
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.
Source: crossref · Quality: baseline
Research context
OpenAlex topics: Cooperative Communication and Network Coding · Wireless Communication Security Techniques · UAV Applications and Optimization
SciVX discovery tags are terminology-based. OpenAlex topics are source-provided classifications.
Affiliations
School of Computer Science, Nanjing University of Posts and Telecommunications, Nanjing 210003, China
School of Computer Science and Engineering, Jiangsu University of Science and Technology, Zhenjiang 212100, China
Department of Electrical and Electronic Engineering, The University of Hong Hong, Hong Kong 999077, China
Funding
Jiangsu University of Science and Technology
References (27)
Show source-provided references
1. The relay eavesdropper channel: Cooperation for secrecy10.1109/TIT.2008.928272 ↗
2. Secure transmission over parallel relay channel10.1109/TIFS.2012.2185493 ↗
3. Yuksel, M., and Erkip, E. (2007, January 2–6). Secure communication with a relay helping the wire-tapper. Proceedings of the IEEE Information Theory Workshop, Lake Tahoe, CA, USA.10.1109/ITW.2007.4313141 ↗
4. Multiacess channel with partially cooperating encoders and security constraints10.1109/TIFS.2013.2263804 ↗
5. coding schemes for relay-assisted information embedding10.1109/TIFS.2008.2009588 ↗
6. Wirelessly powered two-way communication with nonlinear energy harvesting model: Rate regions under fixed and mobile relay10.1109/TWC.2017.2758767 ↗
7. Secrecy-Enhancing Design for Two-Way Energy Harvesting Cooperative Networks with Full-Duplex Relay Jamming10.23919/JCC.2021.05.018 ↗
8. Charge-Then-Cooperate: Secure Resource Allocation for Wireless-Powered Relay Networks With Wireless Energy Transfer10.1109/TVT.2021.3069752 ↗
9. Cooperative Jamming for Physical Layer Security in Hybrid Satellite Terrestrial Relay Networks10.23919/JCC.2019.12.012 ↗
10. Opportunistic Relaying and Jamming Based on Secrecy-Rate Maximization for Multiuser Buffer-Aided Relay Systems10.1109/TVT.2020.3038353 ↗
11. Bliss, M., and Michelusi, N. (2019, January 9–13). Trajectory Optimization for Rotary-Wing UAVs in Wireless Networks with Random Requests. Proceedings of the 2019 IEEE Global Communications Conference (GLOBECOM), Waikoloa, HI, USA.10.1109/GLOBECOM38437.2019.9013307 ↗
12. Joint trajectory and power optimization for mobile jammer-aided secure UAV relay network
13. Joint Trajectory and Communication Design for Multi-UAV Enabled Wireless Networks10.1109/TWC.2017.2789293 ↗
14. Wang, S., Xia, M., and Wu, Y.-C. (2019, January 20–24). Joint Communication and Motion Energy Minimization in mobile ground vehicle Backscatter Communication. Proceedings of the ICC 2019—2019 IEEE International Conference on Communications (ICC), Shanghai, China.10.1109/ICC.2019.8761615 ↗
15. Bondy, J.A., and Murthy, U. (1976). Graph Theory with Applications, Elsevier.10.1007/978-1-349-03521-2 ↗
16. Deployment of mobile robots with energy and timing constraints10.1109/TRO.2006.875494 ↗
17. Near-optimal velocity control for mobile charging in wireless rechargeable sensor networks10.1109/TMC.2015.2473163 ↗
18. Bertsekas, D.P. (1998). Network Optimization: Continuous and Discrete Models, Athena Scientific.
19. Gendreau, M., and Potvin, J.Y. (2010). Handbook of Metaheuristics, Springer. [2nd ed.].10.1007/978-1-4419-1665-5 ↗
20. Randomized local search, evolutionary algorithms, and the minimum spanning tree problem10.1016/j.tcs.2006.11.002 ↗
21. Neighborhood size in the simulated annealing algorithm
22. Boyd, S., and Vandenberghe, L. (2004). Convex Optimization, Cambridge Univ Press.10.1017/CBO9780511804441 ↗
23. The traveling salesman problem: An overview of exact and approximate algorithms10.1016/0377-2217(92)90138-Y ↗
24. Mixed-integer nonlinear optimization10.1017/S0962492913000032 ↗
25. A dynamic programming approach to sequencing problems10.1137/0110015 ↗
26. Ben-Tal, A., and Nemirovski, A. (2013). Lectures on Modern Convex Optimization (MPS/SIAM Series on Optimizations), SIAM.
27. Multi-pair two-way relay network with harvest-then-transmit users: Resolving pairwise uplink-downlink coupling10.1109/JSTSP.2016.2612162 ↗