Jamming Coverage Research Articles

LEO Satellite Downlink Distributed Jamming Optimization Method Using a Non-Dominated Sorting Genetic Algorithm

Due to their low orbit, low-Earth-orbit (LEO) satellites possess advantages such as minimal transmission delay, low link loss, flexible deployment, diverse application scenarios, and low manufacturing costs. Moreover, by increasing the number of satellites, the system capacity can be enhanced, making them the core of future communication systems. However, there have been instances where malicious actors used LEO satellite communication equipment to illegally broadcast events in large sports stadiums or engage in unauthorized leakage of military secrets in sensitive military areas. This has become an urgent issue in the field of communication security. To combat and prevent abnormal and illegal communication activities using LEO satellites, this study proposes a LEO satellite downlink distributed jamming optimization method using a non-dominated sorting genetic algorithm. Firstly, a distributed jamming system model for the LEO satellite downlink is established. Then, using a non-dominated sorting genetic algorithm, the jamming parameters are optimized in the power, time, and frequency domains. Field jamming experiments were conducted in the southwest outskirts of Xi’an, China, targeting the LEO constellation of the China Satellite Network. The results indicate that under the condition that the jamming coverage rate is no less than 90%, the proposed method maximizes jamming power, minimizes time delay, and minimizes frequency compensation compared to existing jamming optimization methods, effectively improving the real-time jamming performance and success rate.

A Multi-Armed Bandit Framework for Efficient UAV-Based Cooperative Jamming Coverage

A Multi-Armed Bandit Framework for Efficient UAV-Based Cooperative Jamming Coverage

Two-stage random sequential adsorption of discorectangles and disks on a two-dimensional surface.

The different variants of two-stage random sequential adsorption (RSA) models for packing of disks and discorectangles on a two-dimensional (2D) surface were investigated. In the SD (sticks+disks) model, the discorectangles were first deposited and then the disks were added. In the DS (disks+sticks) model, the disks were first deposited and then discorectangles were added. At the first stage the particles were deposited up to the selected concentration and at the final (second) stage the particles were deposited up to the saturated (jamming) state. The main parameters of the models were the concentration of particles deposited at the first stage, aspect ratio of the discorectangles ɛ (length to diameter of ratio ɛ=l/d) and disk diameter D. All distances were measured using the value of d as a unit of measurement of linear dimensions, the disk diameter was varied in the interval D∈[1-10], and the aspect ratio value was varied in the interval ɛ∈[1-50]. The dependencies of the jamming coverage of particles deposited at the second stage versus the parameters of the models were analyzed. The presence of first deposited particles for both models regulated the maximum possible disk diameter D_{max} (SD model) or the maximum aspect ratio ɛ_{max} (DS model). This behavior was explained by the deposition of particles in the second stage into triangular (SD model) or elongated (DS model) pores formed by particles deposited at the first stage. The percolation connectivity of disks (SD model) and discorectangles (DS model) for the particles with a hard core and a soft shell structure was analyzed. The disconnectedness was ensured by overlapping of soft shells. The dependencies of connectivity versus the parameters of SD and DS models were also analyzed.

Inverse percolation by removing straight semirigid rods from bilayer square lattices.

Numerical simulations and finite-size scaling analysis have been carried out to study the problem of inverse percolation by removing semirigid rods from a L×L square lattice that contains two layers (and M=L×L×2 sites). The process starts with an initial configuration where all lattice sites are occupied by single monomers (each monomer occupies one lattice site) and, consequently, the opposite sides of the lattice are connected by nearest-neighbor occupied sites. Then the system is diluted by removing groups of k consecutive monomers according to a generalized random sequential adsorption mechanism. The study is conducted by following the behavior of two critical concentrations with size k: (1) jamming coverage θ_{j,k}, which represents the concentration of occupied sites at which the jamming state is reached, and (2) inverse percolation threshold θ_{c,k}, which corresponds to the maximum concentration of occupied sites for which connectivity disappears. The obtained results indicate that (1) the jamming coverage exhibits an increasing dependence on the size k-it rapidly increases for small values of k and asymptotically converges towards a definite value for infinitely large k sizes θ_{j,k→∞}≈0.2701-and (2) the inverse percolation threshold is a decreasing function of k in the range 1≤k≤17. For k≥18, all jammed configurations are percolating states (the lattice remains connected even when the highest allowed concentration of removed sites is reached) and, consequently, there is no nonpercolating phase. This finding contrasts with the results obtained in literature for a complementary problem, where straight rigid k-mers are randomly and irreversibly deposited on a square lattice forming two layers. In this case, percolating and nonpercolating phases extend to infinity in the space of the parameter k and the model presents percolation transition for the whole range of k. The results obtained in the present study were also compared with those reported for the case of inverse percolation by removal of rigid linear k-mers from a square monolayer. The differences observed between monolayer and bilayer problems were discussed in terms of vulnerability and network robustness. Finally, the accurate determination of the critical exponents ν, β, and γ reveals that the percolation phase transition involved in the system has the same universality class as the standard percolation problem.

Random sequential adsorption of self-avoiding chains on two-dimensional lattices.

Random sequential adsorption of extended objects deposited on two-dimensional regular lattices is studied. The depositing objects are chains formed by occupying adsorption sites on the substrate through a self-avoiding walk of k lattice steps; these objects are also called "tortuous k-mers." We study how the jamming coverage, θ_{j,k}, depends on k for lattices with different connectivity (honeycomb, square, and triangular). The dependence can be fitted by the function θ_{j,k}=θ_{j,k→∞}+B/k+C/k^{2}, where B and C are found to be shared parameters by the three lattices and θ_{j,k→∞} (>0) is the jamming coverage for infinitely long k-mers for each of them. The jamming coverage is found to have a growing behavior with the connectivity of the lattice. In addition, θ_{j,k} is found to be higher for tortuous k-mers than for the previously reported for linear k-mers in each lattice. The results were obtained by means of numerical simulation through an efficient algorithm whose characteristics are discussed in detail. The computational method introduced here also allows us to investigate the full-time kinetics of the surface coverage θ_{k}(t) [θ_{j,k}≡θ_{k}(t→∞)]. Along this line, different time regimes are identified and characterized.

Percolation and jamming properties in object growth model on a lattice with impurities

Percolation model with nucleation and object growth is studied by Monte Carlo simulations on a triangular lattice with point-like impurities. Growing objects are needle-like objects and self-avoiding random walk chains. In each run through the system the lattice is initially randomly occupied by point-like impurities at given concentration . Then the seeds for the object growth are randomly distributed at given concentration ρ. The percolation properties and the jamming densities are compared for the two classes of growing objects on the basis of the results obtained for a wide range of densities ρ and up to the percolation threshold for the monomer deposition on a triangular lattice. Values of the percolation thresholds have lower values for the needle-like objects than for the self-avoiding random walk chains. The difference is largest for the lowest values of ρ and , and ceases near the values of the site percolation threshold for monomers on the triangular lattice, . Values of the jamming coverage decrease with for given ρ. This effect is more prominent for the growing random walk chains.

Parameterized and Large-Dynamic-Range 2-D Precise Controllable SAR Jamming: Characterization, Modeling, and Analysis

Barrage jamming technique with controllable jamming coverage against synthetic aperture radar (SAR) systems is of great importance in electronic countermeasures. However, it is still a difficulty for the jammer to accurately impose controllable two-dimensional (2-D) local jamming on the regions of interest (ROIs). In this respect, a new parameterized and large-dynamic-range precise controllable (PLDR-PC) jamming method has been proposed in this paper to assist in solving such problems. Based on the SAR imaging properties of linear frequency modulation (LFM) case, the range and azimuth modulation factors have been well designed to generate large dynamic controllable coverage of jamming signals with high 2-D processing gain. In such a context, the PLDR-PC technique can provide the optimal power allocation and considerably reduce the jamming power while still ensuring the satisfactory performance. The proposed PLDR-PC technique can improve the jamming efficiency and considerably reduce the exposure probability of the jammer. Moreover, to improve the barrage jamming performance, the parameter estimation error model is also established to determine the simple yet valid jamming strategy in practical implementations. Finally, extensive numerical simulations in comparison with the current jamming methods have been carried out to demonstrate the effectiveness and prospect of the PLDR-PC technique against airborne/spaceborne SAR systems.

A Controllable Suppression Jamming Method against SAR Based on Active Radar Transponder

A chirp-mismatch echo signal can be generated by exchanging the I and Q baseband signals of a received SAR signal. In this paper, the basic generation principles of a chirp-mismatch echo signal are analyzed. Then, a suppression jamming method with controllable jamming position and coverage area is proposed. This method firstly performs chirp-mismatch processing on the received SAR signals, then controls the range jamming coverage and center position through range shift-frequency modulation and time delay, and controls the azimuth jamming coverage and center position through motion modulation and azimuth shift-frequency modulation. Theoretical analysis and simulation results show that this method can effectively control the location and coverage of a jamming result without convolution modulation, and it is easy to implement in engineering. The simulation results verify the correctness of the theoretical model, which can provide a basis for the implementation and application of SAR jamming based on the active radar transponder.

Simulation study of random sequential deposition of binary mixtures of lattice animals on a three-dimensional cubic lattice

Random sequential adsorption of mixtures of objects of various shapes on a three-dimensional (3D) cubic lattice is studied numerically by means of Monte Carlo simulations. Depositing objects are ‘lattice animals’, made of a certain number of nearest neighbor sites on a lattice. We analyzed binary mixtures composed of shapes of equal size, n = 3, 4, 5. We concentrate here on the influence of geometrical properties of the shapes on the jamming coverage θ J and on the temporal evolution of the density θ(t). The approach of the coverage θ(t) to the jamming limit θ J is found to be exponential, θ J − θ(t) ∼ exp(−t/σ), both for the mixtures and their components. The values of the relaxation time σ are determined by the number of different orientations m that lattice animals can take when placed on a cubic lattice. The value of the relaxation time σ for a mixture is approximately twice the relaxation time for the pure component shape with a larger number m of possible orientations. Depending on the local geometry of the objects making the mixture, the jamming coverage of a mixture θ J can be either greater than both single-component jamming coverages or it can be in between these values. The first case is the most common, while in the second case, the jamming density of the mixture is very close to the higher jamming density for the pure component shapes. For a majority of the investigated mixtures, a component with a larger number of orientations m has a larger value of the fractional jamming density.

Jamming and percolation in the random sequential adsorption of a binary mixture on the square lattice

We study the competitive irreversible adsorption of a binary mixture of monomers and square-shaped particles of linear size R on the square lattice. With the random sequential adsorption model, we investigate how the jamming coverage and percolation properties depend on the size ratio R and relative flux F. We find that the onset of percolation of monomers is always lower for the binary mixture than in the case with only monomers (R = 1). Moreover, for values F below a critical value, the higher is the flux or size of the largest species, the lower is the value of the percolation threshold for monomers.

Confinement effects on the random sequential adsorption packings of elongated particles in a slit.

The behavior of a system of two-dimensional elongated particles (discorectangles) packed in a slit between the two parallel walls was analyzed using a simulation approach. The packings were produced using the random sequential adsorption model with continuous positional and orientational degrees of freedom. The aspect ratio (length-to-width ratio, ɛ=l/d) of the particles was varied within the range ɛ∈[1;32] while the distance between the walls was varied within the range h/d∈[1;80]. The properties of deposits in jammed state [the coverage, the order parameter, and the long-range (percolation) connectivity between particles] were studied numerically. The values of ɛ and h significantly affected the structure of the packings and the percolation connectivity. Particularly, the observed nontrivial dependencies of the jamming coverage φ(ɛ) or φ(h) were explained by the interplay of the different geometrical factors related to confinement, particle orientation degrees of freedom and excluded volume effects.

Save Our Roads from GNSS Jamming: A Crowdsource Framework for Threat Evaluation.

Global Navigation Satellite Systems (GNSS) jamming is an acute problem in the world of modern navigation. As more and more applications rely on GNSS for both position and timing, jamming ramifications are becoming more severe. In this paper we suggest a novel framework to cope with these threats. First, a Bayesian jamming detection algorithm is introduced. The algorithm can both detect and track several jammers in a pre-defined region of interest. Then, a jamming coverage map algorithm is offered. Similar to cellular coverage maps, such a map can detect “weak” GNSS reception spots and handle them. Since jamming interference can be a dynamic phenomenon (e.g., a vehicle equipped with a jammer), the coverage map changes with time. Thus, interference patterns can be detected more easily. Utilizing the offered algorithm, both on simulation and field experiments, we have succeeded to localize an arbitrary jammer(s) within the region of interest. Thus, the results validate the viability of the proposed method.

Adsorption kinetics and thermodynamic properties of a binary mixture of hard-core particles on a square lattice.

The adsorption kinetics and thermodynamic properties of a binary mixture on a square lattice are studied using the random sequential adsorption with surface diffusion (RSAD). We compare the adsorption of binary species with different equilibrium rate constants and effective rates of adsorption to a surface and find that the temporal evolution of surface coverages of both species can be obtained through the use of the blocking function of a system with irreversible adsorption of highly diffusive particles. Binary mixtures, when one of the components follows the random sequential adsorption (RSA) without surface diffusion and the other follows the RSAD model, display competitive adsorption in addition to cooperative phenomena. Specifically, (i) species replacement occurs over a long period of time, while the total coverage remains unchanged after a short time, (ii) the presence of the RSAD component shifts the jamming coverage to the higher values, and (iii) the maximum jamming coverage is obtained when the effective adsorption of the RSA type components is lower than the other adsorbing particles.

Simulation Studies of Random Sequential Adsorption (RSA) of Mixture of Two-Component Circular Discs

We study Random Sequential Adsorption (RSA) of mixture of two-component circular discs on a two-dimensional continuum substrate by computer simulation for different values of radius ratio $${r}_{A}/{r}_{B}$$ , $$({r}_{A}<{r}_{B})$$ , and relative rate constant $$k = {k}_{A}/{k}_{B}$$ between the discs. For smaller values of radius ratio and all values of relative rate constant between the discs, the approach of instantaneous surface coverage $$\theta (t)$$ to the jammed state surface coverage $$\theta (\infty )$$ of larger and smaller discs, is found to obey a power law behavior $$\theta \left(\infty \right)-\theta (t)\sim {t}^{-p}$$ , separately. For larger values of radius ratio and relative rate constant $$k$$ , the approach is found to obey same power law. Total surface coverage of binary mixture $$\theta (\infty )$$ for all the cases is found always greater than 54.7%, the one component jamming limit. Also, it is found that for a given radius ratio $${r}_{A}/{r}_{B}$$ , there is an optimum value of relative rate constant $$k = {k}_{A}/{k}_{B}$$ for which jamming coverage $$\theta (\infty )$$ is maximum. Also, our study shows that in case of adsorption of a binary mixture of circular discs of a given radius ratio $${r}_{A}/{r}_{B}$$ , relative rate constant $$k$$ can be fixed in order to get maximum or desired surface coverage. Microstructural properties of the coverings formed by RSA of binary mixture of circular discs are studied by analyzing radial distribution function and volume distribution of pores.

Jamming and percolation of linear k-mers on honeycomb lattices.

Numerical simulations and finite-size scaling analysis have been performed to study the jamming and percolation behavior of elongated objects deposited on two-dimensional honeycomb lattices. The depositing particle is modeled as a linear array of length k (so-called k-mer), maximizing the distance between first and last monomers in the chain. The separation between k-mer units is equal to the lattice constant. Hence, k sites are occupied by a k-mer when adsorbed onto the surface. The adsorption process starts with an initial configuration, where all lattice sites are empty. Then, the sites are occupied following a random sequential adsorption mechanism. The process finishes when the jamming state is reached and no more objects can be deposited due to the absence of empty site clusters of appropriate size and shape. Jamming coverage θ_{j,k} and percolation threshold θ_{c,k} were determined for a wide range of values of k (2≤k≤128). The obtained results shows that (i)θ_{j,k} is a decreasing function with increasing k, being θ_{j,k→∞}=0.6007(6) the limit value for infinitely long k-mers; and (ii)θ_{c,k} has a strong dependence on k. It decreases in the range 2≤k<48, goes through a minimum around k=48, and increases smoothly from k=48 up to the largest studied value of k=128. Finally, the precise determination of the critical exponents ν,β, and γ indicates that the model belongs to the same universality class as 2D standard percolation regardless of the value of k considered.

Irreversible bilayer adsorption of straight semirigid rods on two-dimensional square lattices: Jamming and percolation properties.

Numerical simulations and finite-size scaling analysis have been performed to study the jamming and percolation behavior of straight semirigid rods adsorbed on two-dimensional square lattices. The depositing objects can be adsorbed on the surface forming two layers. The filling of the lattice is carried out following a generalized random sequential adsorption (RSA) mechanism. In each elementary step, (i) a set of k consecutive nearest-neighbor sites (aligned along one of two lattice axes) is randomly chosen and (ii) if each selected site is either empty or occupied by a k-mer unit in the first layer, then a new k-mer is then deposited onto the lattice. Otherwise, the attempt is rejected. The process starts with an initially empty lattice and continues until the jamming state is reached and no more objects can be deposited due to the absence of empty site clusters of appropriate size and shape. A wide range of values of k (2≤k≤64) is investigated. The study of the kinetic properties of the system shows that (1) the jamming coverage θ_{j,k} is a decreasing function with increasing k, with θ_{j,k→∞}=0.7299(21) the limit value for infinitely long k-mers and (2) the jamming exponent ν_{j} remains close to 1, regardless of the size k considered. These findings are discussed in terms of the lattice dimensionality and number of sites available for adsorption. The dependence of the percolation threshold θ_{c,k} as a function of k is also determined, with θ_{c,k}=A+Bexp(-k/C), where A=θ_{c,k→∞}=0.0457(68) is the value of the percolation threshold by infinitely long k-mers, B=0.276(25), and C=14(2). This monotonic decreasing behavior is completely different from that observed for the standard problem of straight rods on square lattices, where the percolation threshold shows a nonmonotonic k-mer size dependence. The differences between the results obtained from bilayer and monolayer phases are explained on the basis of the transversal overlaps between rods occurring in the bilayer problem. This effect (which we call a "cross-linking effect"), its consequences on the filling kinetics, and its implications in the field of conductivity of composites filled with elongated particles (or fibers) are discussed in detail. Finally, the precise determination of the critical exponents ν,β, and γ indicates that, although the increasing in the width of the deposited layer drastically affects the behavior of the percolation threshold with k and other critical properties (such as the crossing points of the percolation probability functions), it does not alter the nature of the percolation transition occurring in the system. Accordingly, the bilayer model belongs to the same universality class as two-dimensional standard percolation model.

Irreversible multilayer adsorption of semirigid k-mers deposited on one-dimensional lattices.

Irreversible multilayer adsorption of semirigid k-mers on one-dimensional lattices of size L is studied by numerical simulations complemented by exhaustive enumeration of configurations for small lattices. The deposition process is modeled by using a random sequential adsorption algorithm, generalized to the case of multilayer adsorption. The paper concentrates on measuring the jamming coverage for different values of k-mer size and number of layers n. The bilayer problem (n≤2) is exhaustively analyzed, and the resulting tendencies are validated by the exact enumeration techniques. Then, the study is extended to an increasing number of layers, which is one of the noteworthy parts of this work. The obtained results allow the following: (i) to characterize the structure of the adsorbed phase for the multilayer problem. As n increases, the (1+1)-dimensional adsorbed phase tends to be a "partial wall" consisting of "towers" (or columns) of width k, separated by valleys of empty sites. The length of these valleys diminishes with increasing k; (ii) to establish that this is an in-registry adsorption process, where each incoming k-mer is likely to be adsorbed exactly onto an already adsorbed one. With respect to percolation, our calculations show that the percolation probability vanishes as L increases, being zero in the limit L→∞. Finally, the value of the jamming critical exponent ν_{j} is reported here for multilayer adsorption: ν_{j} remains close to 2 regardless of the considered values of k and n. This finding is discussed in terms of the lattice dimensionality.

DESIGN AND PERFORMANCE OF MOBILE PHONE JAMMER

The continuously use of mobile phone can be attributed to it can use in any places and thus have become one of the most widely used devices in mobile communication which makes it so important in our lives. The convenience and portability of cellphones has made it possible to be carried everywhere. e.g Churches, lecture halls, medical centers etc. Its benefit can create disturbance in some places when there is continuous beeping or ringtones of cell phones which becomes annoying when such noise is disturbance in areas where silence is required or the use or of mobile phone is restricted or prohibited like Libraries and Study rooms A mobile phone jammer is an instrument used to prevent cellular phones from receiving signals from base station. It is a device that transmit signal on the same frequency at which the GSM system operates, the jamming success when the mobile phones in the area where the jammer is located are disabled. The mobile phone jammer unit is intended for blocking all mobile phone types within designated indoor areas. The mobile Phone Jammer is a 'plug and play' unit, its installation is quick and its operation is easy. Once the mobile Phone Jammer is operating, all mobile phones present within the jamming coverage area are blocked, and cellular activity in the immediate surroundings (including incoming and outgoing calls, SMS, pictures sending, etc.) is jammer. This paper focuses on the design of a cell phone jammer to prevent the usage of mobile communication in restricted areas without interfering with the communication channels outside its range.

Jamming and percolation for deposition of k^{2}-mers on square lattices: A Monte Carlo simulation study.

Percolation and jamming of k×k square tiles (k^{2}-mers) deposited on square lattices have been studied by numerical simulations complemented with finite-size scaling theory and exact enumeration of configurations for small systems. The k^{2}-mers were irreversibly deposited into square lattices of sizes L×L with L/k ranging between 128 and 448 (64 and 224) for jamming (percolation) calculations. Jamming coverage θ_{j,k} was determined for a wide range of k values (2≤k≤100 with many intermediate k values to allow a fine scaling analysis). θ_{j,k} exhibits a decreasing behavior with increasing k, being θ_{j,k=∞}=0.5623(3) the limit value for large k^{2}-mer sizes. In addition, a finite-size scaling analysis of the jamming transition was carried out, and the corresponding spatial correlation length critical exponent ν_{j} was measured, being ν_{j}≈1. On the other hand, the obtained results for the percolation threshold θ_{c,k} showed that θ_{c,k} is an increasing function of k in the range 1≤k≤3. For k≥4, all jammed configurations are nonpercolating states and, consequently, the percolation phase transition disappears. An explanation for this phenomenon is offered in terms of the rapid increase with k of the number of surrounding occupied sites needed to reach percolation, which gets larger than the sufficient number of occupied sites to define jamming. In the case of k=2 and 3, the percolation thresholds are θ_{c,k=2}(∞)=0.60355(8) and θ_{c,k=3}=0.63110(9). Our results significantly improve the previously reported values of θ_{c,k=2}^{Naka}=0.601(7) and θ_{c,k=3}^{Naka}=0.621(6) [Nakamura, Phys. Rev. A 36, 2384 (1987)0556-279110.1103/PhysRevA.36.2384]. In parallel, a comparison with previous results for jamming on these systems is also done. Finally, a complete analysis of critical exponents and universality has been done, showing that the percolation phase transition involved in the system has the same universality class as the ordinary random percolation, regardless of the size k considered.

Effects of competition between random sequential nucleation of point-sized seeds and island growth by adsorption of finite-sized grains.

We study random sequential adsorption of particles from a pool onto a one-dimensional substrate following ballistic deposition rules with separate nucleation and growth processes occurring simultaneously. Nucleation describes the formation of point-sized seeds, and after a seed is sown, it acts as an attractor and grows in size by the addition of grains of a fixed size. At each time step either an already-nucleated seed can increase in size, or a new seed may be nucleated. We incorporate a parameter m to describe the relative rates of growth to nucleation. We solve the model analytically to obtain a gap size distribution function and a general expression for the jamming coverage as a function of m. We show that the jamming coverage θ(m) reaches its maximum value of θ(m)=1 in the limit m→∞ following a power-law θ(∞)-θ(m)∼Km^{-1/2} for some constant K. We also perform an extensive Monte Carlo simulation and find good agreement between analytic and numerical results.