Jammer Selection Research Articles

Joint jammer selection and power optimization in covert communications against a warden with uncertain locations

In covert communications, joint jammer selection and power optimization are important to improve performance. However, existing schemes usually assume a warden with a known location and perfect channel state information (CSI), which is difficult to achieve in practice. To be more practical, it is important to investigate covert communications against a warden with uncertain locations and imperfect CSI, which makes it difficult for legitimate transceivers to estimate the detection probability of the warden. First, the uncertainty caused by the unknown warden location must be removed, and the optimal detection position (OPTDP) of the warden is derived which can provide the best detection performance (i.e., the worst case for a covert communication). Then, to further avoid the impractical assumption of perfect CSI, the covert throughput is maximized using only the channel distribution information. Given this OPTDP based worst case for covert communications, the jammer selection, the jamming power, the transmission power, and the transmission rate are jointly optimized to maximize the covert throughput (OPTDP-JP). To solve this coupling problem, a heuristic algorithm based on maximum distance ratio (H-MAXDR) is proposed to provide a sub-optimal solution. First, according to the analysis of the covert throughput, the node with the maximum distance ratio (i.e., the ratio of the distances from the jammer to the receiver and that to the warden) is selected as the friendly jammer (MAXDR). Then, the optimal transmission and jamming power can be derived, followed by the optimal transmission rate obtained via the bisection method. In numerical and simulation results, it is shown that although the location of the warden is unknown, by assuming the OPTDP of the warden, the proposed OPTDP-JP can always satisfy the covertness constraint. In addition, with an uncertain warden and imperfect CSI, the covert throughput provided by OPTDP-JP is 80% higher than the existing schemes when the covertness constraint is 0.9, showing the effectiveness of OPTDP-JP.

A multi-agent deep Q-learning-based joint relay and jammer selection in dual-hop wireless networks

A multi-agent deep Q-learning-based joint relay and jammer selection in dual-hop wireless networks

Multiagent Q-learning algorithm-based relay and jammer selection for physical layer security improvement

Multiagent Q-learning algorithm-based relay and jammer selection for physical layer security improvement

Multi-agent Q-learning algorithm-based relay and jammer selection for physical layer security improvement

Multi-agent Q-learning algorithm-based relay and jammer selection for physical layer security improvement

Reinforcement learning-based secure joint relay and jammer selection in dual-hop wireless networks

Reinforcement learning-based secure joint relay and jammer selection in dual-hop wireless networks

Jammer selection for energy harvesting-aided non-orthogonal multiple access: Performance analysis

Jammer selection for energy harvesting-aided non-orthogonal multiple access: Performance analysis

Security-reliability tradeoff of MIMO TAS/SC networks using harvest-to-jam cooperative jamming methods with random jammer location

This paper evaluates outage probability (OP) and intercept probability (IP) of physical-layer security based MIMO networks adopting cooperative jamming (Coop-Jam). In the considered scenario, a multi-antenna source communicates with a multi-antenna destination employing transmit antenna selection (TAS)/ selection combining (SC), in presence of a multi-antenna eavesdropper using SC. One of jammers appearing near the destination is selected for generating jamming noises on the eavesdropper. Moreover, the destination supports the wireless energy for the chosen jammer, and cooperates with it to remove the jamming noises. We consider two jammer selection approaches, named RAND and SHORT. In RAND, the destination randomly selects the jammer, and in SHORT, the jammer, which is nearest to the destination, is chosen. We derive exact and asymptotic expressions of OP and IP over Rayleigh fading, and perform Monte-Carlo simulations to verify the correction of our derivation. The results present advantages of the proposed RAND and SHORT methods, as compared with the corresponding one without using Coop-Jam.

Jamming and Link Selection for Joint Secrecy/Delay Guarantees in Buffer-Aided Relay System

This paper explores the joint secrecy and delay guarantees based on opportunistic jamming and link selection in a wireless relay system consisting of a source, a destination, multiple buffer-aided relays and a passive eavesdropper wiretapping over both hops. Based on the information of link state and buffer status, we design a novel transmission scheme based on link selection and jammer selection, which dynamically grants transmission links different priorities for packet delivery, such that the constraints on both secrecy outage probability and packet delay are jointly satisfied. To understand the performance of the new scheme, we then apply the bitmap technique and Markov chain theory to develop a complete theoretical framework for the modelling of three fundamental metrics, namely reliability outage probability, packet discarding probability and secrecy/delay constrained throughput (SDT). Finally, we provide extensive simulation and numerical results to validate our theoretical modelling, as well as to demonstrate that the proposed scheme is superior to the benchmarks in terms of SDT.

A Secrecy Transmission Protocol with Energy Harvesting for Federated Learning.

In federated learning (FL), model parameters of deep learning are communicated between clients and the central server. To better train deep learning models, the spectrum resource and transmission security need to be guaranteed. Toward this end, we propose a secrecy transmission protocol based on energy harvesting and jammer selection for FL, in which the secondary transmitters can harvest energy from the primary source. Specifically, a secondary transmitter is first selected, which can offer the best transmission performance for the secondary users to access the primary frequency spectrum. Then, another secondary transmitter , which has the best channel for eavesdropping, is also chosen as a friendly jammer to provide secrecy service. Furthermore, we use outage probability (OP) and intercept probability (IP) as metrics to evaluate performance. Meanwhile, we also derive closed-form expressions of OP and IP of primary users and OP of secondary users for the proposed protocol, respectively. We also conduct a theoretical analysis of the optimal secondary transmission selection (OSTS) protocol. Finally, the performance of the proposed protocol is validated through numerical experiments. The results show that the secrecy performance of the proposed protocol is better than the OSTS and OCJS, respectively.

Intelligent Jamming Strategies for Secure Spectrum Sharing Systems

This paper investigates the secrecy performance of a spectrum sharing network, where <inline-formula> <tex-math notation="LaTeX">${N}$ </tex-math></inline-formula> legitimate source-destination pairs orderly access the shared spectrum for communication, while an eavesdropper (E) attempts to tap the legitimate information transmission. To improve the physical layer security, we propose two jamming strategies that can intelligently switch between jamming and non-jamming, namely, suboptimal jammer selection (SJS) scheme and optimal jammer selection (OJS) scheme. Specifically, when a user pair is assigned to access the shared spectrum, another source is chosen as a friendly jammer in order to create intentional interference at E. For the purpose of comparison, we present the non-jammer selection (NJS) scheme as a benchmark. Analytical closed-form secrecy outage probability expressions of NJS, SJS and OJS schemes are derived over Nakagami-<inline-formula> <tex-math notation="LaTeX">${m}$ </tex-math></inline-formula> fading channels. We further present an asymptotic secrecy outage probability analysis to evaluate the secrecy diversity gain performance of NJS, SJS and OJS schemes. Numerical results show that the secrecy outage probability performance of OJS scheme is better than SJS and NJS schemes in the low average channel power gain <inline-formula> <tex-math notation="LaTeX">${\mathop \Omega \nolimits _{D} }$ </tex-math></inline-formula> region. Furthermore, the secrecy outage probabilities of NJS as well as SJS and OJS schemes converge to each other with the increase of <inline-formula> <tex-math notation="LaTeX">${\mathop \Omega \nolimits _{D} }$ </tex-math></inline-formula>, due to the fact that the OJS and SJS scheme will switch to NJS scheme when <inline-formula> <tex-math notation="LaTeX">${\mathop \Omega \nolimits _{D} }$ </tex-math></inline-formula> tends to infinity.

Wireless Covert Communications Aided by Distributed Cooperative Jamming Over Slow Fading Channels

In this paper, we study covert communications between a pair of legitimate transmitter-receiver against a watchful warden over slow fading channels. There coexist multiple friendly helper nodes who are willing to protect the covert communication from being detected by the warden. We propose an uncoordinated jammer selection scheme where those helpers whose instantaneous channel gains to the legitimate receiver fall below a pre-established selection threshold will be chosen as jammers radiating jamming signals to defeat the warden. By doing so, the detection accuracy of the warden is expected to be severely degraded while the desired covert communication is rarely affected. We then jointly design the optimal selection threshold and message transmission rate for maximizing covert throughput under the premise that the detection error of the warden exceeds a certain level. Numerical results are presented to validate our theoretical analyses. It is shown that the multi-jammer assisted covert communication outperforms the conventional single-jammer method in terms of covert throughput, and the maximal covert throughput improves significantly as the total number of helpers increases, which demonstrates the validity and superiority of our proposed scheme.

A cross-layer cooperative jamming scheme for social internet of things

In this paper, we design a friendly jammer selection scheme for the social Internet of Things (IoT). A typical social IoT is composed of a cellular network with underlaying Device-to-Device (D2D) communications. In our scheme, we consider signal characteristics over a physical layer and social attribute information of an application layer simultaneously. Using signal characteristics, one of the D2D gadgets is selected as a friendly jammer to improve the secrecy performance of a cellular device. In return, the selected D2D gadget is allowed to reuse spectrum resources of the cellular device. Using social relationship, we analyze and quantify the social intimacy degree among the nodes in IoT to design an adaptive communication time threshold. Applying an artificial intelligence forecasting model, we further forecast and update the intimacy degree, and then screen and filter potential devices to effectively reduce the detection and calculation costs. Finally, we propose an optimal scheme to integrate the virtual social relationship with actual communication systems. To select the optimal D2D gadget as a friendly jammer, we apply Kuhn-Munkres (KM) algorithm to solve the maximization problem of social intimacy and cooperative jamming. Comprehensive numerical results are presented to validate the performance of our scheme.

Secure communication with joint resource allocation, relay and jammer selection in OFDM‐based cooperative networks

SummaryThis paper considers an orthogonal frequency division multiplexing (OFDM) based cooperative network, where a source node communicates with a destination node with the help of multiple intermediate nodes, in the presence of an eavesdropper. Each intermediate node is assumed to be able to act as a relay or a jammer to improve the physical layer security. The problem of joint subcarrier allocation, power allocation, and mode selection to maximize the sum secrecy rate is investigated. We first reformulate the problem of subcarrier allocation and intermediate node mode selection as a three‐sided matching game and propose an algorithm that achieves a stable matching. Then, the sum secrecy rate is further improved by proposing a heuristic algorithm to switch the modes of the intermediate nodes. Finally, an iterative power allocation algorithm is proposed. It is verified by simulation results that the proposed algorithm outperforms various benchmark algorithms such as the equal subcarrier allocation algorithm, the pure relay selection algorithm, and the random relay selection algorithm, especially when the transmit power limit is high and the number of intermediate nodes is large.

Secrecy performance of multi-user multi-hop cluster-based network with joint relay and jammer selection under imperfect channel state information

In this paper, we propose and analyze two important secure performance metrics of cluster-based multi-hop relay networks with friendly jamming nodes under the presence of multi-eavesdroppers in condition of imperfect channel estimation. At each hop, partial relay and jammer selection are used to improve the network security. The close-form expressions of secrecy outage probability and the probability of non-zero secrecy capacity of the considered system are derived as criteria to evaluate system security performance. The system performance is analyzed for Rayleigh fading channels with imperfect channel state information. Monte Carlo simulations are also performed to verify the correctness of the analytical results.

Security‐reliability tradeoff analysis of joint relay‐user pair and friendly jammer selection for physical layer security against multiple eavesdroppers

Security‐reliability tradeoff analysis of joint relay‐user pair and friendly jammer selection for physical layer security against multiple eavesdroppers

Eavesdropper and Jammer Selection in Wireless Source Localization Networks

We consider a wireless source localization network in which a target node emits localization signals that are used by anchor nodes to estimate the target node position. In addition to target and anchor nodes, there can also exist eavesdropper nodes and jammer nodes which aim to estimate the position of the target node and to degrade the accuracy of localization, respectively. We first propose the problem of eavesdropper selection with the goal of optimally placing a given number of eavesdropper nodes to a subset of possible positions in the network to estimate the target node position as accurately as possible. As the performance metric, the Cramer-Rao lower bound (CRLB) related to the estimation of the target node position by eavesdropper nodes is derived, and its convexity and monotonicity properties are investigated. By relaxing the integer constraints, the eavesdropper selection problem is approximated by a convex optimization problem and algorithms are proposed for eavesdropper selection. Moreover, in the presence of parameter uncertainty, a robust version of the eavesdropper selection problem is developed. Then, the problem of jammer selection is proposed where the aim is to optimally place a given number of jammer nodes to a subset of possible positions for degrading the localization accuracy of the network as much as possible. A CRLB expression from the literature is used as the performance metric, and its concavity and monotonicity properties are derived. Also, a convex optimization problem and its robust version are derived after relaxation. Moreover, the joint eavesdropper and jammer selection problem is proposed with the goal of placing certain numbers of eavesdropper and jammer nodes to a subset of possible positions. Simulation results are presented to illustrate performance of the proposed algorithms.

Trustworthy Jammer Selection with Truth‐Telling for Wireless Cooperative Systems

In this paper, we propose a trustworthy friendly jammer selection scheme with truth‐telling for wireless cooperative systems. We first utilize the reverse auction scheme to enforce truth‐telling as the dominant strategy for each candidate friendly jammer. Specifically, we consider two auction cases: (1) constant power (CP) case and (2) the utility of the BS maximization (UBM) case. In both cases, the reverse auction scheme enforces truth‐telling as the dominant strategy. Next, we introduce the trust category and trust degree to evaluate the trustworthiness of each Helper transmitter (Helper‐Tx). Specifically, an edge controller calculates the reputation value of each Helper‐Tx periodically using an additive‐increase multiplicative‐decrease algorithm by observing its jamming behavior. With the historical reputation values, the edge controller (EC) classifies a Helper‐Tx into one of four trust categories and calculates its trust degree. Then, the EC selects the best Helper‐Tx based on the trust category and trust degree. Lastly, we present numerical results to demonstrate the performance of our proposed jammer selection scheme.

Security-Reliability Tradeoff for Joint Relay-User Pair and Friendly Jammer Selection with Channel Estimation Error in Internet-of-Things

Security-Reliability Tradeoff for Joint Relay-User Pair and Friendly Jammer Selection with Channel Estimation Error in Internet-of-Things

Improving Physical Layer Security of Uplink NOMA via Energy Harvesting Jammers

We investigate the secrecy transmission of uplink non-orthogonal multiple access (NOMA) with the aid of energy harvesting (EH) jammers. During each time frame, communication is divided into two phases. At the first phase, the base station (BS) transfers wireless power to EH receivers (EHRs). At the second phase, users perform uplink NOMA transmission to BS, while one of EHRs is selected as a friendly jammer that uses the energy harvested from the previous phase to emit the artificial noise for confusing the eavesdropper. In terms of the requirement of channel state information (CSI), we propose three friendly EH jammer selection schemes, namely random EH jammer selection (REJS) scheme without the requirement of any CSI, maximal EH jammer selection (MEJS) scheme with the CSI between BS and each EHR, and optimal EH jammer selection (OEJS) scheme where both the CSIs from BS to EHRs and from EHRs to the eavesdropper need to be known. Analytical closed-form expressions for the connection outage probability (COP), secrecy outage probability (SOP) and effective secrecy throughput (EST) are derived to evaluate the system performance achieved by the proposed schemes, respectively. Also, the asymptotic analysis is provided to gain further insights. The analytical and numerical results indicate that the proposed schemes can realize better secrecy performance than conventional scheme without an EH jammer. Both the secrecy diversity orders of the REJS and MEJS schemes are one while the OEJS scheme can achieve a full secrecy diversity order. Furthermore, owing to the impact of connection outage, the three schemes converge to the same EST floor with the increase of signal-to-noise ratio (SNR).

On the Security Enhancement of Uplink NOMA Systems With Jammer Selection

We investigate physical layer security of an uplink NOMA system consisting of one base station, multiple users and one eavesdropper. During each uplink transmission, two users are paired to perform NOMA and another user is opportunistically selected from the remaining idle users to act as a friendly jammer to emit artificial noise for confusing the eavesdropper. To enhance the transmission security for the system, we propose two friendly jammer selection aided uplink NOMA transmission schemes, namely random jammer selection aided uplink NOMA transmission (RJS-UNT) scheme without knowing the eavesdropper’s channel state information (CSI), and optimal jammer selection aided uplink NOMA transmission (OJS-UNT) scheme where the eavesdropper’s CSI is available. For comparison purpose, a non-jammer selection aided uplink NOMA transmission (NJS-UNT) scheme is also considered. Analytical closed-form expressions for the secrecy outage probability (SOP) are derived to evaluate the secrecy performance achieved by the proposed schemes. Also, the asymptotic SOPs are provided to obtain further insights. The analysis and simulation results indicate that the schemes converge to SOP floors with the increasing SNR, while the floors achieved by the RJS-UNT and OJS-UNT schemes are significantly lower than that achieved by the NJS-UNT scheme, showing the security advantage of the proposed schemes.