Secrecy Rate Maximization with Outage Constraint in Multihop Relaying Networks
Jianping Yao, Yuan Liu

TL;DR
This paper investigates optimizing secure multihop wireless transmissions with adaptive coding and routing to maximize secrecy rate under outage constraints, considering random eavesdropper distribution.
Contribution
It introduces an optimal design framework for wiretap coding and routing strategies in multihop networks with secrecy constraints, including exact rate expressions and a revised routing algorithm.
Findings
Optimal wiretap code parameters derived
Secure routing strategy formulated and solved
Simulation confirms effectiveness of the proposed methods
Abstract
In this paper, we study the secure transmission in multihop wireless networks with randomize-and-forward (RaF) relaying, in the presence of randomly distributed eavesdroppers. By considering adaptive encoder with on-off transmission (OFT) scheme, we investigate the optimal design of the wiretap code and routing strategies to maximize the secrecy rate while satisfying the secrecy outage probability (SOP) constraint. We derive the exact expressions for the optimal rate parameters of the wiretap code. Then the secure routing problem is solved by revising the classical Bellman-Ford algorithm. Simulation results are conducted to verify our analysis.
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
Taxonomy
TopicsWireless Communication Security Techniques · Cooperative Communication and Network Coding · Advanced MIMO Systems Optimization
