Minimum Energy Routing and Jamming to Thwart Wireless Network Eavesdroppers

Abstract

Abstract-There is a rich recent literature on informationtheoretically secure communication at the physical layer of wireless networks, where secret communication between a single transmitter and receiver has been studied extensively. In this paper, we consider how single-hop physical layer security techniques can be extended to multi-hop wireless networks. We show that guaranteed security can be achieved in multihop networks by augmenting physical layer security techniques, such as cooperative jamming, with the higher layer network mechanisms, such as routing. Specifically, we consider the secure minimum energy routing problem, in which the objective is to compute a minimum energy path between two network nodes subject to constraints on the end-to-end communication secrecy and goodput over the path. This problem is formulated as a constrained optimization of transmission power and link selection, which is proved to be NP-hard. Nevertheless, we show that efficient algorithms exist to compute both exact and approximate solutions for the problem. In particular, we develop an exact solution of pseudo-polynomial complexity, as well as an ϵ-optimal approximation of polynomial complexity. Simulation results are also provided to show the utility of our algorithms and quantify their energy savings compared to a combination of (standard) security-agnostic minimum energy routing and physical layer security. In the simulated scenarios, we observe that, by jointly optimizing link selection at the network layer and cooperative jamming at the physical layer, our algorithms reduce the network energy consumption by half.

Robust beamforming and cooperative jamming for secure transmission in DF relay systems

“…Under the channel uncertainty model, our objective is to maximize the achievable secrecy rate at D in (9) by jointly optimizing the beamforming vector w of the desirable signal and the transmit covariance of the jamming signal at R subject to the information rate constraint in (10) and its total transmit power constraint at R in (11). As a result, the optimization problem is formulated as…”

“…To further improve physical layer security, artificial noise (AN) or cooperative jamming (CJ) approach has been introduced in the secrecy system by embedding *Correspondence: feizesong@bit.edu.cn School of Information and Electronics, Beijing Institute of Technology, Beijing 100081, China noise or jamming signal in the transmitted signal to confuse eavesdroppers [8][9][10][11]. In addition to helping relay the desirable information signals from source nodes to destination nodes, trusted relays can also implement CJ [12,13] to confuse the potential eavesdroppers by simultaneously sending jamming signals together with the information signals.…”

Secrecy Rate Maximization With Outage Constraint in Multihop Relaying Networks

“…As a result, there exists a tradeoff between the hops and secure performance, i.e., the problem of secure routing. The authors in [11,12] considered minimum energy routing in the presence of either multiple malicious jammers or eavesdroppers, to guarantee certain end-to-end performance. The authors in [13,14] considered the problem of how to communicate securely with the help of untrusted relays and full-duplex jamming relays, respectively.…”

Energy-Efficient Secrecy in Wireless Networks Based on Random Jamming

“…[21]- [31]. However, only a few works have considered energy-aware routing with secrecy considerations [32], [33].…”

“…Further, in a disadvantaged wireless environment, many passive eavesdroppers might try to intercept the message at each hop, with large uncertainty in the locations of the eavesdroppers, and the eavesdroppers might get arbitrarily close to the transmitters. In such a situation, the energy consumption of any cooperative jamming approach including the scheme of [32], [33] can become very high. Further, if we plan for the wrong number of eavesdroppers or do not correctly anticipate the quality of the eavesdroppers' channels, the secrecy will be compromised.…”