CN103220086B - High throughput network coding method in a kind of wireless network - Google Patents

High throughput network coding method in a kind of wireless network Download PDF

Info

Publication number
CN103220086B
CN103220086B CN201310141842.4A CN201310141842A CN103220086B CN 103220086 B CN103220086 B CN 103220086B CN 201310141842 A CN201310141842 A CN 201310141842A CN 103220086 B CN103220086 B CN 103220086B
Authority
CN
China
Prior art keywords
data flow
bag
packet
network
data
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
Application number
CN201310141842.4A
Other languages
Chinese (zh)
Other versions
CN103220086A (en
Inventor
池凯凯
朱艺华
李燕君
伍永超
程珍
Current Assignee (The listed assignees may be inaccurate. Google has not performed a legal analysis and makes no representation or warranty as to the accuracy of the list.)
Guangdong Gaohang Intellectual Property Operation Co ltd
Pinghu Shengjia Electronics Co ltd
Original Assignee
Zhejiang University of Technology ZJUT
Priority date (The priority date is an assumption and is not a legal conclusion. Google has not performed a legal analysis and makes no representation as to the accuracy of the date listed.)
Filing date
Publication date
Application filed by Zhejiang University of Technology ZJUT filed Critical Zhejiang University of Technology ZJUT
Priority to CN201310141842.4A priority Critical patent/CN103220086B/en
Publication of CN103220086A publication Critical patent/CN103220086A/en
Application granted granted Critical
Publication of CN103220086B publication Critical patent/CN103220086B/en
Expired - Fee Related legal-status Critical Current
Anticipated expiration legal-status Critical

Links

Landscapes

  • Data Exchanges In Wide-Area Networks (AREA)
  • Mobile Radio Communication Systems (AREA)

Abstract

The invention discloses network coding method in a kind of radio communication, comprise step: select step: according to bag size, can reach transmission rate ease up bag deposit number select participate in coding data flow; Combination step: to each selected data flow out participating in encoding, determine the packet number that this data flow will be combined and carry out data packet group conjunction; Coding step: the combination bag of selected data flow out or plaintext bag are carried out network-encoding operation, obtains the encoded packets that this sends.The present invention can reduce the number of times of raw data packets transmission on network node in wireless network, greatly improves network throughput, has good practical value.

Description

High throughput network coding method in a kind of wireless network
Technical field
The present invention relates to radio network technique field, particularly relate to the packet networks coding method in a kind of wireless network on network node.
Technical background
Current, wireless communication technology has been widely used in the various aspects of society, and it is greatly convenient to bring to the life of people.But compared to wire communication, a remarkable deficiency of radio communication is that bandwidth is very limited.Due to this deficiency, the supported throughput of current wireless communication technology is well below wire communication, make service quality also not reach the demand of people far away, such as utilize smart mobile phone to watch high-definition live broadcasting program online, its clarity and fluency require very large gap from people.
Network coding technique is a kind of technology be suitable for very much for improving wireless communication throughput, its main thought is that network trunk node is by multiple encoded packets needing the clear data packet encoder of transmission to become a size constant, then transmission encoded packets reaches once to wrap to send and just multiple clear data bag is delivered to multiple receiving node, thus effectively improve efficiency of transmission, greatly improve radio throughput.
So far, a lot of literature research is had to devise good network coding method, such as loop coding method is (see " On the X-ities of Network Coding in WirelessNetworks ", publish in ACM SIGMETRICS, 2007) and COPE coding method (see " XORs in The Air:Practical Wireless Network coding ", publish in IEEE/ACM Transactions on Networking, 2008) etc.Also some relevant inventions are had:
On December 6th, 2010, Nanjing Univ. of Posts and Telecommunications Yang Zhen has applied for patent " a kind of Wireless mesh network coding method ".In the invention, by adding the destination node of DESN mark for marking raw data packets in the packet header of encoded packets, receiver side only needs the link entering via node to decode, Route Selection is carried out at the link of target approach node, thus reduce the number of times of raw data packets transmission, improve network throughput.
On May 15th, 2012, Harbin Engineering University Zhao Yun dragon has applied for patent " the network code restorative procedure of coding Network Based ".In the invention, decode node calculates required retransmission data packet may set by CBCR algorithm and forms RACK asks bag to send to neighbor node, and then neighbor node to be encoded the packet obtained needed for decode node according to the request content in RACK.
In existing network code algorithm, same data flow only has at most a packet to participate in coding.If there is the bag of several packet and other data flow to carry out network code in a data flow, then the receiving node of this data flow cannot carry out decoding to obtain these packets to encoded packets, can only obtain these data packet codings encoded packets together.
Summary of the invention
The present invention proposes and a kind ofly multiple packets of same data flow can be carried out the network coding method of decoding on a receiving node together with the packet encoder of other data flow, thus significantly increase network node once sends transmitted number of data packets, greatly improves the throughput of network node.
In order to realize above-mentioned technical assignment, the present invention takes following technical solution:
High throughput network coding method in a kind of wireless network, considers that the packet of different data flow is often in different size, has the packet of some data flow large especially, has the packet of some data flow little especially, by data flow F less for packet imultiple packet P i, 1..., P i,nin data before and after couple together and be combined into a large combination bag , then combination is wrapped become an encoded packets to send with the data packet coding of other data flow.Data flow F iafter corresponding receiving node receives encoded packets, can decode and obtain combination bag and this combination bag fractionation is obtained multiple raw data packets P i, 1..., P i,n, thus accomplish once to send and just multiple bags of data flow less for packet are delivered to receiving node, substantially increase throughput.Described high throughput network coding method comprises the following steps:
Step one: flowing through this node and having in the data flow of buffer memory bag, the data flow that can mutually encode is expressed as F 1, F 2..., F k, wherein K is the number of data streams that can mutually encode.In these data flow, pick out that stream that packet is maximum, be expressed as F x, x ∈ 1,2 ..., K}.
Step 2: encoded packets size L is set *=L x, encoded packets transmission rate R *=R xand the final set of data flows S participating in encoding operation f={ F x, wherein L ifor data flow F ithe size of middle packet, R ifor reached at the transmission rate of this wireless link of receiving node from coding nodes to data flow Fi.By data flow F in buffer memory xthe bag of arrival the earliest put into S set p, S pfor the set of the packet of network-encoding operation will be carried out.
Step 3: k=1 is set.
Step 4: if k=x, then jump to the 7th step.
Step 5: calculate , wherein N kdata flow F kthe packet number of institute's buffer memory, n kif be data flow F kin operation below, selected then this data flow that out participates in encoding will participate in the packet number of coding.
To data flow F k, check whether it meets the following conditions:
L * min { R k , R * } < L * R * + n k L k R k .
If data flow F kmeet this condition, then R is set *← min{R k, R *and S f← S f∪ { F k, by data flow F in buffer memory xn kcouple together before and after the individual data arriving bag the earliest, add packet header to be combined into a combination bag, S set put into by the bag that this is new p, then jump to the 7th step.
Step 6: check data flow F kwhether the packet number of institute's buffer memory exceedes 1/3rd of cache size, if exceed 1/3rd of cache size, then by data flow F kpick out and participate in coding, namely R is set *← min{R k, R *and S f← S f∪ { F k, by data flow F in buffer memory xn kcouple together before and after the individual data arriving bag the earliest, add packet header to be combined into a combination bag, S set put into by the bag that this is new p.
Step 7: k ← k+1 is set.If k=K+1, then jump to the 8th step; Otherwise, jump to the 4th step.
Step 8: by S set pin packet be encoded into an encoded packets by network-encoding operation, this encoded packets will with transmission rate R *send.
Step 9: terminate.
Technical characterstic of the present invention and effect:
1) coding method of the present invention breaches the deficiency that each data flow in existing network coding method only has at most a packet participation coding, multiple packages of data flow less for packet are synthesized a combination bag and participate in coding, thus accomplished that the data flow that packet is less can have multiple bag to participate in coding, substantially increase network node and once send transmitted number of data packets.
2) coding method of the present invention take into account physical layer transmission rate parameter to the impact of coding gain simultaneously, the physical layer of encoded data stream can reach transmission rate, choose suitable data flow to encode, reach larger coding gain based on each.
Accompanying drawing explanation
Fig. 1 is legacy network coding method schematic diagram.
Fig. 2 is network coding method schematic diagram (a) network coding method based on packet combined strategy, and the decoding of (b) receiving encoding bag and combination bag split schematic diagram.
Embodiment
Below in conjunction with accompanying drawing, the present invention will be further described.
Be legacy network coding method in Fig. 1, the maximum packet of each data flow participates in coding, participates in the small data packets afterbody zero padding of coding until length equals large packet.
We illustrate the specific embodiment of the present invention with the network code based on packet packaging strategy shown in Fig. 2.Network node is had to the wireless network of network code function, when a network node has send opportunity, based on the information of data flow flowing through this node, as data package size L i, link can reach transmission rate R i, buffer memory packet number N ideng, this node run coding method of the present invention to pick out participate in coding data flow, for data-flow computation that select packet is less go out for combination packet number and finally carry out network-encoding operation and obtain encoded packets.Described coding method comprises following steps:
Step one: flowing through this node and having in the data flow of buffer memory bag, the data flow that can mutually encode is expressed as F 1, F 2..., F k, wherein K is the number of data streams that can mutually encode.In these data flow, pick out that stream that packet is maximum, be expressed as F x, x ∈ 1,2 ..., K}.
Step 2: encoded packets size L is set *=L x, encoded packets transmission rate R *=R xand the final set of data flows S participating in encoding operation f={ F x, wherein L ifor data flow F ithe size of middle packet, R ifor from coding nodes to data flow F ireached at the transmission rate of this wireless link of receiving node.By data flow F in buffer memory xthe bag of arrival the earliest put into S set p, S pfor the set of the packet of network-encoding operation will be carried out.
Step 3: k=1 is set.
Step 4: if k=x, then jump to the 7th step.
Step 5: calculate , wherein N kdata flow F kthe packet number of institute's buffer memory, n kif be data flow F kin operation below, selected then this data flow that out participates in encoding will participate in the packet number of coding.
To data flow F k, check whether it meets the following conditions:
L * min { R k , R * } < L * R * + n k L k R k .
If data flow F kmeet this condition, then R is set *← min{R k, R *and S f← S f∪ { F k, by data flow F in buffer memory xn kcouple together before and after the individual data arriving bag the earliest, add packet header to be combined into a combination bag, S set put into by the bag that this is new p, then jump to the 7th step.
Step 6: check data flow F kwhether the packet number of institute's buffer memory exceedes 1/3rd of cache size, if exceed 1/3rd of cache size, then by data flow F kpick out and participate in coding, namely R is set *← min{R k, R *and S f← S f∪ { F k, by data flow F in buffer memory xn kcouple together before and after the individual data arriving bag the earliest, add packet header to be combined into a combination bag, S set put into by the bag that this is new p.
Step 7: k ← k+1 is set.If k=K+1, then jump to the 8th step; Otherwise, jump to the 4th step.
Step 8: by S set pin packet be encoded into an encoded packets by network-encoding operation, this encoded packets will with transmission rate R *send.
Step 9: terminate.
Encoded packets as shown in Fig. 2 (a) and corresponding transmission rate R is obtained by the above network coding method *after, this encoded packets of network node is with transmission rate R *send.
For each neighbor node receiving this encoded packets, by checking that the header information of encoded packets determines whether encoded packets covers the packet toward oneself, if do not cover the packet toward oneself, then abandoned.If contain the packet toward oneself, then as Suo Shi Fig. 2 (b), obtain the packet toward oneself by execution decode operation.Check that this data package size equals the size of expressly bag or is greater than the size of plaintext bag further, if this packet is greater than expressly bag, then determine that this bag is that a combination is wrapped and is split into multiple plaintext bag, then these are expressly wrapped and give upper strata process; If equal, then determine that this bag is one and expressly wraps and give upper strata process.

Claims (2)

1. a high throughput network coding method in wireless network, it is characterized in that, the method realizes through the following steps:
Step one: flowing through this node and having in the data flow of buffer memory bag, the data flow that can mutually encode is expressed as F 1, F 2..., F k, wherein K is the number of data streams that can mutually encode; In these data flow, pick out that stream that packet is maximum, be expressed as F x, x ∈ 1,2 ..., K};
Step 2: encoded packets size L is set *=L x, encoded packets transmission rate R *=R xand the final set of data flows S participating in encoding operation f={ F x, wherein L ifor data flow F ithe size of middle packet, R ifor from coding nodes to data flow F ireached at the transmission rate of this wireless link of receiving node; By data flow F in buffer memory xthe bag of arrival the earliest put into S set p, S pfor the set of the packet of network-encoding operation will be carried out;
Step 3: k=1 is set;
Step 4: if k=x, then jump to the 7th step;
Step 5: calculate wherein N kdata flow F kthe packet number of institute's buffer memory, n kif be data flow F kmeet selected then this data flow that out participates in encoding of following inequality and will participate in the packet number of coding;
To data flow F k, check whether it meets the following conditions:
If data flow F kmeet this condition, then R is set *← min{R k, R *and S f← S f∪ { F k, by data flow F in buffer memory kn kcouple together before and after the individual data arriving bag the earliest, add packet header to be combined into a combination bag, S set put into by the bag that this is new p, then jump to the 7th step; Otherwise, perform step 6;
Step 6: check data flow F kwhether the packet number of institute's buffer memory exceedes 1/3rd of cache size, if exceed 1/3rd of cache size, then by data flow F kpick out and participate in coding, namely R is set *← min{R k, R *and S f← S f∪ { F k, by data flow F in buffer memory kn kcouple together before and after the individual data arriving bag the earliest, add packet header to be combined into a combination bag, S set put into by the bag that this is new p;
Step 7: k ← k+1 is set; If k=K+1, then jump to the 8th step; Otherwise, jump to the 4th step;
Step 8: by S set pin packet be encoded into an encoded packets by network-encoding operation, this encoded packets will with transmission rate R *send;
Step 9: terminate.
2. high throughput network coding method in wireless network as claimed in claim 1, it is characterized in that: to the data flow of selected out participation network encoding operation in step 6, multiple clear data packages in stream can be synthesized a large combination bag, then by the large data packet coding of this combination bag and other data flow.
CN201310141842.4A 2013-04-22 2013-04-22 High throughput network coding method in a kind of wireless network Expired - Fee Related CN103220086B (en)

Priority Applications (1)

Application Number Priority Date Filing Date Title
CN201310141842.4A CN103220086B (en) 2013-04-22 2013-04-22 High throughput network coding method in a kind of wireless network

Applications Claiming Priority (1)

Application Number Priority Date Filing Date Title
CN201310141842.4A CN103220086B (en) 2013-04-22 2013-04-22 High throughput network coding method in a kind of wireless network

Publications (2)

Publication Number Publication Date
CN103220086A CN103220086A (en) 2013-07-24
CN103220086B true CN103220086B (en) 2015-10-07

Family

ID=48817596

Family Applications (1)

Application Number Title Priority Date Filing Date
CN201310141842.4A Expired - Fee Related CN103220086B (en) 2013-04-22 2013-04-22 High throughput network coding method in a kind of wireless network

Country Status (1)

Country Link
CN (1) CN103220086B (en)

Families Citing this family (5)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
CN104486040B (en) * 2014-12-15 2017-10-24 西安电子科技大学 High efficient coding perception route method based on cache management
CN105187326B (en) * 2015-08-25 2018-01-05 湖南大学 A kind of network code in double bounce wireless network topology structure intercepts management method
CN107026709B (en) * 2016-02-01 2021-02-12 中兴通讯股份有限公司 Data packet coding processing method and device, base station and user equipment
CN106792904B (en) * 2016-11-23 2020-05-12 中国联合网络通信集团有限公司 Small packet data transmission method and base station
CN108449162B (en) * 2018-03-15 2020-07-17 浙江工业大学 Wireless communication energy-saving coding method based on non-prefix code

Citations (2)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
CN101243631A (en) * 2005-06-16 2008-08-13 高通股份有限公司 Coding and modulation for multiple data streams in a communication system
CN101999218A (en) * 2008-04-11 2011-03-30 艾利森电话股份有限公司 Network coded data communication

Patent Citations (2)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
CN101243631A (en) * 2005-06-16 2008-08-13 高通股份有限公司 Coding and modulation for multiple data streams in a communication system
CN101999218A (en) * 2008-04-11 2011-03-30 艾利森电话股份有限公司 Network coded data communication

Non-Patent Citations (2)

* Cited by examiner, † Cited by third party
Title
一种基于无线网络编码的可靠通信策略;徐奎等;《小型微型计算机系统》;20090630;第30卷(第6期);全文 *
张志明等.提高有效吞吐率的P2P TV网络编码数据传输算法.《清华大学学报(自然科学版)》.2012,第52卷(第12期),全文. *

Also Published As

Publication number Publication date
CN103220086A (en) 2013-07-24

Similar Documents

Publication Publication Date Title
CN103220086B (en) High throughput network coding method in a kind of wireless network
CN101951556B (en) Wireless sensor network data distribution method based on network coding
CN102170332B (en) Opportunistic routing protocol data distributing method based on fountain code and network coding
CN101826937B (en) Link layer error control system suitable for next generation mobile Internet and method thereof
CN105515728B (en) A kind of network coding method based on sliding window
CN105163354B (en) A kind of data stream time delay guarantee strategies using at network coding opportunity between convection current
CN107682434A (en) A kind of underwater sensor network framework and its implementation
CN108075861A (en) Network coding transmission method based on multipath in software definition FiWi networks
CN102904689A (en) Improved method for transmission control protocol based on network coding
CN104009830B (en) Extensive receiving terminal data broadcasting method based on finite aggregate network code ARQ
Zhu et al. Network coding-based reliable IPv6 packet delivery over IEEE 802.15. 4 wireless personal area networks
CN105516109B (en) A kind of transmission dispatching method ensureing wireless multi-hop network transmission of video service quality
CN103402205A (en) Wireless tree network access control method and network node equipment
CN105931445B (en) Anti-interference wireless M-Bus short-distance meter reading control method
US8571130B2 (en) Transmitting apparatus and transmission method
CN103475453B (en) Collaboration communication method based on random linear network encoding
CN109982405A (en) The chance routing mode of network code between a kind of session based on multiple data flows
Tan et al. PNCRM: a novel real-time multicast scheme in MANETs based on partial network coding
CN104683070A (en) Transmission control method based on random linear network coding
CN104468050B (en) The self-adapting data package transmission method that the time limit perceives in a kind of cooperative wireless network network
CN105050108B (en) A kind of high data packet transport multicasting method of energy capture wireless sense network
CN102970232B (en) Method and device for sending low-speed STA (station) messages and access device
Lal et al. A rate adaptive and multipath routing protocol to support video streaming in manets
CN102148653A (en) Method for realizing adaptive control over data packet overhead of exclusive OR network coding in wireless network
CN101562549B (en) Communication system and method and coding router

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
TR01 Transfer of patent right
TR01 Transfer of patent right

Effective date of registration: 20200102

Address after: No. 2388, xinqun Road, Pinghu Economic Development Zone, Jiaxing City, Zhejiang Province

Patentee after: PINGHU SHENGJIA ELECTRONICS Co.,Ltd.

Address before: 510000 unit 2414-2416, building, No. five, No. 371, Tianhe District, Guangdong, China

Patentee before: GUANGDONG GAOHANG INTELLECTUAL PROPERTY OPERATION Co.,Ltd.

Effective date of registration: 20200102

Address after: 510000 unit 2414-2416, building, No. five, No. 371, Tianhe District, Guangdong, China

Patentee after: GUANGDONG GAOHANG INTELLECTUAL PROPERTY OPERATION Co.,Ltd.

Address before: 310014 Hangzhou city in the lower reaches of the city of Zhejiang Wang Road, No. 18

Patentee before: Zhejiang University of Technology

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: 20151007

Termination date: 20200422