CN104104474A - Collaboration data transmission method used for wireless relay communication - Google Patents

Abstract

Provided is a collaboration data transmission method used for wireless relay communication. The method comprises the operation steps that (1) coded symbols are generated by a source node according to a preset encoding method, and then the coded symbols are broadcasted to multiple relay nodes which are connected with the source node; (2) after any one of the relay nodes collects sufficient coded symbols, information source symbols with the preset number are recovered according to a preset decoding method, and the source node is notified and assisted to transmit the coded symbols to a target node; (3) if the relay nodes with the preset number collect sufficient coded symbols and start to assist the source node to transmit the coded symbols to the target node, the source node stops broadcasting the coded symbols; and (4) the target node decodes information source symbol sequences and notifies the relay nodes, and then the relay nodes notify the source node. More rapid data transmission is realized by the method.

Description

A kind of synergistic data transmission method for wireless relay communication

Technical field

The present invention relates to a kind of synergistic data transmission method for wireless relay communication, belong to wireless communication technology field, particularly belong to digital fountain code coding/decoding technical field.

Background technology

In wireless relay network, communication for coordination, by several via node collaborative works, assists source node that information is sent to destination node.Communication for coordination has strengthened the throughput of communication, and the reliability of link reduces energy resource consumption, and has expanded the coverage of wireless network.

In the solution of some communications for coordination at present, dynamically adjust the signal of transmission with feedback mechanism, thereby optimize the signal receiving, but such scheme needs a large amount of feedback messages, affected the throughput of system.If use fountain coding, can not need on the basis of feedback mechanism, allow transmission speed adapt to the real-time status of current channel.Fountain coding is a kind of sparse graph coding, has solved the complicated encoding and decoding computational problem of a lot of forward error corrections.Rupee (Luby) coding (M.Luby, LT Codes, In Proceeding of the ACM Symposium on Foundations of Computer Science, Vancouver, BC, CA, November2002) be first general fountain coding, be widely used.But use fountain coding in current communication for coordination time, use the method for " all decoding-forwards ", be that via node needs decoding to go out after all source symbol sequences could to assist source node to send data to destination node, but the method for this " all decoding-forwards " has not been given play to the advantage of multiple via node communications for coordination, in fact in the time having multiple via nodes to participate in communication for coordination, do not need via node decoding to go out all source symbol sequences, but how to realize the communication for coordination of " Partial Decode-forward " of this imperfect decoding, become current wireless communication technology field and be badly in need of the technical barrier solving.

Summary of the invention

In view of this, the object of the invention is to invent a kind of synergistic data transmission method for wireless relay communication, solution via node only needs decoding to go out part source symbol sequence can assist the technical barrier of source node to destination node transmission data afterwards, realizes than the traditional approach target of transfer of data faster.

In order to achieve the above object, the present invention proposes a kind of synergistic data transmission method for wireless relay communication, comprise following operating procedure:

(1) source node is divided into k the original packet that size is identical the initial data that will send, and original packet is called again source symbol, and k is natural number, represents the length of source symbol, structure source symbol sequence S=[s ₁, s ₂..., s _k], wherein s _irepresent i source symbol, i is the natural number that is not more than k; Source node generates coded identification according to source symbol sequence and according to the coding method of setting, and is then broadcast to several via nodes that are connected with it;

(2) any one via node being connected with described source node is collected after enough coded identifications, recovers and sets k-w source symbol of number according to the interpretation method of setting; Wherein w is the natural number that is less than k;

(3) this above-mentioned via node notification source node its collected enough coded identifications;

(4) this above-mentioned via node starts to assist described source node to send coded identification to destination node;

(5) if having set number h via node collected enough coded identifications and start to assist described in source node send coded identification to destination node, the source node coded identification of going off the air; Wherein h is natural number;

(6) described destination node is received enough coded identifications and is gone out described source symbol sequence S according to the interpretation method decoding of setting;

(7) described destination node notifies respectively foregoing its decoding of via node that sends coded identification to it to go out described source symbol sequence S;

(8) the described decoding of via node notification source node destination node being connected with described source node goes out described source symbol sequence S.

The coding method of described setting and interpretation method can be fountain coding and interpretation method.

The value of the described middle w of step (2) is traditionally arranged to be 0.2 times of described source symbol length k value;

In described step (5), the value of the setting number h of via node, meets relational expression wherein operated by rotary motion δ=0.01.

The coding method of the setting described in described step (1) is the fountain coding method changing based on ripple size, and its particular content comprises following operating procedure:

(11) calculation code degree distribution function ρ (d), wherein d is natural number, d=1,2,3 ..., k, concrete computational process comprises following sub-step:

(1101) calculate according to the following formula the value R (L) that ripple size should keep,

R(L)＝b ₁L ²+b ₂L+b ₃,L＝w+1,…,k

In above formula, L is a natural number, is illustrated in decode procedure the also number of the source symbol of unsuccessful decoding; Described ripple refers to the set of the coded identification that the coding number of degrees not processed in decode procedure are 1, and the coded identification that the coding number of degrees are 1 is source symbol; The process that ripple size changes can be strolled model representation with a symmetrical one-dimensional random, and ripple size, in each decoding procedure, or adds one, or subtracts one, obtains dynamically the value of ripple size, wherein b by binomial fitting ₁, b ₂, b ₃it is the constant calculating by binomial fitting;

(1102) calculate according to the following formula the quantity Q (L) when the decoded source symbol that should discharge when successful of k-L source symbol,

$Q\left(L\right)=\left\{\begin{array}{c}R\left(L\right),L=k\\ R\left(L\right)-R(L+1)+1,k>L>0\end{array}\right.$

(1103) calculate when L also undecoded success of source symbol according to the following formula, when described ripple size is R, the coded identification that number of degrees of encoding are d is released and can joins the probability q (d, L, R) in ripple,

(1104) solve following system of linear equations by the non-negative square law of minimum, solve coding degree distribution function ρ (d),

$P\left[\begin{array}{c}M\·\mathrm{\ρ}\left(1\right)\\ M\·\mathrm{\ρ}\left(2\right)\\ \·\\ \·\\ \·\\ M\·\mathrm{\ρ}(k-2)\\ M\·\mathrm{\ρ}(k-1)\\ M\·\mathrm{\ρ}\left(k\right)\end{array}\right]=\left[\begin{array}{c}Q\left(k\right)\\ Q(k-1)\\ \·\\ \·\\ \·\\ Q(w+3)\\ Q(w+2)\\ Q(w+1)\end{array}\right]$

In above-mentioned equation group, P is a matrix by described probability q (d, L, R) structure, is defined as follows:

In above-mentioned equation group, M represents the quantity of needed coded identification;

(12) to source symbol sequence S=[s step (1) Suo Shu ₁, s ₂..., s _k] carry out fountain coding, obtain fountain coding sequence V=[v ₁, v ₂...], wherein, coded identification v _i(i=1,2 ...) and performing step as follows:

(1201) the coding degree distribution function ρ (d) calculating according to step (11), generates a nonnegative integer d at random according to described distribution function ρ (d) _i, by d _ias coded identification v _icoding degree;

(1202) from k source symbol, choose at random d _iindividual different source symbol;

(1203) to described d _iindividual different source symbol carries out XOR, obtains coded identification v _i.

The content of the interpretation method of described setting is to comprise following operating procedure:

(21) from described ripple, select a source symbol, and from described ripple, remove this source symbol;

(22) for each coded identification, if described source symbol is neighbours' symbol of this coded identification, the coding number of degrees of this coded identification subtract one, and remove the neighbours symbol of described source symbol as described coded identification;

(23), if the value that the coding number of degrees of described coded identification subtract after is 1, represent that decoding success goes out a source symbol; If this source symbol that institute's decoding goes out does not appear in described ripple, this source symbol is joined in described ripple; If all source symbols are all successfully translated, successfully decoded, decode procedure finishes, otherwise goes to step (24);

(24) if before decoding completes, described ripple becomes empty set, represents decoding failure, and decode procedure finishes; Otherwise go to step (21).

Beneficial effect of the present invention is that via node only needs decoding to go out part source symbol sequence and can assist source node to send data to destination node afterwards, reach after certain quantity when translating the regeneration node data of part source symbol sequence, information source node can stop to via node ad data, adopt the solution of the present invention, data transmission bauds is faster than traditional mode.

Brief description of the drawings

Fig. 1 is the schematic network structure of transfer of data in wireless relay network.

Fig. 2 is the flow chart of a kind of synergistic data transmission method for wireless relay communication of proposing of the present invention.

Fig. 3 is the simulation experiment result figure of the present invention-average transmission time comparison diagram.

Embodiment

For making the object, technical solutions and advantages of the present invention clearer, below in conjunction with accompanying drawing, the present invention is described in further detail.

Referring to Fig. 1, basic process when traditional wireless relay communication network transmits data is: suppose that source node need to could send to destination node data by several via nodes, and each node only has an antenna, can only semiduplex work, receive data or send data, can not receive data simultaneously and send again data.In current communication for coordination, use the method for " all decoding-forward ", via node needs decoding could assist source node to send data to destination node after going out all source symbol sequences

The basic process of the synergistic data transmission method for wireless relay communication that the present invention proposes in the time of transmission data is: the data that source node will send are divided into k the source symbol that size is identical, source node generates coded identification according to source symbol sequence, then be broadcast to several coupled via nodes, this any one via node recovers part source symbol after collecting enough coded identifications, start to assist source node to send coded identification to destination node, several via nodes are all collected enough coded identifications (can recover part source symbol, and start to assist source node to send coded identification to destination node), source node stops transmission, via node sends coded identification always, until all source symbols are received by destination node.

Referring to Fig. 2, introduce a kind of synergistic data transmission method for wireless relay communication that the present invention proposes, comprise following operating procedure:

(1) source node is divided into k the original packet that size is identical the initial data that will send, and original packet is called again source symbol, and k is natural number, represents the length (as k=256) of source symbol, structure source symbol sequence S=[s ₁, s ₂..., s _k], wherein s _irepresent i source symbol, i is the natural number that is not more than k; Source node generates coded identification according to source symbol sequence and according to the coding method of setting, and is then broadcast to several via nodes that are connected with it;

(2) any one via node being connected with described source node is collected after enough coded identifications, recovers and sets k-w source symbol of number according to the interpretation method of setting; Wherein w is the natural number that is less than k;

(3) this above-mentioned via node notification source node its collected enough coded identifications;

(4) this above-mentioned via node starts to assist described source node to send coded identification to destination node;

(5) if having set number h via node collected enough coded identifications and start to assist described in source node send coded identification to destination node, the source node coded identification of going off the air; Wherein h is natural number;

(6) described destination node is received enough coded identifications and is gone out described source symbol sequence S according to the interpretation method decoding of setting;

(7) described destination node notifies respectively foregoing its decoding of via node that sends coded identification to it to go out described source symbol sequence S;

(8) the described decoding of via node notification source node destination node being connected with described source node goes out described source symbol sequence S.

The coding method of described setting and interpretation method can be fountain coding and interpretation method.

The value of the described middle w of step (2) is traditionally arranged to be 0.2 times of described source symbol length k value;

In described step (5), the value of the setting number h of via node, meets relational expression wherein operated by rotary motion δ=0.01.

The coding method of the setting described in described step (1) is the fountain coding method changing based on ripple size, and its particular content comprises following operating procedure:

(11) calculation code degree distribution function ρ (d), wherein d is natural number, d=1,2,3 ..., k, concrete computational process comprises following sub-step:

(1101) calculate according to the following formula the value R (L) that ripple size should keep,

R(L)＝b ₁L ²+b ₂L+b ₃,L＝w+1,…,k

In above formula, L is a natural number, is illustrated in decode procedure the also number of the source symbol of unsuccessful decoding; Described ripple refers to the set of the coded identification that the coding number of degrees not processed in decode procedure are 1, and the coded identification that the coding number of degrees are 1 is source symbol; The process that ripple size changes can be strolled model representation with a symmetrical one-dimensional random, and ripple size, in each decoding procedure, or adds one, or subtracts one, obtains dynamically the value of ripple size, wherein b by binomial fitting ₁, b ₂, b ₃it is the constant calculating by binomial fitting;

(1102) calculate according to the following formula the quantity Q (L) when the decoded source symbol that should discharge when successful of k-L source symbol,

$Q\left(L\right)=\left\{\begin{array}{c}R\left(L\right),L=k\\ R\left(L\right)-R(L+1)+1,k>L>0\end{array}\right.$

(1103) calculate when L also undecoded success of source symbol according to the following formula, when described ripple size is R, the coded identification that number of degrees of encoding are d is released and can joins the probability q (d, L, R) in ripple,

(1104) solve following system of linear equations by the non-negative square law of minimum, solve coding degree distribution function ρ (d),

$P\left[\begin{array}{c}M\·\mathrm{\ρ}\left(1\right)\\ M\·\mathrm{\ρ}\left(2\right)\\ \·\\ \·\\ \·\\ M\·\mathrm{\ρ}(k-2)\\ M\·\mathrm{\ρ}(k-1)\\ M\·\mathrm{\ρ}\left(k\right)\end{array}\right]=\left[\begin{array}{c}Q\left(k\right)\\ Q(k-1)\\ \·\\ \·\\ \·\\ Q(w+3)\\ Q(w+2)\\ Q(w+1)\end{array}\right]$

In above-mentioned equation group, P is a matrix by described probability q (d, L, R) structure, is defined as follows:

In above-mentioned equation group, M represents the quantity of needed coded identification;

Signal is exemplified below: suppose k=10, w=2, using computer simulation to calculate one-dimensional random strolls the value of model and is: R (3)=2.1407, R (4)=2.5149, R (5)=2.8394, R (6)=3.1301, R (7)=3.3959, R (8)=3.6423, R (9)=3.8729, R (10)=4.0906; Use software matlab matching to obtain b ₁=-0.0123, b ₂=0.4353, b ₃=0.9591;

Then the value that recalculates R (L) is as follows:

R(10)＝4.0803、R(9)＝3.8790、R(8)＝3.6531、R(7)＝3.4025、R(6)＝3.1274、R(5)＝2.8276、R(4)＝2.5031、R(3)＝2.1541；

Then the value that calculates Q (L) is as follows:

Q(10)＝4.0803、Q(9)＝0.7987、Q(8)＝0.7741、Q(7)＝0.7494、Q(6)＝0.7249、Q(5)＝0.7002、Q(4)＝0.6755、Q(3)＝0.6510；

The matrix P by described probability q (d, L, R) structure calculating is as follows:

$P=\left[\begin{array}{cccccccccc}1.00& 0& 0& 0& 0& 0& 0& 0& 0& 0\\ 0& 0.20& 0& 0& 0& 0& 0& 0& 0& 0\\ 0& 0.18& 0.07& 0& 0& 0& 0& 0& 0& 0\\ 0& 0.16& 0.12& 0.03& 0& 0& 0& 0& 0& 0\\ 0& 0.13& 0.15& 0.09& 0.02& 0& 0& 0& 0& 0\\ 0& 0.11& 0.17& 0.14& 0.08& 0.02& 0& 0& 0& 0\\ 0& 0.09& 0.17& 0.19& 0.16& 0.10& 0.03& 0& 0& 0\\ 0& 0.07& 0.15& 0.21& 0.24& 0.21& 0.15& 0.07& 0& 0\\ 0& 0& 0& 0& 0& 0& 0& 0& 0& 0\\ 0& 0.02& 0.07& 0.13& 0.22& 0.33& 0.47& 0.62& 0.80& 1.00\end{array}\right]$

Solve following system of linear equations by the non-negative square law of minimum, solve coding degree distribution function ρ (d),

$P\left[\begin{array}{c}M\·\mathrm{\ρ}\left(1\right)\\ M\·\mathrm{\ρ}\left(2\right)\\ \·\\ \·\\ \·\\ M\·\mathrm{\ρ}\left(8\right)\\ M\·\mathrm{\ρ}\left(9\right)\\ M\·\mathrm{\ρ}\left(10\right)\end{array}\right]=\left[\begin{array}{c}Q\left(10\right)\\ Q\left(9\right)\\ \·\\ \·\\ \·\\ Q\left(5\right)\\ Q\left(4\right)\\ Q\left(3\right)\end{array}\right]$

Obtain:

M·ρ(1)＝4.0803，M·ρ(2)＝0.0，M·ρ(3)＝2.6142，M·ρ(4)＝0.7053，M·ρ(5)＝0.0，

M·ρ(6)＝0.0，M·ρ(7)＝0.0，M·ρ(8)＝3.3515，M·ρ(9)＝0.0，M·ρ(10)＝0.1344

Finally obtain coding degree distribution function ρ (d) as follows:

$\mathrm{\ρ}\left(1\right)=\frac{M\·\mathrm{\ρ}\left(1\right)}{\underset{i=1}{\overset{10}{\mathrm{\Σ}}}M\·\mathrm{\ρ}\left(i\right)}=0.37,\mathrm{\ρ}\left(2\right)=\frac{M\·\mathrm{\ρ}\left(2\right)}{\underset{i=1}{\overset{10}{\mathrm{\Σ}}}M\·\mathrm{\ρ}\left(i\right)}=0.0,\mathrm{\ρ}\left(3\right)=\frac{M\·\mathrm{\ρ}\left(3\right)}{\underset{i=1}{\overset{10}{\mathrm{\Σ}}}M\·\mathrm{\ρ}\left(i\right)}=0.24,$

$\mathrm{\ρ}\left(4\right)=\frac{M\·\mathrm{\ρ}\left(4\right)}{\underset{i=1}{\overset{10}{\mathrm{\Σ}}}M\·\mathrm{\ρ}\left(i\right)}=0.06,\mathrm{\ρ}\left(5\right)=\frac{M\·\mathrm{\ρ}\left(5\right)}{\underset{i=1}{\overset{10}{\mathrm{\Σ}}}M\·\mathrm{\ρ}\left(i\right)}=0.0,\mathrm{\ρ}\left(6\right)=\frac{M\·\mathrm{\ρ}\left(6\right)}{\underset{i=1}{\overset{10}{\mathrm{\Σ}}}M\·\mathrm{\ρ}\left(i\right)}=0.0,$

$\mathrm{\ρ}\left(7\right)=\frac{M\·\mathrm{\ρ}\left(7\right)}{\underset{i=1}{\overset{10}{\mathrm{\Σ}}}M\·\mathrm{\ρ}\left(i\right)}=0.0,\mathrm{\ρ}\left(8\right)=\frac{M\·\mathrm{\ρ}\left(8\right)}{\underset{i=1}{\overset{10}{\mathrm{\Σ}}}M\·\mathrm{\ρ}\left(i\right)}=0.31,\mathrm{\ρ}\left(9\right)=\frac{M\·\mathrm{\ρ}\left(9\right)}{\underset{i=1}{\overset{10}{\mathrm{\Σ}}}M\·\mathrm{\ρ}\left(i\right)}=0.0,$

$\mathrm{\ρ}\left(10\right)=\frac{M\·\mathrm{\ρ}\left(10\right)}{\underset{i=1}{\overset{10}{\mathrm{\Σ}}}M\·\mathrm{\ρ}\left(i\right)}=0.02$

(12) to source symbol sequence S=[s step (1) Suo Shu ₁, s ₂..., s _k] carry out fountain coding, obtain fountain coding sequence V=[v ₁, v ₂...], wherein, coded identification v _i(i=1,2 ...) and performing step as follows:

(1201) the coding degree distribution function ρ (d) calculating according to step (11), generates a nonnegative integer d at random according to described distribution function ρ (d) _i, by d _ias coded identification v _icoding degree;

(1202) from k source symbol, choose at random d _iindividual different source symbol;

(1203) to described d _iindividual different source symbol carries out XOR, obtains coded identification v _i.

The content of the interpretation method of described setting is to comprise following operating procedure:

(21) from described ripple, select a source symbol, and from described ripple, remove this source symbol;

(22) for each coded identification, if described source symbol is neighbours' symbol of this coded identification, the coding number of degrees of this coded identification subtract one, and remove the neighbours symbol of described source symbol as described coded identification;

(23), if the value that the coding number of degrees of described coded identification subtract after is 1, represent that decoding success goes out a source symbol; If this source symbol that institute's decoding goes out does not appear in described ripple, this source symbol is joined in described ripple; If all source symbols are all successfully translated, successfully decoded, decode procedure finishes, otherwise goes to step (24);

(24) if before decoding completes, described ripple becomes empty set, represents decoding failure, and decode procedure finishes; Otherwise go to step (21).

To method proposed by the invention, inventor has carried out emulation experiment twice, and emulation experiment parameter arranges as follows for the first time: δ=0.01, and k=256, b=256 byte, b represents the size of original packet, h=5, symbol in expression, round; Emulation experiment parameter arranges as follows for the second time: δ=0.01, and k=256, b=256 byte, h=8, in emulation experiment, inventor is method of the present invention (being abbreviated as Partial LT codes) and rupee coding method LT codes (Luby Transfer:M.Luby, LT Codes, In Proceeding of the ACM Symposium on Foundations of Computer Science, Vancouver, BC, CA, November2002) carried out contrast experiment, experimental result is referring to Fig. 3.Contrast and experiment shows, method Partial LT codes of the present invention is better than a rupee coding method LT codes in average transmission time technical indicator.

Claims (6)

1. for a synergistic data transmission method for wireless relay communication, it is characterized in that: described method comprises following operating procedure:

(1) source node is divided into k the original packet that size is identical the initial data that will send, and original packet is called again source symbol, and k is natural number, represents the length of source symbol, structure source symbol sequence S=[s ₁, s ₂..., s _k], wherein s _irepresent i source symbol, i is the natural number that is not more than k; Source node generates coded identification according to source symbol sequence and according to the coding method of setting, and is then broadcast to several via nodes that are connected with it;

(2) any one via node being connected with described source node is collected after enough coded identifications, recovers and sets k-w source symbol of number according to the interpretation method of setting; Wherein w is the natural number that is less than k;

(3) this above-mentioned via node notification source node its collected enough coded identifications;

(4) this above-mentioned via node starts to assist described source node to send coded identification to destination node;

(5) if having set number h via node collected enough coded identifications and start to assist described in source node send coded identification to destination node, the source node coded identification of going off the air; Wherein h is natural number;

(6) described destination node is received enough coded identifications and is gone out described source symbol sequence S according to the interpretation method decoding of setting;

(7) described destination node notifies respectively foregoing its decoding of via node that sends coded identification to it to go out described source symbol sequence S;

(8) the described decoding of via node notification source node destination node being connected with described source node goes out described source symbol sequence S.

2. a kind of synergistic data transmission method for wireless relay communication according to claim 1, is characterized in that: the coding method of described setting and interpretation method can be fountain coding and interpretation method.

3. a kind of synergistic data transmission method for wireless relay communication according to claim 1, is characterized in that: the value of the described middle w of step (2) is traditionally arranged to be 0.2 times of described source symbol length k value.

4. a kind of synergistic data transmission method for wireless relay communication according to claim 1, is characterized in that: the value of the setting number h of via node in described step (5), meets relational expression wherein operated by rotary motion δ=0.01.

5. a kind of synergistic data transmission method for wireless relay communication according to claim 1, it is characterized in that: the coding method of the setting described in described step (1) is the fountain coding method changing based on ripple size, and its particular content comprises following operating procedure:

(11) calculation code degree distribution function ρ (d), wherein d is natural number, d=1,2,3 ..., k, concrete computational process comprises following sub-step:

(1101) calculate according to the following formula the value R (L) that ripple size should keep,

R(L)＝b ₁L ²+b ₂L+b ₃,L＝w+1,…,k

In above formula, L is a natural number, is illustrated in decode procedure the also number of the source symbol of unsuccessful decoding; Described ripple refers to the set of the coded identification that the coding number of degrees not processed in decode procedure are 1, and the coded identification that the coding number of degrees are 1 is source symbol; The process that ripple size changes can be strolled model representation with a symmetrical one-dimensional random, and ripple size, in each decoding procedure, or adds one, or subtracts one, obtains dynamically the value of ripple size, wherein b by binomial fitting ₁, b ₂, b ₃it is the constant calculating by binomial fitting;

(1102) calculate according to the following formula the quantity Q (L) when the decoded source symbol that should discharge when successful of k-L source symbol,

$Q\left(L\right)=\left\{\begin{array}{c}R\left(L\right),L=k\\ R\left(L\right)-R(L+1)+1,k>L>0\end{array}\right.$

(1103) calculate when L also undecoded success of source symbol according to the following formula, when described ripple size is R, the coded identification that number of degrees of encoding are d is released and can joins the probability q (d, L, R) in ripple,

(1104) solve following system of linear equations by the non-negative square law of minimum, solve coding degree distribution function ρ (d),

$P\left[\begin{array}{c}M\·\mathrm{\ρ}\left(1\right)\\ M\·\mathrm{\ρ}\left(2\right)\\ \·\\ \·\\ \·\\ M\·\mathrm{\ρ}(k-2)\\ M\·\mathrm{\ρ}(k-1)\\ M\·\mathrm{\ρ}\left(k\right)\end{array}\right]=\left[\begin{array}{c}Q\left(k\right)\\ Q(k-1)\\ \·\\ \·\\ \·\\ Q(w+3)\\ Q(w+2)\\ Q(w+1)\end{array}\right]$

In above-mentioned equation group, P is a matrix by described probability q (d, L, R) structure, is defined as follows:

In above-mentioned equation group, M represents the quantity of needed coded identification;

(12) to source symbol sequence S=[s step (1) Suo Shu ₁, s ₂..., s _k] carry out fountain coding, obtain fountain coding sequence V=[v ₁, v ₂...], wherein, coded identification v _i(i=1,2 ...) and performing step as follows:

(1201) the coding degree distribution function ρ (d) calculating according to step (11), generates a nonnegative integer d at random according to described distribution function ρ (d) _i, by d _ias coded identification v _icoding degree;

(1202) from k source symbol, choose at random d _iindividual different source symbol;

(1203) to described d _iindividual different source symbol carries out XOR, obtains coded identification v _i.

6. a kind of synergistic data transmission method for wireless relay communication according to claim 1 or 5, is characterized in that: the content of the interpretation method of described setting is to comprise following operating procedure:

(21) from described ripple, select a source symbol, and from described ripple, remove this source symbol;

(22) for each coded identification, if described source symbol is neighbours' symbol of this coded identification, the coding number of degrees of this coded identification subtract one, and remove the neighbours symbol of described source symbol as described coded identification;

(23), if the value that the coding number of degrees of described coded identification subtract after is 1, represent that decoding success goes out a source symbol; If this source symbol that institute's decoding goes out does not appear in described ripple, this source symbol is joined in described ripple; If all source symbols are all successfully translated, successfully decoded, decode procedure finishes, otherwise goes to step (24);

(24) if before decoding completes, described ripple becomes empty set, represents decoding failure, and decode procedure finishes; Otherwise go to step (21).