CN103475441A - Cooperative interference transmission method based on clusters in wireless multi-hop network - Google Patents

Cooperative interference transmission method based on clusters in wireless multi-hop network Download PDF

Info

Publication number
CN103475441A
CN103475441A CN2013103202087A CN201310320208A CN103475441A CN 103475441 A CN103475441 A CN 103475441A CN 2013103202087 A CN2013103202087 A CN 2013103202087A CN 201310320208 A CN201310320208 A CN 201310320208A CN 103475441 A CN103475441 A CN 103475441A
Authority
CN
China
Prior art keywords
bunch
interfering nodes
group
listener
transmit stage
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.)
Granted
Application number
CN2013103202087A
Other languages
Chinese (zh)
Other versions
CN103475441B (en
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 CN201310320208.7A priority Critical patent/CN103475441B/en
Publication of CN103475441A publication Critical patent/CN103475441A/en
Application granted granted Critical
Publication of CN103475441B publication Critical patent/CN103475441B/en
Active legal-status Critical Current
Anticipated expiration legal-status Critical

Links

Images

Abstract

The invention provides a cooperative interference transmission method based on clusters in a wireless multi-hop network. The method includes a first transmission period: a cluster head of a sending cluster in the wireless multi-hop network sending information to relay nodes selected in the sending cluster and a selected first group of interference nodes interfering an eavesdropper; and a second transmission period: the relay nodes sending the information to a cluster head of a receiving cluster in the wireless multi-hop network and a selected second group of interference nodes interfering the eavesdropper. Through adoption of the cooperative interference transmission method based on the clusters in the wireless multi-hop network, optimal relay nodes can be selected for information cooperation transmission and optimal interference nodes can be selected to interfere the eavesdropper so that a safety information rate is maximized in a transmission process under a specific sending power and safety performance of the whole network is improved.

Description

In wireless multi-hop network based on bunch cooperation disturb transmission method
Technical field
The present invention relates to wireless network communication technique, particularly in wireless multi-hop network based on bunch cooperation disturb transmission method.
Background technology
Wireless multi-hop network has become the focus of a research in wireless network communication technique at present, and along with the development of wireless multi-hop network, its range of application is also more and more wider.Nearest achievement in research shows, in wireless multi-hop network, utilizes via node to carry out the performance that cooperation transmission can effectively be improved communication quality, wireless multi-hop network is provided.Yet, utilize via node to carry out the safety problem that cooperation transmission may be brought communication, for example, in sending bunch bunch, receive bunch bunch in or bunch between node in may exist the listener-in to be eavesdropped the information of wireless multi-hop network transmission.
The scheme of existing assurance wireless multi-hop network communication security all combines with other technologies usually, for example, improve the fail safe of transfer of data by the encryption technology on upper strata, so often make whole scheme comparatively complicated, and, in prior art, rarely have scheme can solve in wireless multi-hop network and utilize relay node cooperation to transmit the safety problem of bringing, in particular, there is no in prior art for utilize cooperation transmission to disturb listener-in's scheme at wireless multi-hop network.
Summary of the invention
(1) technical problem that will solve
Technical problem to be solved by this invention be in wireless multi-hop network based on bunch cooperation transmission in information security issue.
(2) technical scheme
For this purpose, the present invention proposes in a kind of wireless multi-hop network based on bunch cooperation disturb transmission method, comprise: the first transmit stage: bunch bunch head of the transmission in described wireless multi-hop network by information be sent to send bunch bunch in selected via node, and by first group of selected interfering nodes, the listener-in is disturbed; The second transmit stage: described via node is sent to the reception bunch bunch head in described wireless multi-hop network by described information, and by second group of selected interfering nodes, described listener-in is disturbed.
In said method, described first group of interfering nodes comprises: in the transmission that listener-in in sending bunch bunch is disturbed bunch bunch interfering nodes and to bunch between the listener-in disturbed bunch between interfering nodes; Described second group of interfering nodes comprises: in interfering nodes in the transmission that listener-in in sending bunch bunch is disturbed bunch bunch, reception that listener-in in receiving bunch bunch is disturbed bunch bunch interfering nodes and to bunch between the listener-in disturbed bunch between interfering nodes.
Preferably, in described the second transmit stage, the mode that described via node adopts decoding to forward is sent to described reception bunch bunch head by described information, and the information rate of described via node is not less than the information rate of described reception bunch bunch head.
Preferably, described first group of interfering nodes and described second group of interfering nodes disturb and comprise described listener-in: described first group of interfering nodes and described second group of interfering nodes send default interference signal to described listener-in.
Preferably, described default interference signal is informed to described via node and described reception bunch bunch head are so that described via node and described reception bunch bunch head is eliminated the impact of described interference signal in described the first transmit stage and the second transmit stage before described the first transmit stage.
Preferably, described first group of interfering nodes and described second group of interfering nodes disturb and comprise described listener-in: make described first group of interfering nodes and described second group of interfering nodes orientation send interference signal to described listener-in.
Preferably, select the step of described via node, described first group of interfering nodes and described second group of interfering nodes to comprise: to list all can combination as the node of described via node, described first group of interfering nodes and described second group of interfering nodes; Each group node combination based on listed, under certain transmitted power, calculate the security information speed of described the first transmit stage and the security information speed of described the second transmit stage; Selection makes first group of interfering nodes in the combination of the maximized node of the security information speed of described the first transmit stage as described first group of selected interfering nodes, selection makes second group of interfering nodes in the combination of the maximized node of the security information speed of described the second transmit stage as described second group of selected interfering nodes, selects to make via node in the maximized node combination of smaller in the security information speed of the security information speed of described the first transmit stage and described the second transmit stage as described selected via node.
Preferably, poor between the greater of listener-in's maximum information speed between listener-in and described bunch in the maximum information speed that the security information speed of described the first transmit stage is via node described in described the first transmit stage and described transmission bunch bunch, the security information speed of described the second transmit stage is to receive poor between the maximum of listener-in's maximum information speed in listener-in and described reception between listener-in in the maximum information speed of bunch bunch head and described transmission bunch bunch, described bunch bunch bunch described in described the second transmit stage.
Preferably, select the step of described via node, described first group of interfering nodes and described second group of interfering nodes also to comprise: the power division weights that obtain described via node, described first group of interfering nodes and described second group of interfering nodes.
(3) beneficial effect
In wireless multi-hop network provided by the present invention based on bunch cooperation disturb transmission method can choose optimum via node and first and second groups of interfering nodes, make the security information speed in transmitting procedure maximize.The present invention has filled up and there is no the blank of utilizing relay node cooperation to transmit to disturb listener-in's technical scheme in the prior art in wireless multi-hop network, make simultaneously and utilize relay node cooperation when transmission in wireless multi-hop network, no longer need the other technologies such as combining encryption technology can ensure the fail safe of communication.
The accompanying drawing explanation
Fig. 1 be according in the wireless multi-hop network of the embodiment of the present invention based on bunch cooperation disturb the schematic diagram of transmission method;
Fig. 2 be according in the wireless multi-hop network of the embodiment of the present invention based on bunch cooperation disturb the flow chart of transmission method;
Fig. 3 A be according in the wireless multi-hop network of the embodiment of the present invention based on bunch cooperation disturb the schematic diagram of the first transmit stage of transmission method;
Fig. 3 B be according in the wireless multi-hop network of the embodiment of the present invention based on bunch cooperation disturb the schematic diagram of the second transmit stage of transmission method;
Fig. 4 chooses flow chart according to the via node of the embodiment of the present invention and each interfering nodes;
Fig. 5 is according to the safe outage probability of the transmission method of the embodiment of the present invention and transmission method of the prior art and the simulation comparison figure of transmitted power;
Fig. 6 is according to the safe outage probability of the transmission method of the embodiment of the present invention and transmission method of the prior art and the simulation comparison figure of both candidate nodes.
Embodiment
Fig. 1 show according in the wireless multi-hop network of the embodiment of the present invention based on bunch cooperation disturb the schematic diagram of transmission method.As shown in Figure 1, S, D are respectively source node and destination node, both apart from each others, need to assist to communicate by intermediate node, these intermediate nodes form via node, by extremely next bunch of communication, with this, by relaying bunch, information is transferred to destination node D by source node S by the node in same cluster.In sending bunch bunch, receive bunch bunch in and send bunch with reception bunch bunch between exist the listener-in to be eavesdropped transmitting procedure, in order to guarantee the fail safe of communication process, by the listener-in being sent to interference signal to suppress its eavesdropping.Due to each group send bunch with receive bunch between data transmission procedure be similar, therefore can the method be described by one group of data transmission procedure that sends bunch and receive bunch.
Fig. 2 show according in the wireless multi-hop network of the embodiment of the present invention based on bunch cooperation disturb the flow chart of transmission method.As shown in Figure 2, this transmission method can comprise:
The first transmit stage: send bunch bunch head by information be sent to send bunch bunch in selected via node, and by first group of selected interfering nodes, the listener-in is disturbed;
The second transmit stage: described via node preferably is sent to information to receive bunch bunch head in the mode of DF (Decode-and-Forward, decoding forwards), and by second group of selected interfering nodes, the listener-in is disturbed.
Fig. 3 A and 3B show respectively according in the wireless multi-hop network of the embodiment of the present invention based on bunch cooperation disturb the schematic diagram of the first and second transmit stages of transmission method.
As shown in Figure 3A, in the first transmit stage, send a bunch bunch head information is sent to via node, in this course, in sending bunch bunch the listener-in and bunch between listener-in's (can ignore the impact of listener-in in receiving bunch bunch) can be eavesdropped information, need to select first group of interfering nodes to be disturbed above-mentioned listener-in.For listener-in in sending bunch bunch, can in sending bunch bunch, select suitable interfering nodes to be disturbed it, for bunch between the listener-in, can in sending bunch and receive bunch bunch, select suitable interfering nodes to be disturbed it.First group of interfering nodes comprise interfering nodes in transmission that listener-in in sending bunch bunch is disturbed bunch bunch and to bunch between the listener-in disturbed bunch between interfering nodes.
As shown in Figure 3 B, in the second transmit stage, via node is sent to information to receive bunch bunch head, in this course, listener-in in sending bunch bunch, bunch between the listener-in and receive bunch bunch in the listener-in all can be eavesdropped information, need to select second group of interfering nodes to be disturbed above-mentioned listener-in.For listener-in in sending bunch bunch, can in sending bunch bunch, select suitable interfering nodes to be disturbed it, for listener-in in receiving bunch bunch, can in receiving bunch bunch, select suitable interfering nodes to be disturbed it, for bunch between the listener-in, can in sending bunch or receive bunch bunch, select suitable interfering nodes to be disturbed it.Second group of interfering nodes comprise interfering nodes in transmission that listener-in in sending bunch bunch is disturbed bunch bunch, in reception that listener-in in receiving bunch bunch is disturbed bunch bunch interfering nodes and to bunch between the listener-in disturbed bunch between interfering nodes.
In order to guarantee the fail safe of transmitting procedure, need in sending bunch, select optimum via node, choose optimum interfering nodes for each listener-in in sending bunch or receive bunch simultaneously the listener-in is disturbed accordingly.Hereinafter, will describe the choosing method of via node and interfering nodes in detail.
Fig. 4 shows according to the via node of the present embodiment and each interfering nodes and chooses flow chart.As shown in Figure 4, the choosing method of the via node in the first transmit stage and the second transmit stage and each interfering nodes is as follows:
S41: list all node combinations that can be used as via node, first group of interfering nodes and second group of interfering nodes;
S42: each the group node combination based on listed, calculate the security information speed of the first transmit stage and the security information speed of the second transmit stage;
S43: select to make first group of interfering nodes in the maximized node combination of security information speed of the first transmit stage first group of interfering nodes as optimum, selection makes second group of interfering nodes in the combination of the maximized node of the security information speed of the second transmit stage second group of interfering nodes as optimum, selects to make via node in the maximized node combination of smaller in the security information speed of the security information speed of the first transmit stage and the second transmit stage as optimum via node.Wherein, poor between the greater of listener-in's maximum information speed between listener-in and described bunch in the maximum information speed that the security information speed of described the first transmit stage is via node described in described the first transmit stage and described transmission bunch bunch, the security information speed of described the second transmit stage is to receive poor between the maximum of listener-in's maximum information speed in listener-in and described reception between listener-in in the maximum information speed of bunch bunch head and described transmission bunch bunch, described bunch bunch bunch described in described the second transmit stage.
In the transmission method according to the present embodiment, set the gross power of whole transmitting procedure, when selecting via node and first and second groups of interfering nodes, obtain the power division weights of via node and first and second groups of interfering nodes.Afterwards, via node and first and second groups of interfering nodes carry out respective transmissions according to its power division weights.Particularly, the total transmitted power that can set whole transmit stage is P 0, in the first transmit stage, total transmitted power of each node is P (1), in the second transmit stage, total transmitted power of each node is P (2), wherein, P (1)+ P (2)=P 0.
1) the first transmit stage:
Can set the transmitted power that sends bunch bunch head is P hT; The transmitted power sum that can set interfering nodes in all transmissions bunch bunch is
Figure BDA00003577245900061
and use
Figure BDA00003577245900062
the weights allocation vector of interfering nodes set in mean sending bunch bunch; The transmitted power sum that can set interfering nodes between all bunches is
Figure BDA00003577245900063
and use
Figure BDA00003577245900064
the weights allocation vector of interfering nodes set between meaning bunch; Can set be positioned at send bunch bunch bunch between the transmitted power sum of interfering nodes be
Figure BDA00003577245900065
and use
Figure BDA00003577245900066
the weights allocation vector that means this node set.Wherein,
Figure BDA00003577245900069
for the conjugate transpose operator, the transmitted power sum of each node is total transmitted power of the first transmit stage, that is:
Figure BDA00003577245900067
With mean bunch information that bunch hair send that sends,
Figure BDA000035772459000611
mean default interference signal.
The signal that via node receives is:
Figure BDA00003577245900068
Wherein, n rfor the noise that via node receives, n rgaussian distributed CN~(0, σ 2), h hTRmean to send a bunch bunch H twith the channel gain of via node,
Figure BDA00003577245900071
with
Figure BDA00003577245900072
in mean sending respectively bunch bunch the interfering nodes set and bunch between the channel gain vector of interfering nodes and via node.
Via node and reception bunch bunch head it should be noted that, can before the first transmit stage, in advance default interference signal be informed to via node and receive bunch bunch head, so that can be eliminated the impact of interference signal in the first and second transmit stages; Perhaps, can also make first and second groups of interfering nodes directionally to corresponding listener-in, send interference signal by wireless directional transmissions technology, thereby directly avoid interference the continue impact of node of signal pair.Therefore, according to shannon formula, the maximum information speed that can obtain via node is;
R R = 1 2 log 2 ( 1 + γR ) = 1 2 log 2 ( 1 + P HT | h HTR | 2 σ 2 )
Wherein, γ rit is the signal to noise ratio at via node place.
In sending bunch bunch the
Figure BDA000035772459000715
the signal that individual listener-in receives is:
Figure BDA00003577245900074
Wherein,
Figure BDA00003577245900075
the additive white Gaussian noise and Gaussian distributed CN~(0, the σ that mean this listener-in 2),
Figure BDA00003577245900076
mean to send a bunch bunch H twith this listener-in's channel gain, mean
Figure BDA00003577245900077
disturb the channel gain vector of interfering nodes and this listener-in in this listener-in's transmission bunch bunch,
Figure BDA00003577245900078
mean to disturb the power division weights of interfering nodes in this listener-in's transmission bunch bunch.
In can obtaining sending bunch bunch the
Figure BDA000035772459000716
individual listener-in's maximum information speed is:
Figure BDA00003577245900079
Wherein,
Figure BDA000035772459000710
it is the signal to noise ratio at this listener-in place.
The signal that between ε bunch, the listener-in receives is:
Figure BDA000035772459000711
Wherein,
Figure BDA000035772459000717
the additive white Gaussian noise and Gaussian distributed CN~(0, the σ that mean this listener-in place 2), h hTer[ε] and
Figure BDA000035772459000719
mean respectively to send a bunch bunch H tand this listener-in's channel gain and disturb this listener-in bunch between interfering nodes and this listener-in's channel gain,
Figure BDA000035772459000718
mean to disturb this listener-in bunch between the power division weights of interfering nodes.
The maximum information speed that can obtain listener-in between ε bunch is:
R er ( 1 ) [ ϵ ] = 1 2 log 2 ( 1 + γ er ( 1 ) [ ϵ ] ) = 1 2 log 2 ( 1 + P HT | h HTer [ ϵ ] | 2 P jr ( 1 ) | W jr ( 1 ) [ ϵ ] h jrer ( 1 ) [ ϵ ] | 2 + σ 2 )
Wherein,
Figure BDA000035772459000815
it is the signal to noise ratio at listener-in place between this bunch.
2) the second transmit stage:
In order to improve the performance of whole transmission network, via node is receiving a transmission bunch bunch H tafter the information sent, the mode preferably information forwarded with decoding is sent to the information that via node was received to receive bunch bunch head.For via node can be correctly decoded, need the information rate of via node to be not less than a reception bunch bunch H rinformation rate, that is:
P HT|h HTR| 2≥P R|h RHR| 2
The transmitted power that can set via node is P r; The transmitted power sum that can set interfering nodes in all transmissions bunch bunch is and use
Figure BDA00003577245900084
the weights allocation vector of interfering nodes set in mean sending bunch bunch; The transmitted power sum that can set interfering nodes in all receptions bunch bunch is and use the weights allocation vector of interfering nodes set in mean receiving bunch bunch; The transmitted power sum that can set interfering nodes between all bunches is
Figure BDA00003577245900087
and use
Figure BDA00003577245900088
the weights allocation vector of interfering nodes set between meaning bunch; Can set be positioned at receive bunch bunch bunch between the transmitted power sum of interfering nodes be
Figure BDA00003577245900089
and use
Figure BDA000035772459000810
the weights allocation vector that means this node set.Wherein,
Figure BDA000035772459000816
for the conjugate transpose operator, the transmitted power sum of each node is total transmitted power of the second transmit stage, that is: P R + P ja T ( 2 ) + P ja R ( 2 ) + P jr ( 2 ) = P ( 2 ) .
In the second transmit stage, receive a bunch bunch H rthe signal that place receives is;
Figure BDA000035772459000812
Wherein, P rthe transmitted power of via node, n hRthe additive white Gaussian noise Gaussian distributed CN at expression reception bunch bunch head place~(0, σ 2), h rHRmean via node and receive a bunch bunch H rchannel gain,
Figure BDA000035772459000813
with
Figure BDA000035772459000814
in mean receiving respectively bunch bunch the interfering nodes set with receive a bunch bunch H rand bunch between the interfering nodes set with receive a bunch bunch H rthe channel gain vector.
Due to before the first transmit stage, in advance default interference signal informed to via node and received bunch bunch head, perhaps by wireless directional transmissions technology, make first and second groups of interfering nodes directionally to corresponding listener-in, send interference signal, thereby eliminated interference signal to receiving a bunch bunch H rimpact.Therefore, receive a bunch bunch H rmaximum information speed be:
R HR = 1 2 log 2 ( 1 + γ HR ) = 1 2 log 2 ( 1 + R H | h RHR | 2 σ 2 )
Wherein, γ hRto receive a bunch bunch H rthe signal to noise ratio at place.
The signal that ι listener-in in sending bunch bunch locates to receive is:
Figure BDA00003577245900092
Wherein,
Figure BDA00003577245900093
ι additive white Gaussian noise and Gaussian distributed CN~(0, the σ that the listener-in locates in sending bunch bunch 2),
Figure BDA00003577245900095
with mean respectively via node and this listener-in's channel gain, disturb the channel gain of interfering nodes and this listener-in in this listener-in's transmission bunch bunch, mean to disturb the power division weights of interfering nodes in this listener-in's transmission bunch bunch.
The maximum information speed that in sending bunch bunch, ι listener-in locates is:
R ea T ( 2 ) [ ι ] = 1 2 log 2 ( 1 + γ ea T ( 2 ) [ ι ] ) = 1 2 log 2 ( 1 + P R | h Rea T [ ι ] | 2 P ja T ( 2 ) | w ja T ( 2 ) [ ι ] h jaea T ( 2 ) [ ι ] | 2 + σ 2 )
Wherein,
Figure BDA00003577245900098
it is the signal to noise ratio at this listener-in place.
The signal that in receiving bunch bunch, υ listener-in receives is:
Figure BDA00003577245900099
Wherein,
Figure BDA000035772459000910
be illustrated in receive bunch bunch in υ additive white Gaussian noise and Gaussian distributed CN~(0, the σ that the listener-in locates 2),
Figure BDA000035772459000911
mean respectively via node and this listener-in channel gain, disturb the channel gain of interfering nodes and υ listener-in in this listener-in's reception bunch bunch, mean to disturb the power division weights of interfering nodes in this listener-in's reception bunch bunch.
The maximum information speed that in receiving bunch bunch, υ listener-in locates is;
R ea R ( 2 ) [ υ ] = 1 2 log 2 ( 1 + γ ea R ( 2 ) [ υ ] ) = 1 2 log 2 ( 1 + P R | h Rea R [ υ ] | 2 P ja R ( 2 ) | w ja R ( 2 ) [ υ ] h jaea R ( 2 ) [ υ ] | 2 + σ 2 )
Wherein,
Figure BDA000035772459000914
it is the signal to noise ratio at this listener-in place.
The signal that between κ bunch, the listener-in receives is:
Figure BDA00003577245900101
Wherein,
Figure BDA00003577245900102
the additive white Gaussian noise and Gaussian distributed CN~(0, the σ that mean listener-in place between κ bunch 2), h rer[κ] and
Figure BDA00003577245900103
mean respectively via node and this listener-in channel gain, disturb this listener-in bunch between interfering nodes and this listener-in's channel gain,
Figure BDA00003577245900104
mean to disturb this listener-in bunch between the power division weights of interfering nodes.
Between κ bunch, the maximum information speed at listener-in place is:
R ea R ( 2 ) [ κ ] = 1 2 log 2 ( 1 + γ ea ( 2 ) [ κ ] ) = P R | h Rea [ κ ] | 2 P ja ( 2 ) | w ja ( 2 ) [ κ ] h jaea ( 2 ) [ κ ] | 2 + σ 2
Wherein,
Figure BDA00003577245900106
signal to noise ratio for this listener-in place.
Above signal and the maximum information speed received to each node and listener-in in the present invention's the first transmit stage and the second transmit stage have been described in detail.By foregoing description, the security information speed that can obtain the first transmit stage and the second transmit stage is respectively:
Figure BDA00003577245900107
R S ( 2 ) = [ R HR - max κ , ι , υ { R er ( 2 ) [ κ ] , R ea T ( 2 ) [ ι ] , R ea R ( 2 ) [ υ ] } ] +
That is the maximum information speed that, the security information speed of the first transmit stage is via node in described the first transmit stage and send bunch bunch in the listener-in and bunch between poor between the greater of listener-in's maximum information speed; The security information speed of the second transmit stage be the maximum information speed that receives bunch bunch head in the second transmit stage with send bunch bunch in the listener-in, bunch between poor between the maximum of listener-in's maximum information speed in listener-in and reception bunch bunch.Wherein, [x] +=max{0, x},
Figure BDA000035772459001015
for the quantity of listener-in in sending bunch,
Figure BDA000035772459001016
for bunch between listener-in's quantity,
Figure BDA000035772459001017
for the quantity of listener-in in receiving bunch,
Figure BDA00003577245900109
with
Figure BDA000035772459001010
mean respectively in the first transmit stage each send bunch bunch in listener-in's maximum information speed between listener-in and each bunch,
Figure BDA000035772459001011
with
Figure BDA000035772459001012
mean respectively in the second transmit stage listener-in between each bunch, each send bunch bunch in listener-in and each receive bunch bunch in listener-in's maximum information speed.
The security information speed of complete transmission process by
Figure BDA000035772459001013
with
Figure BDA000035772459001014
in the less security information speed of value determine, therefore, the security information speed of complete transmission process is:
R S = min { R S ( 1 ) , R S ( 2 ) }
In order to guarantee the requirement of different service quality (QoS) to communication security, security information speed grade that can be corresponding to different service definitions, for example, can define a common L grade, wherein, Tl means corresponding to l the corresponding fixedly security information of security information speed grade speed, and fixedly security information speed raises along with the security information speed grade and increases, wherein 1≤l≤L.
In order to portray the security performance of whole system, we utilize safe outage probability as evaluation criteria, and it is defined as P{R s<T l, work as R sbe less than T lthe time, judge that current transmission does not meet the requirement of l security information speed grade, thinks that current transmission is in unsafe state.
Our target is to select optimum relaying and interfering nodes under certain transmitted power, makes the safe outage probability minimum of whole system, and optimization problem is:
Figure BDA00003577245900112
Wherein,
Figure BDA000035772459001110
mean probability, R *mean the optimum via node of selecting,,
Figure BDA000035772459001111
mean the optimum interfering nodes set of selecting.For can improve based on bunch wireless multi-hop network in the fail safe of communication, need to make the safe outage probability minimum of complete transmission process.Be statistical probability due to what consider, therefore can be converted into maximization security information speed R by minimizing safe outage probability problem sproblem.Therefore, can before transmission, list the node combination of all via nodes and first, second group interfering nodes, calculate each node and combine corresponding
Figure BDA00003577245900114
with and select to make
Figure BDA00003577245900116
first group of interfering nodes in maximum node combination, as first group of interfering nodes of optimum, selected to make
Figure BDA00003577245900117
second group of interfering nodes in maximum node combination, as second group of interfering nodes of optimum, selects to make R svia node in maximum node combination is as optimum via node.Particularly, can select optimum via node and interfering nodes by following formula:
P * = arg max min { R S ( 1 ) , R S ( 2 ) }
Figure BDA00003577245900119
Figure BDA00003577245900122
= arg max min { 1 + &gamma; HR 1 + &gamma; er ( 2 ) &lsqb; &kappa; &rsqb; , 1 + &gamma; HR 1 + &gamma; ea T ( 2 ) &lsqb; &iota; &rsqb; , 1 + &gamma; HR 1 + &gamma; ea R ( 2 ) &lsqb; &upsi; &rsqb; }
Wherein, R *for via node, with be respectively in the first transmit stage send bunch bunch in the interfering nodes set and bunch between the interfering nodes set,
Figure BDA00003577245900126
with
Figure BDA00003577245900127
be respectively in the second transmit stage send bunch bunch in the interfering nodes set, receive bunch bunch in the interfering nodes set and bunch between the interfering nodes set.
Proved that above-mentioned optimization problem is protruding optimization problem, in prior art, existed many protruding optimization methods to solve this class problem, such as gradient method, interior point method etc., be not described in detail here.
Much larger than 1 the time, can further obtain following formula when signal to noise ratio:
Figure BDA00003577245900128
Figure BDA000035772459001210
Wherein, mean in the first group node combination to disturb listener-in between ε bunch bunch between interfering nodes,
Figure BDA000035772459001212
mean in the first group node combination to disturb send bunch bunch in the
Figure BDA000035772459001216
interfering nodes in individual listener-in's transmission bunch bunch;
Figure BDA000035772459001213
mean in the second group node combination to disturb listener-in between κ bunch bunch between interfering nodes,
Figure BDA000035772459001214
mean in the second group node combination to disturb interfering nodes in the transmission bunch bunch of ι listener-in in sending bunch bunch,
Figure BDA000035772459001215
mean in the second group node combination to disturb interfering nodes in the reception bunch bunch of υ listener-in in receiving bunch bunch.
As mentioned above, optimum transmission bunch via node, first group of interfering nodes and second group of interfering nodes have been obtained according to the present embodiment.
Below respectively the security performance of the wireless multi-hop network based on method provided by the present invention (CB-ORJ), noiseless traditional relay selection (CS-NJ) scheme and noiseless optimization relay selection (OS-NJ) scheme is contrasted.
Fig. 5 is according to the safe outage probability of the transmission method of the embodiment of the present invention and transmission method of the prior art and the simulation comparison figure of transmitted power.In simulated environment, transmission bunch bunch head,
The position that receives bunch bunch head and listener-in is fixed, and bunch in both candidate nodes random distribution (both candidate nodes in each bunch is 6).In the simulation result shown in Fig. 5, contrasted the safe outage probability and the transmitted power P that sends bunch bunch head of three kinds of schemes hTrelation, in simulation process, set total transmitted power P of whole transmitting procedure 0=80dBW, and the transmitted power P of a transmission bunch bunch HT hTtransmitted power P with via node requate.As shown in Figure 5, in method provided by the present invention (CB-ORJ), safe outage probability is with P hTincrease be obvious downward trend, the safe outage probability of CS-NJ and OS-NJ strategy approaches saturated after slightly descending.
Fig. 6 is according to the safe outage probability of the transmission method of the embodiment of the present invention and transmission method of the prior art and the simulation comparison figure of both candidate nodes.In simulated environment, the position that sends bunch bunch head, reception bunch bunch head and listener-in is fixed, both candidate nodes random distribution in bunch.In simulation process, set total transmitted power P of whole transmitting procedure 0=80dBW, P hT=16dBW, P r=P hT.As shown in Figure 6, along with bunch in the both candidate nodes number increase, the safe outage probability of three kinds of schemes all reduces.Than other two schemes, in method provided by the present invention (CB-ORJ), safe outage probability descends very obvious.For CS-NJ and OS-NJ, due to the restriction of scheme itself, make safe outage probability reduce degree less, when bunch in both candidate nodes number while being increased to certain value, the safe outage probability of this two schemes no longer includes significant change.
Known by above description, by adopt in wireless multi-hop network provided by the present invention based on bunch cooperation disturb transmission method, can choose optimum relay node cooperation transmission information, and can choose optimum interfering nodes and disturb the listener-in, thereby the security information speed make transmitting procedure under certain transmitted power in maximizes, and has improved the security performance of whole network.
Although described by reference to the accompanying drawings embodiments of the present invention, but those skilled in the art can make various modifications and variations without departing from the spirit and scope of the present invention, such modification and modification all fall into by within the claims limited range.

Claims (10)

  1. In a wireless multi-hop network based on bunch cooperation disturb transmission method, comprising:
    The first transmit stage: bunch bunch head of the transmission in described wireless multi-hop network by information be sent to send bunch bunch in selected via node, and by first group of selected interfering nodes, the listener-in is disturbed;
    The second transmit stage: described via node is sent to the reception bunch bunch head in described wireless multi-hop network by described information, and by second group of selected interfering nodes, described listener-in is disturbed.
  2. 2. method according to claim 1, wherein, described first group of interfering nodes comprises: in the transmission that listener-in in sending bunch bunch is disturbed bunch bunch interfering nodes and to bunch between the listener-in disturbed bunch between interfering nodes.
  3. 3. method according to claim 1, wherein, described second group of interfering nodes comprises: in interfering nodes in the transmission that listener-in in sending bunch bunch is disturbed bunch bunch, reception that listener-in in receiving bunch bunch is disturbed bunch bunch interfering nodes and to bunch between the listener-in disturbed bunch between interfering nodes.
  4. 4. method according to claim 1, wherein, in described the second transmit stage, the mode that described via node adopts decoding to forward is sent to described reception bunch bunch head by described information, and the information rate of described via node is not less than the information rate of described reception bunch bunch head.
  5. 5. method according to claim 1, wherein, described first group of interfering nodes and described second group of interfering nodes disturb and comprise described listener-in: described first group of interfering nodes and described second group of interfering nodes send default interference signal to described listener-in.
  6. 6. method according to claim 5, also comprise: described default interference signal is informed to described via node and described reception bunch bunch head are so that described via node and described reception bunch bunch head is eliminated the impact of described interference signal in described the first transmit stage and the second transmit stage before described the first transmit stage.
  7. 7. method according to claim 1, wherein, described first group of interfering nodes and described second group of interfering nodes disturb and comprise described listener-in: make described first group of interfering nodes and described second group of interfering nodes orientation send interference signal to described listener-in.
  8. 8. according to the described method of any one in claim 1-7, wherein, select the step of described via node, described first group of interfering nodes and described second group of interfering nodes to comprise:
    List all can combination as the node of described via node, described first group of interfering nodes and described second group of interfering nodes;
    Each group node combination based on listed, under certain transmitted power, calculate the security information speed of described the first transmit stage and the security information speed of described the second transmit stage;
    Selection makes first group of interfering nodes in the combination of the maximized node of the security information speed of described the first transmit stage as described first group of selected interfering nodes, selection makes second group of interfering nodes in the combination of the maximized node of the security information speed of described the second transmit stage as described second group of selected interfering nodes, selects to make via node in the maximized node combination of smaller in the security information speed of the security information speed of described the first transmit stage and described the second transmit stage as described selected via node.
  9. 9. method according to claim 8, wherein, poor between the greater of listener-in's maximum information speed between listener-in and described bunch in the maximum information speed that the security information speed of described the first transmit stage is via node described in described the first transmit stage and described transmission bunch bunch, the security information speed of described the second transmit stage is to receive poor between the maximum of listener-in's maximum information speed in listener-in and described reception between listener-in in the maximum information speed of bunch bunch head and described transmission bunch bunch, described bunch bunch bunch described in described the second transmit stage.
  10. 10. according to the described method of any one in claim 1-7, wherein, select the step of described via node, described first group of interfering nodes and described second group of interfering nodes also to comprise:
    Obtain the power division weights of described via node, described first group of interfering nodes and described second group of interfering nodes.
CN201310320208.7A 2013-07-26 2013-07-26 In wireless multi-hop network based on bunch cooperation interference transmission method Active CN103475441B (en)

Priority Applications (1)

Application Number Priority Date Filing Date Title
CN201310320208.7A CN103475441B (en) 2013-07-26 2013-07-26 In wireless multi-hop network based on bunch cooperation interference transmission method

Applications Claiming Priority (1)

Application Number Priority Date Filing Date Title
CN201310320208.7A CN103475441B (en) 2013-07-26 2013-07-26 In wireless multi-hop network based on bunch cooperation interference transmission method

Publications (2)

Publication Number Publication Date
CN103475441A true CN103475441A (en) 2013-12-25
CN103475441B CN103475441B (en) 2016-06-08

Family

ID=49800163

Family Applications (1)

Application Number Title Priority Date Filing Date
CN201310320208.7A Active CN103475441B (en) 2013-07-26 2013-07-26 In wireless multi-hop network based on bunch cooperation interference transmission method

Country Status (1)

Country Link
CN (1) CN103475441B (en)

Cited By (7)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
CN105992124A (en) * 2015-02-12 2016-10-05 北京邮电大学 Inter-cluster communication method based on D2D (Device-to-Device)
CN106131823A (en) * 2016-06-06 2016-11-16 西安交通大学 Relay transmission method based on safety of physical layer in eavesdropping user's random distribution scene
CN109788479A (en) * 2019-02-27 2019-05-21 西安交通大学 A kind of distributed collaborative jamming power distribution method minimizing secrecy outage probability
CN110677181A (en) * 2019-08-30 2020-01-10 哈尔滨工业大学(深圳) Physical layer secure transmission method and system based on energy collection
CN111698680A (en) * 2020-05-07 2020-09-22 东南大学 Cluster-based cooperative interference safety communication method in wireless sensor network
CN112333804A (en) * 2020-12-31 2021-02-05 江苏移动信息系统集成有限公司 Performance optimization method and system for cognitive network
CN112911616A (en) * 2021-01-19 2021-06-04 西安理工大学 Covert transmission method based on cooperative interference countermeasure joint detection

Families Citing this family (1)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
CN107426792B (en) * 2017-04-01 2020-10-09 华侨大学 Power division energy acquisition relay safety transmission method for scrambling of target user

Citations (2)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
US20090262689A1 (en) * 2008-04-22 2009-10-22 Electronics And Telecommunications Research Institute Method and apparatus for allocating resources to a node in ad-hoc network
CN102438235A (en) * 2011-08-22 2012-05-02 北京邮电大学 Method for selecting optimal distributed type interference source in mobile collaborative network

Patent Citations (2)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
US20090262689A1 (en) * 2008-04-22 2009-10-22 Electronics And Telecommunications Research Institute Method and apparatus for allocating resources to a node in ad-hoc network
CN102438235A (en) * 2011-08-22 2012-05-02 北京邮电大学 Method for selecting optimal distributed type interference source in mobile collaborative network

Non-Patent Citations (4)

* Cited by examiner, † Cited by third party
Title
IOANNIS KRIKIDIS ET AL.: "《Relay Selection for Secure Cooperative Networks with Jamming》", 《IEEE TRANSACTIONS ON WIRELESS COMMUNICATIONS》, vol. 8, no. 10, 31 October 2009 (2009-10-31) *
JINGCHAO CHEN ET AL.: "《Joint Relay and Jammer Selection for Secure Two-Way Relay Networks》", 《IEEE TRANSACTIONS ON INFORMATION FORENSICS AND SECURITY》, vol. 7, no. 1, 29 February 2012 (2012-02-29) *
LUN DONG ET AL.: "《COOPERATIVE JAMMING FOR WIRELESS PHYSICAL LAYER SECURITY》", 《2009 IEEE/SP 15TH WORKSHOP ON STATISTICAL SIGNAL PROCESSING》, 31 December 2009 (2009-12-31) *
龙航 等: "《协作干扰技术的提出、现状和未来展望》", 《电信科学》, vol. 29, no. 1, 31 January 2013 (2013-01-31) *

Cited By (10)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
CN105992124A (en) * 2015-02-12 2016-10-05 北京邮电大学 Inter-cluster communication method based on D2D (Device-to-Device)
CN105992124B (en) * 2015-02-12 2020-04-24 北京邮电大学 Inter-cluster communication method based on D2D
CN106131823A (en) * 2016-06-06 2016-11-16 西安交通大学 Relay transmission method based on safety of physical layer in eavesdropping user's random distribution scene
CN106131823B (en) * 2016-06-06 2019-08-23 西安交通大学 Relay transmission method based on safety of physical layer in eavesdropping user random distribution scene
CN109788479A (en) * 2019-02-27 2019-05-21 西安交通大学 A kind of distributed collaborative jamming power distribution method minimizing secrecy outage probability
CN110677181A (en) * 2019-08-30 2020-01-10 哈尔滨工业大学(深圳) Physical layer secure transmission method and system based on energy collection
CN111698680A (en) * 2020-05-07 2020-09-22 东南大学 Cluster-based cooperative interference safety communication method in wireless sensor network
CN111698680B (en) * 2020-05-07 2022-06-28 东南大学 Cluster-based cooperative interference safety communication method in wireless sensor network
CN112333804A (en) * 2020-12-31 2021-02-05 江苏移动信息系统集成有限公司 Performance optimization method and system for cognitive network
CN112911616A (en) * 2021-01-19 2021-06-04 西安理工大学 Covert transmission method based on cooperative interference countermeasure joint detection

Also Published As

Publication number Publication date
CN103475441B (en) 2016-06-08

Similar Documents

Publication Publication Date Title
CN103475441A (en) Cooperative interference transmission method based on clusters in wireless multi-hop network
CN101800578B (en) Method for reducing downlink multipoint cooperation implicate feedback overhead
CN104378757B (en) A kind of method that safety of physical layer is ensured in the more interference eavesdropping networks of more relayings
CN102438235B (en) Method for selecting optimal distributed type interference source in mobile collaborative network
CN104469755A (en) Physical layer security transmission method for keeping relay and jamming node selection result secret
CN103117835B (en) Joint adaptive modulation and coding and power distribution method of bidirectional relay system
CN104104422A (en) Multi-antenna non-trusted relay system based on limit feedback and transmission method thereof
CN102448073B (en) Mixed type via node, base station and mixed type trunking method
Kim et al. Infrastructure relay transmission with cooperative MIMO
CN103220094B (en) Cognition network is carried out and passes and the joint transmission method cooperated
CN105933040A (en) Secure transmission method adopting information source and relay-combined transmitting antenna selection
CN104009834A (en) MIMO secret communication method based on differential chaos shift keying
CN104579443A (en) Linear pre-coding method based on multi-cell coordination Massive MIMO system
CN104283629A (en) Channel safety transmission method
CN106921418A (en) A kind of relay cooperative method for precoding based on imperfect channel state information
CN103209427B (en) User-channel-quality-based collaborative user selection method for source users
CN101651478B (en) Scheme for combining space-time code cooperation, relay selection and power distribution
CN104717035A (en) Interference alignment method of cellular network based on D2D communication
CN105813130A (en) Coordination mechanism method of multiple-hop underwater acoustic network data transmission
CN103297108B (en) A kind of uplink beam manufacturing process of Multi-source multi-relay collaborative network
CN103236878B (en) A kind of coordinates beam shaping method receiving vector estimation based on maximum-ratio combing
CN102300224B (en) Methods for sending and receiving configuration information triggering SRS (Sounding Reference Signal), base station and user equipment (UE)
CN106100716A (en) Cooperation communication system forwards based on mixing and the safety of opportunistic relay strengthens strategy
CN102946609B (en) Data communication method of multiuser bidirectional relay communication system
CN105873206A (en) Large-scale MIMO transmission cellular relay network model and power distribution method

Legal Events

Date Code Title Description
C06 Publication
PB01 Publication
C10 Entry into substantive examination
SE01 Entry into force of request for substantive examination
C14 Grant of patent or utility model
GR01 Patent grant