CN102970117B - Method for suitable for end-to-end degree of freedom feedback of random linear network coding - Google Patents
Method for suitable for end-to-end degree of freedom feedback of random linear network coding Download PDFInfo
- Publication number
- CN102970117B CN102970117B CN201210516856.5A CN201210516856A CN102970117B CN 102970117 B CN102970117 B CN 102970117B CN 201210516856 A CN201210516856 A CN 201210516856A CN 102970117 B CN102970117 B CN 102970117B
- Authority
- CN
- China
- Prior art keywords
- freedom
- node
- degree
- source node
- destination node
- 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
Abstract
The invention relates to a method for suitable for end-to-end degree of freedom feedback of random linear network coding. According to the method, end-to-end degree of freedom feedback is adopted and mainly comprises a treatment flow of a source node, an intermediate node and a destination node. In the method, degree of freedom represents a number of insufficient linearly independent coding groups of the destination node. Through the end-to-end degree of freedom feedback, timers are arranged on the sound node and the destination nodes, so that the source node can immediately know the receiving condition of the destination node so as to regulate a transmission strategy, therefore, the interaction between the source node and the destination node is promoted, unnecessary transmission is reduced, and network performances are improved. The method adopting the end-to-end degree of freedom is simple, and can reflect the demand of nodes on the insufficient coding groups.
Description
Technical field
The present invention relates to a kind of method being applicable to the end-to-end degree of freedom feedback of random linear network encoding.The method, by the degree of freedom of destination node is fed back to source node, makes source node can understand the reception condition of destination node in time, thus can adjust its transmission policy targetedly, and then improve network performance.The method adopting the end-to-end degree of freedom to feed back is not only succinct, also more accurately can reflect that destination node is to the demand still lacking coding groups.
Background technology
In recent years, along with the development of technology and the growth of user's request, radio self organizing network technology is subject to the extensive concern of academia and industrial quarters always, and becomes the popular research field of the active wireless network communication technology.For a long time, no matter in academia or industrial quarters, mostly attempt to utilize the thinking of wire communication to study wireless network, after transforming a little by the various results of study being applicable to cable network, be applied to wireless self-organization network.In fact, compared with wire communication, radio communication has the place of its uniqueness, the broadcast characteristic of the most outstanding is exactly some wireless channel, this wireless network node can be caused to receive packet that a large amount of destination node is not oneself.If wireless link is considered as " wire link ", so the grouping of these redundancies directly abandons by node, and this wastes limited radio channel resource undoubtedly.Therefore, if features such as energy Appropriate application wireless broadcast channels, the performance of wireless self-organization network will obtain larger improvement space.
Network code is one of major progress in recent years acquired by communication theory field, good resolving ideas is given to how utilizing the broadcast characteristic of radio communication, its core concept is that network node not only performs data forwarding capability, also carry out coded treatment by the packet received, this wherein just can comprise those and be considered to the grouping that redundancy will be dropped in the past.In fact, the broadcast characteristic of wireless self-organization network and the multi-hop feature of topology are applicable to the broadcast requests of network code very much, and conversely, network code can adapt to again the dynamic of wireless self-organization network well.Therefore, network coding technique is applied in the research of wireless self-organization network and becomes very natural.In recent years, network code emerged large quantities of achievement in research at aspect of performances such as improving the throughput of wireless self-organization network, reliability.
Feedback mechanism is essential in current network protocol design, and by feedback, sending node can recognize the reception condition of receiving node, and then realizes the objects such as speed control, transmitting.When adopting network code, a coding groups often carries the information of multiple original packet, and therefore, receiving node only could decode out raw information in the coding groups collecting abundant linear independence.Following feedback system can be taked: source node ceaselessly sends coding groups until receive destination node to the completed feedback packet of present lot always in more existing network code agreements (such as classical network code agreement MORE).Might as well suppose that coding batch size is k, then destination node only just produces a feedback packet confirmed present lot (being called a batch feedback) when receiving the coding groups of k linear independence, if source node file after receiving this feedback does not also transfer, just start the transmission of next batch.Compare conventional transmission mode, this batch feedback system completely decreases a large amount of feedback flows produced the confirmation of individual data grouping on the one hand, improves efficiency; On the other hand, under the wireless multi-hop network environment of reality, feedback packet experiences very large time delay possibly and could arrive source node, source node can continue to send the coding groups of present lot owing to not receiving feedback in time, this can aggravate the severe of network condition, make feedback packet arrive the time delay of source node more greatly, cause vicious circle thus.These all can cause limited Internet resources to be wasted in a large number, and then affect the network performance such as throughput and time delay.Therefore, need a kind of method that in time reception condition of destination node can be fed back to source node badly, improve network performance further.
The present invention proposes a kind of method being applicable to the end-to-end degree of freedom feedback of random linear network encoding, and the degree of freedom of destination node is fed back to source node by the method, and the degree of freedom is the description to the number still lacking coding groups.Under this kind of method, destination node only just need not send feedback packet when receiving the coding groups of abundant linear independence, but just the degree of freedom can be fed back to source node in due course.At this moment source node just can understand the concrete reception condition of destination node according to the degree of freedom, and then adjusts its sending strategy, improves efficiency of transmission.
[list of references]
[1]J.S.Park，D.S.Lun，F.Soldo，“Performance of Network Coding in Ad Hoc Networks”，IEEE MILCOM 2006，Washing DC，USA，2006.
[2]D.Wang，Q.Zhang，J.C.Liu，“Pratial Network Coding：Theory and Application inContinuous Sensor Data Collection”，IEEE IWQoS 2006，New Haven，CT，USA，2006.
[3]A.G.Dimakis，P.B.Godfrey，M.Wainwright，“Network Coding for Distributed StorageSystems”，IEEE INFOCOM 2007，Anchorage，AK，USA.
[4]J.S.Park，M.Gerla，D.S.Lun，Y.Yi，and M.Médard，“CodeCast：ANetwork-Coding-Based Ad Hoc Multicast Protocol”，IEEE Wireless Communications，No.5，2006，pp.76-81.
[5]S.Chachulski，M.Jennings，S.Katti，and D.Katabi，“Trading Structure forRandomness in Wireless Opportunistic Routing”，ACM SIGCOMM 2007，Kyoto Japan，2007.
[6]D.Koustonikolas，C.C.Wang，and Y.C.Hu，“CCACK：Efficient Network Coding BasedOpportunistic Routing Through Cumulative Coded Acknowledgements”，IEEE INFOCOM2010 Mini Conference，San Diego，USA，2010.
[7]Y.Lin，B.Lin，and B.Liang，“CodeOR：Opportunistic Routing in Wireless MeshNetworks with Segmented Network Coding”，IEEE ICNP 2008，Florida，USA，2008.
Summary of the invention
Technical problem: the object of this invention is to provide a kind of method fed back based on the end-to-end degree of freedom being applicable to random linear network encoding.Source node utilizes the method can understand the reception condition of destination node in time, and then reduces the unnecessary transmission of node by the adjustment of sending strategy and accelerate whole transmission process, while lifting throughput, reduce unnecessary expense.The method can be applied in general random linear network encoding agreement, supports clean culture and multicast simultaneously.
Technical scheme: current most widely used network code strategy is random linear network encoding, namely node data to be sent are divided into fixed size batch, then forward after the multiple grouping stochastic linear combinations in batch again, after destination node receives the coding groups of abundant linear independence, the original packet of this batch can be decoded by Gaussian elimination method.Under traditional batch feedback system, destination node only just sends in the coding groups receiving abundant linear independence and feeds back to source node, this kind of feedback system may cause node-node transmission too much, cause limited Internet resources to be wasted in a large number, thus affect the network performance such as throughput and time delay.
For solving the problem, the present invention proposes the feedback method based on the end-to-end degree of freedom.The degree of freedom dactylus point of node wants to separate the number that code book batch at least also needs the coding groups of the linear independence received.The core concept of this method is destination node and carves in due course the degree of freedom of this node is fed back to source node, and then source node is according to its transmission policy of degree of freedom dynamic conditioning.
The process employs degree of freedom feedback end to end, and degree of freedom feedback mainly comprises the handling process of source node, intermediate node and destination node end to end, specific as follows:
The handling process of source node is:
11) set coding batch size as k, when the first round transmission of each batch, the coding groups number that source node sends is N (k)=k* (1+r), and enter wait state after sending, wherein parameter r is redundancy of giving out a contract for a project;
12) suppose that source node receives the degree of freedom feedback of destination node sometime, and the degree of freedom of its feedback is f, if f=0, then source node enters the transmission of next batch; If f ≠ 0, then represent the coding groups that destination node also lacks f linear independence, namely receive the coding groups of (k-f) individual linear independence, at this moment source node should continue to send coding groups to meet the demand of destination node; Meanwhile, for preventing waits for too long, source node starts a timer T when receiving the one degree of freedom feedback packet of destination node
s;
13) if at timer T
sbefore time-out, source node has received the feedback packet that the destination node degree of freedom is 0, then while starting to send next batch of grouping, cancel timer T
s; If timer T
sovertime and source node epicycle transmission terminates, then need decision-making again: source node, according to the degree of freedom of the current up-to-date feedback packet display received, is set to f
new, then source node continues to send f
new* (1+r) individual coding groups, resets timer T simultaneously
s;
14) when there is multiple destination node, can there is following change in the process of source node: first, and source node may receive the degree of freedom feedback packet of multiple destination node, as timer T
stime-out is when the coding groups number that decision-making source node next round will send, and its degree of freedom gets the maximum of the degree of freedom received at present; Secondly, only when to receive all destination node degrees of freedom be the feedback packet of 0, source node just stops the transmission of present lot, the transmission of beginning next batch;
The handling process of intermediate node is:
21) intermediate forwarding nodes is responsible for forwarding the coding groups recompile received and the route of feedback packet again; When receiving one degree of freedom and being the feedback packet of 0, this node will stop the transmission of present lot coding groups; The handling process of destination node is:
31) destination node receives only and the coding groups of linear independence number identical with present lot, if the grouping received is the coding groups of first linear independence of present lot, in order to its reception condition being fed back to source node in time, destination node now can start another timer T
d, its size is arranged according to concrete reception condition;
32) if at timer T
dbefore time-out, destination node has collected the coding groups of the linear independence of present lot, then produce one degree of freedom and be the feedback packet of 0 and send it back source node, cancel timer T simultaneously
d;
33) if timer T
dtime-out, then destination node calculates this node degree of freedom f=k – m now, and wherein, batch size is k, and the coding groups having received linear independence is m, degree of freedom f is placed on the head of feedback packet; This type of feedback packet all desirably the number of transmissions ETX optimal path is transferred to source node, resets timer T while transmission
d; When there is multiple destination node, each destination node arranges oneself timer respectively.
Beneficial effect: the present invention proposes a kind of method being applicable to the end-to-end degree of freedom feedback of random linear network encoding.By the feedback of the degree of freedom end to end, source node can in time according to its sending strategy of reception condition dynamic conditioning of destination node, thus decrease unnecessary transmission, take full advantage of limited Internet resources, further increase Business Stream throughput, the method can be widely used in various random linear network encoding agreement.
Accompanying drawing explanation
Below in conjunction with accompanying drawing, the present invention is further described.
Fig. 1: the handling process schematic diagram of source node.
Fig. 2: the handling process schematic diagram of destination node.
Embodiment
In the method, destination node feeds back the degree of freedom of this node, and source node decides according to the degree of freedom of feedback the coding groups number that its continuation will send.The specific embodiment of the present invention is:
The concrete handling process of source node:
1) as shown in Figure 1, suppose that coding batch size is k, when the first round transmission of each batch, the coding groups number that source node sends is that (parameter r represents transmission redundancy to N (k)=k* (1+r), its value can carry out dynamic conditioning as the case may be), if after sending, enter wait state.
2) suppose that source node receives the degree of freedom feedback of destination node sometime, and the degree of freedom of its feedback is f.If f=0, then source node enters the transmission of next batch; If f unequal to 0, then represent the coding groups that destination node also lacks f linear independence, namely receive the coding groups of (k-f) individual linear independence, at this moment source node should continue to send coding groups to meet the demand of destination node.Meanwhile, for preventing waits for too long, source node starts a timer T when receiving the one degree of freedom feedback packet of destination node
s.
3) if at timer T
sbefore time-out, source node has received the feedback packet that the destination node degree of freedom is 0, then while starting to send next batch of grouping, cancel timer T
s.If timer T
sovertime and source node epicycle transmission terminates, then need decision-making again.Source node, according to the degree of freedom of the current up-to-date feedback packet display received, might as well be set to f
new, then continuation is sent f by source node
new* (1+r) individual coding groups, resets timer T simultaneously
s.
Such source node is in transmission always---waiting for ACK---timer expiry---, and continue the state of transmission, until its degree of freedom f=0 of the feedback packet received, this represents the coding groups that destination node has received k linear independence.If at this moment file transfer does not also terminate, then source node starts the transmission of next batch.
When there is multiple destination node, following change can occur: first, source node may receive the degree of freedom feedback packet of multiple destination node, as timer T
stime-out is when the coding groups number that decision-making source node next round will send, and its degree of freedom gets the maximum of the degree of freedom received at present; Secondly, only when to receive all destination node degrees of freedom be the feedback packet of 0, source node just stops the transmission of present lot, the transmission of beginning next batch.
The concrete handling process of intermediate node:
Intermediate forwarding nodes is responsible for forwarding the coding groups recompile received and the route of feedback packet again.When receiving one degree of freedom and being the feedback packet of 0, this node will stop the transmission of present lot coding groups.
The concrete handling process of destination node:
1) as Fig. 2, destination node receives only and the coding groups of linear independence number identical with present lot.If the grouping received is the coding groups of first linear independence of present lot, in order to its reception condition being fed back to source node in time, destination node now can start a timer T
d(its size can be arranged according to concrete reception condition).
2) if at timer T
dbefore time-out, destination node has collected the coding groups of the linear independence of present lot, then produce one degree of freedom and be the feedback packet of 0 and send it back source node, cancel timer simultaneously.
3) if timer T
dtime-out, then destination node calculates this node degree of freedom now and (supposes that batch size is k, received the coding groups of m linear independence, then degree of freedom f=k-m, placed it in the head of feedback packet.This type of feedback packet is all transferred to source node according to ETX optimal path, resets timer T while transmission
d.Process like this is until collect present lot.When there is multiple destination node, each destination node arranges oneself timer respectively.
Claims (1)
1. one kind is applicable to the method for the end-to-end degree of freedom feedback of random linear network encoding, it is characterized in that the process employs degree of freedom feedback end to end, and degree of freedom feedback mainly comprises the handling process of source node, intermediate node and destination node end to end, specific as follows:
The handling process of source node is:
11) set coding batch size as k, when the first round transmission of each batch, the coding groups number that source node sends is N (k)=k* (1+r), and enter wait state after sending, wherein parameter r is redundancy of giving out a contract for a project;
12) suppose that source node receives the degree of freedom feedback of destination node sometime, and the degree of freedom of its feedback is f, if f=0, then source node enters the transmission of next batch; If f ≠ 0, then represent the coding groups that destination node also lacks f linear independence, namely received the coding groups of k-f linear independence, at this moment source node should continue to send coding groups to meet the demand of destination node; Meanwhile, for preventing waits for too long, source node starts a timer T when receiving the one degree of freedom feedback packet of destination node
s;
13) if at timer T
sbefore time-out, source node has received the feedback packet that the destination node degree of freedom is 0, then while starting to send next batch of grouping, cancel timer T
s; If timer T
sovertime and source node epicycle transmission terminates, then need decision-making again: source node, according to the degree of freedom of the current up-to-date feedback packet display received, is set to f
new, then source node continues to send f
new* (1+r) individual coding groups, resets timer T simultaneously
s;
14) when there is multiple destination node, can there is following change in the process of source node: first, and source node can receive the degree of freedom feedback packet of multiple destination node, as timer T
stime-out, when the coding groups number that decision-making source node next round will send, the degree of freedom of destination node gets the maximum of the degree of freedom received at present; Secondly, only when to receive all destination node degrees of freedom be the feedback packet of 0, source node just stops the transmission of present lot, the transmission of beginning next batch; The handling process of intermediate node is:
21) intermediate node is responsible for forwarding the coding groups recompile received and the route of feedback packet again; When receiving one degree of freedom and being the feedback packet of 0, this node will stop the transmission of present lot coding groups;
The handling process of destination node is:
31) destination node receives only and the coding groups of linear independence number identical with present lot, if the grouping received is the coding groups of first linear independence of present lot, in order to its reception condition being fed back to source node in time, destination node now can start another timer T
d, its size is arranged according to concrete reception condition;
32) if at timer T
dbefore time-out, destination node has collected the coding groups of the linear independence of present lot, then produce one degree of freedom and be the feedback packet of 0 and send it back source node, cancel timer T simultaneously
d;
33) if timer T
dtime-out, then destination node calculates this node degree of freedom f=k – m now, and wherein, batch size is k, and the coding groups having received linear independence is m, degree of freedom f is placed on the head of feedback packet; This type of feedback packet all desirably the number of transmissions optimal path is transferred to source node, resets timer T while destination node sends feedback packet
d; When there is multiple destination node, each destination node arranges oneself timer respectively.
Priority Applications (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN201210516856.5A CN102970117B (en) | 2012-12-05 | 2012-12-05 | Method for suitable for end-to-end degree of freedom feedback of random linear network coding |
Applications Claiming Priority (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN201210516856.5A CN102970117B (en) | 2012-12-05 | 2012-12-05 | Method for suitable for end-to-end degree of freedom feedback of random linear network coding |
Publications (2)
| Publication Number | Publication Date |
|---|---|
| CN102970117A CN102970117A (en) | 2013-03-13 |
| CN102970117B true CN102970117B (en) | 2015-06-24 |
Family
ID=47800015
Family Applications (1)
| Application Number | Title | Priority Date | Filing Date |
|---|---|---|---|
| CN201210516856.5A Expired - Fee Related CN102970117B (en) | 2012-12-05 | 2012-12-05 | Method for suitable for end-to-end degree of freedom feedback of random linear network coding |
Country Status (1)
| Country | Link |
|---|---|
| CN (1) | CN102970117B (en) |
Families Citing this family (4)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN104243098A (en) * | 2014-09-23 | 2014-12-24 | 中国人民解放军理工大学 | Transmitting method based on parallel batch network coding |
| US10034200B2 (en) * | 2015-10-23 | 2018-07-24 | Motorola Mobility Llc | Iteratively transmitting random linear network encoded packets from multiple transmission nodes |
| CN109104262B (en) * | 2018-07-03 | 2021-12-10 | 深圳市智慧海洋科技有限公司 | Underwater sound wireless reliable communication method |
| CN110248384B (en) * | 2019-06-20 | 2023-05-09 | 中国科学院大学 | Single-hop wireless multicast packet length optimization method based on random linear network coding |
Citations (3)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN101247205A (en) * | 2007-12-07 | 2008-08-20 | 中国人民解放军理工大学 | Combined periodic line consumption measurement encoding method |
| US7529198B2 (en) * | 2005-04-07 | 2009-05-05 | Microsoft Corporation | Scalable overlay network |
| CN101621353A (en) * | 2008-07-03 | 2010-01-06 | 华为技术有限公司 | Method, device and system for random linear network encoding |
-
2012
- 2012-12-05 CN CN201210516856.5A patent/CN102970117B/en not_active Expired - Fee Related
Patent Citations (3)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| US7529198B2 (en) * | 2005-04-07 | 2009-05-05 | Microsoft Corporation | Scalable overlay network |
| CN101247205A (en) * | 2007-12-07 | 2008-08-20 | 中国人民解放军理工大学 | Combined periodic line consumption measurement encoding method |
| CN101621353A (en) * | 2008-07-03 | 2010-01-06 | 华为技术有限公司 | Method, device and system for random linear network encoding |
Also Published As
| Publication number | Publication date |
|---|---|
| CN102970117A (en) | 2013-03-13 |
Similar Documents
| Publication | Publication Date | Title |
|---|---|---|
| RU2357379C2 (en) | Method and device for hybrid multiple-address and single-address transfer in data transfer network | |
| JP2023153400A (en) | Wireless communication method and computer program | |
| JP2016506176A (en) | Multi-enterprise device multicasting or broadcasting communication | |
| Khreishah et al. | Distributed network coding-based opportunistic routing for multicast | |
| CN102970117B (en) | Method for suitable for end-to-end degree of freedom feedback of random linear network coding | |
| CN101212285A (en) | Opportunity synergy based automatic retransmission request method | |
| CN101895376A (en) | Transmission method for realizing data broadcasting in multi-hop wireless network | |
| CN103428803A (en) | Opportunistic routing method combining with opportunistic network coding | |
| Gao et al. | COPE: Improving energy efficiency with coded preambles in low-power sensor networks | |
| CN108135020A (en) | A kind of wireless sensor network opportunistic routing protocol design method based on network code | |
| CN102970235B (en) | Multicast routing method based on intra-flow and inter-flow network encoding in wireless mesh network | |
| Jerbi et al. | MSU-TSCH: A Mobile scheduling updated algorithm for TSCH in the internet of things | |
| CN111836209A (en) | Method and system for improving LoRa single-channel data transmission efficiency | |
| CN111935664B (en) | Network data real-time collection method based on dynamic feedback | |
| Hernández Marcano et al. | Throughput, energy and overhead of multicast device‐to‐device communications with network‐coded cooperation | |
| Narmawala et al. | Survey of applications of network coding in wired and wireless networks | |
| CN108259132B (en) | Bidirectional cooperative access method based on self-adaptive multi-decoding | |
| US11950324B2 (en) | Techniques for multi-data rate communications | |
| JP2016201833A (en) | Data broadcast with prepare-to-broadcast message | |
| WO2011107048A2 (en) | Communication method, apparatus and system used for bidirectional relay system | |
| Zhou et al. | Network coded constrained application protocol with improved energy efficiency for iiot networks | |
| CN103313141A (en) | Cooperative node selection establishment method for distribution type wireless multicast | |
| EP2182673A1 (en) | systems and methods for improving multicast communications | |
| Wei et al. | Network Coding Based Reliable Multi-path Routing in Wireless Sensor Network | |
| CN104639292A (en) | Method suitable for secondary user network encoding transmission in cognitive radio network |
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 |
Granted publication date: 20150624 Termination date: 20151205 |
|
| EXPY | Termination of patent right or utility model |