CN106162646A - The motivational techniques of a kind of cooperation interference realizing safety of physical layer and device - Google Patents

The motivational techniques of a kind of cooperation interference realizing safety of physical layer and device Download PDF

Info

Publication number
CN106162646A
CN106162646A CN201610554434.5A CN201610554434A CN106162646A CN 106162646 A CN106162646 A CN 106162646A CN 201610554434 A CN201610554434 A CN 201610554434A CN 106162646 A CN106162646 A CN 106162646A
Authority
CN
China
Prior art keywords
node
cooperative
theta
data sending
channel
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.)
Pending
Application number
CN201610554434.5A
Other languages
Chinese (zh)
Inventor
王莉
满毅
宋梅
李蒙
Current Assignee (The listed assignees may be inaccurate. Google has not performed a legal analysis and makes no representation or warranty as to the accuracy of the list.)
Beijing University of Posts and Telecommunications
Original Assignee
Beijing University of Posts and Telecommunications
Priority date (The priority date 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 date listed.)
Filing date
Publication date
Application filed by Beijing University of Posts and Telecommunications filed Critical Beijing University of Posts and Telecommunications
Priority to CN201610554434.5A priority Critical patent/CN106162646A/en
Publication of CN106162646A publication Critical patent/CN106162646A/en
Pending legal-status Critical Current

Links

Classifications

    • HELECTRICITY
    • H04ELECTRIC COMMUNICATION TECHNIQUE
    • H04WWIRELESS COMMUNICATION NETWORKS
    • H04W28/00Network traffic management; Network resource management
    • H04W28/02Traffic management, e.g. flow control or congestion control
    • H04W28/0226Traffic management, e.g. flow control or congestion control based on location or mobility
    • HELECTRICITY
    • H04ELECTRIC COMMUNICATION TECHNIQUE
    • H04WWIRELESS COMMUNICATION NETWORKS
    • H04W12/00Security arrangements; Authentication; Protecting privacy or anonymity
    • H04W12/08Access security
    • HELECTRICITY
    • H04ELECTRIC COMMUNICATION TECHNIQUE
    • H04WWIRELESS COMMUNICATION NETWORKS
    • H04W72/00Local resource management
    • H04W72/04Wireless resource allocation
    • H04W72/044Wireless resource allocation based on the type of the allocated resource
    • H04W72/0473Wireless resource allocation based on the type of the allocated resource the resource being transmission power
    • HELECTRICITY
    • H04ELECTRIC COMMUNICATION TECHNIQUE
    • H04WWIRELESS COMMUNICATION NETWORKS
    • H04W72/00Local resource management
    • H04W72/12Wireless traffic scheduling
    • H04W72/1215Wireless traffic scheduling for collaboration of different radio technologies
    • HELECTRICITY
    • H04ELECTRIC COMMUNICATION TECHNIQUE
    • H04WWIRELESS COMMUNICATION NETWORKS
    • H04W72/00Local resource management
    • H04W72/30Resource management for broadcast services
    • HELECTRICITY
    • H04ELECTRIC COMMUNICATION TECHNIQUE
    • H04WWIRELESS COMMUNICATION NETWORKS
    • H04W72/00Local resource management
    • H04W72/50Allocation or scheduling criteria for wireless resources
    • H04W72/54Allocation or scheduling criteria for wireless resources based on quality criteria
    • HELECTRICITY
    • H04ELECTRIC COMMUNICATION TECHNIQUE
    • H04WWIRELESS COMMUNICATION NETWORKS
    • H04W72/00Local resource management
    • H04W72/50Allocation or scheduling criteria for wireless resources
    • H04W72/54Allocation or scheduling criteria for wireless resources based on quality criteria
    • H04W72/541Allocation or scheduling criteria for wireless resources based on quality criteria using the level of interference

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 embodiment of the invention discloses motivational techniques and the device of a kind of cooperation interference realizing safety of physical layer, including: obtain destination node and the positional information of eavesdropping node and data transmitting node to destination node and to the channel power gain eavesdropping node;Selecting the alternate location of cooperative node, alternate location need to meet the cooperative node improvement effect to the safe capacity of described data transmitting node, to realize secure communication;And alternate location is carried out grade classification;For corresponding position grade, according to the grade that own service demand, positional information, benefit function and position are corresponding, utilize contract theory method, determine when described cooperative node is in described position correspondence grade getable service recompense and the cooperation jamming power provided is provided;Obtained result is broadcasted, selects for cooperative node.The application embodiment of the present invention can solve sending node in the case of cannot obtaining cooperative node more specific location information, provides effective incentives strategy.

Description

Method and device for exciting cooperative interference for realizing physical layer security
Technical Field
The present invention relates to the field of mobile communications technologies, and in particular, to a method and an apparatus for implementing cooperative interference for physical layer security.
Background
With the development of wireless communication technology, higher requirements are made on security and guarantee of information communication, and in particular, in recent years, cooperative relay communication has been proposed and widely used in order to achieve wider network coverage and faster data transmission rate. Due to the introduction of the cooperative nodes, the network structure has stronger openness and more complex structure, and the communication security faces greater threats and challenges.
In the current relay network, nodes in the network are passive nodes with limited energy and selfishness, so that the nodes are not willing to actively cooperate with other nodes to perform physical layer secure communication for optimal utilization of respective energy sources, and based on the fact, the system performance when multiple users share a single cooperative node is analyzed by utilizing a game theory in literature. Another scholars proposes that a starkeberg game is utilized to stimulate a plurality of cooperative nodes to simultaneously provide a safe cooperative service for the same source node, and a double-layer game strategy is adopted to maximize the self utility of each node including the source node. In general, a node receiving the cooperation service is referred to as a data transmission node, and a node receiving a service request from the data transmission node is referred to as a target node. In the prior art, a situation that one or more cooperative nodes serve one legal data sending node is proposed, which is based on that a user knows specific location information of the cooperative node, but no specific solution is given for a scene in which the location information of the cooperative node is uncertain.
In an actual communication situation, no matter the node is eavesdropped or the cooperative node, the geographic position of the node is not updated in real time due to privacy of the node and energy limitation of the node, so that a user cannot obtain specific position information of the cooperative node or the eavesdropping node in real time, and information asymmetry of the cooperative node and the data sending node is caused. Especially, the location of the cooperative node has an extremely important influence on the realization of the cooperative interference service, but the existing cooperative interference incentive does not take this into account.
Disclosure of Invention
The embodiment of the invention aims to provide an incentive method and an incentive device for realizing the cooperative interference of physical layer security, so as to provide an effective incentive strategy under the condition that a sending node cannot obtain the specific position information of a cooperative node, meet the requirement of security capacity among legal communication users and ensure that the cooperative node can obtain the maximum benefit at different positions.
In order to achieve the above object, an embodiment of the present invention discloses an excitation method for realizing physical layer secure cooperative interference, which is applied to a data transmission node, and the method includes:
obtaining position information of a target node and an eavesdropping node, a first channel power gain from the data sending node to the target node, and a second channel power gain from the data sending node to the eavesdropping node;
obtaining M positions where the cooperative node can be located;
for each position in the M positions, judging whether the cooperative node can realize safe communication when in the position according to the first channel power gain, the second channel power gain, a third channel power gain from the cooperative node in the position to the target node, a fourth channel power gain from the cooperative node in the position to the eavesdropping node and the improvement effect of the cooperative node in the position on the safety capacity of the data sending node;
if so, determining the position as an alternative position of the cooperative node;
grading the determined alternative positions according to the power gain of the fourth channel;
aiming at the grade corresponding to each position, determining the service remuneration obtained when the cooperative node is in the grade and the cooperative interference power required to be provided by utilizing a contractual theory method according to the self service requirement, the position information, the benefit function and the grade corresponding to the position;
broadcasting the determined service reward corresponding to each level and the cooperative interference power required to be provided, so that the cooperative node receiving the service reward corresponding to each level and the cooperative interference power required to be provided sends an interference signal with the cooperative interference power of the level corresponding to the position of the cooperative node.
Preferably, the determining, for each of the M locations, whether the cooperative node can implement secure communication when in the location according to the first channel power gain, the second channel power gain, a third channel power gain from the cooperative node in the location to the target node, a fourth channel power gain from the cooperative node in the location to the eavesdropping node, and an improvement effect of the cooperative node in a level corresponding to the location on the security capacity of the data sending node, includes:
assisting the data sending node to achieve a safe capacity increment C at the target node when the cooperative node is judged to be at the positions_iWhether it is greater than zero; if yes, the cooperative node is shown to be capable of realizing safe communication when being at the position; wherein,
C s _ i = ( C s d - C s e ) + | P i ≠ 0 - ( C s d - C s e ) + | P i = 0
Csdfor the channel capacity from the data sending node to the target node, the expression is:
C s d = log 2 ( 1 + P s h s d σ 2 + P i h i d )
Csefor the channel capacity from the data sending node to the eavesdropping node, the expression is as follows:
C s e = log 2 ( 1 + P s h s e σ 2 + P i h i e )
hsd、hse、hid、hiethe first channel power gain, the second channel power gain, the third channel power gain, the fourth channel power gain, P, respectivelysSignal transmission power, P, for the data transmitting node to the target nodeiA preset cooperative interference power, sigma, for the cooperative node to the outside2Is the gaussian white noise power in the channel.
Preferably, the benefit function is specifically expressed as:
R = Σ i = 1 N β i · ( ω · C s _ θ i - T θ i )
Cs_θithe specific expression of (A) is as follows:
C s _ θ i = ( C s d _ i - C s e _ i ) + | Q θ i ≠ 0 - ( C s d _ i - C s e _ i ) + | Q θ i = 0
Csd_ifor the channel capacity from the data sending node to the target node, the expression is:
C s d _ i = log 2 ( 1 + P s h s d σ 2 + Q θ i h i d )
Cse_ifor the channel capacity from the data sending node to the eavesdropping node, the expression is as follows:
C s e _ i = log 2 ( 1 + P s h s e σ 2 + Q θ i h i e )
wherein R is the benefit of the data sending node; θ i is the grade corresponding to the cooperative node at the ith candidate position, TθiRemuneration for services available to collaboration nodes at alternate locations of level θ i, QθiCooperative interference power externally provided for cooperative nodes with candidate positions of the level theta i, wherein N is the number of the candidate positions of the cooperative nodes, βiIs the probability that the cooperative node is at the ith candidate position, and for all the candidate positions of the cooperative node, the existenceω represents the gain per unit increase in safety capacity, Cs_θiAnd obtaining the safety capacity of the data sending node under the excitation of the cooperative node at the candidate position with the grade of theta i.
Preferably, the function of the benefit of the cooperative node is specifically expressed as:
U(θi)=Tθi-fθi·Qθi
where U (θ i) is the benefit of the cooperative node at the candidate position of the level θ i, QθiFor the cooperative interference power to the outside of the cooperative node at the alternative position with the grade of thetai, fθiA reduction in the benefit per unit power consumption for the cooperative node at the candidate position of the rank θ i.
In order to achieve the above object, an embodiment of the present invention further discloses an excitation apparatus for implementing cooperative interference of physical layer security, which is applied to a data transmission node, and the apparatus includes:
the first acquisition module is used for acquiring position information of a target node and an eavesdropping node, a first channel power gain from the data sending node to the target node and a second channel power gain from the data sending node to the eavesdropping node;
a second obtaining module, configured to obtain M positions where the cooperative node may be located;
a first judging module, configured to judge, for each of the M positions, whether secure communication can be achieved when the cooperative node is in the position according to the first channel power gain, the second channel power gain, a third channel power gain from the cooperative node in the position to the target node, a fourth channel power gain from the cooperative node in the position to the eavesdropping node, and an improvement effect of the cooperative node in the position on a security capacity of the data sending node;
a first determining module, configured to determine the location as an alternative location of the cooperative node when the first determining module determines that the location is the alternative location of the cooperative node;
a grade division module, configured to perform grade division on the determined candidate position according to the fourth channel power gain;
a second determining module, configured to determine, according to a level corresponding to each location, a service reward obtained when the cooperative node is in the level and a cooperative interference power that needs to be provided, by using a contractual theory method according to a self service requirement, the location information, a benefit function, and the level corresponding to the location;
and the broadcasting module is used for broadcasting the determined service remuneration corresponding to each grade and the cooperative interference power required to be provided so that the cooperative node receiving the service remuneration corresponding to each grade and the cooperative interference power required to be provided sends an interference signal by the cooperative interference power of the grade corresponding to the position of the cooperative node.
Preferably, the first judging module includes: a second judging module and a representing module,
the second judging module is configured to judge that the cooperative node is located at the position, and assist the data sending node to achieve a safe capacity increment C at the target nodes_iWhether it is greater than zero;
the representing module is configured to represent that secure communication can be achieved when the cooperative node is located at the position when the determination result of the first determining module is yes;
wherein,
C s _ i = ( C s d - C s e ) + | P i ≠ 0 - ( C s d - C s e ) + | P i = 0
Cdfor the channel capacity from the data sending node to the target node, the expression is:
C s d = log 2 ( 1 + P s h s d σ 2 + P i h i d )
Csefor the channel capacity from the data sending node to the eavesdropping node, the expression is as follows:
C s e = log 2 ( 1 + P s h s e σ 2 + P i h i e )
hsd、hse、hid、hiethe first channel power gain, the second channel power gain, the third channel power gain, the fourth channel power gain, P, respectivelysSignal transmission power, P, for the data transmitting node to the target nodeiA preset cooperative interference power, sigma, for the cooperative node to the outside2Is the gaussian white noise power in the channel.
Preferably, the benefit function is specifically expressed as:
R = Σ i = 1 N β i · ( ω · C s _ θ i - T θ i )
Cs_θithe specific expression of (A) is as follows:
C s _ θ i = ( C s d _ i - C s e _ i ) + | Q θ i ≠ 0 - ( C s d _ i - C s e _ i ) + | Q θ i = 0
Csd_ifor the channel capacity from the data sending node to the target node, the expression is:
C s d _ i = log 2 ( 1 + P s h s d σ 2 + Q θ i h i d )
Cse_ifor the channel capacity from the data sending node to the eavesdropping node, the expression is as follows:
C s e _ i = log 2 ( 1 + P s h s e σ 2 + Q θ i h i e )
wherein R is the data transmissionThe benefit of sending nodes; θ i is the grade corresponding to the cooperative node at the ith candidate position, TθiRemuneration for services available to collaboration nodes at alternate locations of level θ i, QθiCooperative interference power externally provided for cooperative nodes with candidate positions of the level theta i, wherein N is the number of the candidate positions of the cooperative nodes, βiIs the probability that the cooperative node is at the ith candidate position, and for all the candidate positions of the cooperative node, the existenceω represents the gain per unit increase in safety capacity, Cs_θiAnd obtaining the safety capacity of the data sending node under the excitation of the cooperative node at the candidate position with the grade of theta i.
Preferably, the function of the benefit of the cooperative node is specifically expressed as:
U(θi)=Tθi-fθi·Qθi
where U (θ i) is the benefit of the cooperative node at the candidate position of the level θ i, QθiFor the cooperative interference power to the outside of the cooperative node at the alternative position with the grade of thetai, fθiA reduction in the benefit per unit power consumption for the cooperative node at the candidate position of the rank θ i.
As can be seen from the foregoing technical solutions, the excitation method and apparatus for realizing cooperative interference of physical layer security provided in the embodiments of the present invention are applied to a data transmitting node, and obtain location information of a target node and an eavesdropping node, a first channel power gain from the data transmitting node to the target node, and a second channel power gain from the data transmitting node to the eavesdropping node; obtaining M positions where the cooperative node can be located; aiming at each position in M positions, judging whether the cooperative node can realize safe communication when in the position according to a first channel power gain, a second channel power gain, a third channel power gain from the cooperative node to a target node in the position, a fourth channel power gain from the cooperative node to an eavesdropping node in the position and the improvement effect of the cooperative node in the position on the safety capacity of a data sending node; if so, determining the position as an alternative position of the cooperative node; grading the determined alternative positions according to the power gain of a fourth channel; aiming at the grade corresponding to each position, determining the service remuneration obtained when the cooperative node is in the grade and the cooperative interference power required to be provided by utilizing a contractual theory method according to the self service requirement, the position information, the benefit function and the grade corresponding to the position; broadcasting the determined service reward corresponding to each level and the cooperative interference power required to be provided, so that the cooperative node receiving the service reward corresponding to each level and the cooperative interference power required to be provided sends an interference signal with the cooperative interference power of the level corresponding to the position of the cooperative node.
By applying the technical scheme provided by the embodiment of the invention, the problem that the sending node gives an effective incentive strategy under the condition that the specific position information of the cooperative node cannot be obtained is solved, and the cooperative node can obtain the maximum benefit at different positions while the requirement of the safety capacity among legal communication users is met.
Of course, it is not necessary for any method or device embodying the present invention to achieve all of the above-described advantages at the same time.
Drawings
In order to more clearly illustrate the embodiments of the present invention or the technical solutions in the prior art, the drawings used in the description of the embodiments or the prior art will be briefly described below, it is obvious that the drawings in the following description are only some embodiments of the present invention, and for those skilled in the art, other drawings can be obtained according to the drawings without creative efforts.
Fig. 1 is a schematic flowchart of a method for exciting cooperative interference for implementing physical layer security according to an embodiment of the present invention;
fig. 2 is a schematic structural diagram of an excitation device for implementing cooperative interference for physical layer security according to an embodiment of the present invention;
fig. 3 is a graph corresponding to cooperative interference power when the cooperative node is at different levels according to the embodiment of the present invention;
FIG. 4 is a graph of cooperative nodes at different hierarchical locations in accordance with an embodiment of the present invention;
fig. 5 is a graph corresponding to benefits obtained by the same cooperative node at different levels according to an embodiment of the present invention;
fig. 6 is a graph corresponding to benefits obtained by the data sending node under the cooperative excitation of the cooperative nodes at different hierarchical positions according to the embodiment of the present invention;
fig. 7 is a graph of cooperative node benefits obtained by cooperative nodes at different hierarchical locations according to an embodiment of the present invention, corresponding to different levels of service remuneration and cooperative interference power.
Detailed Description
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 only a part of the embodiments of the present invention, and not all of the embodiments. 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.
To solve the problems in the prior art, embodiments of the present invention provide a method and an apparatus for implementing cooperative interference for physical layer security, which are applicable to a data transmitting node and are described in detail below.
It should be noted that, in the embodiment of the present invention, an excitation mechanism for maximizing the benefit of the data sending node is designed by using a signal discrimination model according to the asymmetric information characteristic between the cooperative node and the data sending node.
The technical personnel in the field can understand that a data sending node, a target node, an eavesdropping node and a cooperative node correspond to a communication model, the data sending node can be understood as a user needing to communicate, the target node is understood as a base station, the eavesdropping node is an eavesdropper, and the cooperative node is used as a mobile relay; the cooperative nodes assist the data transmitting nodes to improve spectrum resources and provide interference power to reduce the signal-to-noise ratio of the eavesdropping node. The embodiment of the invention focuses on improving the frequency spectrum resources of the data transmitting node through the cooperative node and improving the communication quality of the data transmitting node and the target node.
Fig. 1 is a flowchart of a method for exciting cooperative interference for implementing physical layer security according to an embodiment of the present invention, including the following steps:
s101, obtaining position information of a target node and an eavesdropping node, a first channel power gain from the data sending node to the target node, and a second channel power gain from the data sending node to the eavesdropping node.
It should be noted that, in the case that the data sending node needs to obtain the assisting stimulus, the data sending node first obtains the location information of the target node and the eavesdropping node. Those skilled in the art can understand that the channel power gains from the data sending node to the target node and from the data sending node to the eavesdropping node are related to the corresponding link distances, so that the channel power gains of the respective links can be obtained under the condition of obtaining the location information, and the obtaining of the channel power gains of the links is the prior art, and is not described herein again in the embodiments of the present invention.
S102, M positions where the cooperative nodes are possibly located are obtained.
In practical application, under the condition that the data sending node does not know the specific position of the cooperative node, the positions where the M cooperative nodes may be located are selected, and because the M positions are relatively random, the possible positions cannot meet the effect of the cooperative node on improving the safety capacity of the data sending node, that is, cannot meet the requirement of the data sending node on safety communication, and still need further selection processing.
S103, aiming at each position in the M positions, judging whether the cooperative node can realize safe communication when in the position according to the first channel power gain, the second channel power gain, the third channel power gain from the cooperative node in the position to the target node, the fourth channel power gain from the cooperative node in the position to the eavesdropping node and the improvement effect of the cooperative node in the position on the safety capacity of the data sending node.
Specifically, the method comprises the following steps:
assisting the data sending node to achieve a safe capacity increment C at the target node when the cooperative node is judged to be at the positions_iWhether it is greater than zero;
if so, the cooperative node is represented to be capable of realizing safe communication when being at the position.
Wherein,
C s _ i = ( C s d - C s e ) + | P i ≠ 0 - ( C s d - C s e ) + | P i = 0
Csdfor the channel capacity from the data sending node to the target node, the expression is:
C s d = log 2 ( 1 + P s h s d σ 2 + P i h i d )
Cseis that it isThe channel capacity from the data sending node to the eavesdropping node is expressed as follows:
C s e = log 2 ( 1 + P s h s e σ 2 + P i h i e )
hsd、hse、hid、hiethe first channel power gain, the second channel power gain, the third channel power gain, the fourth channel power gain, P, respectivelysSignal transmission power, P, for the data transmitting node to the target nodeiA preset cooperative interference power, sigma, for the cooperative node to the outside2Is the gaussian white noise power in the channel.
It should be noted that the formula shown in the embodiment of the present invention includes "()+"is, meaning: the value in parentheses was compared with 0, and the largest was selected as ()+Value of (c) ()+The value of (d) is non-negative. With (C)sd-Cse)+For example, at Csd-CseWhen (C) is less than 0sd-Cse)+0; at Csd-CseWhen (C) is greater than 0sd-Cse)+=Csd-Cse
As will be understood by those skilled in the art, in the above M possible positions, there is a position where the data sending node can achieve secure communication, provided that when the cooperative node is at the position, the improvement effect of the security capacity from the cooperative node to the data sending node is satisfied, which is greater than 0, that is, the security capacity increment of the data sending node itself is greater than 0.
The specific implementation mode is as follows: and determining one position, namely fixing the position information of the cooperative node, so that the link distances from the cooperative node to the target node and from the cooperative node to the eavesdropping node can be obtained, and the channel power gains of the two links can be obtained. From a formula corresponding to the effect of improving the security capacity of the data transmitting node, when hsd、hse、hid、hieDetermining the signal transmitting power P from the data transmitting node to the target nodesGaussian white noise power sigma in channel for known information of data transmitting node2With statistical properties, there is a specific calculation formula in the communication system, and the improvement effect is also combined with the cooperative interference power P of the cooperative nodeiCorrelation, here with PiAnd calculating as a preset cooperative interference power to obtain a calculation result. Here, as long as P is usediGreater than 0. Illustratively, PiThe setting is 10dBm, and the embodiment of the present invention is not particularly limited.
S104, determining the position as an alternative position of the cooperative node.
Illustratively, there is one location among the M possible locations, 500M from the target node and 300M from the eavesdropping node, where the channel power gain, i.e., each value in the channel power gain matrix, is obtained at PiSet to 10dBm, power σ of Gaussian white noise2At-180 dBm, an improvement in safety capacity is obtainedIf the good effect is larger than 0, the point can be used as the alternative position of the cooperative node. And sequentially selecting and confirming the positions until the number N meeting the setting is selected.
And S105, carrying out grade division on the determined alternative positions according to the fourth channel power gain.
It should be noted that the fourth channel power gain is from the cooperative node to the eavesdropping node, and for each of the N alternative positions, a corresponding channel power gain h can be obtainedieN h can be obtainedieThe value is obtained. With the N number of hieThe value represents the size of the rank, the rank corresponding to the candidate position is represented by θ i, and the rank division is performed, normally, N hieThe values correspond to N levels, assuming N is 20, i.e. there are 20 levels.
It will be understood by those skilled in the art that the closer to the eavesdropping node, the higher the ranking, and vice versa, the same distance from the target node.
And S106, aiming at the grade corresponding to each position, determining the service remuneration obtained when the cooperative node is in the grade and the cooperative interference power required to be provided by utilizing a contractual theory method according to the self service requirement, the position information, the benefit function and the grade corresponding to the position.
It should be noted that, the data sending node sends a pair of cooperative interference powers Q according to its own service requirementθiAnd corresponding service reward TθiAs a set, the initialization is to obtain the corresponding number of cooperative interference powers Q according to the value of NθiAnd corresponding service reward TθiThe zeroing is performed, and the magnitude of these values is determined, which is the setting performed during initialization, and is not described in detail for the prior art.
Those skilled in the art can understand that, when the data sending node cannot obtain the specific position of the cooperative node, the probability distribution information of the cooperative node may be obtained according to the previous statistical data analysis of the data sending node, or the probability distribution of the cooperative node may be set according to actual needs, which is not specifically limited herein. For all possible position distributions, with a probability sum of 1, the cooperative node is assumed to be in the set N positions. It is assumed that, when the locations of the cooperative nodes are subject to uniform distribution, the probability information of each location is 1/N.
Specifically, the benefit function is specifically expressed as:
R = Σ i = 1 N β i · ( ω · C s _ θ i - T θ i )
Cs_θithe specific expression of (A) is as follows:
C s _ θ i = ( C s d _ i - C s e _ i ) + | Q θ i ≠ 0 - ( C s d _ i - C s e _ i ) + | Q θ i = 0
Csd_ifor the channel capacity from the data sending node to the target node, the expression is:
C s d _ i = log 2 ( 1 + P s h s d σ 2 + Q θ i h i d )
Cse_ifor the channel capacity from the data sending node to the eavesdropping node, the expression is as follows:
C s e _ i = log 2 ( 1 + P s h s e σ 2 + Q θ i h i e )
wherein R is the benefit of the data sending node; θ i is the grade corresponding to the cooperative node at the ith candidate position, TθiCo-ordinating for alternative positions of order thetaiRemuneration of services available to the node, QθiCooperative interference power externally provided for cooperative nodes with candidate positions of the level theta i, wherein N is the number of the candidate positions of the cooperative nodes, βiIs the probability that the cooperative node is at the ith candidate position, and for all the candidate positions of the cooperative node, the existenceω represents the gain per unit increase in safety capacity, Cs_θiAnd obtaining the safety capacity of the data sending node under the excitation of the cooperative node at the candidate position with the grade of theta i.
In practical application, the benefit of the data sending node is related to improvement of the security capacity of the data sending node by the cooperative node, specifically, related to the cooperative interference power of the cooperative node and the service reward corresponding to the cooperative node, where the service reward of the cooperative node is the payment of the data sending node for obtaining the corresponding cooperative interference power.
Specifically, the function of the benefit of the cooperative node is specifically expressed as:
U(θi)=Tθi-fθi·Qθi
where U (θ i) is the benefit of the cooperative node at the candidate position of the level θ i, QθiFor the cooperative interference power to the outside of the cooperative node at the alternative position with the grade of thetai, fθiA reduction in the benefit per unit power consumption for the cooperative node at the candidate position of the rank θ i.
In practical application, the benefit obtained by the cooperative node must not be a negative value, otherwise, the meaning of cooperation is lost, and the constraint condition that the benefit function U (θ i) of the cooperative node needs to comply with is as follows: the benefit is not less than 0, and according to the benefit function of the data sending node, the following results are obtained:
U(θi)=Tθi-fθi·Qθi≥0
for theAs for cooperative nodes, a cooperative node having any level θ i to satisfy should have a level (T) selected to meet itselfθi,Qθi) For a sufficient reason to select (T) corresponding to its own rankθi,Qθi) The benefit U (θ i) obtained is necessarily greater than that obtained by choosing other levels, called incentive compatibility, expressed as:
Tθi-fθi·Qθi≥Tθj-fθi·Qθj
for the level θ i of the cooperative node, it is assumed in this embodiment that all the candidate positions have different levels θ i, and for practical applications, if the same level still exists, the present solution may be used, the nodes with the same level may be merged, and then the probabilities of the nodes are added to obtain a new probability, which is not specifically limited in this solution. For the cooperative nodes with higher grade, the cooperative interference power Q required to be transmittedθiThe larger, the corresponding, the reward T receivedθiThe larger the reward relationship, the more expressed:
Qθ0≤Qθ1≤…Qθi-1≤Qθi≤…QθN
first, the higher the level θ i, the corresponding optimum (T)θi,Qθi) In (1), the cooperative interference power Q required to be provided by the cooperative nodeθiAnd service reward T it can obtainθiAssuming that there are two different levels θ i and θ j, i, j ∈ {1,2, 3.., N }, we can get by deforming the excitation-compatible formula:
Tθi-Tθj≥fθi·(Qθi-Qθj)
because f isθiIs constant positive when Tθi>TθjWhen is, Qθi>Qθj.
From the excitation-compatible conditions can be derived:
T θ i - f θ i · Q θ i ≥ T θ j - f θ i · Q θ j T θ j - f θ j · Q θ j ≥ T θ i - f θ j · Q θ i
adding these two inequalities can result in:
(fθi-fθj).(Qθi-Qθj)≥0
fθiis a monotone decreasing function of theta i, and if theta i is more than or equal to theta j, f is present by combining the obtained formulaθi≥fθjFurther, Q can be derivedθi≥Qθj. Similarly, the magnitude of the case when θ i ≦ θ j, so the following conclusions can be drawn:
for grade, θ i-1<At θ i, there is Tθ0≤Tθ1≤…Tθi-1≤Tθi≤…TθNAnd Qθ0≤Qθ1≤…Qθi-1≤Qθi≤…QθN
For the function R to obtain the optimal value, it needs to be solved into an equation, when θ i > 1, the benefit is not less than 0 and the excitation is compatible, so that:
Tθi-fθi·Qθi≥Tθ1-fθi·Qθ1≥Tθ1-fθi·Qθ1
namely:
Tθi-fθi·Qθi≥Tθ1-fθ1·Qθ1
when i belongs to {2, 3.,. N }, the condition is satisfied, and other grades can be obtained by the same method
Uθi≥Uθi-1
Consider three different adjacent levels, thetai-1, thetaiθ i +1, can be obtained according to the excitation-compatible conditions:
T &theta; i + 1 - f &theta; i + 1 &CenterDot; Q &theta; i + 1 &GreaterEqual; T &theta; i - f &theta; i + 1 &CenterDot; Q &theta; i T &theta; i - f &theta; i &CenterDot; Q &theta; i &GreaterEqual; T &theta; i - 1 - f &theta; i &CenterDot; Q &theta; i - 1 .
according to the condition of monotonicity, the method comprises the following steps,
Tθi-Tθi-1≥fθi·(Qθi-Qθi-1)≥fθi+1·(Qθi-Qθi-1)
and then by activating the compatible conditions can be obtained,
Tθi-fθi·Qθi≥Tθi-1-fθi·Qθi-1
Tθi-1-fθi-1·Qθi-1≥Tθi-fθi-1·Qθi
wherein, i, j belongs to {2, …, N }, i ≠ j, through the process, the excitation compatible condition with the original inequality number of N (N-1) can be reduced to 2 (N-1), wherein the excitation compatible condition is divided into N-1 inequalities. And transforming the two inequalities to obtain:
Tθi-1+fθi·(Qθi-Qθi-1)≤Tθi≤Tθi-1+fθi-1·(Qθi-Qθi-1)
the inequality shows that the data sending node pays T to the cooperative nodeθiSubject to the constraint of assuming Tθi-1,QθiAnd Qθi-1It is known that from an economic point of view, a data sending node must endeavour to reduce the payment paid to a cooperative node in order to maximize its own utility, and therefore here with respect to TθiThe constraint of (A) must be that the lower bound can be taken to maximize the utility of the data sending node, there is
Tθi-1+fθi·(Qθi-Qθi-1)=Tθi
It can be derived from the excitation-compatible condition that, for the level thetai, in order to maximize the benefit function of the data transmitting node,
Tθi-fθi·Qθi=0
can be obtained by the above simplification process at (T)θi,Qθi) The best data sending node is obtained with the greatest benefit, and the following results are obtained:
Tθi-fθi·Qθi=Tθi-1-fθi·Qθi-1
taking the benefit function of the data sending node as a Lagrangian function, wherein i is not equal to j in i, j ∈ {1, …, N }, and the benefit function of the data sending node is maximized in (T)θi,Qθi) The derivation is carried out under the limiting condition that the benefit of the data sending node is maximum when the optimal condition is obtained, and lambda isiFor lagrange multipliers, one can obtain:
L ( Q &theta; i , T &theta; i ) = &Sigma; i = 1 N &lsqb; &beta; i &CenterDot; ( &omega; &CenterDot; C s _ &theta; i - T &theta; i ) + &lambda; i &CenterDot; ( T &theta; i - f &theta; i &CenterDot; Q &theta; i - T &theta; i - 1 + f &theta; i &CenterDot; Q &theta; i - 1 ) &rsqb;
let L (Q)θi,Tθi) Respectively to lambdai、TθiAnd QθiTaking the derivative and let it be 0, the system of equations is obtained as follows:
&part; L &part; &lambda; i = T &theta; i - f &theta; i &CenterDot; Q &theta; i - T &theta; i - 1 + f &theta; i &CenterDot; Q &theta; i - 1 = 0
using the resulting system of equations, β are distributed at known levelsiIn the case of (2), λ can be obtainedNThen the second equation is used again to combine βiAnd λi+1The residual λ of i ∈ {2, 3.., N } is obtained by a recursive ideaiValue, so the order of solving is λN,λN-1,…,λ2,λ1The method is a solving process of an inverse order. After all values of Lagrange multiplier are found, all (T) is found by using formulaθi,Qθi) Medium optimal cooperative interference power QθiThe value of (c). Finally, the obtained Q is utilizedθiThe value of (A) is combined with a formula to obtain a payment TθiThe value of (c). To this end, all optima (T)θi,Qθi) It is completely solved.
Exemplarily, N-20, evenly distributed, i.e.The corresponding grades are also 20, and the transmitting power P of the data transmitting nodes20dBm, path loss index α of 3, noise power spectral density N0Is-180 dBm, has a spectral width of 10MHz, and can obtain corresponding noise power sigma according to the noise power spectral density and the spectral width2=N0B, gain per unit safety capacity ω 10-6The power-per-unit utility reduction function fθiIs 50/thetai 0.05
The simulation results of the cooperative nodes at different levels and the cooperative interference power are shown in fig. 3; the corresponding simulation results of the cooperative nodes at different levels and service rewards are shown in fig. 4; the corresponding simulation results of the benefits obtained when the same cooperative node is at different levels are shown in fig. 5; the corresponding simulation results of the benefits obtained by the data sending node under the cooperative excitation of the cooperative nodes at different levels are shown in fig. 6; the simulation results of the cooperative node benefits obtained by the cooperative nodes at different levels and the service remuneration and the cooperative interference power at different levels are shown in fig. 7.
S107, broadcasting the determined service remuneration corresponding to each grade and the cooperative interference power required to be provided, so that the cooperative node receiving the service remuneration corresponding to each grade and the cooperative interference power required to be provided sends an interference signal with the cooperative interference power of the grade corresponding to the position of the cooperative node.
And after calculating the service reward corresponding to each level of the alternative position of the cooperative node and the cooperative interference power required to be provided, the data sending node disperses the service reward and the cooperative interference power in a broadcasting mode, and after receiving the service reward and the cooperative interference power, the cooperative phase selects the service reward and the cooperative interference power which can enable the benefit of the data sending node to be optimal, and performs cooperative interference excitation.
By applying the embodiment shown in fig. 1 of the invention, the problem that the sending node gives an effective incentive strategy under the condition that the sending node cannot obtain the specific position information of the cooperative node can be solved, and the cooperative node can obtain the maximum benefit at different positions while the requirement of the safety capacity between legal communication users is met.
Fig. 2 is a schematic structural diagram of an excitation apparatus for implementing cooperative interference for physical layer security according to an embodiment of the present invention, which may include a first obtaining module 201, a second obtaining module 202, a first determining module 203, a first determining module 204, a ranking module 205, a second determining module 206, and a broadcasting module 207.
A first obtaining module 201, configured to obtain location information of a target node and a eavesdropping node, a first channel power gain from the data sending node to the target node, and a second channel power gain from the data sending node to the eavesdropping node;
a second obtaining module 202, configured to obtain M positions where the cooperative node may be located;
a first determining module 203, configured to determine, for each of the M positions, whether secure communication can be achieved when the cooperative node is in the position according to the first channel power gain, the second channel power gain, a third channel power gain from the cooperative node in the position to the target node, a fourth channel power gain from the cooperative node in the position to the eavesdropping node, and an improvement effect of the cooperative node in the position on the security capacity of the data sending node;
specifically, in practical applications, the first determining module 203 may include: a second judging module and a representing module (not marked in the figure);
the second judging module is configured to judge that the cooperative node is located at the position, and assist the data sending node to achieve a safe capacity increment C at the target nodes_iWhether it is greater than zero;
the representing module is configured to represent that secure communication can be achieved when the cooperative node is located at the position when the determination result of the first determining module is yes;
wherein,
C s _ i = ( C s d - C s e ) + | P i &NotEqual; 0 - ( C s d - C s e ) + | P i = 0
Csdfor the channel capacity from the data sending node to the target node, the expression is:
C s d = log 2 ( 1 + P s h s d &sigma; 2 + P i h i d )
Csefor the channel capacity from the data sending node to the eavesdropping node, the expression is as follows:
C s e = log 2 ( 1 + P s h s e &sigma; 2 + P i h i e )
hsd、hse、hid、hiethe first channel power gain, the second channel power gain, the third channel power gain, the fourth channel power gain, P, respectivelysSignal transmission power, P, for the data transmitting node to the target nodeiA preset cooperative interference power, sigma, for the cooperative node to the outside2Is the gaussian white noise power in the channel.
A first determining module 204, configured to determine the location as an alternative location of the cooperative node when the first determining module determines that the location is the alternative location of the cooperative node;
a ranking module 205, configured to rank the determined candidate locations according to the fourth channel power gain;
a second determining module 206, configured to determine, according to the level corresponding to each location, a service reward that can be obtained when the cooperative node is in the level and a cooperative interference power that needs to be provided, by using a contractual theory method according to the service requirement of the cooperative node, the location information, the benefit function, and the level corresponding to the location;
specifically, in practical application, the benefit function is specifically expressed as:
R = &Sigma; i = 1 N &beta; i &CenterDot; ( &omega; &CenterDot; C s _ &theta; i - T &theta; i )
Cs_θithe specific expression of (A) is as follows:
C s _ &theta; i = ( C s d _ i - C s e _ i ) + | Q &theta; i &NotEqual; 0 - ( C s d _ i - C s e _ i ) + | Q &theta; i = 0
Csd_ifor the channel capacity from the data sending node to the target node, the expression is:
C s d _ i = log 2 ( 1 + P s h s d &sigma; 2 + Q &theta; i h i d )
Cse_ifor the channel capacity from the data sending node to the eavesdropping node, the expression is as follows:
C s e _ i = log 2 ( 1 + P s h s e &sigma; 2 + Q &theta; i h i e )
wherein R is the benefit of the data sending node; θ i is cooperation at the ith candidate positionGrade, T, corresponding to a nodeθiRemuneration for services available to collaboration nodes at alternate locations of level θ i, QθiCooperative interference power externally provided for cooperative nodes with candidate positions of the level theta i, wherein N is the number of the candidate positions of the cooperative nodes, βiIs the probability that the cooperative node is at the ith candidate position, and for all the candidate positions of the cooperative node, the existenceω represents the gain per unit increase in safety capacity, Cs_θiAnd increasing the obtained safety capacity of the data sending node under the excitation of the cooperative node at the candidate position with the grade theta i.
Specifically, in practical application, the function of the benefit of the cooperative node is specifically expressed as:
U(θi)=Tθi-fθi·Qθi
where U (θ i) is the benefit of the cooperative node at the candidate position of the level θ i, QθiFor the cooperative interference power to the outside of the cooperative node at the alternative position with the grade of thetai, fθiA reduction in the benefit per unit power consumption for the cooperative node at the candidate position of the rank θ i.
The broadcasting module 207 is configured to broadcast the determined service reward corresponding to each level and the cooperative interference power that needs to be provided, so that the cooperative node that receives the service reward corresponding to each level and the cooperative interference power that needs to be provided sends an interference signal with the cooperative interference power of the level corresponding to its location.
By applying the embodiment shown in fig. 2 of the invention, the problem that the sending node gives an effective incentive strategy under the condition that the sending node cannot obtain the specific position information of the cooperative node can be solved, and the cooperative node can obtain the maximum benefit at different positions while the requirement of the safety capacity between legal communication users is met.
It is noted that, herein, relational terms such as first and second, and the like may be used solely to distinguish one entity or action from another entity or action without necessarily requiring or implying any actual such relationship or order between such entities or actions. Also, the terms "comprises," "comprising," or any other variation thereof, are intended to cover a non-exclusive inclusion, such that a process, method, article, or apparatus that comprises a list of elements does not include only those elements but may include other elements not expressly listed or inherent to such process, method, article, or apparatus. Without further limitation, an element defined by the phrase "comprising an … …" does not exclude the presence of other identical elements in a process, method, article, or apparatus that comprises the element.
All the embodiments in the present specification are described in a related manner, and the same and similar parts among the embodiments may be referred to each other, and each embodiment focuses on the differences from the other embodiments. In particular, as for the apparatus embodiment, since it is substantially similar to the method embodiment, the description is relatively simple, and for the relevant points, reference may be made to the partial description of the method embodiment.
Those skilled in the art will appreciate that all or part of the steps in the above method embodiments may be implemented by a program to instruct relevant hardware to perform the steps, and the program may be stored in a computer-readable storage medium, which is referred to herein as a storage medium, such as: ROM/RAM, magnetic disk, optical disk, etc.
The above description is only for the preferred embodiment of the present invention, and is not intended to limit the scope of the present invention. Any modification, equivalent replacement, or improvement made within the spirit and principle of the present invention shall fall within the protection scope of the present invention.

Claims (8)

1. A method for stimulating cooperative interference for realizing physical layer security is applied to a data transmitting node, and the method comprises the following steps:
obtaining position information of a target node and an eavesdropping node, a first channel power gain from the data sending node to the target node, and a second channel power gain from the data sending node to the eavesdropping node;
obtaining M positions where the cooperative node can be located;
for each position in the M positions, judging whether the cooperative node can realize safe communication when in the position according to the first channel power gain, the second channel power gain, a third channel power gain from the cooperative node in the position to the target node, a fourth channel power gain from the cooperative node in the position to the eavesdropping node and the improvement effect of the cooperative node in the position on the safety capacity of the data sending node;
if so, determining the position as an alternative position of the cooperative node;
grading the determined alternative positions according to the power gain of the fourth channel;
aiming at the grade corresponding to each position, determining the service remuneration obtained when the cooperative node is in the grade and the cooperative interference power required to be provided by utilizing a contractual theory method according to the self service requirement, the position information, the benefit function and the grade corresponding to the position;
broadcasting the determined service reward corresponding to each level and the cooperative interference power required to be provided, so that the cooperative node receiving the service reward corresponding to each level and the cooperative interference power required to be provided sends an interference signal with the cooperative interference power of the level corresponding to the position of the cooperative node.
2. The method according to claim 1, wherein said determining, for each of the M locations, whether the cooperative node can achieve secure communication when in the location according to the first channel power gain, the second channel power gain, the third channel power gain from the cooperative node in the location to the target node, the fourth channel power gain from the cooperative node in the location to the eavesdropping node, and the effect of the cooperative node in the level corresponding to the location on improving the security capacity of the data transmitting node, comprises:
assisting the data sending node to achieve a safe capacity increment C at the target node when the cooperative node is judged to be at the positions_iWhether it is greater than zero; if yes, the cooperative node is shown to be capable of realizing safe communication when being at the position; wherein,
C s _ i = ( C s d - C s e ) + | P i &NotEqual; 0 - ( C s d - C s e ) + | P i = 0
Csdfor the channel capacity from the data sending node to the target node, the expression is:
C s d = log 2 ( 1 + P s h s d &sigma; 2 + P i h i d )
Csefor the channel capacity from the data sending node to the eavesdropping node, the expression is as follows:
C s e = log 2 ( 1 + P s h s e &sigma; 2 + P i h i e )
hsd、hse、hid、hiethe first channel power gain, the second channel power gain, the third channel power gain and the fourth channel power gain are respectivelyRate gain, PsSignal transmission power, P, for the data transmitting node to the target nodeiA preset cooperative interference power, sigma, for the cooperative node to the outside2Is the gaussian white noise power in the channel.
3. The method of claim 2, wherein the benefit function is embodied as:
R = &Sigma; i = 1 N &beta; i &CenterDot; ( &omega; &CenterDot; C s _ &theta; i - T &theta; i )
Cs_θithe specific expression of (A) is as follows:
C s _ &theta; i = ( C s d _ i - C s e _ i ) + | Q &theta; i &NotEqual; 0 - ( C s d _ i - C s e _ i ) + | Q &theta; i = 0
Csd_ifor the channel capacity from the data sending node to the target node, the expression is:
C s d _ i = log 2 ( 1 + P s h s d &sigma; 2 + Q &theta; i h i d )
Cse_ifor the channel capacity from the data sending node to the eavesdropping node, the expression is as follows:
C s e _ i = log 2 ( 1 + P s h s e &sigma; 2 + Q &theta; i h i e )
wherein R is the benefit of the data sending node; θ i is the grade corresponding to the cooperative node at the ith candidate position, TθiRemuneration for services available to collaboration nodes at alternate locations of level θ i, QθiCooperative interference power externally provided for cooperative nodes with candidate positions of the level theta i, wherein N is the number of the candidate positions of the cooperative nodes, βiIs the probability that the cooperative node is at the ith alternative position, and is applied to all the cooperative nodesAlternative location, existenceω represents the gain per unit increase in safety capacity, Cs_θiAnd obtaining the safety capacity of the data sending node under the excitation of the cooperative node at the candidate position with the grade of theta i.
4. The method of claim 3, wherein the function of the benefit of the cooperative node is embodied as:
U(θi)=Tθi-fθi·Qθi
where U (θ i) is the benefit of the cooperative node at the candidate position of the level θ i, QθiFor the cooperative interference power to the outside of the cooperative node at the alternative position with the grade of thetai, fθiA reduction in the benefit per unit power consumption for the cooperative node at the candidate position of the rank θ i.
5. An apparatus for incentivizing cooperative interference for physical layer security, applied to a data transmitting node, the apparatus comprising:
the first acquisition module is used for acquiring position information of a target node and an eavesdropping node, a first channel power gain from the data sending node to the target node and a second channel power gain from the data sending node to the eavesdropping node;
a second obtaining module, configured to obtain M positions where the cooperative node may be located;
a first judging module, configured to judge, for each of the M positions, whether secure communication can be achieved when the cooperative node is in the position according to the first channel power gain, the second channel power gain, a third channel power gain from the cooperative node in the position to the target node, a fourth channel power gain from the cooperative node in the position to the eavesdropping node, and an improvement effect of the cooperative node in the position on a security capacity of the data sending node;
a first determining module, configured to determine the location as an alternative location of the cooperative node when the first determining module determines that the location is the alternative location of the cooperative node;
a grade division module, configured to perform grade division on the determined candidate position according to the fourth channel power gain;
a second determining module, configured to determine, according to a level corresponding to each location, a service reward obtained when the cooperative node is in the level and a cooperative interference power that needs to be provided, by using a contractual theory method according to a self service requirement, the location information, a benefit function, and the level corresponding to the location;
and the broadcasting module is used for broadcasting the determined service remuneration corresponding to each grade and the cooperative interference power required to be provided so that the cooperative node receiving the service remuneration corresponding to each grade and the cooperative interference power required to be provided sends an interference signal by the cooperative interference power of the grade corresponding to the position of the cooperative node.
6. The apparatus of claim 5, wherein the first determining module comprises: a second judging module and a representing module,
the second judging module is configured to judge that the cooperative node is located at the position, and assist the data sending node to achieve a safe capacity increment C at the target nodes_iWhether it is greater than zero;
the representing module is configured to represent that secure communication can be achieved when the cooperative node is located at the position when the determination result of the first determining module is yes;
wherein,
C s _ i = ( C s d - C s e ) + | P i &NotEqual; 0 - ( C s d - C s e ) + | P i = 0
Csdfor the channel capacity from the data sending node to the target node, the expression is:
C s d = log 2 ( 1 + P s h s d &sigma; 2 + P i h i d )
Csefor the channel capacity from the data sending node to the eavesdropping node, the expression is as follows:
C s e = log 2 ( 1 + P s h s e &sigma; 2 + P i h i e )
hsd、hse、hid、hiethe first channel power gain, the second channel power gain, the third channel power gain, the fourth channel power gain, P, respectivelysSignal transmission power, P, for the data transmitting node to the target nodeiA preset cooperative interference power, sigma, for the cooperative node to the outside2Is the gaussian white noise power in the channel.
7. The apparatus of claim 6, wherein the benefit function is embodied as:
R = &Sigma; i = 1 N &beta; i &CenterDot; ( &omega; &CenterDot; C s _ &theta; i - T &theta; i )
Cs_θithe specific expression of (A) is as follows:
C s _ &theta; i = ( C s d _ i - C s e _ i ) + | Q &theta; i &NotEqual; 0 - ( C s d _ i - C s e _ i ) + | Q &theta; i = 0
Csd_ifor the channel capacity from the data sending node to the target node, the expression is:
C s d _ i = log 2 ( 1 + P s h s d &sigma; 2 + Q &theta; i h i d )
Cse_ifor the channel capacity from the data sending node to the eavesdropping node, the expression is as follows:
C s e _ i = log 2 ( 1 + P s h s e &sigma; 2 + Q &theta; i h i e )
wherein R is the benefit of the data sending node; θ i is the grade corresponding to the cooperative node at the ith candidate position, TθiRemuneration for services available to collaboration nodes at alternate locations of level θ i, QθiCooperative interference power externally provided for cooperative nodes with candidate positions of the level theta i, wherein N is the number of the candidate positions of the cooperative nodes, βiIs the probability that the cooperative node is at the ith candidate position, and for all the candidate positions of the cooperative node, the existenceω represents the gain per unit increase in safety capacity, Cs_θiAnd obtaining the safety capacity of the data sending node under the excitation of the cooperative node at the candidate position with the grade of theta i.
8. The apparatus of claim 7, wherein the function of the benefit of the cooperative node is embodied as:
U(θi)=Tθi-fθi·Qθi
where U (θ i) is the benefit of the cooperative node at the candidate position of the level θ i, QθiFor the cooperative interference power to the outside of the cooperative node at the alternative position with the grade of thetai, fθiA reduction in the benefit per unit power consumption for the cooperative node at the candidate position of the rank θ i.
CN201610554434.5A 2016-07-14 2016-07-14 The motivational techniques of a kind of cooperation interference realizing safety of physical layer and device Pending CN106162646A (en)

Priority Applications (1)

Application Number Priority Date Filing Date Title
CN201610554434.5A CN106162646A (en) 2016-07-14 2016-07-14 The motivational techniques of a kind of cooperation interference realizing safety of physical layer and device

Applications Claiming Priority (1)

Application Number Priority Date Filing Date Title
CN201610554434.5A CN106162646A (en) 2016-07-14 2016-07-14 The motivational techniques of a kind of cooperation interference realizing safety of physical layer and device

Publications (1)

Publication Number Publication Date
CN106162646A true CN106162646A (en) 2016-11-23

Family

ID=58062763

Family Applications (1)

Application Number Title Priority Date Filing Date
CN201610554434.5A Pending CN106162646A (en) 2016-07-14 2016-07-14 The motivational techniques of a kind of cooperation interference realizing safety of physical layer and device

Country Status (1)

Country Link
CN (1) CN106162646A (en)

Cited By (3)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
CN107018527A (en) * 2017-04-21 2017-08-04 湖北工业大学 Multi-user Cooperation communication motivational techniques under a kind of double-point information asymmetrical network environment
CN110248306A (en) * 2018-03-08 2019-09-17 北京邮电大学 A kind of cooperative node of source node determines method, apparatus, electronic equipment and medium
CN110572826A (en) * 2019-07-10 2019-12-13 西安电子科技大学 Cooperative physical layer security implementation method based on interference node optimization layout

Citations (1)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
CN104918238A (en) * 2014-03-14 2015-09-16 北京邮电大学 Cooperation interference excitation method for realizing physical layer safety

Patent Citations (1)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
CN104918238A (en) * 2014-03-14 2015-09-16 北京邮电大学 Cooperation interference excitation method for realizing physical layer safety

Non-Patent Citations (2)

* Cited by examiner, † Cited by third party
Title
康凯: "协作通信系统中继节点选择策略研究", 《中国优秀硕士学位论文全文数据库》 *
陈国利: "基于激励的机会网络协作传输机制", 《中国优秀硕士学位论文全文数据库》 *

Cited By (6)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
CN107018527A (en) * 2017-04-21 2017-08-04 湖北工业大学 Multi-user Cooperation communication motivational techniques under a kind of double-point information asymmetrical network environment
CN107018527B (en) * 2017-04-21 2019-11-08 湖北工业大学 Multi-user Cooperation communicates motivational techniques under a kind of double-point information asymmetrical network environment
CN110248306A (en) * 2018-03-08 2019-09-17 北京邮电大学 A kind of cooperative node of source node determines method, apparatus, electronic equipment and medium
CN110248306B (en) * 2018-03-08 2020-05-08 北京邮电大学 Method and device for determining cooperative node of source node, electronic equipment and medium
CN110572826A (en) * 2019-07-10 2019-12-13 西安电子科技大学 Cooperative physical layer security implementation method based on interference node optimization layout
CN110572826B (en) * 2019-07-10 2021-05-18 西安电子科技大学 Cooperative physical layer security implementation method based on interference node optimization layout

Similar Documents

Publication Publication Date Title
Zhao et al. Dynamic contract incentive mechanism for cooperative wireless networks
Han et al. Matching theory for wireless networks
Zhang et al. Energy-spectral efficiency trade-off in underlaying mobile D2D communications: An economic efficiency perspective
Wang et al. Sociality‐aware resource allocation for device‐to‐device communications in cellular networks
Chen et al. Energy efficient relay selection and power allocation for cooperative cognitive radio networks
Chen et al. Optimal user‐centric relay assisted device‐to‐device communications: an auction approach
Li et al. A commercial video-caching system for small-cell cellular networks using game theory
CN106162646A (en) The motivational techniques of a kind of cooperation interference realizing safety of physical layer and device
Wang et al. Interference pricing in 5G ultra‐dense small cell networks: a Stackelberg game approach
Saad et al. Distributed coalition formation games for secure wireless transmission
Tahir et al. Novel distributed algorithm for coalition formation for enhanced spectrum sensing in cognitive radio networks
Noreen et al. Discount interference pricing mechanism for data offloading in D2D communications
Huo et al. A novel secure relay selection strategy for energy-harvesting-enabled Internet of things
Safwat et al. Strategic behaviour for spectrum access in hybrid overlay/underlay cognitive radio networks
Boabang et al. Network‐Assisted Distributed Fairness‐Aware Interference Coordination for Device‐to‐Device Communication Underlaid Cellular Networks
CN105916197B (en) The power adaptive method that social credibility drives in D2D network
Liu et al. Resource allocation strategy against selfishness in cognitive radio ad‐hoc network based on Stackelberg game
Paul et al. Throughput maximisation in cognitive radio networks with residual bandwidth
Lu et al. Improving physical layer security and efficiency in D2D underlay communication
He et al. Cooperative spectrum sharing based on contract theory with optimal bandwidth and power allocation
Hamouda et al. New coalition formation game for spectrum sharing in cognitive radio networks
Yang et al. Social aware joint link and power allocation for D2D communication underlaying cellular networks
Swamy et al. Multiconstraint-based quality of service-aware joint optimistic framework for non-orthogonal multiple access-based fog computing vehicular network
Zheng et al. Dynamic resource allocation based on service time prediction for device‐to‐device communication underlaying cellular networks
Yang et al. A robust stackelberg game based uplink power control for device-to-device communication with channel uncertainty and outage probability constraints

Legal Events

Date Code Title Description
C06 Publication
PB01 Publication
C10 Entry into substantive examination
SE01 Entry into force of request for substantive examination
RJ01 Rejection of invention patent application after publication
RJ01 Rejection of invention patent application after publication

Application publication date: 20161123