CN111447611B - Transmission method for protecting information security through cooperation in wireless network - Google Patents
Transmission method for protecting information security through cooperation in wireless network Download PDFInfo
- Publication number
- CN111447611B CN111447611B CN202010150704.2A CN202010150704A CN111447611B CN 111447611 B CN111447611 B CN 111447611B CN 202010150704 A CN202010150704 A CN 202010150704A CN 111447611 B CN111447611 B CN 111447611B
- Authority
- CN
- China
- Prior art keywords
- node
- cooperative interference
- legal
- transmission
- cooperative
- Prior art date
- Legal status (The legal status is an assumption and is not a legal conclusion. Google has not performed a legal analysis and makes no representation as to the accuracy of the status listed.)
- Active
Links
Images
Classifications
-
- H—ELECTRICITY
- H04—ELECTRIC COMMUNICATION TECHNIQUE
- H04W—WIRELESS COMMUNICATION NETWORKS
- H04W12/00—Security arrangements; Authentication; Protecting privacy or anonymity
- H04W12/03—Protecting confidentiality, e.g. by encryption
-
- H—ELECTRICITY
- H04—ELECTRIC COMMUNICATION TECHNIQUE
- H04W—WIRELESS COMMUNICATION NETWORKS
- H04W40/00—Communication routing or communication path finding
- H04W40/02—Communication route or path selection, e.g. power-based or shortest path routing
- H04W40/04—Communication route or path selection, e.g. power-based or shortest path routing based on wireless node resources
- H04W40/08—Communication route or path selection, e.g. power-based or shortest path routing based on wireless node resources based on transmission power
-
- H—ELECTRICITY
- H04—ELECTRIC COMMUNICATION TECHNIQUE
- H04W—WIRELESS COMMUNICATION NETWORKS
- H04W40/00—Communication routing or communication path finding
- H04W40/02—Communication route or path selection, e.g. power-based or shortest path routing
- H04W40/12—Communication route or path selection, e.g. power-based or shortest path routing based on transmission quality or channel quality
-
- H—ELECTRICITY
- H04—ELECTRIC COMMUNICATION TECHNIQUE
- H04W—WIRELESS COMMUNICATION NETWORKS
- H04W40/00—Communication routing or communication path finding
- H04W40/02—Communication route or path selection, e.g. power-based or shortest path routing
- H04W40/20—Communication route or path selection, e.g. power-based or shortest path routing based on geographic position or location
-
- H—ELECTRICITY
- H04—ELECTRIC COMMUNICATION TECHNIQUE
- H04W—WIRELESS COMMUNICATION NETWORKS
- H04W40/00—Communication routing or communication path finding
- H04W40/02—Communication route or path selection, e.g. power-based or shortest path routing
- H04W40/22—Communication route or path selection, e.g. power-based or shortest path routing using selective relaying for reaching a BTS [Base Transceiver Station] or an access point
-
- H—ELECTRICITY
- H04—ELECTRIC COMMUNICATION TECHNIQUE
- H04W—WIRELESS COMMUNICATION NETWORKS
- H04W72/00—Local resource management
- H04W72/04—Wireless resource allocation
- H04W72/044—Wireless resource allocation based on the type of the allocated resource
- H04W72/0473—Wireless resource allocation based on the type of the allocated resource the resource being transmission power
-
- H—ELECTRICITY
- H04—ELECTRIC COMMUNICATION TECHNIQUE
- H04W—WIRELESS COMMUNICATION NETWORKS
- H04W72/00—Local resource management
- H04W72/50—Allocation or scheduling criteria for wireless resources
- H04W72/54—Allocation or scheduling criteria for wireless resources based on quality criteria
- H04W72/542—Allocation or scheduling criteria for wireless resources based on quality criteria using measured or perceived quality
Landscapes
- Engineering & Computer Science (AREA)
- Computer Networks & Wireless Communication (AREA)
- Signal Processing (AREA)
- Quality & Reliability (AREA)
- Computer Security & Cryptography (AREA)
- Mobile Radio Communication Systems (AREA)
Abstract
The invention discloses a transmission method for protecting information security in a wireless network through cooperation, which provides a measure for improving the security performance and simultaneously having the smallest influence on the interference of a legal user receiving signal aiming at a security weak area in the wireless network. The method and the device aim at maximizing the safe connection probability, protect the legal communication nodes by optimizing the cooperative interference power and selecting or setting specific cooperative interference nodes on the basis of ensuring the correct demodulation of the legal communication nodes, and effectively improve the safety performance; according to the invention, when the above conditions are met, the cooperative interference nodes which do not need to send interference signals can be eliminated according to the optimized cooperative interference power distribution. The invention is simple and effective, the interaction overhead between the nodes is small, and the transmission method is realized quickly.
Description
Technical Field
The invention relates to the technical field of wireless communication safety transmission, in particular to a transmission method for protecting information safety through cooperation in a wireless network.
Background
The communication service is developed to the present, the security problem is increasingly paid attention by people, and malicious eavesdroppers may exist in the reachable range of the communication signal to monitor and decode the transmission signal due to the broadcasting characteristic of the wireless network.
Conventional secure transmission algorithms are typically based on cryptographic designs. The transmission signal is encrypted based on an encryption algorithm, and an eavesdropper decodes the transmission signal under the condition of unknown key, so that the calculation complexity is extremely high, and the transmission signal can be generally considered to be difficult to decrypt without the key. However, as the computer industry is rapidly developed, the computing capability of the computer is greatly improved compared with the prior art, and a secure transmission mechanism provided based on cryptography faces greater security threat in the future.
The physical layer security is based on the security definition in the absolute sense of shannon. The research shows that: when the channel capacity of the legal channel is greater than the capacity of the interception channel, the legal communication node transmits information at an information rate which is not higher than the difference part between the capacity of the legal user channel and the capacity of the interception channel through channel coding, namely the actual information rate needing to be kept secret in the signals transmitted after coding is not greater than the difference value, and an eavesdropper cannot correctly demodulate the signals. Thus, physical layer security is security in an absolute sense. But in an actual communication scenario, the location, number, and channel state information of an eavesdropper are difficult for a legitimate user to know. Therefore, an effective protection method is needed to protect the communication scene security weak area. It is a feasible measure to enhance security that a part of legitimate communication nodes which do not participate in signal transmission send cooperative interference signals. In addition, the gradual maturity of full-duplex technology enables a legal receiving node to send a self-interference signal to protect the area around the legal receiving node while receiving the signal. In the existing research, although the combination of the cooperative interference and self-interference combined encryption methods has been proposed, the cooperative interference power is not optimally distributed, and the security performance and energy efficiency cannot be guaranteed. At the same time, no protection measures have been proposed for the least secure transmission areas within the communication scenario. Therefore, it is desirable to provide a transmission method for protecting information security in a wireless network through cooperation.
Disclosure of Invention
The present invention is directed to solve the above-mentioned drawbacks of the prior art, and provides a transmission method for protecting information security through cooperation in a wireless network.
The purpose of the invention can be achieved by adopting the following technical scheme:
a transmission method for protecting information security through cooperation in a wireless network is applied to a multi-node wireless communication scene, the multi-node wireless communication scene comprises legal communication nodes, cooperative interference nodes and eavesdroppers, the eavesdroppers are randomly distributed in the communication scene and can passively eavesdrop legal signals, and the transmission method comprises the following steps:
s1, acquiring transmission distance and channel state information between legal communication nodes;
s2, determining a source node and a destination node, taking the power of the transmission distance alpha between legal communication nodes as a weight, wherein alpha represents a path loss index, selecting the shortest transmission path according to a Dijkstra algorithm, and determining the correct demodulation signal-to-noise ratio threshold of the legal communication nodes on the transmission path;
s3, establishing a single-hop safe connection probability optimization model according to the information determined in the steps S1 and S2, and solving the optimal distribution of the cooperative interference power for each hop transmission on the transmission path by using an optimization algorithm;
s4, protecting the least safe transmission area by utilizing a specific cooperative interference node around the sending node of each hop of transmission on the transmission path, wherein when a legal communication node sends a signal, the least safe transmission area in the communication scene is designated as the area near the sending node;
and S5, for any optimized cooperative interference node, if the cooperative interference power of the cooperative interference node is smaller than the mean value of all the cooperative interference powers by an order of magnitude or more, the cooperative interference signal does not need to be sent, and the cooperative interference node is removed. Here, one order of magnitude is equal to 20 dB.
Further, the step S3 is as follows:
s31, establishing a single-hop safe connection probability optimization model as follows:
the optimization model represents a safe connection probability optimization model of the ith legal communication node for sending information to the (i + 1) th legal receiving node, wherein mueRepresenting eavesdropper density, Γ (x) representing gamma function, α representing pathLoss index, di,i+1Indicates the transmission distance, sigma, from the ith transmitting node to the (i + 1) th legitimate receiving node2Representing the noise, which follows a Gaussian distribution with a mean of 0 units of variance, δ being the self-interference suppression coefficient, PsRepresenting self-interference power, PjRepresenting the interference power of the jth co-operating interfering node, dj,i+1Represents the transmission distance, P, from the jth cooperative interference node to the (i + 1) th legal receiving nodeiRepresents the ith transmitting node transmitting power, | hi,i+1|2Representing the channel gain coefficients from the i-th transmitting node to the i + 1-th legitimate receiving node, subject to an exponential distribution with a mean value of 1, gamma0Indicating the lowest demodulation SNR threshold of a legal receiving node, i.e. each hop of the transmitting and receiving node needs to meet the correct demodulation requirement, Pj_maxRepresenting a cooperative interference power peak;
s32, judging the capability of the cooperative interference node to send signals, if a legal communication node can select a continuous power value to send signals, executing a step S33, and if the legal communication node can select a discrete power value to send signals, executing a step S34;
s33, determining heuristic algorithm parameters, and determining the optimal distribution of the cooperative interference power by using a heuristic algorithm on the optimization model in the step S31;
and S34, determining the optimal cooperative interference power distribution for the optimization model in the step S31 by using an exhaustive search method.
Further, the step S4 is as follows:
s41, if the rear side of the sending node has no cooperative interference node protection, a specific cooperative interference node is arranged on the rear side of the sending node, and the node and other cooperative interference nodes solve the optimal cooperative interference power distribution through the optimization algorithm in the step S3;
and S42, if the rear side of the sending node has the protection of the cooperative interference node, turning to the next step S5.
Further, in step S33, determining a particle swarm algorithm parameter, and determining an optimal cooperative interference power distribution for the optimization model in step S31 by using a particle swarm algorithm.
Compared with the prior art, the invention has the following advantages and effects:
1. the method and the device aim at maximizing the safe connection probability, and effectively improve the safety performance by optimizing the cooperative interference power and selecting or setting a specific cooperative interference node to protect the sending node on the basis of ensuring that the legal communication node can be correctly demodulated;
2. in the invention, the cooperative interference nodes which do not need to send interference signals can be removed according to the optimized cooperative interference power distribution while the safety performance is ensured;
3. the invention is simple and effective, the interaction overhead between the nodes is small, and the transmission method is realized quickly.
Drawings
FIG. 1 is a schematic diagram of a multi-node wireless communication scenario in an embodiment of the present invention;
fig. 2 is a schematic flowchart of a transmission method for protecting information security through cooperation in a wireless network according to an embodiment of the present invention;
fig. 3 is a schematic diagram of a multi-node wireless communication scenario after improving the security performance of single-hop transmission according to an embodiment of the present invention.
Detailed Description
In order to make the objects, technical solutions and advantages of the embodiments of the present invention clearer, the technical solutions in the embodiments of the present invention will be clearly and completely described below with reference to the drawings in the embodiments of the present invention, and it is obvious that the described embodiments are some, but not all, embodiments of the present invention. All other embodiments, which can be derived by a person skilled in the art from the embodiments given herein without making any creative effort, shall fall within the protection scope of the present invention.
Example one
The embodiment discloses a transmission method for protecting information security through cooperation in a wireless network, which is based on optimizing interference power of cooperative nodes and selecting or setting a specific cooperative interference node to protect a sending node so as to improve security performance.
The transmission method is applied to a multi-node wireless communication scene, wherein the multi-node wireless communication scene comprises legal communication nodes, cooperative interference nodes and an eavesdropper, the topological distribution of the legal communication nodes and the cooperative interference nodes is known, and the transmission distance and the channel characteristics between the legal communication nodes and the cooperative interference nodes are known.
According to the physical layer security definition, the secure capacity expression is:
ΔC＝Clegal-Ceav
wherein, ClegalIndicating the legal channel capacity, CeavIndicating the eavesdropping channel capacity. When the capacity of the legal channel is larger than that of the eavesdropping channel, the information needing to be kept secret is sent at the information rate delta C which is not higher than the difference part of the capacity of the legal user channel and the capacity of the eavesdropping channel through channel coding, so that the safe transmission in the absolute sense can be ensured, and an eavesdropper can not correctly demodulate signals all the time.
In practical communication scenarios where there is uncertainty about the eavesdropper location and its channel characteristics, it can usually only be described in terms of the probability of a secure connection, i.e. the probability that the legal channel capacity is greater than the eavesdropping channel capacity. When Δ C > 0 or the probability that the value of Δ C is greater than a certain predetermined value is very high, it can be considered that the signal transmission of the legitimate communication node is in a safe state.
The method comprises the steps that legal communication nodes at any positions and in any number exist in a communication scene, the number and the position distribution of eavesdroppers are assumed to obey random uniform distribution, and a legal channel and an eavesdropping channel both contain large-scale fading and Rayleigh fading. The legal communication nodes can acquire channel state information and transmission distance by sending a measurement reference signal, and the channel state information refers to a channel gain coefficient in the communication scene. In the communication process, information sent by a source node is forwarded to a destination node through a multi-hop relay, and the relay is a legal communication node on a multi-hop transmission path. The multi-hop transmission path may be determined according to the classical Dijkstra routing algorithm.
Since the transmission power of the legal communication node and the transmission distance between the legal communication nodes to the power of alpha are in an increasing relationship, alpha represents a path loss exponent, and the value can be determined by the landform. Generally, the greater the transmission power, the greater the signal dispersion range and thus the less secure as the transmission distance is greater. In the patent, when a Dijkstra algorithm is used for routing, the influence of a parameter alpha is considered, and a required topology weight is the power of a transmission distance alpha between legal communication nodes. The path selection according to the weight value can make the transmission power coverage range of the legal communication node as small as possible.
In addition, each hop transmission on the transmission path is carried out in different time slots, and the hop transmissions are independent. For any one-hop transmission, the receiving node sends a self-interference signal to protect the area adjacent to the receiving node. Meanwhile, all legal communication nodes which do not perform signal transmission in a communication scene can be used as cooperative interference nodes to send interference signals.
The expression of the probability of the single-hop safe connection on the transmission path is as follows:
wherein, mueRepresenting eavesdropper density, Γ (x) representing gamma function, α representing path loss exponent, di,i+1Indicates the transmission distance, sigma, from the ith transmitting node to the (i + 1) th legitimate receiving node2Representing the noise, which follows a Gaussian distribution with a mean of 0 units of variance, δ being the self-interference suppression coefficient, PsRepresenting self-interference power, PjRepresenting the interference power of the jth co-operating interfering node, dj,i+1And the transmission distance from the jth cooperative interference node to the (i + 1) th legal receiving node is represented.
In the prior art, the safety performance of a multi-node wireless communication scene is not optimized and analyzed, and the safety performance of the whole transmission path is improved by maximizing the safety connection probability corresponding to each hop transmission on the path. Therefore, a single-hop safe connection probability optimization model can be established:
wherein, PiRepresents the ith transmitting node transmitting power, | hi,i+1|2Representing the channel gain coefficients from the i-th transmitting node to the i + 1-th legitimate receiving node, subject to an exponential distribution with a mean value of 1, gamma0Indicating the lowest demodulation SNR threshold of a legal receiving node, i.e. each hop of the transmitting and receiving node needs to meet the correct demodulation requirement, Pj_maxRepresenting the cooperative interference power peak assuming the self-interference power is the same as the transmission power to the next receiving node.
The optimization model represents that the single-hop safe connection probability is maximized under the condition that the receiving node is correctly demodulated and the cooperative interference power does not exceed the peak limit, and is equivalent to solving the optimal cooperative interference power distribution, so that the safety performance of a communication scene is optimal. Since the objective function is not convex with respect to the cooperative interference power, the conventional convex optimization method is difficult to solve, and generally, a heuristic algorithm can be used to solve the suboptimal solution of the objective function. The particle swarm optimization method provided by the embodiment can effectively solve the non-convex optimization problem, and can rapidly approach the optimal solution through several iterations. The particle swarm algorithm principle is as follows:
assuming N random particles (each particle representing a set of optimization model candidate solutions, i.e., one cooperative interference power combination), the particle positions (positions equivalent to the initial values) are all randomly generated. The particles continuously iterate according to the empirical direction to find an optimal solution, and the searching direction of each iteration particle is determined by two elements, namely the current global optimal particle position and the historical optimal position of the particle. The principle expression is as follows:
wherein the content of the first and second substances,
represents the search direction of the ith particle in the (t + 1) th iteration, w represents an inertia factor, the larger w is, the stronger global optimization capability is, the smaller w is, the stronger local optimization capability is,
representing the search direction of the ith particle at the t-th iteration, c1、c2Respectively, an acceleration constant, random (0,1) a random number between 0 and 1,
indicating the optimal position of the ith particle itself in t iterations,
represents the position of the ith particle after the t-th iteration, pgtRepresenting the global optimal particle position in t iterations,
the position of the ith particle after the t +1 th iteration is shown.
In an actual communication scene, the sending power of the cooperative interference node may only be selected by a plurality of fixed values instead of continuous arbitrary values, and for discrete cooperative interference power optimization, an exhaustive search method may be adopted to obtain an approximately optimal solution. The exhaustive search method is an optimization algorithm with high time complexity, and the complexity is O (n)2) However, the exhaustive search method can always find the optimal solution for the discrete problem, and the optimal solution can be quickly searched when the method is applied to the scene.
When a legal communication node transmits a signal, an eavesdropper in the vicinity of the transmitting node can more easily obtain a higher signal-to-noise ratio than a legal receiving node, thereby successfully eavesdropping the signal. Thus, the least secure transmission area within the scene is the area near the sending node. The embodiment proposes that a cooperative interference node is arranged at the rear side of a sending node, the position has minimum interference on a signal received by a legal user, and the interference on the periphery of the sending node can be effectively carried out under the condition that the correct demodulation of a receiving node is not influenced; if a cooperative interference node exists at the rear side of a sending node in a communication scene, the cooperative interference node is selected as a specific cooperative interference node, the node sends a cooperative interference signal to protect a least safe transmission area, and the sending power is optimized together with the cooperative interference node needing to be optimized. By the protection method, an eavesdropper in a least safe transmission area in a communication scene can be effectively interfered, and a legal receiving node is influenced as little as possible. On the basis, the safety performance of the communication scene can be further improved.
For any cooperative interference node after power optimization, if the cooperative interference power of the cooperative interference node is smaller than the mean value of all the cooperative interference powers by one order of magnitude or more, the cooperative interference node is regarded as unimportant and can be removed in a cooperative node set without sending a cooperative interference signal. The node may participate in other scene communications or signal transmissions on different frequencies.
Example two
A transmission method for protecting information security through cooperation in a wireless network, as shown in fig. 1, a multi-node wireless communication scenario includes a legal communication node, a cooperative interference node, and an eavesdropper, as shown in fig. 2, the transmission method for protecting information security through cooperation includes the following steps:
t101, a legal communication node sends a measurement reference signal to acquire transmission distance and channel state information;
t102, determining a source node and a destination node, taking the power of the transmission distance alpha between legal communication nodes as a weight, and selecting a transmission path by utilizing a Dijkstra algorithm; determining a threshold of a correct demodulation signal-to-noise ratio of a legal communication node on a transmission path;
t103, establishing a single-hop safe connection probability optimization model according to the information determined in the steps T101 and T102, if the cooperative interference nodes have the capacity of selecting continuous power values to send signals, determining particle swarm optimization parameters, and determining the optimal distribution of cooperative interference power by using a particle swarm algorithm on the optimization model; and if the cooperative interference node has the capacity of selecting the discrete power value to send the signal, determining the optimal cooperative interference power distribution by using an exhaustive search method for the optimization model. The expression of the optimization model is as follows:
and T104, if the rear side of the sending node is not protected by the cooperative interference node, setting a specific cooperative interference node on the rear side of the sending node, and solving the optimal cooperative interference power distribution by the node and other cooperative interference nodes through the optimization algorithm in the step T103. If the rear side has the cooperative interference node protection, the step can be skipped;
t105, as shown in fig. 3, for any optimized cooperative interference node, if the cooperative interference power of the cooperative interference node is smaller than the average value of all the cooperative interference powers by an order of magnitude or more, the cooperative interference node is removed, no cooperative interference signal is sent, and other nodes operate normally.
The method flow of the present application is now complete. According to the specific implementation of the application, the method and the device can improve the safety performance and the transmission efficiency of a multi-node wireless communication scene, eliminate the cooperative interference nodes which do not need to send interference signals, and have the advantages of simple algorithm implementation and high operation speed.
The above embodiments are preferred embodiments of the present invention, but the present invention is not limited to the above embodiments, and any other changes, modifications, substitutions, combinations, and simplifications which do not depart from the spirit and principle of the present invention should be construed as equivalents thereof, and all such changes, modifications, substitutions, combinations, and simplifications are intended to be included in the scope of the present invention.
Claims (3)
1. A transmission method for protecting information security through cooperation in a wireless network is applied to a multi-node wireless communication scene, the multi-node wireless communication scene comprises legal communication nodes, cooperative interference nodes and eavesdroppers, the eavesdroppers are randomly distributed in the communication scene and passively eavesdrop legal signals, and the transmission method is characterized by comprising the following steps:
s1, acquiring transmission distance and channel state information between legal communication nodes;
s2, determining a source node and a destination node, taking the power of the transmission distance alpha between legal communication nodes as a weight, wherein alpha represents a path loss index, selecting the shortest transmission path according to a Dijkstra algorithm, and determining the correct demodulation signal-to-noise ratio threshold of the legal communication nodes on the transmission path;
s3, establishing a single-hop safe connection probability optimization model according to the information determined in the steps S1 and S2, and solving the optimal distribution of the cooperative interference power for each hop transmission on the transmission path by using an optimization algorithm;
s4, protecting the least safe transmission area by utilizing a specific cooperative interference node around a legal communication node transmitted by each hop on a transmission path, wherein when the legal communication node sends a signal, the least safe transmission area in a communication scene is designated as the area near the legal communication node;
s5, if the cooperative interference power of the cooperative interference node optimized in the step S3 is smaller than the mean value of all the cooperative interference powers by an order of magnitude or more, the cooperative interference node does not need to send a cooperative interference signal, and the cooperative interference node is removed;
wherein, the step S3 is as follows:
s31, establishing a single-hop safe connection probability optimization model as follows:
the optimization model represents a safe connection probability optimization model of the ith legal communication node for sending information to the (i + 1) th legal receiving node, wherein mueRepresenting eavesdropper density, Γ (x) representing gamma function, α representing path loss exponent, di，i+1Indicates the transmission distance, sigma, from the ith legal communication node to the (i + 1) th legal receiving node2Representing noise subject to a mean of 0 units of varianceA distribution of S, delta being a self-interference suppression coefficient, PsRepresenting self-interference power, PjRepresenting the interference power of the jth co-operating interfering node, dj，i+1Represents the transmission distance, P, from the jth cooperative interference node to the (i + 1) th legal receiving nodeiRepresents the ith legal communication node transmission power, | hi，i+1|2Representing the channel gain coefficients of the ith legitimate communication node to the (i + 1) th legitimate receiving node, obeying an exponential distribution with a mean value of 1, gamma0Representing the lowest demodulation SNR threshold of a legal receiving node, wherein each hop of the transmission receiving node needs to meet the correct demodulation requirement, Pj_maxRepresenting a cooperative interference power peak;
s32, judging the capability of the cooperative interference node to send signals, if a legal communication node selects a continuous power value to send signals, executing a step S33, and if the legal communication node selects a discrete power value to send signals, executing a step S34;
s33, determining heuristic algorithm parameters, and determining the optimal distribution of the cooperative interference power by using a heuristic algorithm on the optimization model in the step S31;
and S34, determining the optimal cooperative interference power distribution for the optimization model in the step S31 by using an exhaustive search method.
2. The method for securing information by collaboration as recited in claim 1, wherein said step S4 is performed by:
s41, if the rear side of the legal communication node has no cooperative interference node protection, a specific cooperative interference node is arranged on the rear side of the legal communication node, and the specific cooperative interference node and other cooperative interference nodes solve the optimal cooperative interference power distribution through the optimization algorithm in the step S3;
and S42, if the rear side of the legal communication node has the protection of the cooperative interference node, turning to the next step S5.
3. The method for transmitting information security through cooperation protection in a wireless network according to claim 1, wherein in step S33, the parameters of the particle swarm algorithm are determined, and the optimal allocation of the cooperative interference power is determined by using the particle swarm algorithm for the optimization model in step S31.
Priority Applications (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN202010150704.2A CN111447611B (en) | 2020-03-06 | 2020-03-06 | Transmission method for protecting information security through cooperation in wireless network |
Applications Claiming Priority (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN202010150704.2A CN111447611B (en) | 2020-03-06 | 2020-03-06 | Transmission method for protecting information security through cooperation in wireless network |
Publications (2)
| Publication Number | Publication Date |
|---|---|
| CN111447611A CN111447611A (en) | 2020-07-24 |
| CN111447611B true CN111447611B (en) | 2021-08-10 |
Family
ID=71648698
Family Applications (1)
| Application Number | Title | Priority Date | Filing Date |
|---|---|---|---|
| CN202010150704.2A Active CN111447611B (en) | 2020-03-06 | 2020-03-06 | Transmission method for protecting information security through cooperation in wireless network |
Country Status (1)
| Country | Link |
|---|---|
| CN (1) | CN111447611B (en) |
Families Citing this family (1)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN112822662B (en) * | 2020-11-24 | 2022-05-20 | 西安交通大学 | D2D cache user safety cooperation method and system based on joint content transmission and interference blocking |
Citations (3)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| WO2010012108A1 (en) * | 2008-07-31 | 2010-02-04 | Pin-Han Ho | System and method for cooperative coded data multicast |
| US8098609B2 (en) * | 2008-02-12 | 2012-01-17 | Nec Laboratories America, Inc. | Integrated scheduling of unicast and multicast traffic in relay-enabled wireless networks |
| CN108990011A (en) * | 2018-07-16 | 2018-12-11 | 南京理工大学 | The safe Enhancement Method of radio physical layer based on cooperation interference in public transport |
Family Cites Families (1)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN101883415B (en) * | 2009-05-05 | 2013-06-05 | 电信科学技术研究院 | Configuration method of sending power of sounding reference signals (SRS), network side equipment and user equipment (UE) |
-
2020
- 2020-03-06 CN CN202010150704.2A patent/CN111447611B/en active Active
Patent Citations (3)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| US8098609B2 (en) * | 2008-02-12 | 2012-01-17 | Nec Laboratories America, Inc. | Integrated scheduling of unicast and multicast traffic in relay-enabled wireless networks |
| WO2010012108A1 (en) * | 2008-07-31 | 2010-02-04 | Pin-Han Ho | System and method for cooperative coded data multicast |
| CN108990011A (en) * | 2018-07-16 | 2018-12-11 | 南京理工大学 | The safe Enhancement Method of radio physical layer based on cooperation interference in public transport |
Non-Patent Citations (1)
| Title |
|---|
| 结合全双工与协作干扰的无线网状网物理层安全策略;廖晓敏 等;《电讯技术》;20180731;第58卷(第7期);第753-759页 * |
Also Published As
| Publication number | Publication date |
|---|---|
| CN111447611A (en) | 2020-07-24 |
Similar Documents
| Publication | Publication Date | Title |
|---|---|---|
| Shu et al. | On physical layer security for cognitive radio networks | |
| Zou et al. | Physical-layer security with multiuser scheduling in cognitive radio networks | |
| Gao et al. | Covert communication in relay-assisted IoT systems | |
| Zhang et al. | United against the enemy: Anti-jamming based on cross-layer cooperation in wireless networks | |
| Li et al. | MD-GAN-based UAV trajectory and power optimization for cognitive covert communications | |
| Wang et al. | Anti-jamming communication in cognitive radio networks with unknown channel statistics | |
| Yuan et al. | Routing-toward-primary-user attack and belief propagation-based defense in cognitive radio networks | |
| Osorio et al. | Safeguarding MTC at the physical layer: Potentials and challenges | |
| Lopez et al. | Towards secure wireless mesh networks for UAV swarm connectivity: Current threats, research, and opportunities | |
| Win et al. | Cognitive network secrecy with interference engineering | |
| Sun et al. | Covertness and secrecy study in untrusted relay-assisted D2D networks | |
| Budhiraja et al. | Interference mitigation and secrecy ensured for NOMA-based D2D communications under imperfect CSI | |
| Zhang et al. | Taming cross-layer attacks in wireless networks: A Bayesian learning approach | |
| Liu et al. | Q-learning based UAV secure communication in presence of multiple UAV active eavesdroppers | |
| Xiao et al. | Reinforcement learning based network coding for drone-aided secure wireless communications | |
| CN111447611B (en) | Transmission method for protecting information security through cooperation in wireless network | |
| Zhang et al. | Cooperative anti-jamming for infrastructure-less wireless networks with stochastic relaying | |
| CN111132262A (en) | Optimal relay selection method and system in relay cooperation wireless network | |
| Afghah et al. | Cooperative spectrum sharing and trust management in iot networks | |
| He et al. | Resource allocation for secrecy rate optimization in UAV-assisted cognitive radio network | |
| Liu et al. | Physical layer authentication enhancement using maximum SNR ratio based cooperative AF relaying | |
| Mohapatra et al. | Secure communications for the two-user broadcast channel with random traffic | |
| Ratna et al. | Survey on jamming wireless networks: Attacks and prevention strategies | |
| Ji et al. | Securing wireless communications from the perspective of physical layer: A survey | |
| Bagali et al. | Maximize resource utilization based channel access model with presence of reactive jammer for underwater wireless sensor network |
Legal Events
| Date | Code | Title | Description |
|---|---|---|---|
| PB01 | Publication | ||
| PB01 | Publication | ||
| SE01 | Entry into force of request for substantive examination | ||
| SE01 | Entry into force of request for substantive examination | ||
| GR01 | Patent grant | ||
| GR01 | Patent grant |