CN101729206B - Conflict detection-based method for separating the threshold selection and cooperation conflict of detector - Google Patents

Abstract

The invention discloses a conflict detection-based method for separating the threshold selection and cooperation conflict of a detector, which is characterized in that in a small-sized time slot multiple access network transmitted by relay aid, firstly, forecasting the substantial output of a network according to the number of network users, packet sending probability of users, detection probability and false-alarm probability, obtaining the reciprocal relationship between the detection probability and the false-alarm probability by extremum operation to further obtain the optimal detector threshold; secondly, detecting conflict orders and active users according to time slots by a destination end, and notifying a judgment result to all network users by a control channel; and finally, determining the length of transmission time interval of data packets by the system according to the judgment result, and selecting corresponding trunk node aiding information source to transmit data packets, thereby realizing the separation of conflict data packets at the destination end by a sub-optimal linear solution.

Description

Select and cooperation conflict separation method based on the detector thresholding of collision detection

Technical field

The present invention relates to the small-sized time slot multi-access network of the auxiliary transmission of relaying; And the reception of carrying out the colliding data bag simultaneously with separate; Particularly a kind of detector thresholding based on collision detection is selected and cooperation conflict separation method, belongs to network service and signal processing technology field.

Background technology

In wireless network; A large amount of uncertain channel variation; Uneven traffic carrying capacity, radio node move that caused network configuration changes and to the requirement of broadband high-speed rate communication etc., communication system optimization and network design under the existence conditions have been constituted significant challenge.This challenge require we examine closely again existing network each assembly (insert from physical layer design to the MAC layer and the routing of route layer, from information source be compressed to chnnel coding and modulation, from the circuit stages resource allocation to the network level resource allocation) design philosophy and method.In the face of above-mentioned challenge, cause people's great interest thereby in recent years signal processing technology is introduced the performance that network effectively improves wireless network.Many bags based on conflict resolution receive (Multiple Packet Reception; MPR) the technology multiple access of examining closely the access network at random from a new angle inserts problem; Be converted into the Signal Separation problem to the conflict resolution in the network and solve, utilize signal processing technology and Internet resources to solve the collision problem in the network jointly.Its basic thought is exactly to make network node have the function that receives a plurality of user data package simultaneously and they are effectively separated, rather than simply a plurality of packets that arrive simultaneously is used as conflict and all abandons.Node wraps the introducing of receiving ability more, will bring new opportunities and challenges to the design of procotol, improves the throughput and the transmission wait time delay that reduces packet of whole network effectively, for realizing that the new generation of wireless wide-band communication system has great importance.

It is a kind of new method of using signal processing technology to solve data packet collisions problem in the wireless slotted random access network that the network assistance that people such as Tsatsanis propose divides the collection multiple access to insert (NDMA, Network-assisted DiversityMultiple Access) mechanism.This method utilizes Internet resources to obtain diversity performance, and adopts the method for Signal Separation to recover the colliding data bag, and this is at first signal processing to be combined with the network organizing technology, to improve the method for network performance.Yet NDMA mechanism causes its performance to receive the very big restriction of radio channel state for the dependence that retransmits.

Collaboration diversity is as a kind of new model of space diversity, gets more and more people's extensive concerning once occurring.Its basic thought is the formal construction " virtual multi-antenna array " through shared antenna and other Internet resources between the multi-user, and produces the certain space diversity gain of cooperation acquisition through distributed treatment.Lin Rui and A.P.Petropulu etc. combine collaboration diversity with NDMA mechanism, proposed a kind of MAC agreement of high-throughput---ALLIANCES mechanism, and for the many bags receptions that solve under the WLAN decline state provide new way.

In above-mentioned two mechanism; In case conflict takes place; Destination needs collisions exponent number and active user collection (user that promptly conflicts set) to adjudicate, and this moment, the thresholding selection of detector was most important, and the general further exerts an influence with separating to the conflict bag re-transmission of system.All based on the correct hypothesis that detects of conflict exponent number total energy quilt, in fact, the mistaken verdict of destination very likely takes place the conclusion of NDMA and ALLIANCES mechanism.Be the performance of accurate assessment, must consider nonideal collision detection and, but do not see relevant report at present as yet the influence of systematic function based on many packet receivers of cooperation system of NDMA.

Summary of the invention

The objective of the invention is deficiency to existing many bag method of reseptances in the small-sized time slot multi-access network of supporting the auxiliary transmission of relaying; Propose a kind of method of separating, thereby improve many bags receptivity of wireless communication system effectively based on the selection of detector thresholding and the cooperation conflict of collision detection.Its advantage is: on the one hand, utilize many bags receiving ability of node to solve unavoidable data packet collisions problem in traditional random access protocol; On the other hand, utilize the transfer capability of relaying to reduce the re-transmission failure that causes because of the intrinsic fading characteristic of wireless channel and further solve the detector thresholding selection problem that relates to when the collisions exponent number detects and adjudicates with the active user collection.

For realizing above-mentioned purpose; The invention provides a kind of selection of detector thresholding and cooperation conflict separation method based on collision detection; This method has been broken the ideal hypothesis that conflict exponent number total energy is correctly detected in traditional NDMA mechanism and the ALLIANCES mechanism; In cooperation conflict separation mechanism; The detector thresholding selects to take into account desirable collision detection and two kinds of situation of imperfect collision detection; According to network user's number; User's the probability of giving out a contract for a project; Detection probability and false-alarm probability are predicted the potential handling capacity of network; By asking the extreme value computing to obtain the optimum derivative relation between detection probability and false-alarm probability, and then try to achieve optimum detector thresholding; Then, destination detects at conflict time slot collisions exponent number and active user collection according to this optimum thresholding, and by control channel court verdict is notified to the all-network user; System selects the auxiliary information source of corresponding relay node to carry out the transmission of packet, and then realizes the separation of colliding data bag at destination according to this specified data bag when transmission segment length as a result.

Technical scheme of the present invention is following: select and cooperation conflict separation method based on the detector thresholding of collision detection, it is characterized in that:

(1) at first; The probability of giving out a contract for a project, detection probability and false alarm probability according to network user's number, user are predicted the potential throughput of network; Potential throughput is defined as in the potential unit time slot can successful data recovered bag; Through asking the extreme value computing to obtain the derivative relation between detection probability and false alarm probability, and then try to achieve the detector thresholding, step is following:

To be user buffer be empty probability zero hour period in transmission to definition Pe, when K user when conflicting time slot collision, its binary expression is following:

$P\left(K\right)=\left(\begin{array}{c}J\\ K\end{array}\right){(1-\mathrm{Pe})}^K{\mathrm{Pe}}^{J-K},K=\mathrm{0,1},\·\·\·,J---\left(1\right)$

Wireless channel is modeled as the Rayleigh flat fading channel

Wherein, phase place

[0,2 π) go up and obey evenly distribution; Amplitude A _Ij(n) Rayleigh distributed, variance are 2 σ _A ²A _Ij(n) and

Separate, channel is obeyed independent same distribution, noise w between all users _r(n) be modeled as the white gaussian variable of incoherent return-to-zero average, variance is σ _v ²

False alarm probability P _FBe expressed as:

$P_F={\∫}_T^{\∞}\frac{x}{{\mathrm{\σ}}_v^2}\exp (-\frac{x^2}{2{\mathrm{\σ}}_v^2})\mathrm{dx}=\exp (-\frac{T^2}{2{\mathrm{\σ}}_v^2})---\left(3\right)$

Detection probability P _DBe expressed as:

$P_D={\∫}_T^{\∞}\frac{x}{{\mathrm{\σ}}_v^2+{\mathrm{\σ}}_A^2}\exp (-\frac{x^2}{2({\mathrm{\σ}}_v^2+{\mathrm{\σ}}_A^2)})\mathrm{dx}=\exp (-\frac{T^2}{2({\mathrm{\σ}}_v^2+{\mathrm{\σ}}_A^2)})---\left(4\right)$

Making m represent can be by the quantity of correct detected information source node; N representes by false-alarm to be the idle node quantity of active node; Correspondingly, the conflict exponent number that is detected

equals m+n.When K-m information source omission, n free subscriber by the probability of false-alarm is:

$P_{\det \mathrm{ect}}(m,n)=\left(\begin{array}{c}K\\ m\end{array}\right){\left(P_D\right)}^m{(1-P_D)}^{K-m}\left(\begin{array}{c}J-K\\ n\end{array}\right){\left(P_F\right)}^n{(1-P_F)}^{J-K-n}---\left(5\right)$

Wherein, 0≤m≤K, 0≤n≤J-K.Therefore, all correct probability that detects promptly correctly detects all active users (m=K), and no free subscriber is shown by the probability tables of false-alarm (n=0):

P _detect(K，0)＝P _D ^K(1-P _F) ^J-K (6)

Correspondingly, the lengths table of transmission period is shown:

$L(K,m,n)=\left\{\begin{array}{cccc}m+n,& 0\≤m\≤K,& 0\≤n\≤J-K,& m+n\≠0\\ 1,& m=0& \mathrm{and}& n=0\end{array}\right.---\left(7\right)$

When K information source conflict, the average length of transmission period is expressed as:

$\stackrel{\‾}{L}\left(K\right)=\underset{m=0}{\overset{K}{\mathrm{\Σ}}}\underset{n=0}{\overset{J-K}{\mathrm{\Σ}}}{P}_{\det \mathrm{ect}}(m,n)L(K,m,n)={\mathrm{KP}}_D+(J-K)P_F+{(1-P_D)}^K{(1-P_F)}^{J-K}---\left(8\right)$

The average length of transmission period is expressed as:

$\stackrel{\‾}{L}=\underset{K=0}{\overset{J}{\mathrm{\Σ}}}P\left(K\right)\stackrel{\‾}{L}\left(K\right)={\mathrm{JP}}_F+J(1-\mathrm{Pe})(P_D-P_F)+{[(1-\mathrm{Pe})(1-P_D)+\mathrm{Pe}(1-P_F)]}^J---\left(9\right)$

The assessment of potential throughput has two kinds of situation:

A) situation 1: when potential throughput is assessed; Each mistaken verdict of hypothesis goal end all will cause transmitting losing of last all packets of period; Therefore, only when destination was made right-on judgement, the transmission period was only useful; On the useful transmission period, K packet can be by correct recovery at most.At this moment, average potential recoverable bag is expressed as:

${\stackrel{\‾}{N}}_1=\underset{K=0}{\overset{J}{\mathrm{\Σ}}}\mathrm{KP}\left(K\right)P_{\det \mathrm{ect}}(K,0)=J(1-\mathrm{Pe})P_D{[(1-\mathrm{Pe})P_D+\mathrm{Pe}(1-P_F)]}^{J-1}---\left(10\right)$

Potential throughput under the situation 1 is expressed as

${\mathrm{PTP}}_1=\frac{{\stackrel{\‾}{N}}_1}{\stackrel{\‾}{L}}---\left(11\right)$

B) situation 2: under this hypothesis, under the situation of destination mistake in judgment, still have some conflicting data bag fortunately to be detected.When K-m information source omission, there be m information source correctly to recover at the most.At this moment, average potential recoverable bag is expressed as

${\stackrel{\‾}{N}}_2=\underset{K=0}{\overset{J}{\mathrm{\Σ}}}P\left(K\right)\underset{m=0}{\overset{K}{\mathrm{\Σ}}}\underset{n=0}{\overset{J-K}{\mathrm{\Σ}}}m{P}_{\det \mathrm{ect}}(m,n)=J(1-\mathrm{Pe})P_D---\left(12\right)$

Potential throughput under the situation 2 is expressed as

${\mathrm{PTP}}_2=\frac{{\stackrel{\‾}{N}}_2}{\stackrel{\‾}{L}}---\left(13\right)$

Take into account above-mentioned two kinds of situation, potential throughput is expressed as

PTP＝δ·PTP ₁+(1-δ)·PTP ₂ (14)

Wherein, δ is a constant, 0≤δ≤1;

Selecting initial value δ, is objective function optimization detector thresholding with potential throughput, order

$\frac{\mathrm{dPTP}}{d{P}_F}=0---\left(15\right)$

Can get

$\frac{d{P}_D}{d{P}_F}=\frac{\mathrm{\δ}(J-1)\mathrm{Pe}{P}_D{I_2}^{J-2}(J-J{I}_1+{I_1}^J)+\mathrm{JPe}{P}_D(1-{I_1}^{J-1})[\mathrm{\δ}{I_2}^{J-1}+(1-\mathrm{\δ})]}{[\mathrm{\δ}{I_2}^{J-2}{I}_3+(1-\mathrm{\δ})](J-J{I}_1+{I_1}^J)-J(1-\mathrm{Pe})P_D(1-{I_1}^{J-1})[\mathrm{\δ}{I_2}^{J-1}+(1-\mathrm{\δ})]}---\left(16\right)$

Wherein, I ₁=(1-Pe) (1-P _D)+Pe (1-P _F), I ₂=(1-Pe) P _D+ Pe (1-P _F), I ₃=Pe (1-P _F)+JP _D(1-Pe).

Under the high s/n ratio situation, P _D≈ 1, P _F≈ 0, (1-P _F)/P _D≈ 1, and formula (16) is reduced to:

$\frac{d{P}_D}{d{P}_F}=\frac{\mathrm{\δ}(J-1)\mathrm{Pe}(J-\mathrm{JPe}+{\mathrm{Pe}}^J)+\mathrm{JPe}(1-{\mathrm{Pe}}^{J-1})}{\left\{\mathrm{\δ}\right[\mathrm{Pe}+J(1-\mathrm{Pe})]+(1-\mathrm{\δ})\}(J-\mathrm{JPe}+{\mathrm{Pe}}^J)-J(1-\mathrm{Pe})(1-{\mathrm{Pe}}^{J-1})}=\mathrm{\β}---\left(17\right)$

From formula (3) and formula (4), can get:

P _D＝P _F ^1/1+SNR， $\mathrm{SNR}=\frac{{\mathrm{\σ}}_A^2}{{\mathrm{\σ}}_v^2}---\left(18\right)$

$\frac{d{P}_D}{d{P}_F}=\frac{1}{1+\mathrm{SNR}}{P_F}^{-\mathrm{SNR}/(1+\mathrm{SNR})}---\left(19\right)$

From formula (18) and formula (19), can get:

P _F，opt＝[(1+SNR)β] ^-(1+SNR)/SNR (20)

Can get the detector thresholding according to formula (3) and formula (20) is:

$T_{\mathrm{opt}}=\sqrt{-2{\mathrm{\σ}}_v^2\log \left[P_{F,\mathrm{opt}}\right]}=\sqrt{2{\mathrm{\σ}}_v^2\frac{1+\mathrm{SNR}}{\mathrm{SNR}}\log \left[(1+\mathrm{SNR})\mathrm{\β}\right]}---\left(21\right);$

(2) after information source is sent packet; Destination carries out collision detection according to the detector thresholding of trying to achieve to receiving packet; In case conflict is detected, destination is adjudicated collisions exponent number and active user collection, by control channel court verdict is notified to the all-network user then;

(3) be the linearity that obtains collision signal duplicate independently; System gets into the auxiliary retransmission time period of relaying; The conflict exponent number that the length of retransmission time period equals to be detected subtracts 1; A node is elected to be relaying randomly and is retransmitted the signal that it receives at the conflict time slot; The auxiliary retransmission time period one of relaying finishes; The broadcast channel control bit of just resetting is ended current re-transmission and transmission that all are relevant;

(4) destination all colliding data bags of utilizing the linear solution butt joint of suboptimum to receive are united and are unpacked, and realize that many bags separate.When conflict exponent number K and active user collection S (n) are correctly detected, $\hat{K}=K$ And $\hat{S}\left(n\right)=S\left(n\right).$ Make the transmission signal indication of source node do $X={[x_{i_1}^T\left(n\right),x_{i_2}^T\left(n\right),\·\·\·,x_{i_K}^T\left(n\right)]}^T,$ Make the reception signal indication of destination do $Z={[z_d^T\left(n\right),z_d^T(n+1),\·\·\·,z_d^T(n+K-1)]}^T,$ Z wherein _d(n)=y _d(n), the matrix form that then receives signal is expressed as Z=HX+W, and wherein, H representes channel coefficients between source node and destination, can detect through active user to obtain estimating that W representes noise matrix.When many bags separated, when the channel matrix full rank, the linear solution of suboptimum capable of using realized the separation of colliding data bag, promptly $\hat{X}=H^{-1}Z,$ And obtain and initial value δ corresponding real-time network goodput ATP;

(5) result of above-mentioned steps (4) is exported to the renewal of coefficient δ; Its process is the iteration to coefficient δ different values in the scope of 0≤δ≤1 in the formula (14); Repeating step (1)-(4) finally obtain formula (21) result and are the goodput ATP of optimum detector thresholding with the network of correspondence.

In the above-mentioned steps (3): make arbitrary node i in the network that (1≤i≤J) packet in conflict time slot n transmission is expressed as x _i(n)=[x _{I, 0}(n) ... X _{I, M-1}(n)], each packet comprises M symbol, and the transmitted power of each symbol is σ _x ²Destination receives signal

$y_r\left(n\right)=\underset{i\∈S\left(n\right)}{\mathrm{\Σ}}{a}_{\mathrm{ir}}\left(n\right)x_i\left(n\right)+w_r\left(n\right),$ r∈{d}∪L(n)， $r\∉S\left(n\right)---\left(22\right)$

Time slot n+k, $1\≤k\≤\hat{K}-1,$ A node is chosen as relaying at random, and retransmits it at the signal y (n) of time slot that conflicts.At this moment, reception signal indication in destination place does

z _d(n+k)＝a _rd(n+k)c(n+k)y(n)+w _d(n+k)，r∈R(n) (23)

Wherein $R\left(n\right)=\{r_1,\·\·\·,r_{\hat{K}-1}\}$ Be the via node set; a _Rd(n) be channel coefficients between r via node and destination; w _d(n+k) be noise vector; C (n+k) is a normalization coefficient.If $r\∉S\left(n\right),$ Be that relaying itself is not a source node, y (n)=y then _r(n), $c(n+k)=\sqrt{{\mathrm{\σ}}_x^2/(\hat{K}{\mathrm{\σ}}_x^2{\mathrm{\σ}}_a^2+{\mathrm{\σ}}_v^2)},$ Wherein ${\mathrm{\σ}}_a^2={\mathrm{\σ}}_A^2;$ If r ∈ S (n), promptly relaying itself is exactly a source node, then y (n)=x _r(n), c (n+k)=1.

When above-mentioned optimum detector thresholding obtained, the iteration selection course of coefficient δ was following in the formula (14):

(1) initial value of coefficient δ is made as 0, at this moment PTP=PTP ₂

(2) try to achieve corresponding thresholding and realization conflict separation, more real-time goodput ATP and potential throughput, calculate | PTP-ATP| ²

(3) update coefficients δ makes δ=δ+Δ δ, and wherein above-mentioned steps (2) is repeated in Δ δ=1/J and 0≤δ≤1;

(4) repeat above-mentioned steps (2), (3); Find and make real-time goodput and the most approaching coefficient δ of potential throughput; When promptly satisfying

, formula (21) result is the optimum detector thresholding.

Advantage of the present invention and remarkable result: the present invention introduces collision detection in the auxiliary many packet receivers system of relaying, has broken the correct hypothesis that detects of conflict exponent number total energy quilt in existing NDMA and the ALLIANCES mechanism.Desirable collision detection and imperfect conflict check system Effect on Performance have been taken all factors into consideration in the mathematical analysis of systematic function-potential throughput; And worst case and best-case when having taken into account potential throughput evaluation; Thereby be that a kind of systematic function that more meets the practical communication situation is estimated; Can obtain more accurate optimum detector thresholding in view of the above, and then obtain than NDMA mechanism and the better throughput performance of time slot A LOHA mechanism.

Description of drawings:

Fig. 1 is the flow chart of the inventive method;

Fig. 2 is that three users' colliding data bag retransmits sketch map.

Embodiment

Below in conjunction with accompanying drawing and embodiment the present invention is described further.

Referring to Fig. 1,2; The detector thresholding confirm to comprise two steps: the 1. mathematical analysis of potential throughput: utilize potential throughput on the conflict time slot to substitute throughput and predict the throughput performance on the whole transmission period, defining potential throughput and be can successful data recovered bag in the potential unit time slot.Number of users Network Based, user's the probability of giving out a contract for a project, detection probability and false-alarm probability predicted the potential handling capacity of network, specifically divides two kinds of situation to predict, and the handling capacity of predicting under two kinds of situation is carried out linear combination.2. the selection of detector thresholding: obtain the derivative relation between detection probability and false alarm probability through asking the extreme value computing, and then try to achieve the detector thresholding according to the functional relation between detection probability and the false alarm probability.

The transmission of colliding data bag: K of supposition wraps in time slot n and clashes; The court verdict of the expression conflict exponent number K that makes

,

expression active user collection user that promptly conflicts collects the court verdict of S (n).Under destination court verdict

and

; For recovering individual colliding data bag, the auxiliary retransmission time period length of relaying is fixed as individual time slot.At time slot n+k, $1\≤k\≤\hat{K}-1,$ A node is selected as relaying, if this node is non-information source relaying, then retransmits the collision signal that it receives at the conflict time slot; If this node is the information source relaying, then retransmit the packet that it produces at the conflict time slot.

The separation of colliding data bag: the packet that on receiving terminal will conflict packet that time slot receives and the auxiliary retransmission time period of relaying, will receive carries out combined decoding.Channel coefficient matrix can detect through active user and obtain estimating.When the channel matrix full rank, the linear solution of suboptimum capable of using realizes the separation of colliding data bag.

Iteration according to coefficient δ in the formula (14) is selected; In the scope of 0≤δ≤1, find and make real-time goodput and the most approaching coefficient δ of potential throughput; When promptly satisfying

; Be the optimum detector thresholding; With the detector thresholding of the square frame 1 among optimum detector thresholding replacement Fig. 1, proceed follow-up square frame step by Fig. 1 then, realize best many bags separating effect at last.

Claims (3)

1. select based on the detector thresholding of collision detection and cooperation conflict separation method, it is characterized in that:

(1) at first; Count J, user's the probability of giving out a contract for a project, detection probability and false alarm probability predicts the potential throughput of network according to the network user; Through asking the extreme value computing to obtain the derivative relation between detection probability and false alarm probability, and then try to achieve the detector thresholding, step is following:

To be user buffer be empty probability zero hour period in transmission to definition Pe, when K user when conflicting time slot collision, its binary expression is following:

$P\left(K\right)=\left(\begin{array}{c}J\\ K\end{array}\right){(1-\mathrm{Pe})}^K{\mathrm{Pe}}^{J-K},K=0.1.....J---\left(1\right)$

With the wireless channel a between i user and j user _Ij(n) be modeled as the Rayleigh flat fading channel,

Wherein, phase place [0,2 π) go up and obey evenly distribution; Amplitude A _Ij(n) Rayleigh distributed, variance does

A _Ij(n) and

Separate, channel is obeyed independent same distribution, noise w between all users _r(n) be modeled as the white gaussian variable of incoherent return-to-zero average, variance does

False alarm probability P _FBe expressed as:

$P_F={\∫}_T^{\∞}\frac{x}{{\mathrm{\σ}}_v^2}\exp (-\frac{x^2}{2{\mathrm{\σ}}_v^2})\mathrm{dx}=\exp (-\frac{T^2}{2{\mathrm{\σ}}_v^2})---\left(3\right)$

Detection probability P _DBe expressed as:

$P_D={\∫}_T^{\∞}\frac{x}{{\mathrm{\σ}}_v^2+{\mathrm{\σ}}_A^2}\exp (-\frac{x^2}{2({\mathrm{\σ}}_v^2+{\mathrm{\σ}}_A^2)})\mathrm{dx}=\exp (-\frac{T^2}{2({\mathrm{\σ}}_v^2+{\mathrm{\σ}}_A^2)})---\left(4\right)$

Making m represent can be by the quantity of correct detected information source node; N representes by false-alarm to be the idle node quantity of active node; Correspondingly, the conflict exponent number that is detected

equals m+n.When K-m information source omission, n free subscriber by the probability of false-alarm is:

$P_{\det \mathrm{ect}}(m,n)=\left(\begin{array}{c}K\\ m\end{array}\right){\left(P_D\right)}^m{(1-P_D)}^{K-m}\left(\begin{array}{c}J-K\\ n\end{array}\right){\left(P_F\right)}^n{(1-P_F)}^{J-K-n}---\left(5\right)$

Wherein, 0≤m≤K, 0≤n≤J-K.Therefore, all correct probability that detects promptly correctly detects all active users (m=K), and no free subscriber is shown by the probability tables of false-alarm (n=0):

P _detect(K，0)＝P _D ^K(1-P _F) ^J-K (6)

Correspondingly, the lengths table of transmission period is shown:

$L(K,m,n)=\left\{\begin{array}{cc}m+n,& 0\≤m\≤K,0\≤n\≤J-K,m+n\≠0\\ 1,& m=0\mathrm{andn}=0\end{array}\right.---\left(7\right)$

When K information source conflict, the average length of transmission period is expressed as:

$\stackrel{\‾}{L}\left(K\right)=\underset{m=0}{\overset{K}{\mathrm{\Σ}}}\underset{n=0}{\overset{J-K}{\mathrm{\Σ}}}{P}_{\det \mathrm{ect}}(m,n)L(K,m,n)={\mathrm{KP}}_D+(J-K)P_F+{(1-P_D)}^K{(1-P_F)}^{J-K}---\left(8\right)$

The average length of transmission period is expressed as:

$\stackrel{\‾}{L}=\underset{K=0}{\overset{J}{\mathrm{\Σ}}}P\left(K\right)\stackrel{\‾}{L}\left(K\right)={\mathrm{JP}}_F+J(1-\mathrm{Pe})(P_D-P_F)+{[(1-\mathrm{Pe})(1-P_D)+\mathrm{Pe}(1-P_F)]}^J---\left(9\right)$

The assessment of potential throughput has two kinds of situation:

A) situation 1: when potential throughput is assessed; Each mistaken verdict of hypothesis goal end all will cause transmitting losing of last all packets of period; Therefore, only when destination was made right-on judgement, the transmission period was only useful; On the useful transmission period, K packet can be by correct recovery at most.At this moment, average potential recoverable bag is expressed as:

${\stackrel{\‾}{N}}_1=\underset{K=0}{\overset{J}{\mathrm{\Σ}}}\mathrm{KP}\left(K\right)P_{\det \mathrm{ect}}(K,0)=J(1-\mathrm{Pe})P_D{[(1-\mathrm{Pe})P_D+\mathrm{Pe}(1-P_F)]}^{J-21}---\left(10\right)$

Potential throughput under the situation 1 is expressed as

${\mathrm{PTP}}_1=\frac{{\stackrel{\‾}{N}}_1}{\stackrel{\‾}{L}}---\left(11\right)$

B) situation 2: under this hypothesis, under the situation of destination mistake in judgment, still have some conflicting data bag fortunately to be detected.When K-m information source omission, there be m information source correctly to recover at the most.At this moment, average potential recoverable bag is expressed as

${\stackrel{\‾}{N}}_2=\underset{K=0}{\overset{J}{\mathrm{\Σ}}}P\left(K\right)\underset{m=0}{\overset{K}{\mathrm{\Σ}}}\underset{n=0}{\overset{J-K}{\mathrm{\Σ}}}{\mathrm{mP}}_{\det \mathrm{ect}}(m,n)=J(1-\mathrm{Pe})P_D---\left(12\right)$

Potential throughput under the situation 2 is expressed as

${\mathrm{PTP}}_2=\frac{{\stackrel{\‾}{N}}_2}{\stackrel{\‾}{L}}---\left(13\right)$

Take into account above-mentioned two kinds of situation, potential throughput is expressed as

PTP＝δ·PTP ₁+(1-δ)·PTP ₂ (14)

Wherein, δ is a constant, 0≤δ≤1;

Selecting initial value δ, is objective function optimization detector thresholding with potential throughput, order

$\frac{\mathrm{dPTP}}{{\mathrm{dP}}_F}=0---\left(15\right)$

Can get

$\frac{{\mathrm{dP}}_D}{{\mathrm{DP}}_F}=\frac{\mathrm{\δ}(J-1){\mathrm{PeP}}_D{I_2}^{J-2}(J-{\mathrm{JI}}_1+{I_1}^J)+{\mathrm{JPeP}}_D(1-{I_1}^{J-1})[{{\mathrm{\δI}}_2}^{J-1}+(1-\mathrm{\δ})]}{[{{\mathrm{\δI}}_2}^{J-2}{I}_3+(1-\mathrm{\δ})](J-{\mathrm{JI}}_1+{I_1}^J)-J(1-\mathrm{Pe})P_D(1-{I_1}^{J-1})[{{\mathrm{\δI}}_2}^{J-1}+(1-\mathrm{\δ})]}---\left(16\right)$

Wherein, I ₁=(1-Pe) (1-P _D)+Pe (1-P _F), I ₂=(1-Pe) P _D+ Pe (1-P _F), I ₃=Pe (1-P _F)+JP _D(1-Pe).

Under the high s/n ratio situation, P _D≈ 1, P _F≈ 0, (1-P _F)/P _D≈ 1, and formula (16) is reduced to:

$\frac{{\mathrm{dP}}_D}{{\mathrm{dP}}_F}=\frac{\mathrm{\δ}(J-1)\mathrm{Pe}(J-\mathrm{JPe}+{\mathrm{Pe}}^J)+\mathrm{JPe}(1-{\mathrm{Pe}}^{J-1})}{\left\{\mathrm{\δ}\right[\mathrm{Pe}+J(1-\mathrm{Pe})]+(1-\mathrm{\δ})\}(J-\mathrm{JPe}+{\mathrm{Pe}}^J)-J(1-\mathrm{Pe})(1-{\mathrm{Pe}}^{J-1})}=\mathrm{\β}---\left(17\right)$

From formula (3) and formula (4), can get:

P _D＝P _F ^1/1+SNR， $\mathrm{SNR}=\frac{{\mathrm{\σ}}_A^2}{{\mathrm{\σ}}_v^2}---\left(18\right)$

$\frac{{\mathrm{dP}}_D}{{\mathrm{dP}}_F}=\frac{1}{1+\mathrm{SNR}}{P_F}^{-\mathrm{SNR}/(1+\mathrm{SNR})}---\left(19\right)$

From formula (18) and formula (19), can get:

P _F，opt＝[(1+SNR)β] ^-(1+SNR)/SNR (20)

Can get the detector thresholding according to formula (3) and formula (20) is:

$T_{\mathrm{opt}}=\sqrt{-2{\mathrm{\σ}}_v^2\log \left[P_{F,\mathrm{opt}}\right]}=\sqrt{2{\mathrm{\σ}}_v^2\frac{1+\mathrm{SNR}}{\mathrm{SNR}}\log \left[(1+\mathrm{SNR})\mathrm{\β}\right]}---\left(21\right);$

(2) after information source is sent packet; Destination carries out collision detection according to the detector thresholding of trying to achieve to receiving packet; In case conflict is detected, destination is adjudicated collisions exponent number and active user collection, by control channel court verdict is notified to the all-network user then;

(3) be the linearity that obtains collision signal duplicate independently; System gets into the auxiliary retransmission time period of relaying; The conflict exponent number that the length of retransmission time period equals to be detected subtracts 1; A node is elected to be relaying randomly and is retransmitted the signal that it receives at the conflict time slot; The auxiliary retransmission time period one of relaying finishes; The broadcast channel control bit of just resetting is ended current re-transmission and transmission that all are relevant;

(4) when the channel matrix H full rank; All colliding data bags that the linear solution butt joint of destination suboptimum capable of using is received are united and are unpacked;

realizes that many bags separate, and obtains and initial value δ corresponding real-time network goodput ATP;

(5) result of above-mentioned steps (4) is exported to the renewal of coefficient δ; Its process is the iteration to coefficient δ different values in the scope of 0≤δ≤1 in the formula (14); Repeating step (1)-(4) finally obtain formula (21) result and are the goodput ATP of optimum detector thresholding with the network of correspondence.

2. the detector thresholding based on collision detection according to claim 1 is selected and cooperation conflict separation method, it is characterized in that: (1≤i≤J) packet in conflict time slot n transmission is expressed as x for the arbitrary node i in the network _i(n)=[x _{I, 0}(n) ... X _{I, M-1}(n)], each packet comprises M symbol, and the transmitted power of each symbol does Destination receives signal

Time slot n+k;

node is chosen as relaying at random, and retransmits it at the signal y (n) of time slot that conflicts.At this moment, reception signal indication in destination place does

Wherein

Be the via node set; a _Rd(n) be channel coefficients between r via node and destination; w _d(n+k) be noise vector; C (n+k) is a normalization coefficient.If

Be that relaying itself is not a source node, y (n)=y then _r(n),

Wherein If

Be that relaying itself is exactly a source node, y (n)=x then _r(n), c (n+k)=1.

3. the detector thresholding based on collision detection according to claim 1 and 2 is selected and cooperation conflict separation method, and when it is characterized in that the optimum detector thresholding obtains, the iterative process of coefficient δ is following in the formula (14):

(1) initial value of coefficient δ is made as 0, at this moment PTP=PTP ₂

(2) try to achieve corresponding thresholding and realization conflict separation, more real-time goodput ATP and potential throughput, calculate | PTP-ATP| ²

(3) update coefficients δ makes δ=δ+Δ δ, wherein Δ δ=1/J and 0≤δ≤1;

(4) repeat above-mentioned steps (2), (3); Find and make real-time goodput and the most approaching coefficient δ of potential throughput; When promptly satisfying

, formula (21) result is the optimum detector thresholding.

Images