CN104703246A - Quick and slow link adaptive fusion based relay selection method - Google Patents

Quick and slow link adaptive fusion based relay selection method Download PDF

Info

Publication number
CN104703246A
CN104703246A CN201510071665.6A CN201510071665A CN104703246A CN 104703246 A CN104703246 A CN 104703246A CN 201510071665 A CN201510071665 A CN 201510071665A CN 104703246 A CN104703246 A CN 104703246A
Authority
CN
China
Prior art keywords
link
node
interfering nodes
gamma
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.)
Granted
Application number
CN201510071665.6A
Other languages
Chinese (zh)
Other versions
CN104703246B (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.)
Guangxi Normal University
Original Assignee
Guangxi Normal University
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 Guangxi Normal University filed Critical Guangxi Normal University
Priority to CN201510071665.6A priority Critical patent/CN104703246B/en
Publication of CN104703246A publication Critical patent/CN104703246A/en
Application granted granted Critical
Publication of CN104703246B publication Critical patent/CN104703246B/en
Expired - Fee Related legal-status Critical Current
Anticipated expiration legal-status Critical

Links

Classifications

    • HELECTRICITY
    • H04ELECTRIC COMMUNICATION TECHNIQUE
    • H04WWIRELESS COMMUNICATION NETWORKS
    • H04W40/00Communication routing or communication path finding
    • H04W40/02Communication route or path selection, e.g. power-based or shortest path routing
    • H04W40/22Communication route or path selection, e.g. power-based or shortest path routing using selective relaying for reaching a BTS [Base Transceiver Station] or an access point

Abstract

The invention discloses a quick and slow link adaptive fusion based relay selection method. The method comprises safe decoding-and-forwarding collaborative network relay selection and ordinary collaborative network relay selection. The method is characterized in that a channel state change frequency division method is put forward, a quick or slow link adaptive mode is selected according to the method, and accordingly, the system performance is improved, and the system complexity is reduced; (2) considering that reality system users link adaptive transmission generally, the method can be applied to reality systems and has realistic feasibility; (3) the secrecy capacity and whether the switching frequency between interference nodes is used are considered in security collaboration network relay selection, the relay selection is reasonable and meaningful by establishing relay selection in ordinary collaborative network on the basis of determining towards actual channels.

Description

Based on the relay selection method that fast, slow speed link self adaptation merge
Technical field
The present invention relates to mobile communication technology field, be specifically related to a kind of relay selection method merged based on fast, slow speed link self adaptation.
Background technology
In security cooperation network, due to the character of the wireless medium of broadcast, all users in system Covering domain can eavesdrop source information.Performance and the protection communication link of information privacy in communication are not eavesdropped by possible listener-in, become more and more important.Information privacy in conventional wireless network is the field of higher-layer protocols, and access to your password security scheme.But the high-rise information security realized is in the face of the challenge of ever-increasing potential risk.So in order to improve the security performance of mobile communication system further, people start to pay close attention to physical layer information safety problem.Hurry up, slow speed link adaptive mode may be used to security cooperation network and common collaborative network, but in the relay selection of two kinds of networks, all do not consider impact that is fast, slow speed link adaptive technique at present.
Summary of the invention
The invention provides a kind of relay selection method merged based on fast, slow speed link self adaptation, the method is respectively for security cooperation network and common collaborative network, on the basis that fast, slow speed link self adaptation merge, respective relay selection method is provided respectively, have effectively achieved the relay selection of the cooperation communication system adopting link circuit self-adapting transmission means.Feature of the present invention is: (1) proposes a kind of method distinguishing channel state variations frequency, channel conditions change is more frequent, can be considered that channel conditions is more undesirable, quick or the slow speed link adaptive mode according to the method choice for use, effectively achieve the fusion of two class link circuit self-adaptings in practical communication scene, thus improve the performance of system to a certain extent and reduce the complexity of system.(2) relay selection method is in the past different from, relay selection method that the present invention carries considers link circuit self-adapting transmission means, in view of reality system generally adopts link circuit self-adapting to transmit, therefore institute of the present invention extracting method can be used for reality system, has realistic feasibility.(3) taken into account secrecy capacity and whether used the switching frequency between interfering nodes in security cooperation network trunk is selected, relay selection is based upon on the judgement basis to actual channel in common collaborative network, make relay selection more reasonable, there is realistic meaning.
Set forth technical scheme of the present invention below.
Based on the relay selection method that fast, slow speed link self adaptation merge, described method comprises the safe relay selection of decoding forward collaboration network and the relay selection of common collaborative network.The relay selection of described safe decoding forward collaboration network, comprises the steps:
(1) choose two via nodes, a via node R is used for normal transmission data, and another node J is as interfering nodes.
(2) under the prerequisite of interfering nodes set non-NULL, if use interfering nodes, then:
C S ( i Y * , J * ) = arg max i ≠ J i ∈ C J ∈ J set { C S ( i , J ) } = arg max i ≠ J i ∈ C J ∈ J set { 1 2 log 2 ( 1 + γ i , D W 1 + γ J , D W 1 + 1 + γ i , E W γ J , E W ) } ;
If do not use interfering nodes, then:
C S ( i N * ) = arg max i ∈ C d { C S ( i ) } = arg max i ∈ C d { 1 2 log 2 ( 1 + γ i , D W 1 + γ i , E W ) } ;
Wherein: candidate relay node when using interfering nodes and interfering nodes respectively; it is candidate relay node when not using interfering nodes; represent Instant SNR or the average signal-to-noise ratio of link between node i to destination node D; represent Instant SNR or the average signal-to-noise ratio of link between node i to eavesdropping node E; represent Instant SNR or the average signal-to-noise ratio of link between interfering nodes j to destination node D; represent Instant SNR or the average signal-to-noise ratio of link between interfering nodes j to eavesdropping node E; I belongs to set of relay nodes C d, C dfor can decoding success forward from the set of relay nodes of source node signal; Interfering nodes J belongs to interfering nodes set J set, and J ≠ i, interfering nodes set J setby forming as the via node of interfering nodes.
(3) if then use interfering nodes, and choose and J *respectively as via node and interfering nodes; If then do not use interfering nodes, and choose as via node.
The relay selection of described common collaborative network, comprises the steps:
(1) the i-th (i=1,2 are obtained by estimation ... N d) individual via node to the Instant SNR sample of destination node D link is ask for the average of this link Instant SNR sample respectively variance the degree of bias and kurtosis
(2) suppose that this link channel type is φ, estimate channel parameter, the Instant SNR probability density function of all kinds channel wherein, N i,D, for describing parameter during different channels type; Obtain supposing that channel type is the average of the channel Instant SNR of φ according to Instant SNR probability density function variance the degree of bias and kurtosis
(3) calculate:
ϵ φ = [ V 1 X - v φ , 1 Y ] 2 v 2 X + 1 2 [ 1 - v φ , 2 Y v 2 X ] 2 + 1 6 ( v 3 X - v φ , 3 Y ) 2 + 1 24 ( v 4 X - v φ , 4 Y ) 2 ;
Minimum ε φcorresponding hypothesis channel type is the actual channel type of this link, and determines channel parameter N i,D, with
(4) outage probability during this link employing slow speed link self adaptation:
This link adopts outage probability during rapid link self adaptation:
Wherein: M is the progression of M-QAM modulation, gauss-Q function, represent the maximum integer being less than or equal to x; H represents bit number, k represents dimension, l represents the number of Gamma component, l=1 ..., N i,D.
(5) basis select via node; Wherein: R *for selected via node; When link adopts rapid link self adaptation, when link adopts slow speed link self adaptation, P out Z ( γ i , D W ) = P out SAM ( γ i , D S ) .
Embodiment
Each link adopts fast or Adaptive Transmission mode at a slow speed, and rapid link self adaptation is according to Instant SNR determination modulation system, and slow speed link self adaptation is according to average signal-to-noise ratio determination modulation system.According to judging channel, frequent variations choice for use is fast or slow speed link adaptive technique.In view of the close ties of translational speed and channel variation frequency, when destination node translational speed is υ d≤ υ 0time, judge that this link channel conditions is non-frequent variations, be suitable for rapid link adaptive technique; Work as υ 0< υ d≤ υ 1time, judge that this link channel conditions is common variation, link circuit self-adapting mode corresponding when making channel security capacity maximum choose the prerequisite only changing link circuit self-adapting mode in security cooperation network under, link circuit self-adapting mode corresponding when making outage probability minimum choose the prerequisite only changing link circuit self-adapting mode in common collaborative network under; Work as υ d> υ 1time, judge that this link channel conditions is frequent variations, adopt slow speed link adaptive technique.Wherein: υ dfor node motion speed; υ 0be the first thresholding speed, 10km/h≤υ 0≤ 30km/h; υ 1be the second thresholding speed, 40km/h≤υ 1≤ 60km/h.With represent Instant SNR (W=F) or the average signal-to-noise ratio (W=S) of link (being designated as i → j link) between node i to node j.
(1) safe decoding forward collaboration network trunk is selected
All users in security cooperation network can eavesdrop source information, when information source S (Source) sends data to destination node D (Destination), can be ravesdropping node E (Eavesdropper) eavesdropping.Choose two via nodes, a via node R (Relay) is used for normal transmission data, and another node J (Jammer) is as interfering nodes, and the signal sent from J is interference signal, plays the effect of interference.Because interference is always not favourable to system, so in order to overcome this restriction, proposition system can switch at use interfering nodes and not using between interfering nodes.
represent Instant SNR or the average signal-to-noise ratio of link i → D, represent Instant SNR or the average signal-to-noise ratio of link i → E, represent Instant SNR or the average signal-to-noise ratio of link J → D, represent Instant SNR or the average signal-to-noise ratio of link J → E.Wherein i belongs to set of relay nodes C d, C dfor can decoding success forwarding from the set of relay nodes of source node signal.J belongs to interfering nodes set J set, and J ≠ i, interfering nodes set J setby forming as the via node of interfering nodes.When time, represent that " just disturbing " (J is to interference of E) is greater than " negative interference " (J is to interference of D), when state also continues for some time t (t > t 0) time, this node can as interfering nodes; Otherwise this node not can be used as interfering nodes.As interfering nodes set J setwhen changing, relay selection need be re-started.
(1) under the prerequisite of interfering nodes set non-NULL, if use interfering nodes:
C S ( i Y * , J * ) = arg max i &NotEqual; J i &Element; C J &Element; J set { C S ( i , J ) } = arg max i &NotEqual; J i &Element; C J &Element; J set { [ 1 2 log 2 ( 1 + &gamma; i , D W 1 + &gamma; J , D W 1 + 1 + &gamma; i , E W &gamma; J , E W ) ] + } - - - ( 1 )
candidate relay node when using interfering nodes and interfering nodes.Wherein
Due to the uncertainty of eavesdropping node E, and the signal to noise ratio of not all link all can be estimated to obtain, so eavesdropping node can be divided into determine that position eavesdropping node and undefined position eavesdrop node two kinds.For determining position eavesdropping node, with can estimate to obtain; For undefined position eavesdropping node, &gamma; i , E W = E | &gamma; i , E W | = P ( R ) &sigma; 2 , &gamma; J , E W = E | &gamma; J , E W | = P ( J ) &sigma; 2 , Wherein P (R), P (J)be respectively R → E, the through-put power of J → E link, σ 2for white Gaussian noise variance; with still can be obtained by estimation.
(2) if do not use interfering nodes:
C S ( i N * ) = arg max i &Element; C d { C S ( i ) } = arg max i &Element; C d { [ 1 2 log 2 ( 1 + &gamma; i , D W 1 + &gamma; i , E W ) ] + } - - - ( 2 )
it is candidate relay node when not using interfering nodes.For determining position eavesdropping node, can estimate to obtain; For undefined position eavesdropping node, still can be obtained by estimation.
Relay selection algorithm is as follows:
If then use interfering nodes, choose and J *respectively as via node and interfering nodes; If then do not use interference joint, choose as via node.
(2) common collaborative network relay selection.
By estimating to obtain the i-th (i=1,2 ... N d) individual via node to the Instant SNR sample of destination node D link is
The average of this link Instant SNR sample:
v 1 X = &gamma; i , D ( 1 ) + &gamma; i , D ( 2 ) + . . . &gamma; i , D ( n ) n - - - ( 3 )
The variance of this link Instant SNR sample is:
v 2 X = &Sigma; k = 1 n [ &gamma; i , D ( k ) - v 1 X ] 2 n - 1 - - - ( 4 )
The degree of bias of this link Instant SNR sample is:
v 3 X = 1 ( n - 1 ) ( v 2 X ) 3 2 &Sigma; k = 1 n ( &gamma; i , D ( k ) - v 1 X ) 3 - - - ( 5 )
The kurtosis of this link Instant SNR sample is:
v 4 X = 1 ( n - 1 ) ( v 2 X ) 2 &Sigma; k = 1 n ( &gamma; i , D ( k ) - v 1 X ) 4 - - - ( 6 )
Suppose that channel type is φ, estimate channel parameter, method of estimation has implementation method, repeats no more.Mixing gamma distribution is adopted to describe the Instant SNR probability density function of various channel f &phi; ( &gamma; i , D F ) = &Sigma; l = 1 N i , D &alpha; i , D l ( &gamma; i , D F ) &beta; i , D l - 1 e - &xi; i , D l &gamma; i , D F , Wherein, N i,D, for parameter.When this distribution describes different channels, parameter has different expression formulas.Such as, when channel is Rayleigh channel, N i,D=1, wherein for i → D link average signal-to-noise ratio; When channel is Nakagami-m channel, N i, D=1, &alpha; i , D l = m m &Gamma; ( m ) ( &gamma; i , D S ) m , &beta; i , D l = m , &xi; i , D l = m &gamma; i , D S , Wherein m is the channel parameter can estimating to obtain, for i → D link average signal-to-noise ratio.
The Instant SNR average supposing channel model can be obtained according to instant channel signal to noise ratio probability density function and the Instant SNR variance of hypothesis channel model the Instant SNR degree of bias v &phi; , 3 Y = E [ &gamma; i , D F - v &phi; , 1 Y v &phi; , 2 Y ] 3 With Instant SNR kurtosis v &phi; , 4 Y = E [ &gamma; i , D F - v &phi; , 1 Y v &phi; , 2 Y ] 4 . Wherein φ is respectively different channel types, as Rayleigh channel, and K channel, K gwhen channel, η-μ channel, Nakagami channel etc., calculate corresponding respectively with then calculate:
&epsiv; &phi; = [ V 1 X - v &phi; , 1 Y ] 2 v 2 X + 1 2 [ 1 - v &phi; , 2 Y v 2 X ] 2 + 1 6 ( v 3 X - v &phi; , 3 Y ) 2 + 1 24 ( v 4 X - v &phi; , 4 Y ) 2 - - - ( 7 )
ε φless, illustrate that the statistical property of Instant SNR sample is more identical with the statistical property of hypothesis channel φ, so minimum ε φcorresponding hypothesis channel is the actual channel of this link.N i,D, parameter adopts the parameter of this channel model.
Based on the result that channel judges, obtain this link and adopt as follows respectively with outage probability during rapid link self adaptation at a slow speed:
Wherein: M is the progression of M-QAM modulation; it is Gauss-Q function; represent the maximum integer being less than or equal to x; H represents bit number, k represents dimension, l represents the number of Gamma component, l=1 ..., N i,D.
In sum, relay selection algorithm is as follows:
R * = arg min { P out Z ( &gamma; i , D W ) } - - - ( 8 )
R *for selected via node, when link adopts rapid link self adaptation, when link adopts slow speed link self adaptation,
Provide embodiment below in order to effect of the present invention to be described.
(1) relay selection of security cooperation network.
Have 5 via nodes in base station coverage field can receive and forwarding information, be respectively R 1, R 2, R 3, R 4, R 5, destination node is D, and eavesdropping node is E.System is known eavesdropping node location, and each link signal to noise ratio is estimated to obtain by adaptive technique.
Get v 0=10km/h, v 1=60km/h.The screen v of destination node D d=80km/h, eavesdropping node E is stationary node, i.e. v e=0km/h.Due to v d>v 1, each via node is frequent to the link channel change of destination node D, with slow adaptive technique (SAM); Due to v e<v 0, each via node changes infrequently, with fast adaptive technique (FAM) to the link channel of interfering nodes E.
Estimate the signal to noise ratio obtaining i → j link (dB) as follows:
R 1→ D link:
R 2→ D link:
R 3→ D link:
R 4→ D link:
R 5→ D link:
R 1→ E link:
R 2→ E link:
R 3→ E link:
R 4→ E link:
R 5→ E link:
Get t 0=0.1s.
For R 1node, due to then R 1can not as interfering nodes.
For R 2node, due to and the time t of state continuance 2>t 0, then R 2can as interfering nodes.
For R 3node, due to and the time t of state continuance 3>t 0, then R 3can as interfering nodes.
For R 4node, due to then R 4can not as interfering nodes.
For R 5node, due to and the time t of state continuance 5>t 0, then R 5can as interfering nodes.
From the above, can be J as the set of interfering nodes set∈ { R 2, R 3.
Interfering nodes set is nonempty set, when using interfering nodes, and will bring C into s(R, J), secrecy capacity is as follows:
C S(R 1,R 2)=0.3925;
C S(R 1,R 3)=0.3942;
C S(R 2,R 3)=0;
C S(R 3,R 2)=0.3070
C S(R 4,R 2)=0.3390;
C S(R 4,R 3)=0.3552;
C S(R 5,R 2)=0.02.3;
C S(R 5,R 3)=0;
Then ( R * , J * ) = arg max R &NotEqual; J { C S ( R , J ) } = ( R 1 , R 3 ) = 0.3942 , Namely R is chosen respectively 1, R 3for candidate relay node during use interfering nodes and candidate's interfering nodes.
When not using interfering nodes, will bring C into s(R), secrecy capacity is as follows:
C S(R 1)=0.4037;
C S(R 2)=0;
C S(R 3)=0;
C S(R 4)=0.4312;
C S(R 5)=0;
Then namely R is chosen 4for not using candidate relay node during interfering nodes.
Due to max (C s(R 1, R 3), C s(R 4))=C s(R 4), then do not use interfering nodes, choose R 4for via node.
(2) relay selection of common collaborative network.
Have 2 via nodes in base station coverage field can receive and forwarding information, be respectively R 1, R 2.System is known eavesdropping node location, and each link signal to noise ratio is estimated to obtain by adaptive technique.
Get v 0=10km/h, v 1=60km/h.The screen v of destination node D d=80km/h, each via node is frequent variations to the link channel complexity of destination node D, estimates link signal to noise ratio with SAM.Each via node obtains n sample to the signal to noise ratio of destination node, composition stochastic variable (dB) as follows:
(1) R 1→ D link:
R 1the average of → D link signal to noise ratio sample, variance, the degree of bias and kurtosis as follows:
v 1 X 1 = 984.5834 ;
v 2 X 1 = 902580 ;
v 3 X 1 = 1.0098 ;
v 4 X 1 = 2.8231 .
Rayleigh channel average, variance, the degree of bias and kurtosis as follows:
Then ε rayleigh=0.0107.
Estimate obtain Rice factor n=8, Rice channel average, variance, the degree of bias and kurtosis as follows:
Then ε lai Si=0.8659.
Then ε rayleigh< ε lai Si, channel is Rayleigh channel, so N=1, outage probability P out , R 1 SAM = 0.0054 .
(2) R 2→ D link:
R 2the average of → D link signal to noise ratio sample, variance, the degree of bias and kurtosis as follows:
v 1 X 2 = 1142 ;
v 2 X 2 = 1213000 ;
v 3 X 2 = 1.0882 ;
v 4 X 2 = 2.8966 .
Rayleigh channel average, variance, the degree of bias and kurtosis as follows:
Then ε rayleigh=0.0369.
Estimate obtain Rice factor n=8, Rice channel average, variance, the degree of bias and kurtosis as follows:
Then ε lai Si=1.0199.
Then ε rayleigh< ε lai Si, channel model adopts Rayleigh channel model.Get N=1, outage probability P out , R 2 SAM = 0.0047 .
then R * = arg min { P out Z ( &gamma; i , D W ) } = R 2 , Namely R is selected 2as relaying.

Claims (4)

1., based on the relay selection method that fast, slow speed link self adaptation merge, described method comprises:
The relay selection of safe decoding forward collaboration network;
The relay selection of common collaborative network;
The relay selection of described safe decoding forward collaboration network, comprises the steps:
(1) choose two via nodes, a via node R is used for normal transmission data, and another node J is as interfering nodes;
(2) under the prerequisite of interfering nodes set non-NULL, if use interfering nodes, then:
C S ( i Y * , J * ) = arg max i &NotEqual; J i &Element; C d J &Element; J set { C S ( i , J ) } = arg max i &NotEqual; J i &Element; C d J &Element; J set { 1 2 log 2 ( 1 + &gamma; i , D W 1 + &gamma; J , D W 1 + 1 + &gamma; i , E W &gamma; J , E W ) } ;
If do not use interfering nodes, then:
C S ( i N * ) = arg max i &Element; C d { C S ( i ) } = arg max i &Element; C d { 1 2 log 2 ( 1 + &gamma; i , D W 1 + &gamma; i , E W ) }
Wherein: j *candidate relay node when using interfering nodes and interfering nodes respectively; it is candidate relay node when not using interfering nodes; represent Instant SNR or the average signal-to-noise ratio of link between node i to destination node D; represent Instant SNR or the average signal-to-noise ratio of link between node i to eavesdropping node E; represent Instant SNR or the average signal-to-noise ratio of link between interfering nodes j to destination node D; represent Instant SNR or the average signal-to-noise ratio of link between interfering nodes j to eavesdropping node E; I belongs to set of relay nodes C d, C dfor can decoding success forward from the set of relay nodes of source node signal; Interfering nodes J belongs to interfering nodes set J set, and J ≠ i, interfering nodes set J setby forming as the via node of interfering nodes;
(3) if max ( C S ( i Y * , J * ) , C S ( i N * ) ) = C S ( i Y * , J * ) , Then use interfering nodes, and choose and J *respectively as via node and interfering nodes; If then do not use interfering nodes, and choose as via node.
2. method according to claim 1, the determination principle of wherein said interfering nodes: when being in state when continuing for some time t, t > t 0, t 0for time set point, this node can as interfering nodes; Otherwise this node not can be used as interfering nodes.
3. method according to claim 1, the relay selection of described common collaborative network, comprises the steps: that (1) obtains the i-th (i=1,2...N by estimation d) individual via node to the Instant SNR sample of destination node D link is ask for the average of this link Instant SNR sample respectively variance the degree of bias and kurtosis
(2) suppose that this link channel type is φ, estimate channel parameter, the Instant SNR probability density function of all kinds channel f &phi; ( &gamma; i , D F ) = &Sigma; l = 1 N i , D &alpha; i , D l ( &gamma; i , D F ) &beta; i , D l - 1 e - &xi; i l , &gamma; i , D F , Wherein, N i,D, for describing parameter during different channels type; Obtain supposing that channel type is the average of the channel Instant SNR of φ according to Instant SNR probability density function variance the degree of bias and kurtosis
(3) calculate:
&epsiv; &phi; = [ v 1 X - v &phi; , 1 Y ] 2 v 2 X + 1 2 [ 1 - v &phi; , 2 Y v 2 X ] 2 + 1 6 ( v 3 X - v &phi; , 3 Y ) 2 + 1 24 ( v 4 X - v &phi; , 4 Y ) 2 ;
Minimum ε φcorresponding hypothesis channel type is the actual channel type of this link, and determines channel parameter N i,D, with
(4) outage probability during this link employing slow speed link self adaptation:
This link adopts outage probability during rapid link self adaptation:
Wherein: M is the progression of M-QAM modulation; it is Gauss-Q function; represent the maximum integer being less than or equal to x; H represents bit number, k represents dimension, l represents the number of Gamma component, l=1..., N i,D;
(5) basis select via node; Wherein: R *for selected via node; When link adopts rapid link self adaptation, when link adopts slow speed link self adaptation, P out Z ( &gamma; i , D W ) = P out SAM ( &gamma; i , D S ) .
4. the method according to claim 1 or 2 or 3, described method also comprises choice for use fast or the principle of slow speed link adaptive technique, and described principle is as follows:
(1) υ is worked as d≤ υ 0time, judge that this link channel conditions is non-frequent variations, be suitable for rapid link adaptive technique;
(2) υ is worked as 0< υ d≤ υ 1time, judge that this link channel conditions is common variation, link circuit self-adapting mode corresponding when making channel security capacity maximum choose the prerequisite only changing link circuit self-adapting mode in security cooperation network under; Link circuit self-adapting mode corresponding when making outage probability minimum choose the prerequisite only changing link circuit self-adapting mode in common collaborative network under;
(3) υ is worked as d> υ 1time, judge that this link channel conditions is frequent variations, adopt slow speed link adaptive technique; Wherein: υ dfor node motion speed; υ 0be the first thresholding speed, 10km/h≤υ 0≤ 30km/h; υ 1be the second thresholding speed, 40km/h≤υ 1≤ 60km/h.
CN201510071665.6A 2015-02-11 2015-02-11 The relay selection method adaptively merged based on fast, slow speed link Expired - Fee Related CN104703246B (en)

Priority Applications (1)

Application Number Priority Date Filing Date Title
CN201510071665.6A CN104703246B (en) 2015-02-11 2015-02-11 The relay selection method adaptively merged based on fast, slow speed link

Applications Claiming Priority (1)

Application Number Priority Date Filing Date Title
CN201510071665.6A CN104703246B (en) 2015-02-11 2015-02-11 The relay selection method adaptively merged based on fast, slow speed link

Publications (2)

Publication Number Publication Date
CN104703246A true CN104703246A (en) 2015-06-10
CN104703246B CN104703246B (en) 2018-05-08

Family

ID=53349920

Family Applications (1)

Application Number Title Priority Date Filing Date
CN201510071665.6A Expired - Fee Related CN104703246B (en) 2015-02-11 2015-02-11 The relay selection method adaptively merged based on fast, slow speed link

Country Status (1)

Country Link
CN (1) CN104703246B (en)

Citations (3)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
US20070165581A1 (en) * 2006-01-17 2007-07-19 Mehta Neelesh B Method and system for communicating in cooperative relay networks
CN103702322A (en) * 2013-12-11 2014-04-02 西安交通大学 Physical layer security transmission method for resisting sniffing of unreliable relay nodes
CN103716853A (en) * 2013-10-22 2014-04-09 南京邮电大学 Self-adaption multiple-relay selection method in terminal through communication system

Patent Citations (3)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
US20070165581A1 (en) * 2006-01-17 2007-07-19 Mehta Neelesh B Method and system for communicating in cooperative relay networks
CN103716853A (en) * 2013-10-22 2014-04-09 南京邮电大学 Self-adaption multiple-relay selection method in terminal through communication system
CN103702322A (en) * 2013-12-11 2014-04-02 西安交通大学 Physical layer security transmission method for resisting sniffing of unreliable relay nodes

Non-Patent Citations (1)

* Cited by examiner, † Cited by third party
Title
陈甄,肖琨,张毅: "基于负荷平衡的混合式中继选择新算法", 《电讯技术》 *

Also Published As

Publication number Publication date
CN104703246B (en) 2018-05-08

Similar Documents

Publication Publication Date Title
Rasheed et al. Sparse delay-Doppler channel estimation in rapidly time-varying channels for multiuser OTFS on the uplink
Arumugam et al. Keyless covert communication over multiple-access channels
Ejaz et al. Distributed cooperative spectrum sensing in cognitive radio for ad hoc networks
Hyadi et al. Performance analysis of underlay cognitive multihop regenerative relaying systems with multiple primary receivers
CN105636216B (en) Based on throughput-maximized robust power distribution method
Sun et al. Performance analysis of dual-hop wireless systems over mixed FSO/RF fading channel
CN102238116A (en) Pilot frequency sequence generation method and system
CN102752080A (en) Anti-eavesdrop coding method based on physical layer
Wang et al. Interference hypergraph-based resource allocation (IHG-RA) for NOMA-integrated V2X networks
Lim et al. Impact of outdated CSI on the secure communication in untrusted in-band full-duplex relay networks
Jaiswal et al. On the performance of NOMA-enabled V2V communications under joint impact of nodes mobility and channel estimation error
CN105898759B (en) Resource allocation methods based on SCMA multiple access access mechanism
Wang et al. On the physical layer security in large scale cellular networks
CN106921932A (en) The method and apparatus that information in wireless communication system sends and auxiliary information sends
CN104703246A (en) Quick and slow link adaptive fusion based relay selection method
CN112312390B (en) Neighbor discovery method and system
Kim et al. Performance analysis of adaptive decode-and-forward cooperative single-carrier systems
Watanabe et al. Poster: A scheduling method for V2V networks using successive interference cancellation
Le et al. Cooperative NOMA: device-to-device mode and outage performance analysis
Dong et al. Bi-directional cooperative relays for transmitted reference pulse cluster UWB systems
Hu et al. Maximizing end-to-end throughput of interference-limited multihop networks
Song et al. System design, DMT analysis, and penalty for non-coherent relaying
da Silva et al. Physical Layer Security Techniques Applied to Vehicle-to-Everything Networks
Sung Cooperative spectrum sensing for cognitive radio with multiple secondary users
Chatterjee et al. On optimized decode and forward relay assisted CR system design for throughput maximization

Legal Events

Date Code Title Description
C06 Publication
PB01 Publication
C10 Entry into substantive examination
SE01 Entry into force of request for substantive examination
GR01 Patent grant
GR01 Patent grant
CF01 Termination of patent right due to non-payment of annual fee
CF01 Termination of patent right due to non-payment of annual fee

Granted publication date: 20180508

Termination date: 20200211