CN103220086A - High throughput network coding method in wireless network - Google Patents

High throughput network coding method in wireless network Download PDF

Info

Publication number
CN103220086A
CN103220086A CN2013101418424A CN201310141842A CN103220086A CN 103220086 A CN103220086 A CN 103220086A CN 2013101418424 A CN2013101418424 A CN 2013101418424A CN 201310141842 A CN201310141842 A CN 201310141842A CN 103220086 A CN103220086 A CN 103220086A
Authority
CN
China
Prior art keywords
data flow
data
bag
packet
network
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.)
Granted
Application number
CN2013101418424A
Other languages
Chinese (zh)
Other versions
CN103220086B (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

Images

Landscapes

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

Abstract

The invention discloses a high throughput network coding method in a wireless network. The high throughput network coding method in the wireless network comprises the steps of a selecting step, a combining step and a coding step, wherein in the selecting step, data streams which are involved in coding are selected according to the sizes of packages, reachable transmission speed and the number of catch packages; in the combining step, for each data stream which is selected to be involved in the coding, the number of data packages which are combined in each data stream is determined, and combination is conducted on the date packages; and in the coding step, the operation of network coding is conducted on a combined package of the selected data streams or a plain text package, and a coding package of the sending is obtained. The high throughput network coding method in the wireless network can reduce the frequency of transmission of original data packages on network nodes in the wireless network, largely improves the network throughput and has good practical value.

Description

High throughput network coding method in a kind of wireless network
Technical field
The present invention relates to the radio network technique field, particularly relate to the packet networks coding method on the network node in a kind of wireless network.
Technical background
Current, wireless communication technology has been widely used in the various aspects of society, has brought greatly facility for people's life.Yet than wire communication, a remarkable deficiency of radio communication is that bandwidth is very limited.Because this deficiency, the supported throughput of current wireless communication technology is well below wire communication, make service quality also not reach people's demand far away, such as utilizing the online high definition programme televised live of watching of smart mobile phone, its clarity and fluency have very big gap from people's requirement.
Network coding technique is a kind of technology that very is used for improving the radio communication throughput, its main thought is that the network trunk node becomes an encoded packets that size is constant with a plurality of clear data packet encoders of transmission that need, sending encoded packets then reaches once bag and sends and just a plurality of clear data bags are delivered to a plurality of receiving nodes, thereby improved efficiency of transmission very effectively, improved radio throughput greatly.
So far, there are a lot of literature research to design the good network coding method, such as the loop coding method (referring to " On the X-ities of Network Coding in Wireless Networks ", publish in ACM SIGMETRICS, 2007) and the COPE coding method (referring to " XORs in The Air:Practical Wireless Network coding ", publish in IEEE/ACM Transactions on Networking, 2008) or the like.Some relevant inventions are also arranged:
On December 6th, 2010, the Yang Zhen of Nanjing Univ. of Posts and Telecommunications has applied for patent " a kind of wireless mesh network coding method ".In this invention, by in the packet header of encoded packets, adding the destination node of DESN mark for marking raw data packets, receiver side only need be decoded at the link that enters via node, link at the target approach node carries out Route Selection, thereby reduce the number of times of raw data packets transmission, improve network throughput.
On May 15th, 2012, Harbin Engineering University Zhao Yun dragon has been applied for patent " the network code restorative procedure of coding Network Based ".In this invention, decode node draws required retransmission data packet may set and forms the RACK request package by the CBCR algorithm computation and sends to neighbor node, and neighbor node is encoded according to the request content among the RACK and obtained the required packet of decode node then.
In existing network code algorithm, same data flow has only a packet to participate in coding at most.If have the bag of several packets and other data flow to carry out network code in the data flow, then the receiving node of this data flow can't be decoded to encoded packets and be obtained this several packets, can only obtain these several data packet codings encoded packets together.
Summary of the invention
The present invention proposes a kind of can be together and the network coding method that on receiving node, can decode with the packet encoder of a plurality of packets of same data flow and other data flow, once send institute's data packets transmitted number thereby significantly increase network node, improve the throughput of network node greatly.
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 big especially, has the packet of some data flow especially little, the data flow F that packet is less iA plurality of packet P I, 1..., P I, nIn data before and after couple together and be combined into a big combination bag , will make up bag then
Figure BDA00003079803900022
Become an encoded packets to send with the data packet coding of other data flow.Data flow F iAfter corresponding receiving node received encoded packets, can decode obtained the combination bag
Figure BDA00003079803900033
And should make up bag and split and to obtain a plurality of raw data packets P I, 1..., P I, nThereby a plurality of bags of accomplishing once to send just that packet is less data flow are delivered to receiving node, have improved throughput greatly.Described high throughput network coding method may further comprise the steps:
Step 1: flowing through this node and having in the data flow of buffer memory bag, coded data stream is expressed as F mutually 1, F 2..., F K, wherein K is a coded data flow amount mutually.In these data flow, pick out that stream of packet 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 set of data flows S that finally participates in encoding operation f={ F x, L wherein iBe data flow F iThe size of middle packet, R iReached at transmission rate for this Radio Link of receiving node from coding nodes to data flow Fi.With data flow F in the buffer memory xThe bag of arrival the earliest put into S set p, S pSet for the packet that will carry out network code operation.
Step 3: k=1 is set.
Step 4: if k=x then jumped to for the 7th step.
Step 5: calculate
Figure BDA00003079803900031
, N wherein kBe data flow F kInstitute's cached data packet number, n kBe event data stream F kIn the operation below selected come out to participate in coding then this data flow will participate in coded data bag number.
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 .
Event data stream F kSatisfy this condition, R then is set *← min{R k, R *And S f← S f∪ { F k, with data flow F in the buffer memory xN kThe individual data front and back that arrive bag the earliest couple together, and add that packet header is combined into a combination bag, and the bag that this is new is put into S set p, jumped to for the 7th step then.
Step 6: check data flow F kWhether institute's cached data packet number surpasses 1/3rd of cache size, if surpass 1/3rd of cache size, then with data flow F kPick out and participate in coding, R promptly is set *← min{R k, R *And S f← S f∪ { F k, with data flow F in the buffer memory xN kThe individual data front and back that arrive bag the earliest couple together, and add that packet header is combined into a combination bag, and the bag that this is new is put into S set p
Step 7: k ← k+1 is set.If k=K+1 then jumped to for the 8th step; Otherwise, jumped to for the 4th step.
Step 8: with S set pIn packet be encoded into an encoded packets by network code operation, this encoded packets will be with transmission rate R *Send.
Step 9: finish.
Technical characterstic of the present invention and effect:
1) coding method of the present invention has broken through the deficiency that each data flow has only a packet participation to encode at most in the existing network coding method, the synthetic combination bag of a plurality of packages of the data flow that packet is less participates in coding, thereby accomplished that the less data flow of packet can have a plurality of bags to participate in coding, has improved network node greatly and has once sent institute's data packets transmitted number.
2) influence of physical layer transmission rate parameter to coding gain considered in coding method of the present invention simultaneously, and physical layer that can encoded data stream based on each can reach transmission rate, chooses suitable data stream and encodes, and has reached bigger coding gain.
Description of drawings
Fig. 1 is a legacy network coding method schematic diagram.
Fig. 2 is based on network coding method schematic diagram (a) network coding method of packet combination strategy, and (b) decoding of receiving encoding bag and combination bag split schematic diagram.
Embodiment
The present invention will be further described below in conjunction with accompanying drawing.
Be the legacy network coding method among Fig. 1, the maximum packets of each data flow participate in coding, and the small data packets afterbody zero padding that participates in coding equals big packet up to length.
We illustrate the specific embodiment of the present invention with the network code based on packet assembling strategy shown in Figure 2.The wireless network that has the network code function for network node is when a network node has send opportunity, based on the information of the data flow that flows through this node, as packet size L i, link can reach transmission rate R i, cached data packet number N iMove coding method of the present invention and pick out the packet number that participates in coded data stream, goes out to be used for making up for the less data-flow computation of select packet and carry out the network code operation at last and obtain encoded packets Deng, this node.Described coding method comprises following steps:
Step 1: flowing through this node and having in the data flow of buffer memory bag, coded data stream is expressed as F mutually 1, F 2..., F K, wherein K is a coded data flow amount mutually.In these data flow, pick out that stream of packet 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 set of data flows S that finally participates in encoding operation f={ F x, L wherein iBe data flow F iThe size of middle packet, R iFor from coding nodes to data flow F iReached at the transmission rate of this Radio Link of receiving node.With data flow F in the buffer memory xThe bag of arrival the earliest put into S set p, S pSet for the packet that will carry out network code operation.
Step 3: k=1 is set.
Step 4: if k=x then jumped to for the 7th step.
Step 5: calculate
Figure BDA00003079803900062
, N wherein kBe data flow F kInstitute's cached data packet number, n kBe event data stream F kIn the operation below selected come out to participate in coding then this data flow will participate in coded data bag number.
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 .
Event data stream F kSatisfy this condition, R then is set *← min{R k, R *And S f← S f∪ { F k, with data flow F in the buffer memory xN kThe individual data front and back that arrive bag the earliest couple together, and add that packet header is combined into a combination bag, and the bag that this is new is put into S set p, jumped to for the 7th step then.
Step 6: check data flow F kWhether institute's cached data packet number surpasses 1/3rd of cache size, if surpass 1/3rd of cache size, then with data flow F kPick out and participate in coding, R promptly is set *← min{R k, R *And S f← S f∪ { F k, with data flow F in the buffer memory xN kThe individual data front and back that arrive bag the earliest couple together, and add that packet header is combined into a combination bag, and the bag that this is new is put into S set p
Step 7: k ← k+1 is set.If k=K+1 then jumped to for the 8th step; Otherwise, jumped to for the 4th step.
Step 8: with S set pIn packet be encoded into an encoded packets by network code operation, this encoded packets will be with transmission rate R *Send.
Step 9: finish.
Obtain encoded packets and corresponding transmission rate R shown in Fig. 2 (a) by the above network coding method *After, this encoded packets of network node is with transmission rate R *Send.
Receive the neighbor node of this encoded packets for each, determine that by the header information of checking encoded packets whether encoded packets covers the packet toward oneself, if do not cover the packet toward oneself, then abandons it.If comprised to toward own packet, then obtain past oneself packet by the execution decode operation as Fig. 2 (b) shown in.Check further that this packet size equals the size of bag expressly or greater than the size of bag expressly,, then these are expressly wrapped and give the upper strata and handle if this packet determines then that greater than bag expressly this bag is a combination bag and is split into a plurality of plaintext bags; If equate, determine that then this bag is that a plaintext wraps and give the upper strata processing.

Claims (2)

1. high throughput network coding method in the wireless network is characterized in that this method realizes through the following steps:
Step 1: flowing through this node and having in the data flow of buffer memory bag, coded data stream is expressed as F mutually 1, F 2..., F K, wherein K is a coded data flow amount mutually; In these data flow, pick out that stream of packet 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 set of data flows S that finally participates in encoding operation f={ F x, L wherein iBe data flow F iThe size of middle packet, R iFor from coding nodes to data flow F iReached at the transmission rate of this Radio Link of receiving node.With data flow F in the buffer memory xThe bag of arrival the earliest put into S set p, S pSet for the packet that will carry out network code operation;
Step 3: k=1 is set;
Step 4: if k=x then jumped to for the 7th step;
Step 5: calculate
Figure FDA00003079803800012
, N wherein kBe data flow F kInstitute's cached data packet number, n kBe event data stream F kIn the operation below selected come out to participate in coding then this data flow will participate in coded data bag number;
To data flow F k, check whether it meets the following conditions:
Figure FDA00003079803800011
Event data stream F kSatisfy this condition, R then is set *← min{R k, R *And S f← S f∪ { F k, with data flow F in the buffer memory xN kThe individual data front and back that arrive bag the earliest couple together, and add that packet header is combined into a combination bag, and the bag that this is new is put into S set p, jumped to for the 7th step then;
Step 6: check data flow F kWhether institute's cached data packet number surpasses 1/3rd of cache size, if surpass 1/3rd of cache size, then with data flow F kPick out and participate in coding, R promptly is set *← min{R k, R *And S f← S f∪ { F k, with data flow F in the buffer memory xN kThe individual data front and back that arrive bag the earliest couple together, and add that packet header is combined into a combination bag, and the bag that this is new is put into S set p
Step 7: k ← k+1 is set.If k=K+1 then jumped to for the 8th step; Otherwise, jumped to for the 4th step;
Step 8: with S set pIn packet be encoded into an encoded packets by network code operation, this encoded packets will be with transmission rate R *Send;
Step 9: finish.
2. high throughput network coding method in the wireless network as claimed in claim 1, it is characterized in that: in the step 6 to the selected data flow of coming out to participate in the network code computing, can will make up the big data packet coding that wraps with other data flow to the synthetic big combination bag of a plurality of clear data packages in the stream then.
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 true CN103220086A (en) 2013-07-24
CN103220086B 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)

Cited By (5)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
CN104486040A (en) * 2014-12-15 2015-04-01 西安电子科技大学 Efficient coding-aware routing method based on cache management
CN105187326A (en) * 2015-08-25 2015-12-23 湖南大学 Network coding interception management method in two-hop wireless network topology
CN106792904A (en) * 2016-11-23 2017-05-31 中国联合网络通信集团有限公司 The transmission method of small bag data and base station
CN107026709A (en) * 2016-02-01 2017-08-08 中兴通讯股份有限公司 A kind of data packet coding processing method and processing device, base station and user equipment
CN108449162A (en) * 2018-03-15 2018-08-24 浙江工业大学 A kind of energy saving coding method of wireless communication 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
张志明等: "提高有效吞吐率的P2P TV网络编码数据传输算法", 《清华大学学报（自然科学版）》, vol. 52, no. 12, 31 December 2012 (2012-12-31) *
徐奎等: "一种基于无线网络编码的可靠通信策略", 《小型微型计算机系统》, vol. 30, no. 6, 30 June 2009 (2009-06-30) *

Cited By (11)

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

Also Published As

Publication number Publication date
CN103220086B (en) 2015-10-07

Similar Documents

Publication Publication Date Title
CN101951556B (en) Wireless sensor network data distribution method based on network coding
CN103220086B (en) High throughput network coding method in a kind of wireless network
CN101567755B (en) Network coding method based on fountain codes
CN102170332B (en) Opportunistic routing protocol data distributing method based on fountain code and network coding
CN107147471A (en) A kind of data transfer optimization method based on linear network encoding
CN105515728B (en) A kind of network coding method based on sliding window
CN102904689A (en) Improved method for transmission control protocol based on network coding
CN102404077A (en) Multi-path TCP protocol based on fountain codes
CN101895376A (en) Transmission method for realizing data broadcasting in multi-hop wireless network
CN102006221A (en) Method for optimizing quality of service of stream media
CN101826937A (en) Link layer error control system suitable for next generation mobile Internet and method thereof
CN107682434A (en) A kind of underwater sensor network framework and its implementation
CN103260033A (en) Robust video transmission method combined with networking coding on end system and relay node
CN101938341B (en) Cross-node controlled online video stream selective retransmission method
Wu et al. CoRET: a network coding based multicast retransmission scheme for mobile communication networks
CN105516109B (en) A kind of transmission dispatching method ensureing wireless multi-hop network transmission of video service quality
CN102970235B (en) Multicast routing method based on intra-flow and inter-flow network encoding in wireless mesh network
CN105187326B (en) A kind of network code in double bounce wireless network topology structure intercepts management method
CN102904954B (en) Reliable fragmented transmission method based on network coding for 6LoWPAN (IPv6 over Low Power Wireless Personal Area Network)
CN102546096A (en) Real-time multicasting self-adaptation optimization method based on unequal error protection
CN109982405B (en) Opportunistic routing mode of inter-session network coding based on multiple data streams
CN102244561A (en) Relay transmission method applied to multiple access relay network
CN103475453B (en) Collaboration communication method based on random linear network encoding
CN102316315A (en) Real-time video transmission method
Tan et al. PNCRM: a novel real-time multicast scheme in MANETs based on partial 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
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

TR01 Transfer of patent right
CF01 Termination of patent right due to non-payment of annual fee

Granted publication date: 20151007

Termination date: 20200422

CF01 Termination of patent right due to non-payment of annual fee