CN109639393A - A kind of sliding window network coding method based on twice replaced polynomial - Google Patents
A kind of sliding window network coding method based on twice replaced polynomial Download PDFInfo
- Publication number
- CN109639393A CN109639393A CN201811362272.0A CN201811362272A CN109639393A CN 109639393 A CN109639393 A CN 109639393A CN 201811362272 A CN201811362272 A CN 201811362272A CN 109639393 A CN109639393 A CN 109639393A
- Authority
- CN
- China
- Prior art keywords
- sliding window
- network
- twice replaced
- coding method
- network coding
- 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
Links
Classifications
-
- H—ELECTRICITY
- H04—ELECTRIC COMMUNICATION TECHNIQUE
- H04L—TRANSMISSION OF DIGITAL INFORMATION, e.g. TELEGRAPHIC COMMUNICATION
- H04L1/00—Arrangements for detecting or preventing errors in the information received
- H04L1/004—Arrangements for detecting or preventing errors in the information received by using forward error control
- H04L1/0076—Distributed coding, e.g. network coding, involving channel coding
-
- H—ELECTRICITY
- H04—ELECTRIC COMMUNICATION TECHNIQUE
- H04L—TRANSMISSION OF DIGITAL INFORMATION, e.g. TELEGRAPHIC COMMUNICATION
- H04L1/00—Arrangements for detecting or preventing errors in the information received
- H04L1/0001—Systems modifying transmission characteristics according to link quality, e.g. power backoff
- H04L1/0006—Systems modifying transmission characteristics according to link quality, e.g. power backoff by adapting the transmission format
Landscapes
- Engineering & Computer Science (AREA)
- Computer Networks & Wireless Communication (AREA)
- Signal Processing (AREA)
- Quality & Reliability (AREA)
- Mobile Radio Communication Systems (AREA)
Abstract
The invention belongs to network coding technique fields, disclose a kind of sliding window network coding method based on twice replaced polynomial, and the data packet size for intending transmission in wireless network is determined including (1)；(2) twice replaced polynomial is determined；(3) value of twice replaced polynomial and the size of sliding window are determined；(4) data grouping enters sliding window；(5) it is transmitted after the data grouping in window being carried out network code；(6) recipient receives data grouping and carries out decoding operate, until having received whole data groupings, having restored original data packet；Sliding window network coding method method provided by the invention, only the data grouping entered in sliding window is performed the encoding operation, reduce the complexity of network coding/decoding operation and calculates the time, quick network code mechanism is realized, to maximumlly improve the data throughout of wireless network and extend network lifetime.
Description
Technical field
The invention belongs to network coding technique fields, more particularly, to a kind of sliding based on twice replaced polynomial
Window-Network coding method.
Background technique
Sliding window data disclosed in the prior art determines method and device, determines sliding window in the prior art to solve
Mouth at a time when include business datum statistical value, the data number obtained needed for used mode is more, to being
The larger problem of the consumption for resource of uniting.The mobile method and device of sliding window processed, solves when service disclosed in the prior art
When device does not have event to be entered, the sliding window of server will not be slided backward, and the event in sliding window is fallen in front of causing
Can not output processed the problem of.(the Quadratic Permutation of twice replaced polynomial disclosed in the prior art
Polynomial, QPP) interleaver, to the sequence u of input interleaverkWith function f (i)=(f1i+f2i) mod (k) is interleaved,
To improve the performance of Turbo code.Network coding method based on sliding window disclosed in the prior art, by determining sliding window
Size, and only the data grouping in sliding window is encoded, the reliability of network code is further improved, is significantly reduced
Decoding complexity, to make the data throughput maximization of network, substantially prolongs while realizing fast network coding
Network lifetime.
But the prior art mainly utilizes application of the permutation polynomial to interleaver and Turbo code in some fields,
And in sliding window mechanism, stronger theories integration is lacked to size, the sliding step size etc. of sliding window.When in network
When there is lost data packet, will lead to subsequent series of data packets cannot all transmit immediately, therefore receiving node needs
A large amount of data grouping is cached, while the transmission control of the size of sliding window, data, the scale of desorption coefficient matrix increase,
Decoded complexity is also increased by.
Summary of the invention
Aiming at the above defects or improvement requirements of the prior art, the present invention provides a kind of based on twice replaced polynomial
Sliding window network coding method is maximumlly improved its object is to improve the coding/decoding efficiency of network code to realize
The data throughout and extension network lifetime of network.
To achieve the above object, according to one aspect of the present invention, a kind of cunning based on twice replaced polynomial is provided
Dynamic Window-Network coding method, includes the following steps:
(1) data packet size for intending transmission in wireless network is determined；
(2) twice replaced polynomial is constructed；
(3) value of twice replaced polynomial and the size of sliding window are determined；
(4) intend transmission data grouping and enter sliding window, after the data grouping in sliding window is carried out network code
Transmission；
(5) recipient is decoded received network code, recovers original data packet.
Preferably, the above-mentioned sliding window network coding method based on twice replaced polynomial, network code is limited
Domain GF (2n) in randomly select the linear combination of source vector coefficient, allow to input data splitting from intermediate node and be grouped, each group
Close the linear combination that data grouping includes the grouping of a source data.
Preferably, the above-mentioned sliding window network coding method based on twice replaced polynomial, by twice replaced polynomial p
(x) is defined as: p (x)=ax2+ bx, wherein a, b, x are nonnegative integer, p (x)=ax2The mould of+bx is N.
Preferably, the above-mentioned sliding window network coding method based on twice replaced polynomial, it is used twice replaced
Multinomial p (x)=84x2+ 41x mould 112, i.e. N=112；Twice replaced polynomial p 4 window sizes of support, respectively 56,
28,14 and 7.
Preferably, the above-mentioned sliding window network coding method based on twice replaced polynomial, according in sliding process
Twice replaced polynomial is adjusted the size of sliding window to improve the property of sliding window.
Preferably, the above-mentioned sliding window network coding method based on twice replaced polynomial, intend transmission data grouping into
Enter the method reconfigured into sliding window, specific as follows:
For a linear combination subset R={ G of the row of network node transmissions matrix Gq0,…,Gq|R|-1, first from cunning
Dynamic window starts side frCalculate relevant sliding window result side er=fr+w-1；
Coding vector
Wherein, ciIt is a random number and meets P { ci=1 }=1/2,Refer to that i-th of sliding window, w refer to cunning
The length of dynamic window, r refer to the initial value of sliding window.
In general, through the invention it is contemplated above technical scheme is compared with the prior art, can obtain down and show
Beneficial effect:
Sliding window network coding method provided by the invention based on twice replaced polynomial, only to enter sliding window
Interior data grouping performs the encoding operation, and reduces the complexity of network coding/decoding operation and calculates the time, realizes quick net
Network coding, to maximumlly improve the data throughout of wireless network and extend network lifetime.
Detailed description of the invention
Fig. 1 is the process signal of the sliding window network coding method provided by the invention based on twice replaced polynomial
Figure；
Fig. 2 is the length and external value schematic diagram of the child window in the embodiment of the present invention.
Fig. 3 is the sliding mechanism structural representation of the sliding window length in the embodiment of the present invention based on twice replaced polynomial
Figure.
Specific embodiment
In order to make the objectives, technical solutions, and advantages of the present invention clearer, with reference to the accompanying drawings and embodiments, right
The present invention is further elaborated.It should be appreciated that the specific embodiments described herein are merely illustrative of the present invention, and
It is not used in the restriction present invention.As long as in addition, technical characteristic involved in the various embodiments of the present invention described below
Not constituting a conflict with each other can be combined with each other.
The sliding window network coding method based on twice replaced polynomial that embodiment provides, referring to Fig.1, including it is as follows
Step:
(1) data packet size for intending transmission in wireless network is determined；
(2) twice replaced polynomial is constructed；
(3) value of twice replaced polynomial and the size of sliding window are determined；
(4) intend transmission data grouping and enter sliding window, transmitted after the data grouping in window is carried out network code；
(5) recipient to received network code and is decoded, and recovers original data packet, until all data point
Group has decoded.
It is further described below in conjunction with specific embodiment.In embodiment, wireless network is expressed as a non-directed graph G=
(V, E), wherein V indicates that the node collection in network, E indicate link set.Each link e=(i, j) ∈ E represents node i and node j
Between be connected directly, if (i, j) ∈ E and (j, i) ∈ E, it is assumed that link be it is symmetrical, whether two links, which interfere with each other, depends on
In used interference model.
Network code process in embodiment is in finite field gf (2n) in randomly select the linear combination of source vector coefficient.
x0,x1,…,xn-1Indicate source data grouping associated with the node.Linear network encoding, which allows to input from intermediate node, to be combined
Data grouping, each linear combination of the data splitting grouping comprising the grouping of a source data.
In embodiment, twice replaced polynomial p (x) is defined as: p (x)=ax2+ bx, wherein a, b, x are nonnegative integers,
P (x)=ax2The mould of+bx is N.
Multinomial p (x)=ax2+ bx (mod N) includes: as the necessary and sufficient condition of permutation polynomial
1) to all N >=2, each prime factor of gcd (b, N)=1, N is the factor of a；Its gcd (b, N) is indicated
The greatest common divisor of two positive integers b and N.
It 2) is each element of odd number, gcd (b, N/2)=1, N not equal to 2 to all a and b (a >=1, b >=1), a+b
The number factor is all the factor of a.
Twice replaced polynomial p (x)=ax2+ bx (mod N) is in set of integers ZNOn be it is irreducible, and if only if N > gcd
(N,2a)。
Enable p (x)=84x2+ 41x mould 112, i.e. N=112 are obtained twice replaced multinomial by observing the factor of N=112
Formula p supports 4 window sizes, and respectively 56,28,14 and 7 are used for while accessing 2,4,8 and 16 external values.
When Fig. 2 illustrates N=112, the degree of parallelism of concurrent access method is 4, when the length of child window is 14, external value by
Maximum uncompetitive concurrent access storage method calculates；Digital representation external value e in each celliIndex (i=0,1,
2,…,111)。
Fig. 3 illustrates the sliding window length in embodiment based on twice replaced polynomial and the sliding mechanism knot that proposes
Structure.Assuming that the length of data is N number of information bit, the length of sliding window is w information bit or the integer multiple of w, i-th (1≤i
≤ N/w) a sliding window sliding mechanism it is as shown in Figure 3；In order to effectively improve the performance of sliding window, according to sliding process
In twice replaced polynomial the size of sliding window is adjusted；Sliding window length based on twice replaced polynomial can
To be adaptively adjusted the length of each sliding window, avoid the length of sliding window excessive or too small.
Network node encodes data grouping using coding vector, after recursively executing encoding operation and obtaining coding
Data grouping.
Assuming that a node has received and stored a set (a1,X1),(a2,X2),…,(am,Xm), wherein XiTable
Show information symbol, aiIt is the additional code vector of data grouping.The node selects one group of coefficient ei=(ei0,ei1,…,eim), meter
Calculate linear combinationA new coding groups packet (a', X') is generated according to linear combination.Homologous coding vector
A' is not to be simply equal to e, because of these coefficients and original data packet X=(x0,x1,…,xn-1) related, by comparing, obtain
It arrivesRepeat coding on multiple nodes in a network, obtain coding vector, generates network code data point
Group.
Quasi- transmission data grouping enters sliding window, reconfigures data grouping in sliding window, specific as follows:
When starting to transmit data grouping every time, a linear combination subset of the row of network node transmissions matrix G.First from
Sliding window starts side frAnd calculate relevant sliding window result side er=fr+w-1.If R={ Gq0,…,Gq|R|-1It is matrix G
Row set,With WithRespectively indicate sliding windowBeginning while and when result.Coding vector gr
Start the linear combination of accumulation element R, it may be assumed thatciIt is a random number and meets P { ci=1 }=1/2.
In the wireless network in the sliding window network coding method based on twice replaced polynomial, sliding window is initialized
O (N) time is needed, sliding coding window is found and needs O (e) time, construct a sliding window for each t ∈ T and need O
(eTN) time, coding of the global coding vector in a sliding window need O (T2N) time, coding total time are O
(eT2N)。
As it will be easily appreciated by one skilled in the art that the foregoing is merely illustrative of the preferred embodiments of the present invention, not to
The limitation present invention, any modifications, equivalent substitutions and improvements made within the spirit and principles of the present invention should all include
Within protection scope of the present invention.
Claims (6)
1. a kind of sliding window network coding method based on twice replaced polynomial, which comprises the steps of:
(1) data packet size for intending transmission in wireless network is determined；
(2) twice replaced polynomial is constructed；
(3) value of twice replaced polynomial and the size of sliding window are determined；
(4) intend transmission data grouping and enter sliding window, transmitted after the data grouping in sliding window is carried out network code；
(5) recipient is decoded received network code, recovers original data packet.
2. sliding window network coding method as described in claim 1, which is characterized in that network code is in finite field gf
(2n) in randomly select the linear combination of source vector coefficient, allow to input data splitting from intermediate node and be grouped, each number of combinations
Linear combination according to grouping comprising the grouping of a source data.
3. sliding window network coding method as claimed in claim 1 or 2, which is characterized in that by twice replaced polynomial p
(x) is defined as: p (x)=ax2+ bx, wherein a, b, x are nonnegative integer, p (x)=ax2The mould of+bx is N.
4. sliding window network coding method as claimed in claim 1 or 2, which is characterized in that used twice replaced more
Item formula p (x)=84x2+ 41x mould 112, i.e. N=112；Twice replaced polynomial p 4 window sizes of support, respectively 56,
28,14 and 7.
5. sliding window network coding method as claimed in claim 1 or 2, which is characterized in that according to two in sliding process
Secondary permutation polynomial is adjusted the size of sliding window to improve the property of sliding window.
6. sliding window network coding method as claimed in claim 1 or 2, which is characterized in that quasi- transmission data grouping enters
The method reconfigured into sliding window, specific as follows:
For a linear combination subset R={ G of the row of network node transmissions matrix Gq0,…,Gq|R|-1, first from sliding window
Mouth starts side frCalculate relevant sliding window result side er=fr+w-1；
Coding vector
Wherein, ciIt is a random number and meets P { ci=1 }=1/2,Refer to that i-th of sliding window, w refer to sliding window
The length of mouth, r refer to the initial value of sliding window.
Priority Applications (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN201811362272.0A CN109639393B (en) | 2018-11-15 | 2018-11-15 | Sliding window network coding method based on quadratic permutation polynomial |
Applications Claiming Priority (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN201811362272.0A CN109639393B (en) | 2018-11-15 | 2018-11-15 | Sliding window network coding method based on quadratic permutation polynomial |
Publications (2)
| Publication Number | Publication Date |
|---|---|
| CN109639393A true CN109639393A (en) | 2019-04-16 |
| CN109639393B CN109639393B (en) | 2021-07-06 |
Family
ID=66068237
Family Applications (1)
| Application Number | Title | Priority Date | Filing Date |
|---|---|---|---|
| CN201811362272.0A Active CN109639393B (en) | 2018-11-15 | 2018-11-15 | Sliding window network coding method based on quadratic permutation polynomial |
Country Status (1)
| Country | Link |
|---|---|
| CN (1) | CN109639393B (en) |
Cited By (2)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN113537464A (en) * | 2021-07-06 | 2021-10-22 | 中国人民解放军战略支援部队信息工程大学 | Control method, control management platform, device, medium, and program product for neural network model |
| CN114610424A (en) * | 2022-02-11 | 2022-06-10 | 阿里巴巴（中国）有限公司 | Data processing method, window display method of cloud application and storage medium |
Citations (7)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN101232289A (en) * | 2007-01-17 | 2008-07-30 | 美国博通公司 | Method of decoding turbine coding signal and turbine decoder |
| CN101651458A (en) * | 2008-08-13 | 2010-02-17 | 华为技术有限公司 | Turbo parallel decoding method, device and system |
| US20150280885A1 (en) * | 2008-02-11 | 2015-10-01 | Texas Instruments Incorporated | Partial cqi feedback in wireless networks |
| CN105227268A (en) * | 2015-10-16 | 2016-01-06 | 中国人民解放军国防科学技术大学 | A kind of encoding block self-adapting regulation method towards coding transmission agreement |
| CN105515728A (en) * | 2015-11-24 | 2016-04-20 | 湖北经济学院 | Sliding-window-based network coding method |
| CN107733570A (en) * | 2017-09-27 | 2018-02-23 | 西安邮电大学 | The searching method of constellation mapping method and mapping mode based on Algebraic interleaver |
| CN108476027A (en) * | 2016-01-13 | 2018-08-31 | 杜塞尔多夫华为技术有限公司 | TURBO (WI-TURBO) code that window interweaves |
-
2018
- 2018-11-15 CN CN201811362272.0A patent/CN109639393B/en active Active
Patent Citations (7)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN101232289A (en) * | 2007-01-17 | 2008-07-30 | 美国博通公司 | Method of decoding turbine coding signal and turbine decoder |
| US20150280885A1 (en) * | 2008-02-11 | 2015-10-01 | Texas Instruments Incorporated | Partial cqi feedback in wireless networks |
| CN101651458A (en) * | 2008-08-13 | 2010-02-17 | 华为技术有限公司 | Turbo parallel decoding method, device and system |
| CN105227268A (en) * | 2015-10-16 | 2016-01-06 | 中国人民解放军国防科学技术大学 | A kind of encoding block self-adapting regulation method towards coding transmission agreement |
| CN105515728A (en) * | 2015-11-24 | 2016-04-20 | 湖北经济学院 | Sliding-window-based network coding method |
| CN108476027A (en) * | 2016-01-13 | 2018-08-31 | 杜塞尔多夫华为技术有限公司 | TURBO (WI-TURBO) code that window interweaves |
| CN107733570A (en) * | 2017-09-27 | 2018-02-23 | 西安邮电大学 | The searching method of constellation mapping method and mapping mode based on Algebraic interleaver |
Non-Patent Citations (2)
| Title |
|---|
| CHAO GUI: "Quadratic Permutation Polynomials-Based Sliding Window Network Coding in MANETs", 《INTERNATIONAL CONFERENCE ON GREEN,PERVASIVE,AND CLOUD COMPUTING》 * |
| YAN XIE: "Performance Analysis of Variable Length Sliding Window Network Coding in MANETs", 《2017 4TH INTERNATIONAL CONFERENCE ON SYSTEMS AND INFORMATICS(ICSAI)》 * |
Cited By (2)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN113537464A (en) * | 2021-07-06 | 2021-10-22 | 中国人民解放军战略支援部队信息工程大学 | Control method, control management platform, device, medium, and program product for neural network model |
| CN114610424A (en) * | 2022-02-11 | 2022-06-10 | 阿里巴巴（中国）有限公司 | Data processing method, window display method of cloud application and storage medium |
Also Published As
| Publication number | Publication date |
|---|---|
| CN109639393B (en) | 2021-07-06 |
Similar Documents
| Publication | Publication Date | Title |
|---|---|---|
| Tang et al. | Coded caching schemes with reduced subpacketization from linear block codes | |
| JP5123174B2 (en) | Forward error correction (FEC) code and streaming | |
| Zhong et al. | Timeliness in lossless block coding | |
| US10749554B1 (en) | System and method for short block length distribution matching | |
| US10541711B1 (en) | Short block length distribution matching algorithm | |
| JP2004533766A (en) | Method for decoding a variable length codeword sequence | |
| CN101636914A (en) | Method and apparatus for encoding and decoding data | |
| CN106972865A (en) | A kind of recursive packet markov supercomposed coding method | |
| JP2000156646A (en) | Coding device and method, decoding device and method, signal processor, data transmitter, radio communication device, network station and information processing device and method | |
| US6625762B1 (en) | Interleaving device and method for turbocoding and turbodecoding | |
| CN108199723A (en) | One kind is based on double recursive grouping markov supercomposed coding methods | |
| Li et al. | On the weight spectrum of pre-transformed polar codes | |
| CN109639393A (en) | A kind of sliding window network coding method based on twice replaced polynomial | |
| JP2007129679A (en) | Coding method of qc code | |
| Nguyen et al. | Integrating sparsity into Fulcrum codes: Investigating throughput, complexity and overhead | |
| KR101503653B1 (en) | Apparatus and method for channel encoding and decoding in communication system using low-density parity-check codes | |
| Finiasz et al. | Improved fast syndrome based cryptographic hash functions | |
| CN108023679A (en) | Iterative decoding zoom factor optimization method based on parallel cascade system polarization code | |
| Reyzin et al. | More efficient provably secure steganography | |
| Siavoshani et al. | Noncoherent multisource network coding | |
| Arjmandi et al. | Resource optimized distributed source coding for complexity constrained data gathering wireless sensor networks | |
| CN103138769A (en) | Encoding method provided with unequal error protection | |
| Huang et al. | A hash function based on sponge structure with chaotic map for spinal codes | |
| Papadopoulos et al. | Broadcast erasure channel with feedback and message side information, and related index coding result | |
| US20230361914A1 (en) | Selection of pivot positions for linear network codes |
Legal Events
| Date | Code | Title | Description |
|---|---|---|---|
| PB01 | Publication | ||
| PB01 | Publication | ||
| SE01 | Entry into force of request for substantive examination | ||
| SE01 | Entry into force of request for substantive examination | ||
| GR01 | Patent grant | ||
| GR01 | Patent grant |