A multi-purpose node-based relay cooperative interference secure transmission method, system, device and medium

Abstract

A relay cooperation interference security transmission method, system, device and medium based on multiple destination nodes, the method comprising: selecting an optimal destination node in a communication network topology graph, in the process of covert transmission, the source node sends a covert signal to the relay node, the relay nodes that can correctly decode the covert signal form a decoding set, when the decoding set is not empty, the best relay node is selected from the decoding set, and the covert signal is forwarded to the optimal destination node, the optimal destination node sends the received covert signal to other destination nodes in direct communication with it, while the cooperation interference node sends an interference signal to affect the eavesdropping of the covert signal by the eavesdropping node, and the SC and MRC spatial diversity technology is used to process the covert signal, and the outage probability and the interception probability in the whole covert transmission process are analyzed and derived; the system, device and medium are used to realize a relay cooperation interference security transmission method based on multiple destination nodes; the reliability and security of the covert transmission process are ensured.

Description

Technical Field

[0001] This invention relates to the fields of wireless communication and secure transmission technology, specifically to a method, system, device, and medium for secure transmission through relay cooperative interference based on multiple destination nodes. Background Technology

[0002] Due to the broadcast nature of wireless communication, wireless links based on traditional cryptographic systems are easily interfered with, intercepted, and cracked by eavesdroppers. In recent years, covert communication technology has attracted widespread attention for its effective utilization of the inherent security mechanisms of wireless communication, and research has been conducted on scenario models, optimization objectives, and solutions.

[0003] The invention with application number "201910654610.6" provides a method for optimizing the power division factor in a multi-source relay cooperative communication system based on energy harvesting. In this invention, two source nodes forward information to a destination node through a relay node. The source nodes broadcast signals to the relay node, which simultaneously performs information decoding and energy harvesting based on energy harvesting technology. Under a power division protocol with a power division factor of ρ, the signal-to-noise ratio (SNR) from the two source nodes to the relay node is obtained. The channel capacity from the two source nodes to the relay node and from the relay node to the destination node is obtained according to Shannon's formula, and the channel capacity of the two-source relay cooperative communication system is obtained through a decoding-forwarding protocol. The power division factor of the relay node is optimized to obtain the optimal power division factor, thereby obtaining the optimal channel capacity.

[0004] The invention with application number "201911367198.6" provides a method and system for optimal relay selection in a relay cooperative wireless network. This invention optimizes the received signal-to-noise ratio (SNR) of the target node without considering the CSI of illegitimate nodes, and provides an optimal relay node selection scheme. In this invention, the source node broadcasts a signal to multiple relay nodes, calculates the channel fading gain from each relay node to the destination node, and determines the optimal relay selection criterion accordingly. Based on the determined optimal relay selection criterion, the optimal forwarding relay and the optimal interference relay are determined. The optimal forwarding relay decodes and forwards the received signal to the destination node, while the optimal interference relay generates maximum interference to illegitimate nodes.

[0005] Hu Yong, Zhou Ninghao, Bao Xiuwen, and Hou Jiawen proposed a multi-source, multi-relay cooperative model with multiple eavesdropping nodes. In multi-source scenarios, this model comprehensively considers each source node and selects a suitable cooperative relay for each source node to maximize system efficiency (Science Technology and Engineering, 2020, Vol. 20, No. 4, pp. 1448-1453, Article Title: Relay Selection and Power Allocation Scheme for Multi-Source Wireless Cooperative Networks under Eavesdropping Environment). The entire communication transmission process is completed in two stages. In the first stage, all source nodes broadcast their information to all relay nodes. In the second stage, a relay node is assigned to each source node for forwarding. In the second stage, a power allocation factor is calculated based on the channel parameters of the links from the source node to the relay node and from the relay node to the destination node. A secure channel capacity matrix from the source node to the destination node is established based on the power allocation factor, and the priority of the source nodes is calculated. Then, a relay node is assigned to the source node with the highest priority, and this calculation is repeated until the optimal relay node is assigned to all source nodes.

[0006] The above methods achieve communication transmission through relay cooperation, but the security and reliability of covert signal transmission still need to be improved. Summary of the Invention

[0007] To overcome the shortcomings of the prior art, the present invention aims to provide a method, system, device, and medium for secure transmission via relay cooperative interference based on multiple destination nodes. A covert signal is sent from a source node S to all relay nodes R. All relay nodes R that can correctly decode the covert signal sent by the source node S are grouped into a decoding set C. When the decoding set C is not empty, the optimal relay node R is selected from it. b Optimal relay node R b The covert signal is forwarded to the optimal destination node, which then sends the received covert signal to other destination nodes with which it communicates directly. The covert signal is processed using SC and MRC spatial diversity techniques respectively. The interruption probability and interception probability of the entire covert transmission process are analyzed and derived. This method has the characteristics of ensuring the security and reliability of wireless communication confidential information transmission.

[0008] To achieve the above objectives, the technical solution adopted by the present invention is as follows:

[0009] A relay cooperative interference secure transmission method based on multi-destination nodes specifically includes the following steps:

[0010] Step 1: In the communication network topology diagram, find the links from the source node S to all destination nodes D, and select the optimal destination node using the signal-to-interference-plus-noise ratio (SINR) as the indicator of communication link quality.

[0011] Step 2: Divide the entire covert transmission process of relay selection and cooperative interference into two transmission time slots: In the first transmission time slot, the source node S sends a covert signal to all relay nodes R, and all relay nodes R that can correctly decode the covert signal sent by the source node S form a decoding set C. In the first transmission time slot, the cooperative interference node J sends an interference signal to affect the eavesdropping node E on the covert signal.

[0012] In the second transmission time slot, when the decoding set C is not empty, the best relay node R is selected from it. b Optimal relay node R b The covert signal is forwarded to the optimal destination node selected in step 1. The optimal destination node then sends the received covert signal to other destination nodes that it communicates with directly. In the second transmission time slot, the cooperating interference node J sends an interference signal to affect the eavesdropping node E's eavesdropping on the covert signal.

[0013] Step 3: During the covert transmission process, SC and MRC spatial diversity techniques are used to process the covert signal, and the interruption probability and interception probability of the entire covert transmission process in Step 2 are analyzed and derived.

[0014] Step 1 specifically includes:

[0015] When the channel state information of all communication links is known, all channels follow independent Rayleigh fading with different distributions. The channel fading coefficient remains constant in each transmission time slot and is independent between different transmission time slots, denoted by h. XY The channel fading coefficient from node X to node Y is represented by g, and the corresponding channel power gain is defined as g. XY , where g XY =|h XY | 2 ;

[0016] Channel gain g XY They follow an independent exponential distribution with a mean of 1. Where, λ XY =(d XY ) x d XY This represents the actual propagation distance from node X to node Y in the wireless channel, where x is the attenuation factor.

[0017] The signal received by destination node D from source node S is:

[0018]

[0019] Where, x S P is the covert signal sent by the source node S. S This represents the signal transmission power of the source node S. This represents additive white Gaussian noise with zero mean and variance N0;

[0020] The formula for calculating the SINR of the destination node D is as follows:

[0021]

[0022] From M destination nodes D, select m as the optimal destination nodes. The selection of the optimal destination nodes is as follows:

[0023]

[0024] Step 2 specifically includes:

[0025] In the first time slot, source node S sends a covert signal to all relay nodes R. The signal received by relay node R from source node S is as follows:

[0026]

[0027] The formula for calculating the SINR of the link from source node S to relay node R is:

[0028]

[0029] The signal received by the eavesdropping node E can be represented as:

[0030]

[0031] The formula for calculating the SINR of the link from source node S to eavesdropping node E is:

[0032]

[0033] in,

[0034] In the second time slot, the signal received by destination node D is:

[0035]

[0036] The signal received by the eavesdropping node E is:

[0037]

[0038] The formula for calculating the SINR of the link from source node S to destination node D is:

[0039]

[0040] The formula for calculating the SINR of the link from source node S to eavesdropping node E is:

[0041]

[0042] When the decoder set C is not empty, b optimal relay nodes R are selected from the decoder set C, using the signal-to-interference-plus-noise ratio (SINR) as the metric. b Optimal relay node R b The selection formula is:

[0043]

[0044] The interruption probability and interception probability in step 3 specifically include:

[0045] The interruption probability refers to the probability that the SINR between the source node S and the destination node D is less than a threshold value.

[0046] The interception probability refers to the probability that the SINR between the source node S and the eavesdropping node E is greater than a threshold value.

[0047] Step 3 specifically includes:

[0048] Step 3.1, from source node S to destination node group D m In the link, destination node group D m The formula for calculating SINR from end to end is:

[0049]

[0050] In relay node group R n To the destination node group D m In the link, destination node group D m The formula for calculating SINR from end to end is:

[0051]

[0052] In the link from source node S to eavesdropping node E, the end-to-end SINR calculation formula for eavesdropping node E is as follows:

[0053]

[0054] In relay node group R n In the link to the eavesdropping node E, the end-to-end SINR calculation formula for the eavesdropping node E is as follows:

[0055]

[0056] Step 3.2: Based on the definition of interruption probability and the law of total probability. The outage probability of using the SC selective relay scheme can be expressed as:

[0057]

[0058] In the formula, |C| represents the number of elements in the decoding set C, |C|=0 indicates that the decoding set C is empty, and Pr(|C|=n) represents the probability that there are n relay nodes R that can successfully decode the covert signal sent by the source node S, which is calculated as follows:

[0059]

[0060] In the formula, This represents the probability that no relay node R can successfully decode the covert signal sent by the source node S, and its calculation formula is as follows:

[0061]

[0062] When decoding set hour,

[0063]

[0064] In the formula,

[0065]

[0066]

[0067] When the number of elements in the decoding set C, |C| = n

[0068]

[0069] In the formula, R represents the optimal relay node. b The probability that the SINR of the link to the destination node D is less than the threshold value is expressed as:

[0070]

[0071] Step 3.3: Based on the definition of interruption probability and the law of total probability. The outage probability of the MRC-based relay selection scheme can be expressed as:

[0072]

[0073] When the number of elements in the decoding set C, |C| = n

[0074]

[0075] In the formula,

[0076]

[0077] Step 3.4: Based on the definition of interruption probability and the law of total probability. The interception probability using the SC relay selection scheme can be expressed as:

[0078]

[0079] In the formula, when the decoding set At that time, Pr(γ) SE >γ th The probability that the SINR from source node S to eavesdropping node D is greater than the threshold value can be expressed as:

[0080]

[0081] In the formula, We can obtain the results from the table of common function integrals.

[0082] When the number of elements in the decoding set C, |C| = n The probability that the maximum value of the SINR from source node S to destination node E and the SINR from interrupt node R to destination node E is greater than a threshold value can be expressed as:

[0083]

[0084] Further calculations,

[0085]

[0086] Combining the law of total probability

[0087]

[0088] We can obtain:

[0089]

[0090] Step 3.5: Based on the definition of interruption probability and the law of total probability. The interception probability using the MRC-based relay selection scheme can be expressed as:

[0091]

[0092] In the formula, when the number of elements in the decoding set C, |C| = n,

[0093] In the formula,

[0094]

[0095]

[0096] A relay cooperative jamming secure transmission system based on multiple destination nodes includes:

[0097] Optimal Destination Node Selection Module: Determines the optimal destination node based on the optimal destination node selection criteria;

[0098] Signal broadcasting module: Source node S broadcasts the concealed signal to relay node group R. n ;

[0099] Optimal Relay Node Selection Module: Determines the optimal relay node R based on the selection criteria. b ;

[0100] Decoding and forwarding module: Best relay node R b The received covert signal from source node S is decoded and forwarded to the optimal destination node;

[0101] Signal jamming module: Cooperative jamming node J sends jamming signals to affect the eavesdropping node E's ability to eavesdrop on concealed signals;

[0102] Signal receiving and processing module: Uses SC and MRC spatial diversity techniques to process covert signals.

[0103] A relay cooperative jamming secure transmission device based on multiple destination nodes, comprising:

[0104] Memory: Used to store the computer program that implements the aforementioned method for secure transmission through relay cooperation interference based on multiple destination nodes;

[0105] Processor: Used to implement the aforementioned method for secure transmission of relay cooperative interference based on multiple destination nodes when executing the computer program.

[0106] A computer-readable storage medium, characterized in that the computer-readable storage medium stores a computer program, which, when executed by a processor, implements the steps of the aforementioned method for secure transmission of relay cooperative interference based on multiple destination nodes.

[0107] Compared with the prior art, the beneficial effects of the present invention are as follows:

[0108] 1. Compared with the prior art, the present invention combines relaying of covert signals and cooperative interference with eavesdropping nodes, and selects the optimal covert information transmission path between the source node and the destination node by using the maximum signal-to-interference-plus-noise ratio of the link between the destination node and the relay node as the selection criterion. This maximizes the channel quality difference between the legitimate link and the eavesdropping link and ensures the confidentiality of information transmission.

[0109] 2. Compared with the prior art, the present invention uses SC and MRC spatial diversity techniques to process the covert signals of each diversity link, and derives the precise analytical expressions of the interruption probability and interception probability of the optimal node selection scheme, which quantitatively describes the reliability and security of the covert transmission process.

[0110] In summary, this invention, through the joint efforts of relaying covert signals and cooperating to interfere with eavesdropping nodes, and by employing SC and MRC spatial diversity techniques to process the covert signals of each diversity link, ensures the confidentiality of information transmission and quantitatively describes the reliability and security of the covert transmission process. Attached Figure Description

[0111] Figure 1 This is a schematic diagram of the covert transmission process of the present invention.

[0112] Figure 2 This is a simulation result of the interruption probability under different signal-to-interference-plus-noise ratios and different numbers of relay nodes in this embodiment.

[0113] Figure 3 This is a simulation result of the interruption probability under different signal-to-interference-plus-noise ratios and different numbers of target nodes in this embodiment.

[0114] Figure 4 This is a simulation result diagram of the interception probability under different signal-to-interference-plus-noise ratios and different numbers of interference nodes in this embodiment. Detailed Implementation

[0115] The present invention will now be described in detail with reference to the accompanying drawings.

[0116] See Figure 1 The relay cooperative covert communication system model proposed in this invention consists of a single source node S and a relay node group R. r (1 < r < N), target node group D m (1 < m < M), a single eavesdropping node E and a cooperative jamming node group J k Composed of (1 < k < K). All communication nodes are configured with a single antenna for information reception and transmission, and operate in half-duplex mode.

[0117] See Figure 1 A relay cooperative interference secure transmission method based on multiple destination nodes specifically includes the following steps:

[0118] Step 1: In the communication network topology diagram, find the links from the source node S to all destination nodes D, and select the optimal destination node using the signal-to-interference-plus-noise ratio (SINR) as the indicator of communication link quality.

[0119] Step 2: Divide the entire covert transmission process of relay selection and cooperative interference into two transmission time slots: In the first transmission time slot, the source node S sends a covert signal to all relay nodes R, and all relay nodes R that can correctly decode the covert signal sent by the source node S form a decoding set C. In the first transmission time slot, the cooperative interference node J sends an interference signal, which affects the eavesdropping node E's eavesdropping on the covert signal, but does not affect the relay nodes R and the destination node D's reception of the signal.

[0120] In the second transmission time slot, when the decoding set C is not empty, the best relay node R is selected from it. b Optimal relay node R b The covert signal is forwarded to the optimal destination node selected in step 1. The optimal destination node then sends the received covert signal to other destination nodes that communicate directly with it. In the second transmission time slot, the cooperating jamming node J sends jamming signals, which affect the eavesdropping node E's eavesdropping on the covert signal, but will not affect the relay node R and the destination node D's reception of the signal.

[0121] Step 3: During the covert transmission process, SC and MRC spatial diversity techniques are used to process the covert signal, and the interruption probability and interception probability of the entire covert transmission process in Step 2 are analyzed and derived.

[0122] Step 1 specifically includes:

[0123] When the channel state information of all communication links is known, all channels follow independent Rayleigh fading with different distributions. The channel fading coefficient remains constant in each transmission time slot and is independent between different transmission time slots, denoted by h. XY The channel fading coefficient from node X to node Y is represented by g, and the corresponding channel power gain is defined as g. XY , where g XY =|h XY | 2 ;

[0124] Channel gain g XY They follow an independent exponential distribution with a mean of 1. Where, λ XY =(d XY ) x d XY This represents the actual propagation distance from node X to node Y in the wireless channel, where x is the attenuation factor.

[0125] The signal received by destination node D from source node S is:

[0126]

[0127] Where, x S P is the covert signal sent by the source node S.S This represents the signal transmission power of the source node S. This represents additive white Gaussian noise with zero mean and variance N0;

[0128] The formula for calculating the SINR of the destination node D is as follows:

[0129]

[0130] From M destination nodes D, select m as the optimal destination nodes. The selection of the optimal destination nodes is as follows:

[0131]

[0132] Step 2 specifically includes:

[0133] In the first time slot, source node S sends a covert signal to all relay nodes R. The signal received by relay node R from source node S is as follows:

[0134]

[0135] The formula for calculating the SINR of the link from source node S to relay node R is:

[0136]

[0137] The signal received by the eavesdropping node E can be represented as:

[0138]

[0139] The formula for calculating the SINR of the link from source node S to eavesdropping node E is:

[0140]

[0141] in,

[0142] In the second time slot, the signal received by destination node D is:

[0143]

[0144] The signal received by the eavesdropping node E is:

[0145]

[0146] The formula for calculating the SINR of the link from source node S to destination node D is:

[0147]

[0148] The formula for calculating the SINR of the link from source node S to eavesdropping node E is:

[0149]

[0150] When the decoder set C is not empty, b optimal relay nodes R are selected from the decoder set C, using the signal-to-interference-plus-noise ratio (SINR) as the metric. b Optimal relay node R b The selection formula is:

[0151]

[0152] The interruption probability and interception probability in step 3 specifically include:

[0153] The interruption probability refers to the probability that the SINR between the source node S and the destination node D is less than a threshold value, and is used to measure the reliability of the wireless communication system.

[0154] The interception probability refers to the probability that the SINR between the source node S and the eavesdropping node E is greater than a threshold value, and is used to measure the security of the wireless communication system.

[0155] Step 3 specifically includes:

[0156] Step 3.1, from source node S to destination node group D m In the link, destination node group D m The formula for calculating SINR from end to end is:

[0157]

[0158] In relay node group R n To the destination node group D m In the link, destination node group D m The formula for calculating SINR from end to end is:

[0159]

[0160] In the link from source node S to eavesdropping node E, the end-to-end SINR calculation formula for eavesdropping node E is as follows:

[0161]

[0162] In relay node group R n In the link to the eavesdropping node E, the end-to-end SINR calculation formula for the eavesdropping node E is as follows:

[0163]

[0164] Step 3.2: Based on the definition of interruption probability and the law of total probability. The outage probability of using the SC selective relay scheme can be expressed as:

[0165]

[0166] In the formula, |C| represents the number of elements in the decoding set C, that is, the number of relay nodes R that can correctly decode the covert signal sent by the source node S. |C|=0 indicates that the decoding set C is empty, that is, the relay node group R is empty. n If the covert information from source node S cannot be forwarded to the optimal destination node, Pr(|C|=n) represents the probability that there are n relay nodes R that can successfully decode the covert signal sent by source node S. Its calculation formula is as follows:

[0167]

[0168] In the formula, This represents the probability that no relay node R can successfully decode the covert signal sent by the source node S, and its calculation formula is as follows:

[0169]

[0170] When decoding set hour,

[0171]

[0172] In the formula,

[0173]

[0174]

[0175] When the number of elements in the decoding set C, |C| = n

[0176]

[0177] In the formula, R represents the optimal relay node. b The probability that the SINR of the link to the destination node D is less than the threshold value is expressed as:

[0178]

[0179] Step 3.3: Based on the definition of interruption probability and the law of total probability. The outage probability of the MRC-based relay selection scheme can be expressed as:

[0180]

[0181] When the number of elements in the decoding set C, |C| = n

[0182]

[0183] In the formula,

[0184]

[0185]

[0186] Step 3.4: Based on the definition of interruption probability and the law of total probability. The interception probability using the SC relay selection scheme can be expressed as:

[0187]

[0188] In the formula, when the decoding set At that time, Pr(γ) SE >γ th The probability that the SINR from source node S to eavesdropping node D is greater than the threshold value can be expressed as:

[0189]

[0190] In the formula, We can obtain the results from the table of common function integrals.

[0191] When the number of elements in the decoding set C, |C| = n The probability that the maximum value of the SINR from source node S to destination node E and the SINR from interrupt node R to destination node E is greater than a threshold value can be expressed as:

[0192]

[0193] Further calculations,

[0194]

[0195] Combining the law of total probability

[0196]

[0197] We can obtain:

[0198]

[0199] Step 3.5: Based on the definition of interruption probability and the law of total probability. The interception probability using the MRC-based relay selection scheme can be expressed as:

[0200]

[0201] In the formula, when the number of elements in the decoding set C, |C| = n,

[0202]

[0203] In the formula,

[0204]

[0205]

[0206] Simulation analysis:

[0207] See Figure 2 When the destination node M=4 and the relay nodes N=0, 5, and 10, the curves showing the probability of covert transmission interruption as a function of the signal-to-interference-plus-noise ratio (SIR) are presented using MRC and SC spatial diversity techniques. The probability of covert transmission interruption decreases monotonically with increasing SIR. The number of relay nodes N directly affects the probability of covert transmission interruption; under the same conditions, the more relay nodes, the lower the interruption probability and the more reliable the covert transmission. The theoretical and simulated values ​​are on the same line, verifying the correctness of the formula derivation.

[0208] See Figure 3 When there are 5 relay nodes and M = 1, 5, and 10 destination nodes, the curves showing the probability of covert transmission interruption as a function of the signal-to-interference-plus-noise ratio (SIR) are presented using MRC and SC spatial diversity techniques. The probability of covert transmission interruption decreases monotonically with increasing SIR, and the number of destination nodes M directly affects the probability of covert transmission interruption. Under the same conditions, more destination nodes result in a lower probability of covert transmission interruption, which is more beneficial for the transmission of covert signals from the source node. The theoretical and simulated values ​​are on the same line, verifying the correctness of the formula derivation.

[0209] See Figure 4 When there are 5 relay nodes, 4 destination nodes, and K interfering nodes (K=0, 5, 10), the curves showing the interception probability of covert transmission as a function of the signal-to-interference-plus-noise ratio (SIR) are presented using MRC and SC spatial diversity techniques. The interception probability of covert transmission monotonically decreases with increasing SIR. The number of interfering nodes K directly affects the interception probability of covert transmission; under the same conditions, the more interfering nodes, the lower the interception probability. The theoretical and simulated values ​​are on the same line, verifying the correctness of the formula derivation.

[0210] See Figure 2 , Figure 3 , Figure 4 Simulation results show that, with a signal-to-interference-plus-noise ratio (SNR) of 0 dB, the outage probability of this invention using MRC and SC spatial diversity techniques, when the destination node M = 4 and the relay nodes N = 5, is reduced by 10% compared to the prior art in the case of no relay nodes (N = 0). -2 At a signal-to-interference-plus-noise ratio (SNR) of -5dB, the interruption probability of this invention using MRC and SC spatial diversity techniques, with relay nodes N=5 and destination nodes M=5, is reduced by 10% compared to the prior art with a single destination node (M=1). -2When the signal-to-interference-plus-noise ratio (SNR) is 0 dB, the interception probability of this invention using MRC and SC spatial diversity techniques, with relay nodes N=5, destination nodes M=4, and interfering nodes K=5, is reduced by 10% compared to the prior art in the case of no interfering nodes (K=0). -1 Furthermore, the MRC spatial diversity technique employed in this invention exhibits better performance in terms of outage and interception probabilities compared to the SC spatial diversity technique. In summary, compared with existing technologies, this invention effectively reduces the probability of communication outages and interceptions, demonstrating both security and reliability.

[0211] A relay cooperative jamming secure transmission system based on multiple destination nodes includes:

[0212] Optimal Destination Node Selection Module: Determines the optimal destination node based on the optimal destination node selection criteria, used in step 1 of the relay cooperative interference secure transmission method based on multiple destination nodes in this invention;

[0213] Signal broadcasting module: Source node S broadcasts the concealed signal to relay node group R. n Step 2 of the relay cooperative interference secure transmission method based on multiple destination nodes in this invention;

[0214] Optimal Relay Node Selection Module: Determines the optimal relay node R based on the selection criteria. b Step 3 of the relay cooperative interference secure transmission method based on multiple destination nodes in this invention;

[0215] Decoding and forwarding module: Best relay node R b The received covert signal from source node S is decoded and forwarded to the optimal destination node, which is used in step 3 of the relay cooperative interference secure transmission method based on multiple destination nodes in this invention.

[0216] Signal jamming module: Cooperative jamming node J sends jamming signals to affect the eavesdropping node E's eavesdropping on concealed signals, used in steps 2 and 3 of the relay cooperative jamming secure transmission method based on multi-purpose nodes in this invention;

[0217] Signal receiving and processing module: Uses SC and MRC spatial diversity techniques to process the concealed signal, which is used in step 4 of the relay cooperative interference secure transmission method based on multiple destination nodes in this invention.

[0218] A relay cooperative jamming secure transmission device based on multiple destination nodes, comprising:

[0219] Memory: Used to store the computer program that implements the aforementioned method for secure transmission through relay cooperation interference based on multiple destination nodes;

[0220] Processor: Used to implement the aforementioned method for secure transmission of relay cooperative interference based on multiple destination nodes when executing the computer program.

[0221] The processor can be a Central Processing Unit (CPU), or other general-purpose processors, digital signal processors (DSPs), application-specific integrated circuits (ASICs), field-programmable gate arrays (FPGAs), or other programmable logic devices, discrete gate or transistor logic devices, discrete hardware components, etc. The general-purpose processor can be a microprocessor, or any conventional processor. The processor is the control center of the device for a multi-destination node-based relay cooperative jamming secure transmission method, connecting various parts of the device through various interfaces and lines.

[0222] When the processor executes the computer program, it implements the steps of the above-described method for secure transmission through relay cooperation interference based on multiple destination nodes, for example: selecting the optimal destination node; the source node S sends a covert signal to all relay nodes R, and all relay nodes R that can correctly decode the covert signal sent by the source node S form a decoding set C; when the decoding set C is not empty, the optimal relay node R is selected from it. b Optimal relay node R b The covert signal is forwarded to the optimal destination node selected in step 1, and the optimal destination node then sends the received covert signal to other destination nodes that communicate directly with it; the covert signal is processed using SC and MRC spatial diversity techniques; thus, the aforementioned method for secure transmission of relay cooperative interference based on multiple destination nodes is realized.

[0223] Alternatively, when the processor executes the computer program, it implements the functions of each module in the above system, for example: Optimal destination node selection module: determines the optimal destination based on the optimal destination node selection criteria; Signal broadcasting module: source node S broadcasts a concealed signal to relay node group R. n Optimal relay node selection module: Determines the optimal relay node R based on the selection criteria. b Decoding and forwarding module: Optimal relay node R bThe received covert signal from source node S is decoded and forwarded to the optimal destination node; the signal jamming module: the cooperative jamming node J sends jamming signals to affect the eavesdropping node E on the covert signal; the signal receiving and processing module: the covert signal is processed using SC and MRC spatial diversity techniques; the output is the result of the relay cooperative jamming secure transmission method based on multiple destination nodes.

[0224] For example, the computer program can be divided into one or more modules / units, which are stored in the memory and executed by the processor to complete the present invention. The one or more modules / units can be a series of computer program instruction segments capable of performing preset functions. These instruction segments describe the execution process of the computer program in the device of the multi-destination node-based relay cooperative interference secure transmission method. For example, the computer program can be divided into an optimal destination node selection module, a signal broadcasting module, an optimal relay node selection module, a decoding and forwarding module, a signal interference module, and a signal receiving and processing module. The specific functions of each module are as follows: Optimal destination node selection module: determines the optimal destination based on optimal destination node selection conditions; Signal broadcasting module: source node S broadcasts a concealed signal to relay node group R. n Optimal relay node selection module: Determines the optimal relay node R based on the selection criteria. b Decoding and forwarding module: Optimal relay node R b The received covert signal from source node S is decoded and forwarded to the optimal destination node; the signal jamming module: the cooperative jamming node J sends jamming signals to affect the eavesdropping node E on the covert signal; the signal receiving and processing module: the covert signal is processed using SC and MRC spatial diversity techniques, and the result of the relay cooperative jamming secure transmission method based on multiple destination nodes is output.

[0225] The device described in the multi-destination node-based relay cooperative interference secure transmission method can be a computing device such as a desktop computer, laptop, handheld computer, or cloud server. The device may include, but is not limited to, processors and memory. Those skilled in the art will understand that the above is an example of a device for a multi-destination node-based relay cooperative interference secure transmission method and does not constitute a limitation on the device itself. It may include more components than described above, or combine certain components, or use different components. For example, the device may also include input / output devices, network access devices, buses, etc.

[0226] The memory can be used to store the computer program and / or modules. The processor implements various functions of the device for a multi-destination node-based relay cooperative interference secure transmission method by running or executing the computer program and / or modules stored in the memory and calling the data stored in the memory.

[0227] The memory may primarily include a program storage area and a data storage area. The program storage area may store the operating system and at least one application program required for a given function (such as sound playback or image playback). The data storage area may store data created based on the use of the phone (such as audio data or a phonebook). Furthermore, the memory may include high-speed random access memory (RAM) and non-volatile memory, such as hard disks, RAM, plug-in hard disks, SmartMediaCards (SMC), Secure Digital (SD) cards, flash cards, at least one disk storage device, flash memory device, or other volatile solid-state storage devices.

[0228] The present invention also provides a computer-readable storage medium, characterized in that the computer-readable storage medium stores a computer program, which, when executed by a processor, implements the steps of the aforementioned method for secure transmission of relay cooperative interference based on multiple destination nodes.

[0229] If the system integration module / unit of the aforementioned multi-destination node-based relay cooperative interference secure transmission method is implemented as a software functional unit and sold or used as an independent product, it can be stored in a computer-readable storage medium.

[0230] This invention implements all or part of the processes in the aforementioned method for secure transmission of relay cooperative interference based on multiple destination nodes. It can also be implemented by a computer program instructing related hardware. The computer program can be stored in a computer-readable storage medium. When executed by a processor, the computer program can implement the steps of the aforementioned method for secure transmission of relay cooperative interference based on multiple destination nodes. The computer program includes computer program code, which can be in the form of source code, object code, executable file, or a preset intermediate form, etc.

[0231] The computer-readable storage medium may include: any entity or device capable of carrying the computer program code, recording media, USB flash drive, portable hard drive, magnetic disk, optical disk, computer memory, read-only memory (ROM), random access memory (RAM), electrical carrier signal, telecommunication signal, and software distribution medium, etc.

[0232] It should be noted that the content contained in the computer-readable storage medium may be appropriately increased or decreased according to the requirements of legislation and patent practice in the jurisdiction. For example, in some jurisdictions, according to legislation and patent practice, the computer-readable storage medium does not include electrical carrier signals and telecommunication signals.

[0233] It should be noted that embodiments of the present invention can be implemented using hardware, software, or a combination of both. The hardware portion can be implemented using dedicated logic; the software portion can be stored in memory and executed by an appropriate instruction execution system, such as a microprocessor or dedicated hardware.

[0234] Those skilled in the art will understand that the above-described devices and methods can be implemented using computer-executable instructions and / or included in processor control code, for example, such code provided on a carrier medium such as a disk, CD, or DVD-ROM, a programmable memory such as read-only memory (firmware), or a data carrier such as an optical or electronic signal carrier. The devices and modules of the present invention can be implemented by hardware circuitry of semiconductors such as very large-scale integrated circuits or gate arrays, logic chips, transistors, etc., or programmable hardware devices such as field-programmable gate arrays, programmable logic devices, etc., or by software executed by various types of processors, or by a combination of the above-described hardware circuitry and software, such as firmware.

Claims

1. A method for relay cooperation interference secure transmission based on multi-purpose nodes, characterized in that, Specifically, the following steps are included: Step 1: In the communication network topology diagram, find the links from the source node S to all destination nodes D, and select the optimal destination node using the signal-to-interference-plus-noise ratio (SINR) as the indicator of communication link quality. Step 2: Divide the entire covert transmission process, which combines relay selection and cooperative interference, into two transmission time slots: In the first transmission time slot, the source node S sends a covert signal to all relay nodes R. All relay nodes R that can correctly decode the covert signal sent by the source node S form a decoding set C. In the first transmission time slot, the cooperating interference node J sends an interference signal to affect the eavesdropping node E's eavesdropping on the covert signal. second transmission time slot, from which the best relay node is selected when the decoding set C is non-empty the best relay node forwarding the covert signal to the optimal destination node selected in step 1, which in turn transmits the received covert signal to other destination nodes with which it directly communicates, and in the second transmission time slot, the cooperative jammer J transmits a jamming signal that affects the eavesdropping of the covert signal by the eavesdropper E; Step 3: During the covert transmission process, SC and MRC spatial diversity techniques are used to process the covert signal, based on the definition of interruption probability and the law of total probability. The interruption probability and interception probability of the entire covert transmission process in step 2 are analyzed and derived. The specific steps are as follows: Step 3.1, from source node S to destination node group In the link, the destination node group The formula for calculating SINR from end to end is: In relay node group To the destination node group In the link, the destination node group The formula for calculating SINR from end to end is: From source node S to eavesdropping node In the link, the SINR calculation formula for end-to-end connection of the eavesdropping node E is as follows: In relay node group In the link to the eavesdropping node E, the end-to-end SINR calculation formula for the eavesdropping node E is as follows: ； Step 3.2, the interruption probability of the selected relay scheme using SC is expressed as: Step 3.3, the outage probability of the relay selection scheme using MRC is expressed as: Step 3.4, the interception probability of the selected relay scheme using SC is expressed as: Step 3.5, the interception probability of the MRC-based relay selection scheme is expressed as: 。 2. The relay cooperative interference secure transmission method based on multiple destination nodes according to claim 1, characterized in that, Step 1 specifically includes: When the channel state information of all communication links is known, all channels follow independent Rayleigh fading with different distributions. The channel fading coefficient remains constant in each transmission time slot and is independent between different transmission time slots. The channel fading coefficient from node X to node Y is represented by the corresponding channel power gain, which is defined as follows: ,in ; Channel gain They follow an independent exponential distribution with a mean of 1. ,in, , This represents the actual propagation distance from node X to node Y in the wireless channel. It is the attenuation factor; The signal received by destination node D from source node S is: in, The hidden signal sent by the source node S. This represents the signal transmission power of the source node S. This represents additive white Gaussian noise with zero mean and variance . ; The SINR calculation formula for the destination node D is as follows: From M destination nodes D, select m as the optimal destination nodes. The selection of the optimal destination nodes is as follows: 。 3. The relay cooperative interference secure transmission method based on multiple destination nodes according to claim 1, characterized in that, Step 2 specifically includes: In the first time slot, source node S sends a covert signal to all relay nodes R. The signal received by relay node R from source node S is as follows: The formula for calculating the SINR of the link from source node S to relay node R is: The signal received by the eavesdropping node E can be represented as: The formula for calculating the SINR of the link from source node S to eavesdropping node E is: in, ; In the second time slot, the signal received by destination node D is: The signal received by the eavesdropping node E is: The formula for calculating the SINR of the link from source node S to destination node D is: The formula for calculating the SINR of the link from source node S to eavesdropping node E is: When the decoder set C is not empty, b optimal relay nodes are selected from the decoder set C, using the signal-to-interference-plus-noise ratio (SINR) as the metric. Optimal relay node The selection formula is: 。 4. The relay cooperative interference secure transmission method based on multiple destination nodes according to claim 1, characterized in that, The interruption probability and interception probability in step 3 specifically include: The interruption probability refers to the probability that the SINR between the source node S and the destination node D is less than a threshold value; The interception probability refers to the SINR between the source node S and the eavesdropping node E being greater than a threshold value.

5. A relay cooperative interference secure transmission method based on multiple destination nodes according to claim 1 or 4, characterized in that, Step 3 specifically includes: In the formula of step 3.2, M represents the total number of destination nodes, and m represents the optimal number of destination nodes. This represents the channel gain from the source node to the destination node, which follows an independent exponential distribution. This represents the SINR threshold value of the destination node. This indicates the number of elements in the decoding set C. This indicates that the decoding set C is an empty set. This represents the signal transmission power of the source node S. The variance of zero-mean additive white Gaussian noise is represented by... Indicates existence The probability that a relay node R can successfully decode the covert signal sent by the source node S is calculated using the following formula: In the formula, This represents the probability that no relay node R can successfully decode the covert signal sent by the source node S, and its calculation formula is as follows: When decoding set hour, In the formula, When the number of elements in the decoding set C hour, In the formula, Indicates the best relay node The probability that the SINR of the link to the destination node D is less than the threshold value is expressed as: ； In the formula of step 3.3, when the number of elements in the decoding set C... hour, In the formula, ； In the formula of step 3.4, when the decoding set hour, The probability that the SINR from source node S to eavesdropping node D is greater than a threshold value is expressed as: In the formula, We can obtain the results from the table of common function integrals. , When the number of elements in the decoding set C hour, The probability that the maximum SINR from source node S to destination node E and the SINR from interrupt node R to destination node E are greater than a threshold value is expressed as: Further calculations, Combining the law of total probability , We can obtain: ； In the formula of step 3.5, when the number of elements in the decoding set C... hour, In the formula, 。 6. A relay cooperative interference secure transmission device based on multi-destination nodes, characterized in that, include: Memory: for storing a computer program that implements a multi-destination node-based relay cooperative interference secure transmission method as described in any one of claims 1-5; Processor: Used to implement the relay cooperative interference secure transmission method based on multiple destination nodes as described in any one of claims 1-5 when executing the computer program.

7. A computer-readable storage medium, characterized in that, The computer-readable storage medium stores a computer program that, when executed by a processor, implements the steps of a relay cooperative interference secure transmission method based on multiple destination nodes as described in any one of claims 1-5.

Images