# Patent

## Title
Method for jamming communications in an open-loop-controlled network

## Abstract

A method for optimizing the jamming of P predefined zones or positions in a communications network of transmitters, jammers and receivers comprising several platforms, uses a local reception situation at the level of each friendly platform, a local jamming situation at the level of each friendly reception platform, and determines for each friendly transmitting platform and each friendly receiving platform, one or more parameters so as to minimize or to eliminate the fratricidal effects on the friendly reception platforms.

## Background
CROSS-REFERENCE TO RELATED APPLICATION
This application claims priority to foreign French patent application No. FR 1203479, filed on Dec. 19, 2012, the disclosure of which is incorporated by reference in its entirety.
FIELD OF THE INVENTION
The invention relates to a method of jamming with optimization of the effectiveness and limitation by open-loop control of the fratricidal effects on telecommunications posts associated with a communications network to be safeguarded.
The method according to the invention applies, for example, for jamming certain chosen communication links between entities external to the network to be safeguarded while preserving the communications links in the communications network.
BACKGROUND
The joint use by one and the same force of transmission networks and of jammers (or of networks of jammers) in a theatre of operations in the broad sense, and particularly in terrestrial convoys, in flights of aircraft and in squadrons of ships, is often greatly penalized by the absence of precise control of the effects induced by the jammer or jammers on the transmission post or posts of the network or networks of the force.
The technical problem to be solved for the jointly used transmission networks and the jammers is to limit the fratricidal effects of the jammers on the transmission posts, while guaranteeing a minimum of effectiveness of the jamming on the targets or on the sectors of interest of the theatre.
A first optimization method described in the applicant's patent application FR 11 03578 relies on setting up closed-loop centralized control. This method addresses the problem by resorting to a master station for the jammers, this possibly not being appropriate for all technico-operational situations. A need currently exists for a method that solves the technical problem in open-loop, implementing decentralized decisions at the level of each transmitting and receiving station.
DEFINITIONS
Jammer: transmission system capable of transmitting a signal intended to prevent the operation of all or some of the equipment using the electromagnetic spectrum (transmission posts, radar or navigation systems present in the theatre of operations). A jammer is designated in the subsequent description by the letters Br, the jamming signal by b, the jamming signal vector by B.

Network of jammers: coordinated set of transmission systems which are adapted for transmitting signals intended to prevent the operation of all or some of the equipment using the electromagnetic spectrum present in the theatre of operations.

“Friendly” transmission post or “friendly post”: transmission post defined as forming part of the communications system to be safeguarded and having to be protected from the effects of jamming.

“Friendly” transmission network or “friendly network”: interconnectable set of “friendly” transmission posts.

Friendly transmission: transmission originating from a friendly post or from a friendly jammer.

“Target” equipment: equipment defined as having to be affected by the jamming.

Communicating jammer: jammer furnished with a “friendly” transmission post.

Network of communicating jammers: network of jammers furnished with “friendly” transmission posts, constituting a friendly transmissions sub-network.

Jamming of target equipment: Transmission of a signal or of several signals, from a jammer or from a network of jammers, in such a way that the target equipment is prevented from implementing or from maintaining its service.

Jamming of a geographical zone: Transmission of a signal or of several signals, from a jammer or from a network of jammers, in such a way that any target equipment present in the geographical zone is prevented from implementing or from maintaining its service.

Detection of a signal: capability to decide the presence of a friendly transmission or one originating from an external entity and to intercept the signal. This detection is performed in the band and the duration of analysis of one or more interceptors, analysis module or detection or “sensing” function which may be, for example, hosted by the friendly transmission posts or in direct connection with the friendly posts.

Detection of a transmitter: capability to decide the presence of a transmitter in the theatre by detecting the signal or signals that it transmits.

Location of a transmitter: capability to decide the site of a transmitter in the theatre by detecting the signal or the signals that it transmits.

SISO: single input single output: said of a system of transmissions with one transmitting pathway Tx, one receiving pathway Rx.

SIMO: single input multiple output: said of a system of transmissions with one pathway Tx, N pathways Rx.

MISO: Multiple Input, Single Output: said of a system of transmissions with M pathways Tx, one pathway Rx.

MIMO: Multiple Input, Multiple Output: said of a system of transmissions with M pathways Tx, N pathways Rx.

CIR: Channel Impulse Response: said of the impulse response of the transmission channel, considered to be a finite-response filter.

The term matrix designates a channel matrix.

The domain of jamming has formed the subject of numerous studies and inventions. However, fratricidal effects are always treated fairly poorly in developments known to date. In general, the constraints associated with the implementation of the methods and systems known to the applicant have the effect notably of drastically limiting the ranges and the number of simultaneous friendly radiocommunications, or indeed even of preventing the use of friendly radiocommunications.
SUMMARY OF THE INVENTION
The subject of the present invention relates, notably, to a method which will make it possible to effectively limit the fratricidal effects with a flexibility and a range sufficient to simultaneously allow the jamming of the targets or zones to be jammed and the functioning of the communications between friendly posts in an operational context.
The invention can be implemented on friendly posts employing multiple waveforms on condition that:
the jammers follow frequency plans, temporal patterns and waveforms known to the friendly transmitters/receivers, or readily recognizable to in-situ analysis from among a set known in advance,
the friendly transmitters implement signal sequences detailed in the subsequent description,
the friendly receivers can carry out the measurements on the jamming signals and the friendly signals so as to formulate a local jamming situation and a local reception situation, and to decide the best transmission/reception strategy for the current communication links or those currently being established.
The invention relates to a method for minimizing in an adaptive and decentralized manner the fratricidal effects induced by the jamming of P predefined zones ZB or positions in a communications network comprising friendly transmitters, jammers and friendly receivers, the said network comprising N_pl platforms, a number M≦N_pl of the said platforms, termed friendly transmission platforms being equipped with antennas and with systems for transmitting useful transmission signals configurable in a dynamic manner, a number N≦N_pl of the said platforms, also termed friendly, being equipped with dynamically configurable antennas and systems for receiving useful transmission signals, a number J≦N_pl of the said platforms being equipped with jamming systems and antennas having characteristics known to the friendly transmission and reception platforms, the said jamming systems and antennas being adapted for preventing the transmissions between entities external to the said network of friendly platforms, the said platforms constituting a network, characterized in that it comprises at least the following steps:
E0: Establishing a local reception situation: at the level of each of the N friendly reception platforms measuring, E1, the friendly communication signals Su received by the said platforms originating from the M friendly transmitters, on the basis of the said measurements, for each of the N friendly reception platforms, estimating, E2, the M useful levels received and the M useful propagation channels, N*M estimates,
E3: Establishing a local jamming situation: at the level of each of the N friendly reception platforms measuring, E4, the jamming signals received by the said friendly reception platforms originating from the J jammers, on the basis of the measurements of the jamming signals, for each of the N friendly reception platforms, estimating, E5, the J fratricidal jamming levels received and the J fratricidal jamming channels, N*J estimates in all,
ascertaining a priori the waveforms of the jamming signals and the associated parametrizations, on the basis of the states of the local situations of jamming established by each of the N receiving platforms on the J signals originating from the J jammers, on the basis of the local reception situation established by each of the N receiving platforms on the useful communication signals Su; determining for each of the M friendly transmitting platforms and for each of the N friendly receiving platforms, at least one of the following configuration parameters: a frequency plan, and/or temporal positionings of the transmissions, antenna diagrams and/or orientations, radio access schemes and modulation/coding schemes for the signals transmitted and received, the parameter or parameters being adapted for minimizing or eliminating the fratricidal effects on the N friendly reception platforms,
using the said configuration parameters in transmission and/or reception for the M friendly transmission platforms and the N friendly reception platforms.
After having defined a first set of configuration parameters for the M friendly platforms and for the N friendly platforms, the method will repeat steps E0 to E5 over time so as to maintain and to optimize the configuration parameters for the platforms.
The method uses, for example, the measurement of the propagation channels originating from the J jamming platforms, to recognize in situ a predefined and known jamming strategy so as to jointly optimize the transmission and the quality of the transmissions useful at the level of the friendly transmitting and receiving platforms by adapting the transmission power levels and/or the frequency plans and/or the temporal positioning of the transmissions and/or the spatio-temporal coding schemes and/or the radioelectric resource access protocols employed by the friendly transmitters and receivers.
The method can use jamming signals which code, in a manner known to the friendly receivers, the information useful to the friendly transmitters and receivers so as to inform the latter of the jamming strategy employed, of the characteristics of the jamming waveforms and associated parameters, transmission power, type of diagram and orientation of the antennas, position, altitude, to facilitate the joint optimization of the transmissions and reception processings of the transmissions useful at the level of the friendly transmitting and receiving platforms, the said coded information being reconstructed by the analysis of the jamming signals received by the friendly receivers or being decoded in the jamming signals received by the friendly receivers.
According to a variant embodiment, the method uses, for example, friendly programmable transmitters and receivers adapted for taking dynamic account of the transmission setpoints, regarding the power and/or regarding temporal parameters, the waveform, the spatio-temporal codings, the amplitude phase weighting of the antenna elements.
The method can be used in transmission networks using the MIMO, MISO, SIMO or SISO protocols with or without return pathway from the friendly receivers to the friendly transmitters.
The method can also be used in a radio network comprising receivers adapted for measuring values of transmission channels on the useful transmitters and on the jammers.
According to another variant, the method can be used in a radio network comprising one or more reception posts comprising antennal elements coupled to an interceptor which is adapted for performing transmission channel measurements on the useful transmitters and on the jammers.
The method exploits decentralized decision specific to each friendly transmitter friendly receiver link. It utilizes notably the capabilities of measurements of environment at work in modern modems (SISO, MISO, SIMO and MIMO according to case). It also utilizes the a priori knowledge, by the friendly transmitter receiver posts, of the frequency plans, jamming patterns and waveforms, thereby rendering them readily recognizable by the friendly posts with a minimum of analysis, undertaken at the same time as the CIR measurements and as the informed equalization methods specific to modern modems. Moreover, the frequency plans, temporal patterns and coding modulation schemes specific to the friendly links can likewise be predefined in advance with a reduced set of parameters, and adapted on the fly to the radioelectric situation, according to the frequency occupancy of the channels, the temporal patterns and the jamming waveforms. The analysis needs in the friendly transmitters/receivers are then reduced and the decision taking regarding the adaptation of the friendly communication signals is thereby simplified.



BRIEF DESCRIPTION OF THE DRAWINGS
Other characteristics and advantages of the present invention will become more apparent on reading the description given by way of wholly nonlimiting illustration, accompanied by the figures which represent:
FIG. 1, an exemplary architecture of the system according to the invention,
FIG. 2, a formal example of model of generalized propagation channel in the MIMO case, with definitions and notations of the pertinent geometric and physical quantities,
FIGS. 3A, 3B, an illustration of the notions of network graph and of macrograph which are used to describe the links between friendly posts (Tx, Rx), the interactions between jammers Br and external entities to be jammed,
FIG. 4, a logical product between network graph and channel matrix, defining a generalized channel matrix which takes account at one and the same time of the links or interactions between the parties, transmitters receivers, jammers, zones or points to be jammed, and of the propagation channels between these parties.



DETAILED DESCRIPTION
The example which follows is given by way of wholly nonlimiting illustration for a communication system comprising N_pl transmission platforms which have MIMO, MISO, SIMO or SISO communication posts.
FIG. 1 shows diagrammatically an exemplary network architecture in which the method according to the invention can be implemented.
One or more reception stations Rx1, Rx2, . . . , RxN are in point-to-point or point-to-multipoint link by RF communication pathway for example with M=N_pl−1≦N_pl friendly transmitter/receiver platforms or posts 10, that is to say posts equipped with a transmitting part Tx and with a receiving part Rx. The M friendly platforms are equipped with dynamically configurable antennas 10e and with systems 11 for transmitting useful transmission signals.
The network comprises a number N≦N_pl of the said platforms, also termed friendly, being equipped with dynamically configurable antennas 12r and with systems 13 for receiving useful transmission signals.
From among these N_pl platforms, a number J≦N_pl “jammer” platforms Br1, . . . BrJ have system 14 and a jamming antenna 15b, of omnidirectional type, of directional type or of network type. The transmission characteristics of the systems and antennas are known to the friendly platforms. The transmission characteristics are notably chosen so as to prevent the transmissions between entities external to the said network of friendly platforms, the said platforms constituting an inter-platform network.
The friendly platforms (jammers or without jammer) therefore define an inter-platform communications network which appears, if the set of antennal elements is considered, as a macro-network. Also represented in FIG. 1 is a zone to be jammed ZB in which radio equipment external to the network of friendly posts may be situated. Each reception station Rx1 to RxN receives from the M transmitter posts Tx1 . . . TxM, friendly useful communication signals. A station performs measurements of signal level received Nsr and of channel impulse responses. Each station also receives from the jammers Br1, . . . BrJ, jamming signals Sb regarding which it is informed (that is to say it knows the main characteristics thereof a priori) and can also conduct measurements of jamming signal level received Nbr and of channel impulse responses.
Each station is equipped with a device adapted for managing, at each instant, the communication links with the other stations, the device being for example a decision and decentralized local control facility 20 specific to each friendly transmitter/receiver link.
The decision facilities correspond, for example, to the MAC access layer of a terminal or of a master post. A post comprises a processing device receiving the information on the friendly signal, jamming signal, the values of the associated channels and which is adapted for deducing therefrom the values of the transmission/reception parameters which make it possible not to disturb the links between friends.
The communication links are represented in FIG. 1 in the following manner:
I: conventional common link including the set of measurements performed on the communications links or “reporting” (measurements performed by the friendly posts or by friendly interceptors in favour of the friendly posts on the sequences of signals transmitted by the friendly transmitters Tx) retransmitted if appropriate by return pathway to the friendly posts Tx,

II: link comprising the “reporting” of the measurements on jammer signal, i.e. the set of measurements performed on the jammer signals (measurements performed by the friendly receivers or by interceptors in favour of the friendly receiver posts on the sequences of signals transmitted by the jammers Br, information retransmitted if appropriate by return pathway to the friendly posts Tx),

III: link for control of the jammers on the basis of the information collected by the receivers or interceptors on the jammer platform (or in conjunction with the latter) and of the local decision facility, which are specific to the friendly Tx friendly Rx links, and

IV: transmission of the jamming signals towards the zone aimed at ZB and/or towards the external entities Ci outside the friendly network.

The method implemented by the invention relies notably on:

    
    
        the recordings/measurements of the communication signals received by interceptors, dedicated analysis modules and environment appraisal function (or “sensing”) which are for example co-located or integrated with at least one of the friendly posts,
        the recordings/measurements of the jamming signals interfering with the friendly posts, by interceptors, dedicated analysis modules and sensing function which are for example co-located or integrated with at least one of the friendly posts,
        a formal description of the interactions between friendly transmitter posts Tx, friendly receiver posts Rx, jammers Br and external entities to be jammed Ci, by graphs and macro-graphs which will be specified hereinafter,
        on a general model of propagation of the transmission channel, generalized to take account of the effective interactions between friendly transmitter and receiver posts (Tx Rx) (generally integrated together within a friendly transmission post), jammers Br and external entities Ci, through a notion of generalized channel matrix specified hereinafter,
        on the casting and then on the partial solving of a constrained optimization problem, specified hereinafter,
        jammers which are programmable and dynamically configurable in terms of waveform (envelope, modulation, amplitude, phase, etc.), and for which the frequency plans (choice of the bands, sub-bands and carriers of the jamming signal), the temporal transmission patterns (recurrence of the transmissions according to time and frequency) are known,
        of jamming waveforms, which are multiple and if appropriate complex, but known to the friendly receivers,
        sequences of digital signals Sb transmitted by the jammers, chosen and adapted to allow precise measurements in reception on the said jamming signals received by the posts or stations of the network,
        sequences of digital signals Su transmitted by the friendly transmitters, chosen so as to allow precise measurements in reception on the said friendly signals received by the posts or stations of the network,
        a formulation of the local jamming situation at the level of a post, according to the jamming power measurements received on the posts and of the associated transmission channels; the formulation is performed by the friendly posts, aided by the a priori knowledge by the friendly receivers of the frequency plans, temporal patterns and possible jamming waveforms,
        a formulation of the local reception situation at the level of a station, according to the precise measurements of received useful power originating from the friendly transmitters and associated transmission channels; the formulation is performed by the friendly posts, aided by the a priori knowledge by the friendly receivers of the frequency plans, temporal patterns and possible friendly waveforms,
        of frequency plans, transmission patterns and recurrences, parametrizable spatio-temporal coding and modulation schemes for the digital signals transmitted by the friendly transmitters, chosen and intended to allow them to dynamically adapt the transmission links to the jamming situation, at one and the same time by antenna processing (optimal dispositions and orientations of the antenna patterns in transmission and reception) and by time frequency processing (equalization, modulation and adaptive codings and bitrates, etc.),
        decentralized decision facilities, or indeed ones internal to the friendly posts, allowing the formulation of setpoints and transmission reception adaptive parametrizations which optimize the links between friendly posts, the said decisions being based on the formulation of the local jamming situations and on the formulation of the aforementioned local reception situations.
    
    


In the subsequent description, the channels are determined as consisting of the set of RF propagations between each of the transmitters (jammer or friendly communication transmitter) and each of the friendly communication receivers or each of the targets or zones to be jammed Ci (the zones to be jammed being discretized in the forms of lists of points to be jammed).
The channel matrix is the matrix of the combinations of RF propagation channels between the transmitters and the receivers (Tx Rx channel matrix), between the jammers and the receivers (Br Rx channel matrix) or between the jammers and each of the points to be jammed (Br, Ci channel matrix). These matrices are considered in a first global approach between the platforms (and not between the antennal elements present on each platform) and the value am,n of an element of the channel matrix therefore describes physically and globally the RF channel between platform m and platform n. In the case where a friendly receiver comes into play, the matrix is filled in on the basis of the measurements performed on the useful signals and on the jammer signals. In the case where a zone or a point to be jammed Ci comes into play, the matrix is filled in on the basis of a model of propagation between a jammer Br and the target Ci. All these matrices are thereafter considered in a second approach between each transmission antennal element (each platform may be furnished with several transmission antennas, for example jamming antenna and transmission antenna, themselves consisting of arrays of antennal elements) and each reception antennal element (each platform may be furnished with several reception antennas, themselves consisting of arrays of antennal elements). For each of the approaches, the first level of description of this matrix is binary am,n=1 if the platform (respectively the antenna) n, receives a signal from the platform (respectively the antenna) m, a finer level in the second approach in particular, corresponds to considering am,n as the impulse response of the channel m,n, (if appropriate matrix-like) thereby completely characterizing a multiple input multiple output or MIMO, multiple input single output or MISO, single input multiple output or SIMO, or single input single output or SISO linear channel. This impulse response can be estimated in accordance with the measurements performed by the friendly receivers Rx on the sequences of signals and jammers, by models of propagation considered between transmitters or jammers and receivers, and in accordance with the models of propagation considered between jammers or transmitters and target or zone to be jammed.
The knowledge of the positions of the stations is useful for the optimization of the operation of the communication network and used for the optimization of the jamming. A synchronism or a precise date-stamping of the measurements is also useful for better global optimization.
The precise knowledge of the signal sequences contained in the jamming signals Sb and in the useful communication signals Su is used for the measurement of the signal reception levels and the measurement of the corresponding propagation channels by the friendly receivers Rx, and contributes to the global optimization of the method.
The graph-based representations exhibit the advantage of offering a synthetic representation of the set of interactions between the parties. For example, it is possible to represent the platforms or the antennas by placing an arc between two platforms or antennas if the signal transmitted by one is received by the other, and therefore if it has been possible to measure the channel.
Example given in respect of the implementation of the method according to the invention
MIMO, MISO, SIMO, SISO “useful” communication posts are available on platforms in number N_Pl, of which J platforms comprise jammers.
“Networks of Transmitters and Receivers for the Useful Transmissions”
N_pl communication platforms are therefore available. Each of these platforms is MIMO, MISO, SIMO or SISO. The number of transmitting antennal elements of each of the these platforms is denoted M1, M2 . . . , MN—pl. The number of receiving antennal elements of each of the these N platforms is denoted N1, N2 . . . , NN—pl.
The network consisting of the ΣM—pl=Σm=1 . . . N—pl Mm transmitter antennal elements Tx or Br and of the ΣN—pl=Σn=1 . . . N—pl Nn antennal elements Rx appears as a macro-network, a priori greatly sparse. The set of communication platforms constitutes a network represented by the network graph of size N_pl such as defined above and denoted G0. When the set of antennal elements is considered, a representation thereof by the macro-graph of size ΣM—plΣN—pl is preferred, such as defined above and denoted G0′.
The channel matrix of this macro network consisting of N_pl platforms and ΣM—pl+N—pl antennal elements can be written formally, as will be explained hereinafter or as may be seen in FIGS. 3A, 3B, 4, for which a generic notation is used, in the generalized form H0′(Tx,Rx)=G0′∝ [H0(A)(Tx,Rx), H0(R)(Rx,Tx)]. It is determined by the topology of the network (which determines G0 and G0′) and the channel matrices H0(A) and H0(R) specific to each link Txm→Rxn.
In the method implemented, termed “open-loop” according to the invention, the transmitters, receivers and communication nodes of the friendly network manage at each instant t (sampling tk, k=1, 2, . . . ), the communication links and the pertinent parametrizations (protocols, bitrates, coding schemes and modulation, if appropriate, the weighting of the antenna networks in transmissions/reception, use of relays, etc.), by adapting to the radioelectric environment and to the possible jamming residuals, by being explicitly driven by a decentralized, local decision and control facility specific to each friendly Tx-Rx link. The jamming signals and levels themselves are not controlled on the basis of the friendly transmitters or of the receivers, but fixed as a function of independent effectiveness criteria specific to the geometry and to the targets to be jammed. The radioelectric situation and the interference level due to the jammings are measured by the friendly receiver on each link. The frequency plan, the temporal spatio-temporal parametrization of the radio access, the modulation and coding schemes, and the reception processings in the friendly posts are defined by the decentralized local control at the level of each post so as to optimize the useful link and to minimize the residual fratricidal effects related to the jammings, doing so by exploiting the available techniques known to the person skilled in the art on the friendly posts, if appropriate, for example: transposition of the useful communications on empty and/or little-jammed carriers in the frequency plan, “temporal positioning” or “slottage” of the communication on time intervals that are little jammed or left empty by jamming shapes themselves “slotted” or impulsive, antijammed pathway formation, interference reduction techniques and joint separation and demodulation techniques for friendly receivers having antennal networks and/or utilizing orthogonal codings in the useful signals transmitted, bitrate reduction and/or increase in the correcting power of the codings used (at the price of spectral effectiveness, of complexity of the reception processing, of consumption if appropriate), etc.
The set of antennal networks of the transmitters Tx1, . . . , Txm (M≦N_pl) and of the receivers Rx1, . . . , RxN (N≦N_pl) is therefore formalized as a macro-network G0′ (defined by a matrix of size (ΣM—pl+ΣN—pl)2) whose links are completely described as in FIG. 4 by a generalized channel matrix which determines the complete generalized channel H0′(Tx,Rx,τ). These matrices are determined by the topology of the network macro graph G′ by the channel matrices specific to each link Txm→Rxn. The formal construction of these matrices is given in FIG. 4, the examples of FIGS. 3A and 3B, and of FIG. 2 illustrate the taking into account of the propagation channel to construct the channel matrices specific to each link Txm→Rxn. For the path Txm→Rxn, the formal expression for the useful signals originating from the transmitting platforms and received at the level of the receiving platforms is then at each instant t:



  
    
      X
      ⁡
      
        (
        t
        )
      
    
    =
    
      
        (
        
          
            H
            0
            ′
          
          *
          S
        
        )
      
      ⁢
      
        (
        t
        )
      
    
  




  
    
      i
      .
      e
      .
      
        

      
      ⁢
      
        [
        
          
            
              
                
                  X
                  1
                
                ⁡
                
                  (
                  t
                  )
                
              
            
          
          
            
              
                
                  X
                  N
                
                ⁡
                
                  (
                  t
                  )
                
              
            
          
        
        ]
      
    
    =
    
      
        [
        
          
            (
            
              
                
                  
                    H
                    
                      0
                      11
                    
                    ′
                  
                
                
                  
                    H
                    
                      0
                      
                        1
                        ⁢
                        M
                      
                    
                    ′
                  
                
              
              
                
                  
                    H
                    
                      0
                      
                        N
                        ⁢
                        
                          
                        
                        ⁢
                        1
                      
                    
                    ′
                  
                
                
                  
                    H
                    
                      0
                      NM
                    
                    ′
                  
                
              
            
            )
          
          *
          
            (
            
              
                
                  
                    S
                    1
                  
                
              
              
                
                  
                    S
                    M
                  
                
              
            
            )
          
        
        ]
      
      ⁢
      
        (
        t
        )
      
    
  



where

N is the exact number of receiving platforms comprising a reception antenna (N≦N_pl),
M is the exact number of transmitting platforms comprising a transmission antenna intended for the transmissions of useful signals (M≦N_pl),
H0′ is the “transmitters towards receivers” generalized channel matrix,
Xn(t) n=1, . . . , N is the vector of the useful signals received on the network of the antenna elements of the receiving platform of index n,
Sm(t) n=1, . . . , M is the vector of the signals transmitted on the network of the antenna elements of the transmitting platform of index m, of band B.
In FIG. 2 is also represented an exemplary geometry of the propagation in an axis X (East), Y (North).
The link between the element of index m of the network of transmitting platforms and the element of index n of the network of receiving platforms is characterized by:
Sm(t) aforementioned,
Xnm(t), the contribution vector of the signal Sm received on element n of the antennal network in reception,
Xn(t) aforementioned, total signal vector received on sensor n of the network,
Lmn the number of paths of the propagation channel,
I the index of the I-th multi-path,
α(m,n)I the attenuation of path I with respect to the mean losses,
γ(m,n)I, the mean direction of arrival of path I,
τ(m,n)I, the mean delay of path L, the delays are contained in an interval [O, T(m,n)] dependent on the channel; urban, mountainous, etc.
N(m,n), is the number of sub-paths associated with path I, which sub-paths are assumed to be indiscernible for the signal of band B and therefore distributed in an interval of duration T(m,n)<<1/B,
nI is the index of sub-path I,
φ(m,n)nI,I is the phase of the sub-path of indices I and nI,
α(m,n)nI,I is the relative level of the sub-path of indices I and nI,
θ(m,n)nI,I is the direction of arrival of the sub-path of indices I and nI,
Us(θ(m,n)nI,I) is the direction vector corresponding to the sub-path of indices I and nI for the signal source s.
The temporal distribution of the paths determines its type of fading (flat or selective depending on whether T(m,n)≦≧1/B) and its temporal coherence. The temporal distribution of the sub-paths determines its type of fading (flat or selective, depending on whether T(m,n)I≧1/B) and its temporal coherence. The amplitude distribution of the paths (respectively sub-paths) determines its statistical type (Rayleigh or Rice).
The angular distribution of the paths (respectively sub-paths) determines its angular coherence (omni-directional diffusion, diffusion cone).
“Parametrizations and Powers of the Useful Signals According to the Reception Processing”:
Datam represents the useful signal to be transmitted from the transmitter Txm to the receiver Rxn. Sm represents the signal or a signal vector at the output of the friendly transmitter Txm, by the linear transformation Sm=Codingm.Datam which models in all generality a spatio-temporal coding scheme in transmission such as employed in SISO, SIMO, MISO or MIMO transmissions, the operator Codingm representing the spatio-temporal coding applied by the transmitter Txm to the signal of useful data Datam at the input of the said transmitter. The set of possible values for the coding schemes, Codingm, is denoted Dom_Coding.
In all cases, the spatio-temporal operator Codingm can be defined in a vector space of linear operators operating from a vector space of finite dimension (the space of the sampled useful signals of finite spatial dimension taken over a finite temporal horizon and) in an image vector space of finite dimension (the space of the spatio-temporally coded sampled signals, likewise of finite spatial dimension and of finite temporal horizon), and Dom_Coding can be taken as the unit sphere of the said vector space.
The power of the signal Sm is denoted πSm.
It is possible to express πsm in the form πSm=.SmH.Sm.
Xm,n=H0′m,n. Sm represents the input signal or signal vector of a friendly receiver Rxn after propagation in the filter Hm,n.
The power of the signal Xmn is denoted πXmn.
It is possible to express πXmn in the form πXmn=XmnH.Xmn.
Tn represents the set of processings and filterings applied to the input signal Xn to produce the processing output signal represented formally by Ymn=Tn(Xm,n);
Tn models in all generality a spatio-temporal decoding scheme in reception such as employed in SISO, SIMO, MISO or MIMO transmissions.
The set of possible values for the reception processings Tn is denoted Dom_T.
In all cases, the spatio-temporal operator Tn can be defined in a linear vector space of operators operating from a vector space of finite dimension (the space of the signals sampled at reception antenna input, taken over a finite temporal horizon) with value in an image vector space of finite dimension (the space of the spatio-temporally decoded sampled signals), and Dom_T can be taken as the unit sphere of the said vector space.
The power of the signal Ymn is denoted πYmn.
If Tn is purely linear, it is possible to express πYmn as a function of the coding Codingm applied, as a function of the channel H0′m,n, and as a function of the reception processing applied Tn in the form




  
    
      
        
          
            π
            Ymn
          
          ⁡
          
            (
            
              
                Coding
                m
              
              ;
              
                H
                
                  
                    
                      0
                      ′
                    
                    ⁢
                    m
                  
                  ,
                  n
                
              
              ;
              
                T
                n
              
            
            )
          
        
        =
        
        ⁢
        
          
            Y
            mn
            H
          
          .
          
            Y
            mn
          
        
      
    
  
  
    
      
        =
        
        ⁢
        
          
            
              (
              
                
                  T
                  n
                
                .
                
                  H
                  
                    
                      
                        0
                        ′
                      
                      ⁢
                      m
                    
                    ,
                    n
                  
                
                .
                
                  Coding
                  m
                
                .
                
                  Data
                  m
                
              
              )
            
            H
          
          .
          
            T
            n
          
          .
          
            H
            
              
                
                  0
                  ′
                
                ⁢
                m
              
              ,
              n
            
          
          .
          
            Coding
            m
          
          .
          
            Data
            m
          
        
      
    
  
  
    
      
        =
        
        ⁢
        
          
            X
            mn
            H
          
          .
          
            T
            n
            H
          
          .
          
            T
            n
          
          .
          
            X
            mn
          
          .
        
      
    
  
  
    
      
        =
        
        ⁢
        
          
            Data
            m
            H
          
          .
          
            Coding
            m
            H
          
          .
          
            H
            
              
                
                  0
                  ′
                
                ⁢
                m
              
              ,
              n
            
          
          .
          
            T
            n
            H
          
          .
          
            T
            n
          
          .
          
            H
            
              
                
                  0
                  ′
                
                ⁢
                m
              
              ,
              n
            
          
          .
          
            Coding
            m
          
          .
          
            Data
            m
          
        
      
    
  




In this expression, only data transmitted Datam and the channel H0′m,n evade the control of the local control facility, which can on the other hand control Cadagen, and Tn in the domains of the possible values Dom_Coding and Dom_T to optimize the useful link Txm Rxn.
At the level of each of the N friendly reception platforms, the method will establish, E0, a local reception situation by measuring, E1, the friendly communication signals Su received by the said platforms originating from the M friendly transmitters and then, on the basis of the said measurements, by estimating, E2, for each of the N friendly reception platforms the M useful levels received and the M useful propagation channels (N*M estimates in all).
The useful signals and the procedures for measurements and for equalization of these signals in the receivers, notably on synchronization sequences or on pilot sequences, make it possible to estimate the M×N useful communications channels.
“Network of Jammers and Receivers”
J platforms from among the N_pl are furnished with “jammers” adapted for jamming the communications of the elements external to the friendly network; they are denoted Br1, . . . , BrJ. The set of jammers Br1, . . . , BrJ and receivers and Rx1, . . . , RxN constitutes a “jamming” network represented by an interference graph denoted GJ and submitted to a generalized propagation channel HJ′=GJ′ & HJ(Br, Rx) defined according to the process described in FIG. 4, by considering the number of transmitting platforms J, the number of receiving platforms N and the J×N associated elementary channel matrices.
Each of the jammers Brj, of index j, has an equivalent power level radiated in transmission (PIRE) defined by an interval [0, PIREMAXj], fixed, but known to the friendly receivers for the implementation of the invention, with:
a power level setpoint C_PIREj,
a jamming waveform Bj, known and measured in situ by the friendly receivers,
one or more durations of jamming Tbj with the recurrences Rbi and an advance or a delay πj in transmission of the signal Bj with respect to a common clock, these characteristics being known a priori and/or recognizable in situ by the friendly receivers during their measurement processes,
one or more jamming frequency intervals denoted Fbj corresponding to the jamming intervals, known a priori and/or recognizable in situ by the friendly receivers during their measurement processes,
weightings in amplitude Aj and in phase φj,
if appropriate an antenna orientation Ψj which can be regarded hereinafter as akin to a spatial weighting induced by the antenna directivity.
Enhanced jammers can also be used so as to code or tag in their jamming waveform the power levels PIREs, the jamming waveforms, the durations of the jamming signals, the recurrences with which these jamming signals occur, the delays, the frequencies, and the weightings Ai φi ψi that they apply to inform the friendly receivers thereof.
According to the foregoing, the set of antennal networks of the jammers Br1, . . . , BrJ and of the antennal networks for reception of the receiving platforms Rx1, . . . , RxN is formalized by two interference macro-networks defined by:
a macro-graph “network fratricidal jamming” denoted GJ′ integrating the transmissions of the jammers alone and the associated generalized channel matrix HJ′ (FIGS. 2, 3A, 3B).
The formal expression J(t) for the jammer signals received on a receiver network is then the following at any instant t:



  
    
      J
      ⁡
      
        (
        t
        )
      
    
    =
    
      
        (
        
          
            H
            J
            
              
                ′
                ⁡
                
                  (
                  A
                  )
                
              
              *
            
          
          ⁢
          B
        
        )
      
      ⁢
      
        (
        t
        )
      
    
  




  
    
      i
      .
      e
      .
      
        

      
      ⁢
      
        [
        
          
            
              
                
                  J
                  1
                
                ⁡
                
                  (
                  t
                  )
                
              
            
          
          
            
              
                
              
            
          
          
            
              
                
                  J
                  N
                
                ⁡
                
                  (
                  t
                  )
                
              
            
          
        
        ]
      
    
    =
    
      
        [
        
          
            (
            
              
                
                  
                    H
                    
                      J
                      11
                    
                    ′
                  
                
                
                  
                    
                  
                
                
                  
                    H
                    
                      J
                      
                        1
                        ⁢
                        J
                      
                    
                    ′
                  
                
              
              
                
                  
                    
                  
                
                
                  
                    
                  
                
                
                  
                    
                  
                
              
              
                
                  
                    H
                    
                      J
                      
                        N
                        ⁢
                        
                          
                        
                        ⁢
                        1
                      
                    
                    ′
                  
                
                
                  
                    
                  
                
                
                  
                    H
                    
                      J
                      
                        N
                        ⁢
                        
                          
                        
                        ⁢
                        J
                      
                    
                    ′
                  
                
              
            
            )
          
          *
          
            (
            
              
                
                  
                    B
                    1
                  
                
              
              
                
                  
                    
                  
                
              
              
                
                  
                    B
                    J
                  
                
              
            
            )
          
        
        ]
      
      ⁢
      
        (
        t
        )
      
    
  



where

    
    
        N is the exact number of receiving platforms comprising a reception antenna (N≦N_pl),
        J is the exact number of platforms comprising a jamming antenna (J≦N_pl),
        HJ′( ) is the “jammers towards receivers” generalized channel matrix,
        Jn(t) n=1, . . . , N is the vector of jammer signals received on the network of antenna elements of the receiving platform of index n,
        Bj(t) j=1, . . . , J is the vector of jamming signals transmitted on the network of antenna elements of the platform of index j.

“Parametrizations and Powers of the Jammer Signals According to the Reception Processing”:

    
    


Bj represents the jammer signal at the output of jammer BrJ.
Jjn=HJ′j,n.Bj represents the jammer signal for a transmission from jammer BrJ to receiver Rxn.
The power of the signal Jjn at processing input is denoted πJjn.
It is possible to express πJjn in the form πJjn=XmnH.Xmn.
After passing through the reception processing Tn specific to receiver Txn, the jamming signal at input Jjn is transformed into a jammer signal at output J′jn=Tn(Jjn).
The power of the signal is denoted πJ′jn. It is possible to express πYmn as a function of the processing applied Tn in the form




  
    
      
        
          
            π
            
              
                J
                ′
              
              ⁢
              jn
            
          
          ⁡
          
            (
            
              
                T
                
                  n
                  ;
                
              
              ⁢
              
                H
                
                  
                    
                      J
                      ′
                    
                    ⁢
                    j
                  
                  ,
                  n
                
              
            
            )
          
        
        =
        
        ⁢
        
          
            J
            jn
            
              ′
              ⁢
              
                
              
              ⁢
              H
            
          
          .
          
            J
            jn
            ′
          
          .
        
      
    
  
  
    
      
        =
        
        ⁢
        
          
            
              (
              
                
                  T
                  n
                
                .
                
                  H
                  
                    
                      
                        J
                        ′
                      
                      ⁢
                      j
                    
                    ,
                    n
                  
                
                .
                
                  B
                  j
                
              
              )
            
            H
          
          .
          
            (
            
              
                T
                n
              
              .
              
                H
                
                  
                    
                      J
                      ′
                    
                    ⁢
                    j
                  
                  ,
                  n
                
              
              .
              
                B
                j
              
            
            )
          
        
      
    
  
  
    
      
        =
        
        ⁢
        
          
            J
            jn
            H
          
          .
          
            T
            n
            H
          
          .
          
            T
            n
          
          .
          
            J
            jn
          
          .
        
      
    
  
  
    
      
        =
        
        ⁢
        
          
            
              B
              j
              H
            
            .
            
              H
              
                
                  
                    J
                    ′
                  
                  ⁢
                  j
                
                ,
                n
              
              H
            
            .
            
              T
              n
              H
            
            .
            
              T
              n
            
            .
            
              H
              
                
                  
                    J
                    ′
                  
                  ⁢
                  j
                
                ,
                n
              
            
            .
            
              B
              j
            
          
          ⁢
          
            )
          
        
      
    
  




In this expression, the channel HJ′j,n and the jamming signal transmitted Bj evade the control of the local control facility, which can on the other hand control Tn in the domain of the possible values Dom_T to minimize the jamming level at output and optimize the useful link Txm Rxn. The domain Dom_T of the possible values of Tn depends on the nature of the spatio-temporal processing applied.
“Target Zone or Target Receiver”
The J platforms Br1 . . . BrJ are intended to jam one or more targets or zones characterized by a list of positions Ci1 . . . CiP to be jammed. These positions are firstly geographical points, but may by extension be defined “in the broad sense” in the time/frequency/space domains:

    
    
        in the temporal domain: the zone Ci can correspond to time slots to be jammed indexed on a pseudo-periodic frame which is known and/or controlled by the master station of the jammers,
        in the frequency domain: the zone Ci can correspond to jamming sub-bands to be jammed either in a continuous manner, or in a periodic manner (with indexation on a pseudo-periodic frame) which is known and/or controlled by the jammer or jammers,
        in the spatial domain: the zone Ci can correspond to the position of an identified target, to a geographical zone around this position, to a focusing towards this position. This makes it possible to consider a channel matrix HBC from the jammers to the target zones (which reduces in the case of a single jamming zone to a row vector 1×J), whose default values can be determined as a function of a geometric model or of an empirical model of isotropic mean attenuation dependent on the distance or any other parametric or empirical model (the target zone does not inform the jammers a priori of the effectiveness of the jamming . . . the jammer network can therefore only initiate its jamming strategy in accordance with a model, and only thereafter control if appropriate the effectiveness of the jamming—with a technique known by the acronym look-through for example).
    
    


The jamming signal being fixed and generated, analysis or sensing modules in the friendly receivers or interceptors which are associated therewith produce measurement results on the jammer signals by utilizing their a priori information of the waveforms and model or “pattern” of jamming so as to accelerate and augment the reliability of their measurement procedure, in such a way as to optimize their inherent links by adapting their spectral and temporal resource allocation plans and their se modulation coding scheme. The decision taking is local and decentralized at the level of each useful link, with no backlash on the parametrizations applied by the jammers, thereby inducing simplified management of the jammer network (advantage of the invention).
At the level of each of the N friendly reception platforms, E3, a local jamming situation is established by measuring, E4, the jamming signals received by the said friendly reception platforms originating from the J jammers, on the basis of the measurements of the jamming signals, for each of the N friendly reception platforms, the J fratricidal jamming levels received and the J fratricidal jamming channels, N*J estimates in all.
The jamming signals likewise integrating known sequences, procedures for measurements and for equalization of these signals are applied in the same manner on these signals in the interceptors, analysis modules or sensing function associated with the friendly receivers.
The results of the measurements are utilized by the receivers Rx of the friendly posts, optionally communicated to the friendly transmitters Tx, if the links have return pathways, so as to optimize the friendly Tx/friendly Rx useful links.
The network of jammers and the parametrizations which are applied to the jamming signals remain independent of the setpoints of optimizations specific to the useful links.
Knowing, a priori, the waveforms of the jamming signals and the associated parametrizations, on the basis of the local jamming situation states established by each receiving platform on the J signals originating from the J jammers, on the basis of the local reception situation states established by each receiving platform on the useful communication signals, the method calculates, for each of the M friendly transmitting platforms and each of the N friendly receiving platforms frequency plans, temporal positionings for the transmissions, antenna diagrams and/or orientations, radio access schemes and modulation/coding schemes for the signals transmitted and received eliminating or at the very least minimizing the fratricidal effects on the N friendly reception platforms. These first frequency plans, these temporal positionings, these antenna diagrams and/or orientations, these radio access schemes and these modulation/coding schemes are thereafter applied to the M friendly platforms in transmission and to the N friendly platforms in reception, so as to initialize the reduction in the fratricidal effects of the jamming.
According to one embodiment, the friendly receiving platforms continue in a continuous manner or in a recurrent manner the evaluation of the jamming situation local states and of the reception situation local states so as to continue the calculation of the frequency plans and the application of these frequency plans, temporal positionings of the transmissions, antenna diagrams and/or orientations, radio access schemes and modulation/coding schemes for the signals transmitted and received, so as to maintain and to optimize, by frame-by-frame iteration, the useful bitrate of the transmission service, the power and the quality of the transmissions and of the reception on the friendly platforms while maintaining or reducing the risk of acceptable fratricidal jamming for the quality of the useful transmissions.
Various alternative implementations of the invention can be devised according to the nature of the jammers used and the degree of information of the friendly posts on these jammers, and finally according to the onboard processing capability embedded in the friendly posts.
1/The method according to the invention can be implemented for jamming parameters and modes as follows:


    
    
        sectorial
        min/max/mean power
        spatio-temporal pattern.

2/In a variant of the method, setpoints can also be formulated and disseminated to the friendly transmitters.

3/The method can also be used for Spatio Temporal schemes implemented in the friendly transmitter posts from among the following:

        simple spatial redundancy between pathways Tx and temporal redundancy between the messages
        the ST scheme, robust at Rx to external interference (i.e. non Multi-Path)
        the use of one of the Tx antennas for the jamming signal on each MIMO or MISO Tx and of the other Tx antennas for the communication
        the formation of “spatial pathways” for jamming with a sub-network in transmission (sparse) of com/jammers “hybrid” MISO or MIMO Txs.

4/The method can also be used with friendly receiver posts equipped with Spatio Temporal filters chosen from among the following list, given by way of wholly nonlimiting illustration:

        Jammer Cancellation
        SIMO by Pathway Formation (PF) or by Spatial Matched Filtering (SMF)
        “Optimal” spatio-temporal matched filter in the presence of external interference(s)
        Rejector filter utilizing the a-priori known jammer waveform
        Rejector filter utilizing the a-priori known jammer direction (with or without prior goniometry of the jammer)
        etc.
    
    


The process for optimizing the useful links involves certain criteria related to the reduction in the fratricidal jammings and/or to the maximization of the ratio between the power of the useful signal and the power of the fratricidal jamming on each receiver Rxn, which may be written in accordance with the foregoing in several forms, such as the following, introducing convex functionals:

    
    
        criteria pertaining to the minimization of the mean fratricidal signal level or mean fratricidal+interfering the receivers Rxn at processing output Tn on the receiver Rxn,
        criteria pertaining to the maximization of the ratio between the useful signal power at processing output and the power of the residual jamming signal at processing output on the receiver Rxn.
    
    


Four criteria which can be applied are given hereinbelow by way of nonlimiting illustration, from the least complex to the most complex to implement.
Criterion of Threshold_max_JR Type:
For each friendly receiver Rxn, this criterion guarantees a jamming level on the signals at processing output which does not exceed a given jamming threshold ΔBrn. For each friendly receiver Rxn, the parameter sought is solely the reception processing operator of Rxn in its domain of value.
For all n=1, . . . , N, this therefore entails searching for a parameter Tn in the domain Dom_T which satisfies the following thresholding criterion on the sum of the residual fratricidal contributions of the jammers:




  
    JR
    n
  
  =
  
    
      
        ∑
        
          j
          =
          1
        
        J
      
      ⁢
      
        
          π
          
            
              
                J
                ′
              
              ⁢
              j
            
            ,
            n
          
        
        ⁡
        
          (
          
            
              H
              
                
                  
                    J
                    ′
                  
                  ⁢
                  j
                
                ,
                n
              
            
            ;
            
              T
              n
            
          
          )
        
      
    
    ≤
    
      Δ
      ⁢
      
        
      
      ⁢
      
        Br
        n
      
    
  




knowing that





  
    
      
        
          
            π
            
              
                J
                ′
              
              ⁢
              jn
            
          
          ⁡
          
            (
            
              
                T
                
                  n
                  ;
                
              
              ⁢
              
                H
                
                  
                    
                      J
                      ′
                    
                    ⁢
                    j
                  
                  ,
                  n
                
              
            
            )
          
        
        =
        
        ⁢
        
          tr
          ⁡
          
            [
            
              
                J
                jn
                ′
              
              .
              
                J
                jn
                
                  ′
                  ⁢
                  
                    
                  
                  ⁢
                  H
                
              
            
            ]
          
        
      
    
  
  
    
      
        =
        
        ⁢
        
          tr
          ⁡
          
            [
            
              
                T
                n
              
              .
              
                J
                jn
              
              .
              
                J
                jn
                H
              
              .
              
                T
                n
                H
              
            
            ]
          
        
      
    
  
  
    
      
        =
        
        ⁢
        
          
            tr
            ⁡
            
              [
              
                
                  (
                  
                    
                      T
                      n
                    
                    .
                    
                      H
                      
                        
                          
                            J
                            ′
                          
                          ⁢
                          j
                        
                        ,
                        n
                      
                    
                    .
                    
                      B
                      j
                    
                  
                  )
                
                .
                
                  
                    (
                    
                      
                        T
                        n
                      
                      .
                      
                        H
                        
                          
                            
                              J
                              ′
                            
                            ⁢
                            j
                          
                          ,
                          n
                        
                      
                      .
                      
                        B
                        j
                      
                    
                    )
                  
                  H
                
              
              ]
            
          
          .
        
      
    
  




and knowing that the parameters HJ′j,n and Bj are not controlled for the optimization of the criterion but known by analysis and measurement and a priori information.

Criterion of Min_JR Type:
For each friendly receiver Rxn, this criterion is aimed at seeking a minimum jamming level on the signals at processing output. For each friendly receiver Rxn, the optimized parameter is solely the reception processing operator of Rxn in its domain of value.
For all n=1, . . . , N; this therefore entails searching for the reception processing Tn which minimizes the sum of the residual fratricidal contributions of the jammers




  
    JR
    n
  
  =
  
    
      ∑
      
        j
        =
        1
      
      J
    
    ⁢
    
      
        π
        
          
            
              J
              ′
            
            ⁢
            j
          
          ,
          n
        
      
      ⁡
      
        (
        
          
            T
            n
          
          ;
          
            H
            
              
                
                  J
                  ′
                
                ⁢
                j
              
              ,
              n
            
          
        
        )
      
    
  




knowing that:





  
    
      
        
          
            π
            
              
                J
                ′
              
              ⁢
              jn
            
          
          ⁡
          
            (
            
              
                T
                
                  n
                  ;
                
              
              ⁢
              
                H
                
                  
                    
                      J
                      ′
                    
                    ⁢
                    j
                  
                  ,
                  n
                
              
            
            )
          
        
        =
        
        ⁢
        
          tr
          ⁡
          
            [
            
              
                J
                jn
                ′
              
              .
              
                J
                jn
                
                  ′
                  ⁢
                  
                    
                  
                  ⁢
                  H
                
              
            
            ]
          
        
      
    
  
  
    
      
        =
        
        ⁢
        
          tr
          ⁡
          
            [
            
              
                
                  T
                  n
                
                .
                
                  J
                  jn
                
              
              ·
              
                J
                jn
                H
              
              ·
              
                T
                n
                H
              
            
            ]
          
        
      
    
  
  
    
      
        =
        
        ⁢
        
          tr
          ⁡
          
            [
            
              
                (
                
                  
                    T
                    n
                  
                  .
                  
                    H
                    
                      
                        
                          J
                          ′
                        
                        ⁢
                        j
                      
                      ,
                      n
                    
                  
                  .
                  
                    B
                    j
                  
                
                )
              
              .
              
                
                  (
                  
                    
                      T
                      n
                    
                    .
                    
                      H
                      
                        
                          
                            J
                            ′
                          
                          ⁢
                          j
                        
                        ,
                        n
                      
                    
                    .
                    
                      B
                      j
                    
                  
                  )
                
                H
              
            
            ]
          
        
      
    
  




knowing that the parameters HJ′j,n and Bj are not controlled for the optimization of the criterion but only known by measurement, analysis and a priori information. This may be written formally for each receiver Rxn:





  
    
      ∀
      n
    
    =
    
      1
      ⁢
      
        
      
      ⁢
      ...
      ⁢
      
        
      
      ⁢
      N
    
  
  ,
  
    
      T
      n
    
    =
    
      
        
          Argmin
          
            
              t
              n
            
            ∈
            Dom_T
          
        
        ⁢
        
          {
          
            JR
            n
          
          }
        
      
      =
      
        
          Argmin
          
            
              t
              n
            
            ∈
            Dom_T
          
        
        ⁢
        
          {
          
            
              ∑
              
                j
                =
                1
              
              J
            
            ⁢
            
              
                π
                
                  
                    
                      J
                      ′
                    
                    ⁢
                    j
                  
                  ,
                  n
                
              
              ⁡
              
                (
                
                  
                    H
                    
                      
                        
                          J
                          ′
                        
                        ⁢
                        j
                      
                      ,
                      n
                    
                  
                  ;
                  
                    t
                    n
                  
                
                )
              
            
          
          }
        
      
    
  




Carrying out this criterion amounts to solving for all n=1, . . . , N; an optimization problem for the quadratic criterion





  
    ∑
    
      j
      =
      1
    
    J
  
  ⁢
  
    
      π
      
        
          
            J
            ′
          
          ⁢
          j
        
        ,
        n
      
    
    ⁡
    
      (
      
        
          H
          
            
              
                J
                ′
              
              ⁢
              j
            
            ,
            n
          
        
        ;
        
          t
          n
        
      
      )
    
  




in the variable tn, under the constraint tnεDom_T.

Criterion of Threshold_min_SJR Type:
For each friendly transmitter Txm-friendly receiver Rxn link, this criterion is aimed at guaranteeing a power ratio between the useful signal at processing output and the jamming signal at processing output which exceeds a given threshold ΔSJRn corresponding to an a priori reception quality. For each friendly transmitter Txm, friendly receiver Rxn link, the parameters sought are here

    
    
        the matrix for coding the data useful for the transmission of Txm, i.e. the parameter CodingmεDom_Coding,
        the reception processing operator of Rxn, i.e. TnεDom_T.
    
    


For any friendly Txm, Rxn link m=1, . . . , M; n=1, . . . , N; this therefore entails searching for parameters Codingm and Tn in the respective domains Dom_Coding and Dom_T which satisfy the following thresholding criterion on the useful signal to jammers ratio:




  
    S
    ⁢
    
      
    
    ⁢
    J
    ⁢
    
      
    
    ⁢
    
      R
      
        m
        ,
        n
      
    
  
  =
  
    
      
        
          π
          
            Ym
            ,
            n
          
        
        ⁡
        
          (
          
            
              Coding
              m
            
            ;
            
              H
              
                
                  
                    0
                    ′
                  
                  ⁢
                  m
                
                ,
                n
              
            
            ;
            
              T
              n
            
          
          )
        
      
      
        
          ∑
          
            j
            =
            1
          
          J
        
        ⁢
        
          
            π
            
              
                
                  J
                  ′
                
                ⁢
                j
              
              ,
              n
            
          
          ⁡
          
            (
            
              
                H
                
                  
                    
                      J
                      ′
                    
                    ⁢
                    j
                  
                  ,
                  n
                
              
              ;
              
                T
                n
              
            
            )
          
        
      
    
    ≥
    
      Δ
      ⁢
      
        
      
      ⁢
      S
      ⁢
      
        
      
      ⁢
      J
      ⁢
      
        
      
      ⁢
      
        R
        n
      
    
  




    
    
        knowing that πYmn(Codingm,H0′m,n,Tn)=tr[Ymn.YmnH]=tr[Tn.Xmn.XmnH.TnH]=tr[Tn.H0′m,n.Codingm.Datam.(Tn.H0′m,n. Codingm.Datam)H],

knowing that the channel parameter H0′m,n is not controlled for the optimization of the criterion but known by analysis and measurement and a priori information, knowing that the useful data Datam are neither known nor controlled, knowing that

    
    






  
    
      
        
          
            π
            
              
                J
                ′
              
              ⁢
              jn
            
          
          ⁡
          
            (
            
              
                T
                
                  n
                  ;
                
              
              ⁢
              
                H
                
                  
                    
                      J
                      ′
                    
                    ⁢
                    j
                  
                  ,
                  n
                
              
            
            )
          
        
        =
        
        ⁢
        
          tr
          ⁡
          
            [
            
              
                J
                jn
                ′
              
              .
              
                J
                jn
                
                  ′
                  ⁢
                  
                    
                  
                  ⁢
                  H
                
              
            
            ]
          
        
      
    
  
  
    
      
        =
        
        ⁢
        
          tr
          ⁡
          
            [
            
              
                T
                n
              
              .
              
                J
                jn
              
              .
              
                J
                jn
                H
              
              .
              
                T
                n
                H
              
            
            ]
          
        
      
    
  
  
    
      
        =
        
        ⁢
        
          tr
          ⁡
          
            [
            
              
                (
                
                  
                    T
                    n
                  
                  .
                  
                    H
                    
                      
                        
                          J
                          ′
                        
                        ⁢
                        j
                      
                      ,
                      n
                    
                  
                  .
                  
                    B
                    j
                  
                
                )
              
              .
              
                
                  (
                  
                    
                      T
                      n
                    
                    .
                    
                      H
                      
                        
                          
                            J
                            ′
                          
                          ⁢
                          j
                        
                        ,
                        n
                      
                    
                    .
                    
                      B
                      j
                    
                  
                  )
                
                H
              
            
            ]
          
        
      
    
  




knowing that the parameters HJ′j,n and Bj are not controlled for the optimization of the criterion but only known by measurement, analysis and a priori information.

Criterion of Max_SJR Type:

For each friendly transmitter Txm-friendly receiver Rxn link, this criterion is aimed at guaranteeing a maximum power ratio between the useful signal at processing output and the jamming signal at processing output corresponding to an optimal a priori reception quality for the radioelectric milieu surrounding the transmission Txn←→Rxm. For each friendly transmitter Txm, friendly receiver Rxn link, the parameters sought are here

    
    
        the matrix for coding the data useful for the transmission of Txm, i.e. the parameter CodingmεDom_Coding,
        the reception processing operator of Rxn, i.e. TnεDom_T.
    
    


For any friendly Txm, Rxn link m=1, . . . , M; n=1, . . . , N; this therefore entails searching for parameters Codingm and Tn which maximize the ratio between the power of the useful signal at processing output the sum of the residual fratricidal jamming contributions, i.e. which maximize the criterion




  
    S
    ⁢
    
      
    
    ⁢
    J
    ⁢
    
      
    
    ⁢
    
      R
      
        m
        ,
        n
      
    
  
  =
  
    
      
        π
        
          Ym
          ,
          n
        
      
      ⁡
      
        (
        
          
            Coding
            m
          
          ;
          
            H
            
              
                
                  0
                  ′
                
                ⁢
                m
              
              ,
              n
            
          
          ;
          
            T
            n
          
        
        )
      
    
    
      
        ∑
        
          j
          =
          1
        
        J
      
      ⁢
      
        
          π
          
            
              
                J
                ′
              
              ⁢
              j
            
            ,
            n
          
        
        ⁡
        
          (
          
            
              H
              
                
                  
                    J
                    ′
                  
                  ⁢
                  j
                
                ,
                n
              
            
            ;
            
              T
              n
            
          
          )
        
      
    
  




    
    
        knowing that πYmn(Codingm,H0′m,n,Tn)=tr[Ymn.YmnH]=tr[Tn.Xmn.XmnH.TnH]=tr[Tn.H0′m,n.Codingm.Datam.(Tn.H0′m,n. Codingm.Datam)H],

knowing that the channel parameter H0′m,n is not controlled for the optimization of the criterion but known by analysis and measurement and a priori information, knowing that the useful data Datam are neither known nor controlled, knowing that

    
    






  
    
      
        
          
            π
            
              
                J
                ′
              
              ⁢
              jn
            
          
          ⁡
          
            (
            
              
                T
                
                  n
                  ;
                
              
              ⁢
              
                H
                
                  
                    
                      J
                      ′
                    
                    ⁢
                    j
                  
                  ,
                  n
                
              
            
            )
          
        
        =
        
        ⁢
        
          tr
          ⁡
          
            [
            
              
                J
                jn
                ′
              
              .
              
                J
                jn
                
                  ′
                  ⁢
                  
                    
                  
                  ⁢
                  H
                
              
            
            ]
          
        
      
    
  
  
    
      
        =
        
        ⁢
        
          tr
          ⁡
          
            [
            
              
                T
                n
              
              .
              
                J
                jn
              
              .
              
                J
                jn
                H
              
              .
              
                T
                n
                H
              
            
            ]
          
        
      
    
  
  
    
      
        =
        
        ⁢
        
          tr
          ⁡
          
            [
            
              
                (
                
                  
                    T
                    n
                  
                  .
                  
                    H
                    
                      
                        
                          J
                          ′
                        
                        ⁢
                        j
                      
                      ,
                      n
                    
                  
                  .
                  
                    B
                    j
                  
                
                )
              
              .
              
                
                  (
                  
                    
                      T
                      n
                    
                    .
                    
                      H
                      
                        
                          
                            J
                            ′
                          
                          ⁢
                          j
                        
                        ,
                        n
                      
                    
                    .
                    
                      B
                      j
                    
                  
                  )
                
                H
              
            
            ]
          
        
      
    
  




knowing that the parameters HJ′j,n and Bj are not controlled for the optimization of the criterion but only known by measurement, analysis and a priori information. This may be written formally





  
    
      
        ∀
        m
      
      =
      
        1
        ⁢
        
          
        
        ⁢
        ...
        ⁢
        
          
        
        ⁢
        M
      
    
    ;
    
      n
      =
      
        1
        ⁢
        
          
        
        ⁢
        ...
        ⁢
        
          
        
        ⁢
        N
      
    
  
  ,
  
    

  
  ⁢
  
    
      
        
          
            T
            n
          
          =
          
          ⁢
          
            ArgMax
            ⁢
            
              {
              
                SJR
                
                  m
                  ,
                  n
                
              
              }
            
          
        
      
    
    
      
        
          =
          
          ⁢
          
            
              ArgMax
              
                
                  
                    t
                    n
                  
                  ∈
                  Dom_T
                
                
                  cod_m
                  ∈
                  Dom_Codings
                
              
            
            ⁢
            
              {
              
                
                  
                    π
                    
                      Ym
                      ,
                      n
                    
                  
                  ⁡
                  
                    (
                    
                      
                        cod
                        m
                      
                      ;
                      
                        H
                        
                          
                            
                              0
                              ′
                            
                            ⁢
                            m
                          
                          ,
                          n
                        
                      
                      ;
                      
                        t
                        n
                      
                    
                    )
                  
                
                
                  
                    ∑
                    
                      j
                      =
                      1
                    
                    J
                  
                  ⁢
                  
                    
                      π
                      
                        
                          
                            J
                            ′
                          
                          ⁢
                          j
                        
                        ,
                        n
                      
                    
                    ⁡
                    
                      (
                      
                        
                          H
                          
                            
                              
                                J
                                ′
                              
                              ⁢
                              j
                            
                            ,
                            n
                          
                        
                        ;
                        
                          t
                          n
                        
                      
                      )
                    
                  
                
              
              }
            
          
        
      
    
  




carrying out this criterion amounts to solving for all m=1, . . . , N and n=1, . . . , N an optimization problem for the criterion (quadratic in the coding variable codm)





  
    S
    ⁢
    
      
    
    ⁢
    J
    ⁢
    
      
    
    ⁢
    
      R
      
        m
        ,
        n
      
    
  
  =
  
    
      
        π
        
          Ym
          ,
          n
        
      
      ⁡
      
        (
        
          
            cod
            m
          
          ;
          
            H
            
              
                
                  0
                  ′
                
                ⁢
                m
              
              ,
              n
            
          
          ;
          
            t
            n
          
        
        )
      
    
    
      
        ∑
        
          j
          =
          1
        
        J
      
      ⁢
      
        
          π
          
            
              
                J
                ′
              
              ⁢
              j
            
            ,
            n
          
        
        ⁡
        
          (
          
            
              H
              
                
                  
                    J
                    ′
                  
                  ⁢
                  j
                
                ,
                n
              
            
            ;
            
              t
              n
            
          
          )
        
      
    
  




for the variables codm and tn, and under the constraints codmεDom_Coding and tnεDom_T.

Example 1
Cooperative Barrage Jamming  
This particular example of implementation of the invention applies to the optimization of tactical barrage jamming in the presence of frequency-evading friendly communication posts, which method has formed the subject of the Applicant's patent under the number EP 1303069.
It is shown hereinafter how the previously described general method of the invention is broken down for this particular application.
The barrage jammer or the network of barrage jammers has the capability to interrupt transmissions on certain time slots and certain frequency channels, by following certain pseudo random laws. This capability is a priori known to the friendly posts, as well as the main possible parametrizations which correspond to it, in particular the frequency plans and pseudo-random laws corresponding to the slots not occupied by the jamming signals.
P tactical posts present in the theatre are to be jammed denoted Cip, p=1, . . . , P. These posts are of known or unknown positions. The services that they use and the corresponding operating points are assumed known to the jammers as well as their characteristics (jamming/denial thresholds for the various services, operating margins etc.). The jammers adapt the parametrizations of their barrage jamming waveform.
N frequency-hopping friendly transmitters and receivers seek to safeguard to safeguard their communication links, denoted Rn n=1, . . . , N.
These transmitters/receivers are of approximately known positions and under the control of local communications nodes dubbed LCNs (in a simplified implementation of the invention, the LCNs can be for example the friendly transmitters of each useful link, in a more elaborate implementation, the LCNs can be infrastructure components with local range, relays, “master” transmission posts dedicated to command, etc.)
The positions of the jammers, the positions of the friendly transmitters and of the receivers under its control and the panel of the usable waveforms and associated parametrizations are known to each LCN, local node controller. For example, the frequency-hopping laws, and if appropriate, the slot channels and transmission powers as well as the waveforms used can be chosen by the CLN, or indeed driven by means of a synchronization signal transmitted to the posts that it controls (slave posts). Moreover, the CLNs have associated analysis module or interception capabilities sensing functions which allow them to conduct measurements at one and the same time on the transmitters/receivers whose positions they know, on the useful signals whose transmissions they control/know and on the reception processings of the slave posts, but also on the jammer signals that they do not control but whose main possible characteristics they know and which they can retrieve by in situ measurement. Each LCN can therefore in accordance with its measurements and its a-priori information on the jamming waveforms and on the posts under its control:

    
    
        evaluate the risks of interferences induced by the jamming signals on the receivers that it controls (or on those which have to be safeguarded),
        search for the time slots and the frequency channels not occupied by the jamming signals,
        drive accordingly the transmissions of the posts under its control so as to make their transmissions coincide with the frequency channels and with the time slots not occupied by the jamming signals.
    
    


The process for applying the method according to the invention can be indexed frame-by-frame. The k-th frame will be denoted tk. This then entails for a local controller node LCN at each frame:

    
    
        driving the EVF transmissions of the useful communications, on the time spans or time/frequency slots left empty by the jammers,
        controlling over time the position of the transmitters receivers of the useful links so as to guarantee (by managing certain power margins and certain temporal guard intervals) the non-collision of the useful signals with the jammer signals despite the different propagation times of the said signals,
        in the case of high-speed mobile posts, controlling over time the Doppler of the transmitters receivers of the useful links so as to guarantee (by managing certain power margins and certain frequency guard intervals) the non-collision of the bands of the useful signals with those of the jammer signals despite the different relative speeds of the transmitters of the said signals.
    
    


In numerous cases the times required to propagate ground-ground communication signals over a few tens of kilometers at the most are negligible compared with the durations of the useful notches. Likewise the Doppler shifts corresponding to slow platforms are negligible compared with the bands of the useful transmissions. The physical problem is simplified and therefore reduces to the determination of the instants of starting of the transmissions and of the channels corresponding to these transmissions by the local communications node (LCN). In more complex cases of long-range propagation from mobile platforms (communication on aircraft and on flyby satellites for example), the LCN must in addition take account of the relative propagation times and Doppler).
Direct Deterministic Solution of the Optimization Problem
If the local communication node LCN is ideal, is able or knows how to restore through its measurement, the slots and the frequency channels left free by the jammer(s) on the present and future frames and if it knows exactly the “slave” posts at risk of jamming and finally if it is able to place the slots of its “slave” posts exactly on the slots left free by the jammer(s) without spilling over onto the adjacent frequencies or onto the adjacent slots, the previous optimization problem simplifies to the form of a resources allocation problem. There is indeed no fratricidal impact of the jamming on the useful links provided that the LCN can impose the following setpoint on the slave posts at risk of jamming: for each frame tk, distribute for the links under jamming the transmissions and receptions of the useful signals over the slots left free by the jammer; therefore allot the free slots and channels to the slave transmitters and receivers according to a priority management strategy, according to a latency management strategy or according to a random competing strategy of ALOHA type, or according to any strategy conventionally used in radio access technologies.
Note that in this implementation of the invention, the precise knowledge of the positions of the slave posts and jammers by the local communication node provides substance to more thorough optimizations while remaining very simple: for example the knowledge of the positions directivities and orientations of the jamming antennas and the knowledge of the position of the slave posts allows the LCN to restore through simple models (link budget) the risks of jamming of its slave posts, and to select a priori only the slave posts which are actually under threat of jamming in the aforementioned resource allocation strategy. The measurements performed by the LCN and uploaded if appropriate by the slave posts to the LCN via the return pathways of the friendly links serve only to reinforce the allocation strategy by confirming the absence of fratricidal jammings or their low levels on the allocated slots.
If this variant is pushed to the extreme, it is even possible to consider the implementation of the invention in a still more simplified framework with an LCN not carrying out any measurement and simply informed a priori of the channels and time slots left free of jamming; the said information originates for example from a law decided in advance and known to the jammer and the LCN, or else the said information being coded in the jamming signal itself and decoded by the LCN in its analysis of the jamming signal, or else the said information being obtained by decoding an item of information transmitted in a tagging or triggering signal associated with the jammer.
Case of Multiple Jammers with Defects+Taking into Account of Jamming Budgets Estimated by Use of the a Priori Information of the Measurements and of Propagation Models
The examples and variants hereinabove of implementation of the invention extend directly to the taking into account of the imperfections of one or more jammers, powers and directivities in transmission of the said jammers, directivities in reception of the friendly receivers, attenuations and filters for propagating the jammers to the friendly receivers, as well as operating thresholds of the friendly receivers:

    
    
        Rise and fall times of the jamming signal inducing a lower duration of availability of the slot than the slot duration, thereby similarly reducing the transmission duration utilizable in the jamming slots left empty,
        Spectral overspill of the jamming signal onto part of the channels that are left empty, because of insufficient filtering of the spectrum of the jamming signals, thereby similarly reducing the useful transmission band in the channels left empty of jamming
        Link budgets between the jammers BrJ and the useful receivers Rn modelled by loss coefficients Lj,n inducing a level at input Lj,nPj (Pj: radiated isotropic power equivalent to the transmission by the jammer of index j). These input levels can be estimated by the friendly receivers (at least the LCN, or indeed the slave receivers if appropriate) in accordance with the a priori knowledge (or in accordance with the recovery by analysis of the jamming signals) of the PIRE transmitted, in accordance with the knowledge of the respective positions and angular characteristics of the friendly transmitters of the friendly receivers and of the jammers, and in accordance with a simplified propagation model (sufficiently representative of the attenuation phenomena in the frequency bands concerned for the terrain topology concerned and for the distances involved). This information, when it relates to the jammers, originates for example from strategies known in advance to the friendly receivers (at least known to the LCN) whose implementation is readily recognizable on analysis of the jamming signals; or else this information being coded in the jamming signal itself and decoded by the LCN in its analysis of the jamming signal; or else this information being coded in a tagging signal associated with the jammer, for example according to the method described in the applicant's patent application FR 1203071.
        Operating threshold ΔJRn relating to the friendly receiver Rxn (according to their transmission service), expressing a condition of the form [ΣjLj,nPj]<ΔJRn, which condition has to be satisfied by the aggregated power of the nuisance [ΣjLj,nPj] induced by the fratricidal jammings as a whole, the said nuisance being evaluated in accordance with the power estimations Pj specific to the transmission of each jammer and in accordance with the link budget Lj,n estimated for each jammer Brj—receiver Rxn link. The aforementioned condition expresses in a manner (here simplified but sufficient and effective in numerous cases of implementation of the invention) the receiving capability of the useful link Txm Rxn under acceptable conditions of noise+jamming. It can be evaluated a priori fairly simply on the basis of the a priori knowledge of the jamming schemes or of their in situ recognition by analysis, and by a link budget model. It can be reinforced in situ by measurement of Rxn on the jamming signals.
    
    


The optimization problem is then solved in a very simplified manner by a resource re-allocation strategy, here conditional on the thresholding ΔJRn: the fratricidal effects on the friendly posts remain limited and insignificant provided that the LCN can impose the following setpoint on the slave posts at risk of jamming (i.e. for which we would have [Σj Lj,nPj]>ΔSJRn in the absence of re-allocation and in the presence of jamming signals corresponding to the evaluations of powers received P1 . . . PJ): for each frame tk, reallocate the links at risk of jamming the transmissions and receptions of the useful signals on the slots left free by the jammer; therefore allot the free slots and channels to the slave transmitters and receivers at risk of jamming according to a priority management strategy, according to a latency management strategy or according to a random competing strategy of ALOHA type, or according to any strategy conventionally used in radio access techniques.

    
    
        Operating threshold ΔSJRm,n relating to the useful links between friendly transmitter Txm friendly receiver Rxn (according to their transmission service), expressing a condition of the form πYm,n/[ΣjLj,nPj]>ΔSJRn, which condition has to be satisfied by the ratio between the measured useful power received πYm,n and the aggregated power of the nuisance [ΣjLj,nPj] induced by the fratricidal jammings as a whole, the said nuisance being evaluated in accordance with the power estimations Pj specific to the transmission of each jammer and in accordance with a link budget model Lj,n estimated for each jammer Brj—receiver Rxn link. The aforementioned condition expresses in a manner (here simplified but sufficient and effective in numerous cases of implementation of the invention) the capability for establishing and/or sustaining the useful link Txm Rxn under acceptable conditions. It can be evaluated fairly simply on the basis of the a priori knowledge of the jamming schemes or of their in situ recognition by analysis, by a link budget model (if appropriate reinforced by in situ analysis measurement of Rxn on the jammer signals), and on the basis of the measurements of received level on the useful signal.
    
    


The optimization problem is solved here again in a very simplified manner by a resource re-allocation strategy, here conditional on the thresholding ΔSJRn: the fratricidal effects on the friendly posts remain limited and insignificant provided that the LCN can impose the following setpoint on the slave posts at risk of jamming (i.e. for which we would have πYm,n/[ΣjLj,nPj]<ΔSJRn in the absence of re-allocation and in the presence of jamming signals corresponding to the evaluations of powers received P1 . . . PJ): for each frame tk, reallocate the links at risk of jamming the transmissions and receptions of the useful signals on the slots left free by the jammer; therefore allot the free slots and channels to the slave transmitters and receivers at risk of jamming according to a priority management strategy, according to a latency management strategy or according to a random competing strategy of ALOHA type, or according to any strategy conventionally used in radio access techniques.

## Claims

1. A method for minimizing in an adaptive and decentralized manner fratricidal effects induced by jamming of P predefined zones ZB or positions in a communications network comprising friendly transmitters, jammers and friendly receivers, said network comprising N_pl platforms, a number M≦N_pl of said platforms, being friendly transmission platforms equipped with antennas and with systems for transmitting useful transmission signals configurable in a dynamic manner, a number N≦N_pl of said platforms, also being friendly, and being equipped with dynamically configurable antennas and systems for receiving useful transmission signals, a number J≦N_pl of said platforms being equipped with jamming systems and antennas having characteristics known to the friendly transmission and reception platforms, said jamming systems and antennas being adapted for preventing the transmissions between entities external to said network of friendly platforms, said platforms constituting a network, comprising at least the following steps:
E0: Establishing a local reception situation: at the level of each of the N friendly reception platforms measuring, E1, the friendly communication signals Su received by the said platforms originating from M friendly transmitters, on the basis of said measurements, for each of N friendly reception platforms, estimating, E2, M useful levels received and M useful propagation channels, N*M estimates,
E3: Establishing a local jamming situation: at the level of each of the N friendly reception platforms measuring, E4, the jamming signals received by the said friendly reception platforms originating from the J jammers, on the basis of the measurements of the jamming signals, for each of the N friendly reception platforms, estimating, E5, J fratricidal jamming levels received and J fratricidal jamming channels, N*J estimates in all,
ascertaining a priori the waveforms of the jamming signals and the associated parametrizations, on the basis of the states of the local situations of jamming established by each of the N receiving platforms on the J signals originating from the J jammers, on the basis of a local reception situation established by each of the N receiving platforms on useful communication signals Su; determining for each of the M friendly transmitting platforms and for each of the N friendly receiving platforms, at least one of the following configuration parameters: a frequency plan, and/or temporal positionings of the transmissions, antenna diagrams and/or orientations, radio access schemes and modulation/coding schemes for the signals transmitted and received, the parameter or parameters being adapted for minimizing or eliminating the fratricidal effects on the N friendly reception platforms,
using the said configuration parameters in transmission and/or reception for the M friendly transmission platforms and the N friendly reception platforms.

2. The method according to claim 1, wherein, after having defined a first set of configuration parameters for the M friendly platforms and for the N friendly platforms, steps E0 to E5 are repeated over time so as to maintain and optimize the configuration parameters for the platforms.

3. The method according to claim 2 wherein it uses programmable friendly transmitters and receivers adapted for taking dynamic account of transmission setpoints, regarding power and/or regarding temporal parameters, waveform, spatio-temporal codings, or amplitude phase weighting of the antenna elements.

4. The method according to claim 2, using jamming signals which code, in a manner known to the friendly receivers, the information useful to the friendly transmitters and receivers so as to inform a latter of the jamming strategy employed, of characteristics of jamming waveforms and associated parameters, transmission power, type of diagram and orientation of antennas, position, altitude, to facilitate joint optimization of transmissions and reception processings of transmissions useful at the level of the friendly transmitting and receiving platforms, said coded information being reconstructed by analysis of the jamming signals received by the friendly receivers or being decoded in the jamming signals received by the friendly receivers.

5. The method according to claim 1, using measurement of the propagation channels originating from the J jamming platforms to recognize in-situ a predefined and known jamming strategy so as to jointly optimize the transmission and the quality of the transmissions useful at the level of the friendly transmitting and receiving platforms by adapting transmission power levels and/or frequency plans and/or temporal positioning of transmissions and/or spatio-temporal coding schemes and/or radioelectric resource access protocols employed by the friendly transmitters and receivers.

6. The method according to claim 5 wherein it uses programmable friendly transmitters and receivers adapted for taking dynamic account of transmission setpoints, regarding power and/or regarding temporal parameters, waveform, spatio-temporal codings, or amplitude phase weighting of the antenna elements.

7. The method according to claim 1, using jamming signals which code, in a manner known to the friendly receivers, the information useful to the friendly transmitters and receivers so as to inform the latter of the jamming strategy employed, of the characteristics of the jamming waveforms and associated parameters, transmission power, type of diagram and orientation of the antennas, position, altitude, to facilitate the joint optimization of the transmissions and reception processings of the transmissions useful at the level of the friendly transmitting and receiving platforms, the said coded information being reconstructed by the analysis of the jamming signals received by the friendly receivers or being decoded in the jamming signals received by the friendly receivers.

8. The method according to claim 1 wherein it uses programmable friendly transmitters and receivers adapted for taking dynamic account of transmission setpoints, regarding power and/or regarding temporal parameters, waveform, spatio-temporal codings, or amplitude phase weighting of the antenna elements.

9. Use of the method according to claim 1 in transmission networks using the Multiple Input Multiple Output, Multiple Input single Output, Single Input Multiple Output, or Single Input Single Output protocols with or without return pathway from the friendly receivers to the friendly transmitters.

10. Use of the method according to claim 1 in a radio network comprising receivers adapted for measuring values of transmission channels on the useful transmitters and on the jammers.

11. Use of the method according to claim 1 in a radio network comprising one or more reception posts comprising antennal elements coupled to an interceptor which is adapted for performing transmission channel measurements on the useful transmitters and on the jammers.