This letter investigates the proactive eavesdropping for multiple suspicious links either through interfering or assisting the links. Considering the power constraint at eavesdropper, our objective is to maximize weighted sum eavesdropping rate of multiple suspicious links via jointly optimizing their intervention strategies (jamming or relaying) and the corresponding transmit power at eavesdropper. The formulated problem is shown to be a mixed-integer nonlinear programming (MINLP) problem, which is NP-hard in general. By identifying the separable structure of the formulated problem, we decouple the complex MINLP problem into two subproblems: 1) a jamming subproblem; and 2) a relaying subproblem. These two subproblems are then solved by further recasting them into a combinational problem and a typical concave optimization problem, respectively. Numerical simulations show that our proposed approach can achieve higher eavesdropping rate than conventional eavesdropping approaches.
This letter investigates the proactive eavesdropping for multiple suspicious links either through interfering or assisting the links. Considering the power constraint at eavesdropper, our objective is to maximize weighted sum eavesdropping rate of multiple suspicious links via jointly optimizing their intervention strategies (jamming or relaying) and the corresponding transmit power at eavesdropper. The formulated problem is shown to be a mixed-integer nonlinear programming (MINLP) problem, which is NP-hard in general. By identifying the separable structure of the formulated problem, we decouple the complex MINLP problem into two subproblems: 1) a jamming subproblem; and 2) a relaying subproblem. These two subproblems are then solved by further recasting them into a combinational problem and a typical concave optimization problem, respectively. Numerical simulations show that our proposed approach can achieve higher eavesdropping rate than conventional eavesdropping approaches.
Unlike passive eavesdropping, proactive eavesdropping is recently proposed to use jamming to moderate a suspicious link's communication rate for facilitating simultaneous eavesdropping. This paper advances the proactive eavesdropping research by considering a practical half-duplex mode for the legitimate monitor (e.g., a government agency) and dealing with the challenging case that the suspicious link opportunistically communicates over parallel fading channels. To increase eavesdropping success probability, we propose cognitive jamming for the monitor to change the suspicious link's long-term belief on the parallel channels' distributions and thereby induce it to transmit more likely over a smaller subset of unjammed channels with a lower transmission rate. As the half-duplex monitor cannot eavesdrop the channel that it is simultaneously jamming to, our jamming design should also control the probability of such “own goal” that occurs when the suspicious link chooses one of the jammed (uneavesdroppable) channels to transmit. We formulate the optimal jamming design problem as a mixed integer nonlinear programming (MINLP) and show that it is non-convex. Nevertheless, we prove that the monitor should optimally use the maximum jamming power if it decides to jam, for maximally reducing the suspicious link's communication rate and driving the suspicious link out of the jammed channels. Then we manage to simplify the MINLP to integer programming and reveal a fundamental trade-off in deciding the number of jammed channels: jamming more channels helps reduce the suspicious link's communication rate for overhearing more clearly but increases own goal probability and thus decreases eavesdropping success probability. Finally, we extend our study to the two-way suspicious communication scenario and show that there is another interesting trade-off in deciding the common jammed channels for balancing bidirectional eavesdropping performances. Numerical results show that our optimized jamming-assisted eavesdropping schemes greatly increase eavesdropping success probability as compared with the conventional passive eavesdropping.
This paper studies the proactive eavesdropping for the potential energy-constrained suspicious communication system with one full-duplex-enabled legitimate monitor. Specifically, for such a system, we consider the proactive eavesdropping over finite time blocks under the off-line framework. In each time block, the monitor first acts as the masked power beacon deliberately to proceed wireless energy transfer to the suspicious transmitter for its uplink data transmission, then adaptively executes jamming, passive eavesdropping or assisting strategy based on our provided exact channel condition with strict proofs. According to these adaptive strategies and considering the optimization of transmit power at the monitor, we aim to solve the problem of sum eavesdropping rates maximization over N (N ≥ 1 ) time blocks subject to limited power at the monitor, which is explained as a difficult mixed-inter nonlinear programming (MINLP) problem. Fortunately, it is shown that this MINLP problem can be divided into one jamming subproblem and one passive eavesdropping/assisting subproblem. To observe the achieve performance bound, we firstly exploit the exhaustive search based algorithm and block coordinate descent (BCD) based algorithm to solve these two subproblems, respectively. In addition, in order to decrease the time complexities, we further propose one jamming power efficiency sorting based heuristic algorithm and one signal-to-noise ratio (SNR) approximation based fast algorithm. Numerical results present the considerable gains brought from our proposed adaptive proactive eavesdropping strategy.
This paper investigates a proactive eavesdropping scenario where multiple suspicious communication (SC) links are eavesdropped by a full-duplex monitor who can send jamming or constructive signals on each SC link. In order to avoid being discovered by the suspicious users, the monitor restricts the SC quality-of-service (QoS) degradation caused by itself. Under this SC QoS constraint and the average transmit power constraint, the problems of optimizing the mode and transmit power of the monitor to maximize the average successful eavesdropping probability and the average eavesdropping rate are investigated for the delay-sensitive suspicious service and delay-tolerant suspicious service, respectively. By proving that the time-sharing condition is satisfied, the optimal solutions are derived based on the Lagrange duality method. Simulation results validate the effectiveness of the proposed schemes. It is shown that the proposed schemes can provide satisfactory eavesdropping performance improvement even with zero SC QoS degradation requirement.
Proactive eavesdropping improves the wireless information surveillance performance by cognitively sending jamming signals to degrade the suspicious link condition. Current studies all considered that the suspicious users do not apply jamming to defend against the proactive eavesdropping. Contrary to that, this paper considers that a jammer sends jamming signals to degrade the eavesdropping link condition to protect the suspicious communications. A Stackelberg game framework is formulated to track the interactions between the jammer and the monitor and make strategy designs, where the monitor is the leader aiming at maximizing the successful eavesdropping probability and the jammer is the follower aiming at minimizing the successful eavesdropping probability. For the follower’s problem, the optimal jammer’s jamming power allocation policy with respect to the fixed monitor’s jamming power is derived based on the sum-of-ratios optimization. Then for the leader’s problem, the optimal monitor’s jamming power allocation policy is obtained via the bisection search method and the sum-of-ratios optimization. Some design insights are discussed from the obtained policies. The effectiveness of the proposed scheme is verified by simulation results. It is shown that the jamming from the jammer deteriorates the eavesdropping performance and the proposed scheme outperforms various benchmark schemes in existing literature.
This paper studies a new and challenging wireless surveillance problem where a legitimate monitor attempts to eavesdrop two suspicious communication links simultaneously. To facilitate concurrent eavesdropping, our multi-antenna legitimate monitor employs a proactive eavesdropping via jamming approach, by selectively jamming suspicious receivers to lower the transmission rates of the target links. In particular, we are interested in characterizing the achievable eavesdropping rate region for the minimum-mean-squared-error (MMSE) receiver case, by optimizing the legitimate monitor's jamming transmit covariance matrix subject to its power budget. As the monitor cannot hear more than what suspicious links transmit, the achievable eavesdropping rate region is essentially the intersection of the achievable rate region for the two suspicious links and that for the two eavesdropping links. The former region can be purposely altered by the monitor's jamming transmit covariance matrix, whereas the latter region is fixed when the MMSE receiver is employed. Therefore, we first analytically characterize the achievable rate region for the two suspicious links via optimizing the jamming transmit covariance matrix and then obtain the achievable eavesdropping rate region for the MMSE receiver case. In addition, we also consider the MMSE with successive interference cancellation (MMSE-SIC) receiver case and characterize the corresponding achievable eavesdropping rate region by jointly optimizing the time-sharing factor between different decoding orders. Furthermore, extensions to the imperfect channel state information case and the more than two suspicious links scenario are also examined. Finally, numerical results are provided to corroborate our analysis and evaluate the eavesdropping performance.
Surveillance performance is studied in this paper for a wireless eavesdropping system, where a full-duplex legitimate monitor eavesdrops a suspicious link efficiently with the artificial noise (AN) assistance. Different from the existing work, the suspicious receiver is assumed to be capable of detecting the presence of AN. Once such receiver detects the AN, the suspicious user will stop transmission, which degrades the surveillance performance. Hence, to improve the surveillance performance, AN should be transmitted covertly with a low detection probability. Under these assumptions, an optimization problem is formulated to maximize the eavesdropping non-outage probability under a covert constraint. Based on the detection ability at the suspicious receiver, a novel scheme is proposed to solve the optimization problem using an iterative search. Moreover, we investigate the impact of both the suspicious and the jamming links uncertainties on the covert surveillance performance. Simulations are performed to verify the analyses. We show that the suspicious link uncertainty enhances the surveillance performance, while the jamming link uncertainty can degrade the surveillance performance.