CN101478372B - Cooperative wireless multipath method based on network encoding - Google Patents
Cooperative wireless multipath method based on network encoding Download PDFInfo
- Publication number
- CN101478372B CN101478372B CN2009100767421A CN200910076742A CN101478372B CN 101478372 B CN101478372 B CN 101478372B CN 2009100767421 A CN2009100767421 A CN 2009100767421A CN 200910076742 A CN200910076742 A CN 200910076742A CN 101478372 B CN101478372 B CN 101478372B
- Authority
- CN
- China
- Prior art keywords
- frame
- lost
- lost frames
- destination node
- nodes
- 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.)
- Expired - Fee Related
Links
Images
Landscapes
- Mobile Radio Communication Systems (AREA)
Abstract
The invention relates to a cooperative wireless multi-broadcasting method based on network encoding. The method comprises the following steps: a transmitting node transmiting new frames X1 and X2 by use of two sub-slots to cooperated nodes and target nodes via wireless channels; the cooperated nodes and the transmitting nodes intercepting the received information fed back from the target nodes; under the condition of frame loss, if not at least one target node loses both the frame X1 and the frame X2 and the cooperated nodes receive the lost frame in advance, the lost frame is recoded by the cooperated nodes and the coded composite frame is transmitted to the target nodes at the next sub-slot; if the cooperated nodes don't receive the lost frame in advance, the lost frame is recoded by the transmitting node and the coded composite frame is transmitted to the target nodes at the next sub-slot; and the target nodes decoding the composite frame to obtain the lost frame. The invention not only improves the transmission reliability of the system, reduces the interrupt probability of the transmission, but also saves time resource and power resource.
Description
Technical field
The present invention relates to the broadband radio multi-media communication network field, particularly wireless messages broadcast system has been specifically related to a kind of cooperative wireless multipath method of coding Network Based.
Background technology
There has been the technology of comparative maturity to realize for unicast service in China's radio communication at present, but for multicast service, still reliable multicast method and system that unsystematic can be good, and in WLAN standard 802.11 technical specifications, there is not clear and definite standard for multicast service yet, only be the message transmission under the no automatic request retransmission mechanism, reliability is low, the frame error rate height.Following multicast service is inevitable requirement high reliability and low frame error rate also, thereby only uses present multicast transmission technology and can't satisfy this requirement.
For the network of the multicast pattern of point-to-multipoint, its topological structure is by a sending node (also claiming information source node), and a cooperative nodes and a plurality of destination node are formed, and as shown in Figure 1, S represents sending node among the figure, and d
1, d
2The expression destination node, and R represents cooperative nodes.In this architecture, because the relative position of cooperative nodes R and sending node S and destination node, their difference on the geographical position may cause the scheme Effect on Performance.Shown in Fig. 2 A～Fig. 2 D, cooperative nodes r and information source node s and destination node d
1, d
2Relative position, the difference on the geographical position reduces following four kinds of topology situation simply: (a) symmetrical destination node channel, and each channel average gain identical (Fig. 2 A shows) in the network; (b) symmetrical destination node channel, and the channel between information source node and the destination node is better than the channel (Fig. 2 B shows) between cooperative nodes and the destination node; (c) symmetrical destination node channel, and the channel between information source node and the destination node is worse than the channel (Fig. 2 C shows) between cooperative nodes and the destination node; (d) situation of asymmetric destination node.Said symmetrical destination node channel is meant channel long-run average consistent (Fig. 2 D shows) between information source node and each destination node in above-mentioned.
In wireless environment, because the broadcast characteristic of wireless channel, so sending node is when carrying out information broadcast, and a plurality of destination nodes can receive this broadcast message.Owing in 802.11 agreements, do not introduce automatic request retransmission (ARQ) mechanism on the implementation of wireless multicast mode, so packet loss is higher.If adopt the repeatedly retransmission mechanism of the automatic request retransmission of clean culture (ARQ) to realize multicast, under the packet loss condition with higher, the efficiency of transmission of system can reduce greatly so.Therefore, also do not have at present a kind ofly not only to guarantee efficiency of transmission but also guarantee multicast transmission method and the system that packet loss is lower.
Summary of the invention
The cooperative wireless multipath method that the purpose of this invention is to provide a kind of coding Network Based has not only improved the reliability of system transmissions, has reduced the interruptions in transmissions probability, and has saved system resource, comprises time resource and power resource.
A kind of cooperative wireless multipath method of coding Network Based, this method may further comprise the steps:
The invention provides a kind of cooperative wireless multipath method of coding Network Based, this method may further comprise the steps:
S101, sending node S adopt a sub-slots to send new frame X
1To cooperative nodes R and a plurality of destination node d, d feedback frame X
1Reception information to S and R;
S102, sending node S adopt the next son time slot to send new frame X
2To cooperative nodes R and a plurality of destination node d, d feedback frame X
2Reception information to S and R;
S103 is according to the frame X that is fed back
1And X
2Reception information judge the reception condition of d;
If s104 is all successful received frame X of a plurality of destination node d
1And X
2, change step s109, if not, change step s105;
S105 is if not have d lost frames X simultaneously at least
1And X
2The time, change step s106;
S106 judges whether R successfully receives lost frames, if, change step s107, if not, change step s108;
S107, R encodes to lost frames, makes the compound frame behind the coding carry lost frames information, by R compound frame is sent to d at the next son time slot, and d decodes to compound frame and obtains lost frames, changes step s109;
S108, S encodes to lost frames, makes the compound frame behind the coding carry lost frames information, by S compound frame is sent to d at the next son time slot, changes step s109;
S109 sends as if all frames, then ending method; Otherwise, change step s101.
Preferably, at step s105, if having destination node lost frames X simultaneously at least
1And X
2, change step s106 ';
S106 ' judges whether R successfully receives lost frames X
1And X
2If,, change step s107 ', if not, change step s108 ';
S107 ', R adopt two sub-slots respectively with lost frames X
1And X
2Send to d, change step s109;
S108 ', S adopt two sub-slots to come retransmits lost frame X respectively
1And X
2To d, change step s109.
Preferably, in step s105, if one or more destination node d have only lost an information frame X
1, or one or more destination node d has only lost an information frame X
2
In step s106, judge that drawing R successfully receives lost frames X
1Or X
2
In step s107, the compound frame behind the R coding is lost frames X
1Or X
2Itself;
In step s108, the compound frame behind the S coding is lost frames X
1Or X
2Itself.
Preferably, in step s105, if at least one destination node d has only lost one of them frame X
1Or X
2, but total situation is to have lost different frame X in a plurality of destination node
1, X
2
In step s106, judge that drawing R successfully receives lost frames X
1And X
2
In step s107, the compound frame behind the R coding is lost frames
In step s108, the compound frame behind the S coding is lost frames
Preferably, this method is also comprising step s100 before the step s101: select cooperative nodes R at random in the subclass of the neighbor node of sending node S set neutralizes the subclass of neighbor node set of each destination node d.
Preferably, described cooperative nodes is 1.
Utilize the cooperative wireless multipath method of coding Network Based provided by the invention, have following beneficial effect:
1) resource of saving time improves spectrum efficiency, reduces frame error rate, improves system's multicast throughput;
2) introduce employing cooperation diversity technique, obtain diversity gain;
3) introduced the integrated mode of network code, when improving the multicast system reliability, made full use of the broadcast characteristic of wireless channel with automatic request retransmission mechanism, the complexity that has reduced system's realization is low, saved the system transmissions resource, realized that simply extensibility is good.
Description of drawings
Fig. 1 is a network code cooperation multicast topology schematic diagram in the prior art;
Fig. 2 A～Fig. 2 D is a various topological structures schematic diagram of the prior art;
Fig. 3 is the cooperative wireless multipath method flow chart that the present invention is based on network code;
Fig. 4 for traditional multicast, cooperation multicast in the embodiment of the invention and the present invention is based on network code the cooperation multicasting method the time-derived channel allocative decision relatively;
Fig. 5 is the cooperative wireless multipath method flow chart of coding Network Based in the embodiment of the invention;
Fig. 6 is the outage probability schematic diagram of various topological structures under the different signal to noise ratios in the embodiment of the invention;
Fig. 7 is the outage probability schematic diagram of the various topological structures under identical, the different signal to noise ratio of all channel average channel gain in the embodiment of the invention;
Fig. 8 is the outage probability schematic diagram of the various topological structures under 15 decibels, different transmission rates for the average signal-to-noise ratio of all channels in the embodiment of the invention;
Fig. 9 is the outage probability schematic diagram of the various topological structures under asymmetric transmission-receive channel topology, the different signal to noise ratio in the embodiment of the invention;
Figure 10 is the spectrum efficiency of various topological structures under the different signal to noise ratios in the embodiment of the invention.
Embodiment
The cooperative wireless multipath method of the coding Network Based that the present invention proposes is described as follows in conjunction with the accompanying drawings and embodiments.
The present invention proposes a kind of cooperative wireless multipath method of coding Network Based, purpose is to realize the reliable multicast transmission of wireless network.This method can embed IEEE802.11, and the independently multicast scheme that also can be used as is used.
The present invention considers point-to-multipoint multicast pattern, and has introduced network code and cooperation diversity technique to improve transmission performance, is applicable to wireless network.
The present invention is directed to the problems of the prior art and introduced the network code retransmission mechanism, realize the reliable transmission of multicast data frame.Consider that retransmitting data frame may not be required for all destination nodes, therefore, the present invention utilizes network coding technique to realize that the coding of lost data frames retransmits, and to improve the efficiency of transmission of system, reduces the multicast data frame number of retransmissions.Simultaneously, the present invention has the cooperation diversity, and so-called diversity is meant after adopting the solution of the present invention, frame error rate be inversely proportional to the signal to noise ratio inverse square, therefore reach diversity (frame error rate is inversely proportional to signal to noise ratio under the normal condition).The cooperation diversity, refer to diversity on the one hand, illustrate that on the one hand diversity is owing to cooperation is introduced, because cooperative nodes can participate in transmission course, in the time of transmission, consider that destination node can receive two signal versions, therefore have only when these two signals all take defeat, just can packet loss.As seen, frame error rate be proportional to signal to noise ratio square, utilize the cooperation diversity gain further to reduce the frame error rate of multicast data frame.Therefore, the present invention fully utilizes the implementation that network coding technique and cooperation diversity technique have provided a kind of new cooperative wireless multipath.
Simultaneously, compare with conventional wireless multicast scheme, the present invention introduces automatic request retransmission mechanism, to improve the multicast reliability.Be after destination node receives information frame, (this is the coded system of using always to decoding situation during according to reception, can have some redundancy bytes in information frame, we can judge that the information of receiving is correctly still wrong even correct the mistake that some can be tolerated by these amount of redundant information) receive successful information to sending node and cooperative nodes feedback.If a bit " 1 " is then fed back in success, otherwise then feed back " 0 ".Cooperative nodes also can feed back reception information to sending node simultaneously.Sending node and cooperative nodes then can determine the new information frame of next slot transmission and transmit previous information frame according to the feedback information of destination node.These feedback informations can be realized successfully transmission by special feedback channel.
In the present invention, during sending node S transmission information frame, because the broadcast characteristic of wireless channel, a plurality of destination node d and cooperative nodes R can receive information frame, and after cooperative nodes R receives information frame, decide the Cooperative For Information transmission plan according to the reception information of destination node d.
Be illustrated in figure 3 as a kind of cooperative wireless multipath method flow chart of coding Network Based, this method may further comprise the steps:
S101, sending node S adopt a sub-slots to send new frame X
1To cooperative nodes R and a plurality of destination node d, d feedback frame X
1Reception information to S and R;
S102, sending node S adopt the next son time slot to send new frame X
2To cooperative nodes R and a plurality of destination node d, d feedback frame X
2Reception information to S and R;
In the above-mentioned steps, destination node d is to cooperative nodes and sending node feedback information, because the broadcast characteristic of wireless channel, so cooperative nodes and sending node can receive information during the feedback primary information, simultaneously, compare with information frame, feedback information volume is few, therefore holding time is minimum, compares and can ignore with the used time of information frame;
S103 is according to the frame X that is fed back
1And X
2Reception information judge the reception condition of d;
If s104 is all successful received frame X of a plurality of destination node d
1And X
2, change step s109, if not, change step s105;
S105 is if not have d lost frames X simultaneously at least
1And X
2The time, change step s106;
S106 judges whether R successfully receives lost frames, if, change step s107, if not, change step s108;
S107, R encodes to lost frames, makes the compound frame behind the coding carry lost frames information, by R compound frame is sent to d at the next son time slot, and d decodes to compound frame and obtains lost frames, changes step s109;
S108, S encodes to lost frames, makes the compound frame behind the coding carry lost frames information, by S compound frame is sent to d at the next son time slot, changes step s109;
S109 sends as if all frames, then ending method; Otherwise, change step s101.
In this method, at step s105, if having destination node lost frames X simultaneously at least
1And X
2, change step s106 '; S106 ' judges whether R successfully receives lost frames X
1And X
2If,, change step s107 ', if not, change step s108 '; S107 ', R adopt two sub-slots respectively with lost frames X
1And X
2Send to d, change step s101; S108 ', S adopt two sub-slots to come retransmits lost frame X respectively
1And X
2To d, change step s101.
In this method, having lost the situation of two frames except having a destination node at least, is exactly all successful received frame X of all nodes in addition
1Or all successful received frame X of all nodes
2, promptly have only one or more (comprise all) destination node only to lose an information frame X
1, or have only one or more (comprising all) destination node only to lose an information frame X
2In this case, among the step s106, judge that drawing R successfully receives lost frames X
1Or X
2In step s107, the compound frame behind the R coding is lost frames X
1Or X
2Itself; In step s108, the compound frame behind the S coding is lost frames X
1Or X
2Itself.
Last a kind of situation is that the single target node has only been lost one of them frame in a plurality of destination nodes, but total situation is to have lost different frame X
1, X
2, under this kind situation, in step s106, judge that drawing R successfully receives lost frames X
1Or X
2, in step s107, the compound frame behind the R coding is lost frames
In step s108, the compound frame behind the S coding is lost frames
Above-mentioned cataloged procedure is specially X
1, X
2Carry out mould 2 Hes, the compound frame after obtaining encoding is
The cooperative wireless multipath method of coding Network Based in the present embodiment has adopted the decoding of coding Network Based to transmit approach to cooperation.So-called decoding is transmitted, be that cooperative nodes R receives and decodes again to information after the information that coding is forwarded to destination node earlier, because the cooperative nodes present position causes its channel condition good, therefore sending information frame with cooperative nodes can reduce frame error rate in other words.In the present embodiment, for ease of understanding, suppose that the destination node that is connected with cooperative nodes is two, the cooperative wireless multipath method that the present invention is based on network code is described, certainly, method of the present invention is applicable to the multicast situation of other any a plurality of destination nodes.
Consider that destination node receives the different situations of information frame, transmission policy can be divided into five kinds of independent situations in the present embodiment.Be that example describes with two destination nodes below.
Situation 1: destination node all successfully receives two information frame X in preceding two sub-slots dT
1, X
2, therefore do not need to carry out information and transmit, in new sub-slots, will transmit new information frame;
Situation 2: in preceding two sub-slots, have only a destination node frame losing, and lost an information frame, in this situation, if cooperative nodes successfully receives these lost frames in advance, in the 3rd sub-slots, then be responsible for these lost frames are sent to destination node by cooperative nodes, and do not need sending node to resend, if cooperative nodes does not successfully receive these lost frames in advance, then in the 3rd sub-slots, then send lost frames by sending node;
Situation 3: two destination node frame losings in preceding two sub-slots, and all only lost a same data frames, in this situation, if cooperative nodes successfully receives these lost frames in advance, in the 3rd sub-slots, then be responsible for these lost frames are sent to destination node by cooperative nodes, and do not need sending node to resend, if cooperative nodes does not successfully receive these lost frames in advance, then in the 3rd sub-slots, then send lost frames by sending node;
Situation 4: two destination node frame losings in preceding two sub-slots, and lost the different pieces of information frame.In this situation, if cooperative nodes successfully receives these lost frames X in advance
1And X
2, cooperative nodes is responsible for sending the network code version of these two information frames in the 3rd sub-slots
(two Frame X
1And X
2Mould 2 Hes), if cooperative nodes successfully do not receive these lost frames X in advance
1And X
2, then will be by sending node transmission network version of code in the 3rd sub-slots
To destination node.
Situation 5: have at least a destination node in preceding two sub-slots, to lose all information frame X
1And X
2, in the case, still need two sub-slots to send this two information frame X
1And X
2If cooperative nodes successfully receives these lost frames X in advance
1And X
2, cooperative nodes will transmit this two information frame X respectively in two sub-slots below
1And X
2If do not receive successfully, the sending node node retransmits this two information frame X
1And X
2
Cooperative wireless multipath scheme of the present invention is even under worst case, also identical with the used time resource of original scheme.It is pointed out that 802.11 and some other multicast strategy in, do not use automatic repeat requests (ARQ) technology.Though introduced automatic repeat requests technology in this programme, because transmission time slot of the present invention is a sub-slots, two sub-slots just constitute the time slot of other schemes transmission.In other words, the sub-slots among the present invention program splits into two parts to a time slot and obtains.
Simultaneously, after cooperative nodes or destination node re-transmission, even without successfully receiving, sending node also can send other new Frame, and the solution of the present invention can not guarantee that all Frames all successfully receive, if so, resource can consume too much.The solution of the present invention can be done, and is to reduce frame error rate as much as possible under the efficient resource prerequisite.Comparing the situation that current multicast scheme seldom has consideration information to retransmit, is exactly a transmission primaries as multicast information in 802.11, even bust this can not retransmit yet, the present invention has the effect of obvious reduction frame error rate.
As seen, in situation 4, the present invention's resource of can saving time has improved spectrum efficiency in situation 1, and can obtain the diversity gain with other cooperation transmission meanss.And situation 5 times, the present invention need use the time resource that is equal to traditional multicast and cooperation multicast.In general, the present invention has not only improved the reliability of system transmissions, has reduced the interruptions in transmissions probability, and has saved system resource, comprises time resource and power resource.
Parameter and term explanation:
DT: data frame transfer sub-slots;
X
1: the Frame of certain sub-slots transmission;
X
2: the Frame of next sub-slots transmission;
: mould 2 Hes of two Frames;
σ
Si 2(i=1,2): sending node is to the average channel gain of each destination node, and wherein i represents the destination node numbering;
σ
Ri 2(i=1,2): cooperative nodes is to the average channel gain of each destination node, and wherein i represents the destination node numbering;
σ
Sr 2: sending node is to the average channel gain of cooperative nodes
As shown in Figure 4 and Figure 5, before system operation, sending node need determine that cooperative nodes implements the collaborative program of this network code cooperation.Even although can obtain gain equally under the cooperative nodes wide node situation, be positioned at sending node and destination node cooperative nodes before and can further improve systematic function.Therefore, sending node need select suitable cooperative nodes to improve systematic function between candidate's cooperative nodes is concentrated.For simplified system, can in the subclass of sending node and the set of each destination node neighbor node, select cooperative nodes at random.So, can guarantee that the channel average gain between cooperative nodes and the destination node is better than the average gain of channel between sending node and the destination node, thereby can improve the multicast reliability and reduce frame error rate.Finish the selection of cooperative nodes, then can implement multicasting method of the present invention.The wireless network data link layer protocol standard that current I EEE802.11 standard committee formulates can only provide reliability for unicast data transmission.Its uses be carrier detect repeatedly access/collision avoid (CSMA/CA) carrier monitoring mechanism of reaching an agreement on, but and be not suitable for multicast service.And multicasting method of the present invention can directly apply to and goes in 802.11 agreements, reduces outage probability and frame error rate to reach, and reaches the effect that improves transmission reliability.
In concrete scheme implementation, as shown in Figure 5, comprise step: at first initialization, the cooperative nodes of selection multicast; First sub-slots is sent transferring data frames X by sending node-cooperative nodes, sending node-a plurality of destination nodes
1, the reception condition that cooperative nodes and sending node frame are listened destination node, the reception information of receiving target node feedback; Second sub-slots is sent transferring data frames X by sending node-cooperative nodes-a plurality of destination nodes
2, the reception condition that cooperative nodes and sending node frame are listened destination node, the reception information of receiving target node feedback; Determine the transmission of next sub-slots according to the reception condition of destination node and cooperative nodes: if all destination nodes successfully receive information frame X
1And X
2, sending node will transmit new information frame at next time slot so, thus periodic duty.Equally, if destination node is lost different information frames respectively, to send the network code version of information frame so at the 3rd sub-slots, in the case, because two destination nodes have successfully received one of them information frame, as long as can successfully receive this compound frame, destination node just can recover the another one information frame.Then restart to send new information frame, periodic duty at the 4th sub-slots.
As shown in Figure 4.As seen, can save 1/4 channel resource if destination node is lost respectively under the situation of different information frames, thereby improve spectrum efficiency.If but a destination node is lost all information frames, will still need two sub-slots to come forwarding information so.
For the systematic function criterion system performance gain that the present invention reaches is described with the outage probability below.Outage probability refers to the probability that current channel capacity is lower than transmission rate.Experiment shows no matter use which kind of cooperative nodes, adopts systematic function of the present invention all to be better than traditional multicast pattern, as shown in Figure 6.When cooperative nodes was between sending node and destination node, outage probability was minimum, and systematic function is best.When outage probability is 1%, can obtain the snr gain of 10 decibels (dB).Even compare with cooperation multicast scheme, outage probability of the present invention is almost identical with the outage probability that adopts cooperation multicast scheme, thereby explanation the present invention has obtained diversity gain, as shown in Figure 7.It should be noted that the present invention has also saved resource simultaneously.Under given average signal-to-noise ratio condition, different transmission rates situation performance of the present invention also is enough to cooperation multicast scheme comparable, is better than traditional multicast, as shown in Figure 8.The present invention is equally applicable to asymmetric destination node (sending node is to the channel average gain difference of each destination node) situation.Spectrum efficiency of the present invention obviously is better than other schemes, comprises traditional multicast and cooperation multicast.The outage probability schematic diagram of the various topological structures under asymmetric transmission-receive channel topology as shown in Figure 9, the different signal to noise ratio, as shown in figure 10, in given spectrum efficiency is under 0.5 bps/hertz (b/s/Hz), and the present invention is can obtain the spectral efficiency gain that is higher than other schemes 0.4 bps/hertz (b/s/Hz) under 15 decibels of (dB) situations at all channel average signal-to-noise ratios.
Above execution mode only is used to illustrate the present invention; and be not limitation of the present invention; the those of ordinary skill in relevant technologies field; under the situation that does not break away from the spirit and scope of the present invention; can also make various variations and modification; therefore all technical schemes that are equal to also belong to category of the present invention, and scope of patent protection of the present invention should be defined by the claims.
Claims (6)
1. the cooperative wireless multipath method of a coding Network Based is characterized in that, this method may further comprise the steps:
S101, sending node S adopt a sub-slots to send new frame X
1To cooperative nodes R and a plurality of destination node d, d feedback frame X
1Reception information to S and R;
S102, sending node S adopt the next son time slot to send new frame X
2To cooperative nodes R and a plurality of destination node d, d feedback frame X
2Reception information to S and R;
S103 is according to the frame X that is fed back
1And X
2Reception information judge the reception condition of d;
If s104 is all successful received frame X of a plurality of destination node d
1And X
2, change step s109, if not, change step s105;
S105 is if not have d lost frames X simultaneously at least
1And X
2The time, change step s106;
S106 judges whether R successfully receives lost frames, if, change step s107, if not, change step s108;
S107, R encodes to lost frames, makes the compound frame behind the coding carry lost frames information, by R compound frame is sent to d at the next son time slot, and d decodes to compound frame and obtains lost frames, changes step s109;
S108, S encodes to lost frames, makes the compound frame behind the coding carry lost frames information, by S compound frame is sent to d at the next son time slot, changes step s109;
S109 sends as if all frames, then ending method; Otherwise, change step s101.
2. the method for claim 1 is characterized in that, at step s105, if having destination node lost frames X simultaneously at least
1And X
2, change step s106 ';
S106 ' judges whether R successfully receives lost frames X
1And X
2If,, change step s107 ', if not, change step s108 ';
S107 ', R adopt two sub-slots respectively with lost frames X
1And X
2Send to d, change step s109;
S108 ', S adopt two sub-slots to come retransmits lost frame X respectively
1And X
2To d, change step s109.
3. the method for claim 1 is characterized in that,
In step s105, if one or more destination node d have only lost an information frame X
1, or one or more destination node d has only lost an information frame X
2
In step s106, judge that drawing R successfully receives lost frames X
1Or X
2
In step s107, the compound frame behind the R coding is lost frames X
1Or X
2Itself;
In step s108, the compound frame behind the S coding is lost frames X
1Or X
2Itself.
4. the method for claim 1 is characterized in that,
In step s105, if at least one destination node d has only lost one of them frame X
1Or X
2, but total situation is to have lost different frame X in a plurality of destination node
1, X
2
In step s106, judge that drawing R successfully receives lost frames X
1And X
2
In step s107, the compound frame behind the R coding is lost frames
In step s108, the compound frame behind the S coding is lost frames
5. the method for claim 1, it is characterized in that, in this method, also comprising step s100 before the step s101: in the subclass of the neighbor node of sending node S set neutralizes the subclass of neighbor node set of each destination node d, select cooperative nodes R at random.
6. as method as described in the claim 5, it is characterized in that described cooperative nodes is 1.
Priority Applications (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN2009100767421A CN101478372B (en) | 2009-01-16 | 2009-01-16 | Cooperative wireless multipath method based on network encoding |
Applications Claiming Priority (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN2009100767421A CN101478372B (en) | 2009-01-16 | 2009-01-16 | Cooperative wireless multipath method based on network encoding |
Publications (2)
| Publication Number | Publication Date |
|---|---|
| CN101478372A CN101478372A (en) | 2009-07-08 |
| CN101478372B true CN101478372B (en) | 2011-09-14 |
Family
ID=40839008
Family Applications (1)
| Application Number | Title | Priority Date | Filing Date |
|---|---|---|---|
| CN2009100767421A Expired - Fee Related CN101478372B (en) | 2009-01-16 | 2009-01-16 | Cooperative wireless multipath method based on network encoding |
Country Status (1)
| Country | Link |
|---|---|
| CN (1) | CN101478372B (en) |
Families Citing this family (1)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN102208962B (en) * | 2011-05-19 | 2014-04-02 | 清华大学 | Wireless data transmission method |
Citations (3)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN1741635A (en) * | 2004-11-01 | 2006-03-01 | 华为技术有限公司 | Method for realizing multi-transmitting business macro diversity |
| CN1921415A (en) * | 2006-09-27 | 2007-02-28 | 北京航空航天大学 | Equation method for network resource load |
| CN101335906A (en) * | 2007-06-27 | 2008-12-31 | 华为技术有限公司 | Multi-service information sending method, multi-service implementing method and communication device |
-
2009
- 2009-01-16 CN CN2009100767421A patent/CN101478372B/en not_active Expired - Fee Related
Patent Citations (3)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN1741635A (en) * | 2004-11-01 | 2006-03-01 | 华为技术有限公司 | Method for realizing multi-transmitting business macro diversity |
| CN1921415A (en) * | 2006-09-27 | 2007-02-28 | 北京航空航天大学 | Equation method for network resource load |
| CN101335906A (en) * | 2007-06-27 | 2008-12-31 | 华为技术有限公司 | Multi-service information sending method, multi-service implementing method and communication device |
Also Published As
| Publication number | Publication date |
|---|---|
| CN101478372A (en) | 2009-07-08 |
Similar Documents
| Publication | Publication Date | Title |
|---|---|---|
| US8027284B2 (en) | Method and apparatus for reliable multicasting in wireless relay networks | |
| JP4834081B2 (en) | Multi-carrier scheduling | |
| EP1411688B1 (en) | Method and apparatus for multicast data retransmission | |
| JP5190114B2 (en) | Method and system for reliable relay related transmission scheme and opportunistic cooperative transmission scheme | |
| JP5058012B2 (en) | Radio communication base station apparatus, radio communication relay apparatus, radio communication terminal apparatus, packet retransmission method, and radio communication system | |
| US8745470B2 (en) | Method and system for data transmission in a data network | |
| US8819529B2 (en) | Method of communication | |
| US20100110960A1 (en) | Mbms data transmission and receiving in packet based on mobile communication system | |
| JP5690480B2 (en) | Base station, user terminal, and method for realizing single cell enhanced MBMS | |
| CN1843002B (en) | point-to-multipoint transmission | |
| CN102740352B (en) | Adaptive cooperation method, terminal, base station, and relay equipment based on relay selection | |
| CN102843227B (en) | A kind of based on MAC layer repeating method and device | |
| CN102208962A (en) | Wireless data transmission method | |
| WO2009127141A1 (en) | Data transmission method | |
| CN101478372B (en) | Cooperative wireless multipath method based on network encoding | |
| KR20080012124A (en) | Wireless communication network system and method of transmitting multicast packet over the wireless communication network | |
| CN102013965A (en) | Method for transmitting broadcast service by utilizing carrier aggregation technology and retransmitting by utilizing network coding | |
| JP5032678B2 (en) | Multi-carrier scheduling | |
| Li et al. | HLBP: a hybrid leader based protocol for MAC layer multicast error control in wireless LANs | |
| CN102394730B (en) | Multi-carrier wave dispatch | |
| KR20080083085A (en) | Communication method in a wireless network, communication method of a station in a wireless network, and a station | |
| CN102714583A (en) | Data transmission method and system | |
| Juang | Enhanced wireless broadcasting systems employing network coding |
Legal Events
| Date | Code | Title | Description |
|---|---|---|---|
| C06 | Publication | ||
| PB01 | Publication | ||
| C10 | Entry into substantive examination | ||
| SE01 | Entry into force of request for substantive examination | ||
| C14 | Grant of patent or utility model | ||
| GR01 | Patent grant | ||
| 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: 20110914 Termination date: 20170116 |