CN109495213A - A kind of broadcast repeating method and system based on Hamming weight coding - Google Patents
A kind of broadcast repeating method and system based on Hamming weight coding Download PDFInfo
- Publication number
- CN109495213A CN109495213A CN201811408968.2A CN201811408968A CN109495213A CN 109495213 A CN109495213 A CN 109495213A CN 201811408968 A CN201811408968 A CN 201811408968A CN 109495213 A CN109495213 A CN 109495213A
- Authority
- CN
- China
- Prior art keywords
- packet
- receiving end
- hamming weight
- source node
- light source
- 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.)
- Pending
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/0001—Systems modifying transmission characteristics according to link quality, e.g. power backoff
- H04L1/0023—Systems modifying transmission characteristics according to link quality, e.g. power backoff characterised by the signalling
-
- 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/12—Arrangements for detecting or preventing errors in the information received by using return channel
- H04L1/16—Arrangements for detecting or preventing errors in the information received by using return channel in which the return channel carries supervisory signals, e.g. repetition request signals
- H04L1/1607—Details of the supervisory signal
Abstract
The invention discloses a kind of broadcast repeating method and system based on Hamming weight coding, method includes: S1, satellite light source node period at regular intervals, broadcasts M packet to N number of receiving end；After S2, satellite light source node broadcast M original packet to receiving end, each receiving end sends ACK/NACK control packet and arrives its loss situation of satellite light source node feeding back；The lost packets number that S3, satellite light source node are fed back according to receiving end, by it, whether lost packets are recorded in feedback matrix W；S4, satellite light source node carry out coded combination to the packet that receiving end is lost by Hamming weight coding mode, broadcast is retransmitted to all receiving ends according to the packets lost distributed data recorded in feedback matrix W.Method and system provided by the present invention carry out coded combination to packet using Hamming weight coding mode, retransmit to new encoded information packet, receiving end is made to restore the packet of its loss from less retransmission processes in an optimal manner.
Description
Technical field
The present invention relates to satellite optical communication fields, and in particular to it is a kind of based on Hamming weight coding broadcast repeating method and
System.
Background technique
With the development of satellite optical communication technology and the huge increase of society's transmission information content, the grouping error rate of channel
Also it increases with it, it cannot be guaranteed that information is quickly timely transmitted.Then the characteristic for broadcasting retransmission technique is mentioning network code
There is good application in terms of high transfer rate.Ho etc. proposes the method that random linear network encoding is applied under finite field, and obtains
Random linear network encoding can be improved transmission process validity and reduce expense out.Katti etc. proposes opportunistic network code
The method each node of COPE, COPE protocol requirement determines to need which packet compiled using known self information respectively
Code and how existing packet is encoded.For wireless broadcast network, Gou Liang etc., which is proposed in wireless network, to be based on
The weighting broadcast retransmission scheme WONCR of opportunistic network coding, the program will need to compile by constructing weighted information packet distribution matrix
It is encoded and is wrapped by transmission after the packet XOR coding of code.The it is proposeds such as Fan are by the way of searching to all lost packets
It is generated by coding and retransmits coding packet.Sengupta etc. proposes a kind of network code agreement for wireless mesh network, theoretical
On show if reasonably carrying out coded combination, so that it may obtain maximum network throughput.The it is proposeds such as Xiao Xiao are compiled based on network
The wireless network broadcast repeating method NCWBR of code, there are biggish time delays in retransmission processes for this algorithm.
In the above scheme, existing broadcast retransmission algorithm carries out having operation complexity, efficiency of transmission when encoded information packet
Low, poor robustness and its encoded information packet generated can decode by all recipient nodes, thus largely code machine meeting
It is wasted.
Summary of the invention
In view of the deficiencies in the prior art, the purpose of the present invention is to provide a kind of based on the wide of Hamming weight coding
Repeating method and system are broadcast, coded combination is carried out to packet using Hamming weight coding mode, then satellite light source node is again
New encoded information packet is retransmitted, receiving end is made to restore the information of its loss from less retransmission processes in an optimal manner
Packet.
To achieve the above object, The technical solution adopted by the invention is as follows:
A kind of broadcast repeating method based on Hamming weight coding, comprising:
S1, satellite light source node period Δ t at regular intervals broadcast M packet, institute to a receiving end N (N >=2)
It states and obeys Bernoulli Jacob's distribution between satellite light source node and receiving end, and its packet loss is mutually indepedent；
After S2, the satellite light source node broadcast M original packet to receiving end, each receiving end sends ACK/NACK control
System packet arrives its loss situation of the satellite light source node feeding back, and the loss situation includes: whether packet loses, and loses
The label of packet and the label for losing node；
The lost packets number that S3, the satellite light source node are fed back according to receiving end, by its whether lost packets
It is recorded in feedback matrix W, wherein the feedback matrix W is the matrix of N × M, and row indicates N (N >=2) a receiving end, and column indicate
M packet, W (i, j)=1 indicate that i-th of receiving end Ti does not receive j-th packet Pj, W (i, j)=i-th of 0 expression and connect
Receiving end Ti receives j-th of packet Pj；
S4, the satellite light source node pass through the Chinese according to the packets lost distributed data recorded in the feedback matrix W
The packet that bright weight coding mode loses receiving end carries out coded combination, and broadcast is retransmitted to all receiving ends, until
Until the packet of its loss is all restored in all receiving ends.
Further, a kind of broadcast repeating method based on Hamming weight coding as described above, step S4 include:
S41, the Hamming weight value Yi (0≤Yi≤N, 1≤i≤M) for calculating each column packet in the feedback matrix W, root
M column information packet is arranged in descending order according to the Hamming weight value being calculated, updates the feedback matrix W；
S42, according to batch sending strategy, the batch size of packet needs is calculated, according to the Hamming weight being calculated
Magnitude marks off the packet that each batch includes:
If it, is individually divided into a batch by Hamming weight value Yi=N；
If its Hamming weight value, is assigned to s by Hamming weight value Yi < N, by Hamming weight value Yi≤N-s and meet volume
The column packet of code-bar part is divided into a batch, the batch needed for completing；
S43, for each batch packet first by maximum Hamming weight value YiCorresponding packet and remaining
Packet is adaptively encoded, then is begun looking for from remaining information packet, if two packets meet sending strategy, i.e., will
This column is assigned a value of 0, and the number of packet is put into array C, and 1 number is assigned to s again in two data packets, if s at this time
=N, then the two packets of coded combination carry out broadcast re-transmission；
S44, timely update the feedback matrix W according to the reception condition of receiving end, if new matrix is a non-zero moment
Battle array, then repeatedly step S43, until the feedback matrix W is full 0 matrix.
Further, a kind of broadcast repeating method based on Hamming weight coding as described above, the encoding condition are as follows: false
If when the M times re-transmission,For coded combination packet, P1, P2, P3 ..., Pn, Pk is corresponding
Hamming weight value is Y1, Y2, Y3 ..., Yn, and Yk just may be used in the case that and if only if receiving end, Ti only has 1 packets lost
1 original packet can be solved, receiving end Ti wants to be correctly decoded out the packet data needs lost in coded combination packet completely
Foot: Y1+Y2+Y3+...Yn=Yk.
Further, a kind of broadcast repeating method based on Hamming weight coding as described above, due to the satellite light source
Channel between node and receiving end has consistent statistical property, when packet amount M is sufficiently large, it is believed that the satellite
For light source node after the completion of the packets of single batch, the lost packets number generated is roughly the same, it may be assumed that
T=Q ((1-pc)(1-pe)L-pc(1-pu)L)
Wherein, T is the lost packets number generated, and Q is the quantity for sending original packet, pcpepuIt is parameter, L
For packet length information, to guarantee that receiving end can be properly received the packet of a batch, the satellite light source node needs wide
The packet total amount broadcast are as follows:
Wherein, N is the packet total amount that the satellite light source node needs to broadcast, stochastic variable XkJust for receiving end k
The average transmission number that single packet needs really is received, then, it is known that p (xk≤ i) indicate i-th send after receiving end k at
The function probability of acceptance, it may be assumed that
Wherein,Indicate broadcast retransmit coded combination packet quantity, then all receiving ends at
Function receives average transmission number required for single packet
A kind of broadcast retransmission system based on Hamming weight coding, comprising: satellite light source node and N (N >=2) a reception
End,
The satellite light source node broadcasts M information for period Δ t at regular intervals, to a receiving end N (N >=2)
Packet obeys Bernoulli Jacob's distribution between the satellite light source node and receiving end, and its packet loss is mutually indepedent；
After the satellite light source node is also used to broadcast M original packet to receiving end, each receiving end sends ACK/
NACK control packet arrives its loss situation of the satellite light source node feeding back, and the loss situation includes: whether packet loses, with
And the label of the label of lost packets and loss node；
The satellite light source node is also used to the lost packets number fed back according to receiving end, and whether it is lost information
Packet is recorded in feedback matrix W, wherein the feedback matrix W is the matrix of N × M, and row indicates N (N >=2) a receiving end, list
Show M packet, W (i, j)=1 indicates that i-th of receiving end Ti does not receive j-th packet Pj, W (i, j)=i-th of 0 expression
Receiving end Ti receives j-th of packet Pj；
The satellite light source node is also used to be led to according to the packets lost distributed data recorded in the feedback matrix W
It crosses Hamming weight coding mode and coded combination is carried out to the packet that receiving end is lost, broadcast is retransmitted to all receiving ends,
Until the packet of its loss is all restored in all receiving ends.
Further, a kind of broadcast retransmission system based on Hamming weight coding as described above, the satellite light source node
It is specifically used for:
Calculate the Hamming weight value Y of each column packet in the feedback matrix Wi(0≤Yi≤ N, 1≤i≤M), according to calculating
The Hamming weight value obtained is arranged in descending order M column information packet, updates the feedback matrix W；
According to batch sending strategy, the batch size of packet needs is calculated, according to the Hamming weight value being calculated
Mark off the packet that each batch includes:
If Hamming weight value YiIt is then individually divided into a batch by=N；
If Hamming weight value YiIts Hamming weight value is assigned to s by < N, by Hamming weight value Yi≤ N-s and satisfaction volume
The column packet of code-bar part is divided into a batch, the batch needed for completing；
For each batch packet first by maximum Hamming weight value YiCorresponding packet and remaining information
Packet is adaptively encoded, then is begun looking for from remaining information packet, if two packets meet sending strategy, i.e., is arranged this
It is assigned a value of 0, the number of packet is put into array C, 1 number is assigned to s again in two data packets, if s=N at this time,
Then the two packets of coded combination carry out broadcast re-transmission；
It is timely updated the feedback matrix W according to the reception condition of receiving end, if new matrix is a non-zero matrix,
The encoding submodule is repeated, until the feedback matrix W is full 0 matrix.
Further, a kind of broadcast retransmission system based on Hamming weight coding as described above, the encoding condition are as follows: false
If when the M times re-transmission,For coded combination packet, P1, P2, P3 ..., Pn, Pk is corresponding
Hamming weight value is Y1, Y2, Y3 ..., Yn, and Yk just may be used in the case that and if only if receiving end, Ti only has 1 packets lost
1 original packet can be solved, receiving end Ti wants to be correctly decoded out the packet data needs lost in coded combination packet completely
Foot: Y1+Y2+Y3+...Yn=Yk.
Further, a kind of broadcast retransmission system based on Hamming weight coding as described above, due to the satellite light source
Channel between node and receiving end has consistent statistical property, when packet amount M is sufficiently large, it is believed that the satellite
For light source node after the completion of the packets of single batch, the lost packets number generated is roughly the same, it may be assumed that
T=Q ((1-pc)(1-pe)L-pc(1-pu)L)
Wherein, T is the lost packets number generated, and Q is the quantity for sending original packet, pcpepuIt is parameter, L
For packet length information, to guarantee that receiving end can be properly received the packet of a batch, the satellite light source node needs wide
The packet total amount broadcast are as follows:
Wherein, N is the packet total amount that the satellite light source node needs to broadcast, stochastic variable XkJust for receiving end k
The average transmission number that single packet needs really is received, then, it is known that p (xk≤ i) indicate i-th send after receiving end k at
The function probability of acceptance, it may be assumed that
Wherein,Indicate broadcast retransmit coded combination packet quantity, then all receiving ends at
Function receives average transmission number required for single packet
The beneficial effects of the present invention are: method and system provided by the present invention, using Hamming weight coding mode pair
Packet carries out coded combination, and then satellite light source node again retransmits new encoded information packet, asks automatically compared to tradition
Repeating method is sought, Hamming weight coding mode makes receiving end restore the letter that it is lost from less retransmission processes in an optimal manner
Breath packet.
Detailed description of the invention
Fig. 1 is a kind of process signal of the broadcast repeating method based on Hamming weight coding provided in the embodiment of the present invention
Figure；
Fig. 2 is that the packet provided in the embodiment of the present invention feeds back schematic diagram；
Fig. 3 is the packet batch sending strategy schematic diagram provided in the embodiment of the present invention；
Fig. 4 is that the feedback matrix provided in the embodiment of the present invention updates schematic diagram；
Fig. 5 is that the encoding condition provided in the embodiment of the present invention judges schematic diagram；
Fig. 6 (a)-(c) is the Hamming weight encryption algorithm and NCWBR algorithm and ARQ algorithm provided in the embodiment of the present invention
Performance comparison schematic diagram.
Specific embodiment
The present invention is described in further detail with specific embodiment with reference to the accompanying drawings of the specification.
As shown in Figure 1, a kind of broadcast repeating method based on Hamming weight coding, comprising:
Period Δ t is defended to N (N >=2) M packet of a receiving end broadcast at regular intervals for S1, satellite light source node
Bernoulli Jacob's distribution is obeyed between starlight source node and receiving end, and its packet loss is mutually indepedent；
After S2, satellite light source node broadcast M original packet to receiving end, each receiving end sends ACK/NACK control packet
To its loss situation of satellite light source node feeding back, loss situation includes: whether packet loses and the label of lost packets
With the label for losing node；
The lost packets number that S3, satellite light source node are fed back according to receiving end, by it, whether lost packets are recorded
In feedback matrix W, wherein feedback matrix W is the matrix of N × M, and row indicates N (N >=2) a receiving end, and column indicate M information
Packet, W (i, j)=1 indicate that i-th of receiving end Ti does not receive j-th packet Pj, W (i, j)=0 i-th of receiving end Ti of expression and receive
To j-th of packet Pj；
S4, satellite light source node are compiled according to the packets lost distributed data recorded in feedback matrix W by Hamming weight
Code mode carries out coded combination to the packet that receiving end is lost, and broadcast is retransmitted to all receiving ends, until all receptions
Until the packet of its loss is all restored at end.
Step S4 includes:
S41, the Hamming weight value Yi (0≤Yi≤N, 1≤i≤M) for calculating each column packet in feedback matrix W, according to meter
The Hamming weight value obtained is arranged in descending order M column information packet, updates feedback matrix W；
S42, according to batch sending strategy, the batch size of packet needs is calculated, according to the Hamming weight being calculated
Magnitude marks off the packet that each batch includes:
If it, is individually divided into a batch by Hamming weight value Yi=N；
If its Hamming weight value, is assigned to s by Hamming weight value Yi < N, by Hamming weight value Yi≤N-s and meet volume
The column packet of code-bar part is divided into a batch, the batch needed for completing；
S43, for each batch packet first by maximum Hamming weight value YiCorresponding packet and remaining
Packet is adaptively encoded, then is begun looking for from remaining information packet, if two packets meet sending strategy, i.e., will
This column is assigned a value of 0, and the number of packet is put into array C, and 1 number is assigned to s again in two data packets, if s at this time
=N, then the two packets of coded combination carry out broadcast re-transmission；
S44, timely update feedback matrix W according to the reception condition of receiving end, if new matrix is a non-zero matrix,
Step S43 is repeated, until feedback matrix W is full 0 matrix.
Encoding condition are as follows: assuming that when the M times re-transmission,For coded combination packet, P1,
P2, P3 ..., Pn, the corresponding Hamming weight value of Pk are Y1, Y2, Y3 ..., Yn, and Yk, and if only if receiving end, Ti only has 1 letter
In the case where ceasing packet loss, it is likely to solve 1 original packet, receiving end Ti, which wants to be correctly decoded out in coded combination packet, to be lost
The packet data of mistake needs to meet: Y1+Y2+Y3+...Yn=Yk.
Since the channel between satellite light source node and receiving end has consistent statistical property, when packet amount M foot
When enough big, it is believed that satellite light source node is after the completion of the packets of single batch, the lost packets number of generation
It is roughly the same, it may be assumed that
T=Q ((1-pc)(1-pe)L-pc(1-pu)L)
Wherein, T is the lost packets number generated, and Q is the quantity for sending original packet, pcpepuIt is parameter, L
For packet length information, to guarantee that receiving end can be properly received the packet of a batch, what satellite light source node needed to broadcast
Packet total amount are as follows:
Wherein, N is the packet total amount that satellite light source node needs to broadcast, stochastic variable XkIt is correctly connect for receiving end k
The average transmission number that single packet needs is received, then, it is known that p (xk≤ i) indicate that the success of receiving end k after i-th is sent connects
Receive probability, it may be assumed that
Wherein,Indicate broadcast retransmit coded combination packet quantity, then all receiving ends at
Function receives average transmission number required for single packet
Embodiment one
S101, satellite light source node period Δ t at regular intervals broadcast M packet to a receiving end N (N >=2),
Bernoulli Jacob's distribution is obeyed between satellite light source node and receiving end, and its packet loss is mutually indepedent, i.e. receiving end i (1≤i≤N)
Packet loss be Ri(0≤Ri≤1)；
After S102, satellite light source node broadcast K original packet to receiving end, each receiving end sends ACK/NACK control
Wrap its loss situation of satellite light source node feeding back: (1) whether packet loses；(2) label of lost packets and loss section
The label of point；
The lost packets number that S103, satellite light source node are fed back according to receiving end, it, whether lost packets are remembered
Record is in feedback matrix W.The matrix is the matrix of a N × M, and row represents N (N >=2) a receiving end, and column indicate M packet.
W (i, j)=1 represents receiving end Ti and does not receive packet Pj, and W (i, j)=0 represents receiving end Ti and receives packet Pj；
S104, according to the packets lost distributed data recorded in feedback matrix W, satellite light source node loses receiving end
Packet encoded, broadcast is retransmitted to all receiving ends, until the packet of its loss is all restored in all receiving ends
Until；
S105, given receiving end Ti and coding packet Pj, if in feedback matrix W ranks position element W (i, j)=
0 illustrates that Ti has been received by the packet for all participating in coded combination, so this time transmission benefit for Ti is 0, it is entire to transmit
Process terminates；It is continued to execute if it is not, then jumping to S104.
Fig. 2 gives the feedback matrix with 7 packets and 5 receiving nodes.In Fig. 2,7 packets exist
All there is packet loss phenomenon in receiving end, if the traditional automatic request retransmission method of application needs to retransmit 7 times, and use network code
Method need to find coding mode algorithm appropriate and carry out coded combination to packet, and then source node is to new encoded information packet
It is retransmitted.The present invention carries out coded combination to packet using Hamming weight encryption algorithm.
Hamming weight encodes (BRSOC) algorithm and performance evaluation
Defining 1 Hamming weight is the Hamming distance between a character string and an all-zero word symbol string, wherein binary word
The Hamming weight of symbol string is 1 number, so the Hamming weight of string of binary characters 10001 is 2.
Defining 2 is adaptively the processing pre-set constraint condition adjust automatically coding mode of data in transmission process,
It is adapted the feature of itself and handled data, to ensure the real-time transmitted.
Hamming weight encodes (BRSOC) tactful realization mechanism description
Assuming that the packet total mesh for needing to send under conditions of information lossless is M, algorithm condition can will be met
N number of packet be considered as a broadcast transmission batch, can be by the broadcast transmission of M packet complexity by batch division mode
Problem becomes N number of simple information packet mode, and algorithm complexity reduces, and remaining packet is finally considered as a batch.
Assuming that needing the packet amount of broadcast transmission is 21, calculated according to 4 packets of each batch, it is known that 21 broadcast message packets are logical
It crosses 21/4=6 batch to complete all to send, as shown in Figure 3.
The first step calculates the Hamming weight value Yi (0≤hi≤N, 1≤i≤7) of each column packet in feedback matrix W, then
It is arranged in descending order according to the Hamming weight value being calculated, updates feedback matrix W, as shown in Figure 4.
Second step first calculates the batch size of packet needs, then by Hamming weight value according to batch sending strategy
Mark off the packet that each batch includes:
If (a) Hamming weight Yi=N, it is individually divided into a batch.
If its Hamming weight, is assigned to s by (b) the Hamming weight Yi < N of packet, by Hamming weight Yi≤N-s and
The column packet for meeting theorem 1 is divided into a batch, the batch needed for completing.
Third step is first packet corresponding to maximum Hamming weight value and remaining for the packet of each batch
Packet is adaptively encoded, then is begun looking for from remaining information packet, if two packets meet sending strategy, i.e., will
This column is assigned a value of 0, and the number of packet is put into array C, and 1 number is assigned to s again in two data packets, if s at this time
=N, then the two packets of coded combination carry out broadcast re-transmission.
4th step timely updates packet loss feedback matrix according to the reception condition of receiving node, if new matrix is a non-zero
Matrix, i.e. repeatedly third step, until reception state matrix is full 0 matrix.
Fig. 4 updates shown in feedback matrix, calculates according to 3 packets of each batch, knows that packet is divided into 3 batches according to formula calculating
It is secondary, then since updated matrix first row P2, Hamming weight Yi≤N-s=5-4=1 is searched on principle, it is known that
Only packet P3 meets encoding condition, then coding obtainsThe similarly coded combination of other available batches
Packet
The core of encoding condition algorithm is the important packet of preemptive re-transmission, i.e. the big information of prioritised transmission Hamming weight
Packet.Assuming that when the M times re-transmissionFor coded combination packet, the character representation P1 in packet is encoded,
P2, P3 ... the Hamming weight of Pn, Pk, numerical value use following alphabetical Y1, Y2, Y3...Yn respectively, and Yk is represented, and if only if connecing
In the case that receiving end Ti only has 1 packets lost, Ti is likely to solve 1 original packet, and receiving end Ti wants correct solution
Code goes out the packet data lost in coded combination packet and just needs to meet: Y1+Y2+Y3+...Yn=Yk.
It proves: being retransmitted in network in the broadcast of low time delay, coded combination packet at most only has a loss in each receiving end
Packet because the number that packet is lost in every a line after exclusive or encoding operation will reduce by 2 integer accordingly
Times, cause coded combination packet that cannot decode in receiving end, in Fig. 5 (a)Hamming weight Yh=3, P1 Hamming weight
Y1=1, the Hamming weight Y2=4 of P2 are measured, then, it is known that Yh < Y1+Y2, and one times of 2 is reduced to, is unsatisfactory for encoding condition.Figure
In 5 (b)Hamming weightMeet encoding condition.
Broadcast in this paper satellite optical communication based on network code is retransmitted to be encoded using Hamming weight coding mode.With
NCWBR mode compares, and BRSOC method can make receiving end restore its loss from less retransmission processes in an optimal manner
Packet.In view of the channel between satellite source node and receiving end has consistent statistical property, when packet amount M is enough
When big, it is believed that for node after the completion of the packets of single batch, the lost packets number generated is roughly the same, i.e.,
T=Q ((1-pc)(1-pe)L-pc(1-pu)L)
Wherein Q is the quantity for sending original packet, pcpepuIt is parameter, L is packet length information, to guarantee receiving end
It can be properly received the packet of a batch, the packet total amount that broadcast source node needs are broadcasted is
Wherein stochastic variable XkIt is properly received the average transmission number that single packet needs for node k, then, it is known that p (xk
≤ i) indicate that i-th sends the successful reception probability of posterior nodal point k, i.e.,
WhereinIndicate the quantity for the coded combination packet that broadcast retransmits.Therefore, all receiving ends at
Function receives average transmission number required for single packet
Since the coded combination determination strategy of BRSOC algorithm is first to be handled packet in batches, then pass through the Chinese
Bright weight coding mode priority encoding important information packet receives if packet can be transmitted successfully in a communication network
End can also timely decode important information packet, then in the information transmission higher communication network of requirement of real-time,
It is negligible that encoding and decoding calculate influence of the time used to network performance.Therefore in same satellite optical communication network,
While this algorithm can be improved significant data packet efficiency of transmission and reduce number of retransmissions.
In order to verify the feasibility and validity of BRSOC algorithm, under low time delay radio network information channel transmission state, pass through
Change average repeat time (1) the re-transmission calculation proposed in this paper that different lost packets parameters carrys out the different retransmission algorithms of comparison
Method, BRSOC (2) traditional automatic repeat request algorithm, ARQ；(3) the wireless broadcasting retransmission plan based on random linear network encoding
Slightly, NCWBR.This paper simulated environment is Dell PC machine, and processor is Intel (R) Core (TM) i5-4210U CPU2.40GHz, operating system are 64 win10 systems, are emulated using Matlab2012b.
Fig. 6 (a) is in the case where the packet loss and packet number of receiving end all distinguish identical situation, and receiving end packet loss is
0.2, packet number is 60, average repeat time needed for comparing three kinds of retransmission algorithms of the receiving end number from 5 to 35.By
(a) it can be seen that the average transmission number of BRSOC is much smaller than traditional ARQ, and with the increase of receiving end number, BRSOC is flat
Equal number of retransmissions increase is not significant, because BRSOC passes through the feasibility that coded combination determination strategy judges information packet encoder, determines
Coding mode, to reduce number of retransmissions.And traditional ARQ becomes smaller as receiving end number increases slope, but NCWBR's is flat
Equal number of retransmissions about linearly increases, because NCWBR not can guarantee that coding packet has solvability in receiving end, if wherein any one end
End.
Fig. 6 (b) indicates that the number of receiving end is 20, and packet number is 50, and the packet loss of receiving end becomes from 0.1 to 0.7
Change, increase by 0.1 every time, with the increase of receiving end packet loss, the average repeat time of ARQ increase it is obvious, and BRSOC and
The average repeat time of NCWBR is there is no too big variation, but when packet loss increases to about 0.5, the slope of curve of NCWBR by
It is cumulative to add.Therefore, using proposed mechanism, in the case where network has compared with high packet loss, advantage is more obvious.
Fig. 6 (c) indicates that receiving end packet loss is 0.2, and receiving end number is 15, and packet number changes from 20 to 140.With
Being continuously increased for packet number, the lost packets retransmitted can increase accordingly, and the number retransmitted is got over
It is reduce retransmission efficiency more, increase the time delay of re-transmission.It can be seen that BRSOC has almost no change with the growth of data packet by (c), this
It is smaller to illustrate that the algorithm is influenced by original packet number, so that it is lower to guarantee that number of retransmissions is influenced by encoded information packet.
As shown in Fig. 2, a kind of broadcast retransmission system based on Hamming weight coding, comprising: satellite light source node and N (N >=
2) a receiving end,
Satellite light source node broadcasts M packet for period Δ t at regular intervals, to a receiving end N (N >=2), defends
Bernoulli Jacob's distribution is obeyed between starlight source node and receiving end, and its packet loss is mutually indepedent；
After satellite light source node is also used to broadcast M original packet to receiving end, each receiving end sends ACK/NACK control
System packet arrives its loss situation of satellite light source node feeding back, and loss situation includes: whether packet loses and lost packets
Label and the label for losing node；
Satellite light source node is also used to the lost packets number fed back according to receiving end, and by it, whether lost packets are remembered
Record is in feedback matrix W, wherein feedback matrix W is the matrix of N × M, and row indicates N (N >=2) a receiving end, and column indicate M letter
Breath packet, W (i, j)=1 indicate that i-th of receiving end Ti does not receive j-th packet Pj, W (i, j)=0 i-th of receiving end Ti of expression
Receive j-th of packet Pj；
Satellite light source node is also used to pass through Hamming weight according to the packets lost distributed data recorded in feedback matrix W
Amount coding mode carries out coded combination to the packet that receiving end is lost, and broadcast is retransmitted to all receiving ends, until all
Until the packet of its loss is all restored in receiving end.
Satellite light source node is specifically used for:
Calculate the Hamming weight value Y of each column packet in feedback matrix Wi(0≤Yi≤ N, 1≤i≤M), according to being calculated
Hamming weight value M column information packet is arranged in descending order, update feedback matrix W；
According to batch sending strategy, the batch size of packet needs is calculated, according to the Hamming weight value being calculated
Mark off the packet that each batch includes:
If Hamming weight value YiIt is then individually divided into a batch by=N；
If Hamming weight value YiIts Hamming weight value is assigned to s by < N, by Hamming weight value Yi≤ N-s and satisfaction volume
The column packet of code-bar part is divided into a batch, the batch needed for completing；
For each batch packet first by maximum Hamming weight value YiCorresponding packet and remaining information
Packet is adaptively encoded, then is begun looking for from remaining information packet, if two packets meet sending strategy, i.e., is arranged this
It is assigned a value of 0, the number of packet is put into array C, 1 number is assigned to s again in two data packets, if s=N at this time,
Then the two packets of coded combination carry out broadcast re-transmission；
It is repeated according to the reception condition of the receiving end feedback matrix W that timely updates if new matrix is a non-zero matrix
Encoding submodule is executed, until feedback matrix W is full 0 matrix.
Since the channel between satellite light source node and receiving end has consistent statistical property, when packet amount M foot
When enough big, it is believed that satellite light source node is after the completion of the packets of single batch, the lost packets number of generation
It is roughly the same, it may be assumed that
T=Q ((1-pc)(1-pe)L-pc(1-pu)L)
Wherein, T is the lost packets number generated, and Q is the quantity for sending original packet, pcpepuIt is parameter, L
For packet length information, to guarantee that receiving end can be properly received the packet of a batch, what satellite light source node needed to broadcast
Packet total amount are as follows:
Wherein, N is the packet total amount that satellite light source node needs to broadcast, stochastic variable XkIt is correctly connect for receiving end k
The average transmission number that single packet needs is received, then, it is known that p (xk≤ i) indicate that the success of receiving end k after i-th is sent connects
Receive probability, it may be assumed that
Wherein,Indicate broadcast retransmit coded combination packet quantity, then all receiving ends at
Function receives average transmission number required for single packet
The present invention proposes the broadcast weight based on network code in satellite optical communication on the basis of improving the rate of information throughput
It passes.The strategy is divided into multiple batches by coded combination judgment principle in satellite optical communication net, by packet, then calculates
The Hamming weight of each packet in feedback matrix constructs a new Hamming weight matrix according to calculated value, in new matrix
Energy Fast retransmission meets the coded combination packet of condition, so as to effectively improve retransmission efficiency, reduces number of retransmissions.
Obviously, various changes and modifications can be made to the invention without departing from essence of the invention by those skilled in the art
Mind and range.In this way, if these modifications and changes of the present invention belongs to the range of the claims in the present invention and its equivalent technology
Within, then the present invention is also intended to include these modifications and variations.
Claims (8)
1. a kind of broadcast repeating method based on Hamming weight coding characterized by comprising
S1, satellite light source node period Δ t at regular intervals broadcast M packet to a receiving end N (N >=2), described to defend
Bernoulli Jacob's distribution is obeyed between starlight source node and receiving end, and its packet loss is mutually indepedent；
After S2, the satellite light source node broadcast M original packet to receiving end, each receiving end sends ACK/NACK control packet
To its loss situation of the satellite light source node feeding back, the loss situation includes: whether packet loses, and loses information
The label of packet and the label for losing node；
The lost packets number that S3, the satellite light source node are fed back according to receiving end, by it, whether lost packets are recorded
In feedback matrix W, wherein the feedback matrix W is the matrix of N × M, and row indicates N (N >=2) a receiving end, and column indicate M
Packet, W (i, j)=1 indicate that i-th of receiving end Ti does not receive j-th packet Pj, W (i, j)=0 i-th of receiving end of expression
Ti receives j-th of packet Pj；
S4, the satellite light source node pass through Hamming weight according to the packets lost distributed data recorded in the feedback matrix W
Amount coding mode carries out coded combination to the packet that receiving end is lost, and broadcast is retransmitted to all receiving ends, until all
Until the packet of its loss is all restored in receiving end.
2. a kind of broadcast repeating method based on Hamming weight coding according to claim 1, which is characterized in that step S4
Include:
S41, the Hamming weight value Yi (0≤Yi≤N, 1≤i≤M) for calculating each column packet in the feedback matrix W, according to meter
The Hamming weight value obtained is arranged in descending order M column information packet, updates the feedback matrix W；
S42, according to batch sending strategy, the batch size of packet needs is calculated, according to the Hamming weight value being calculated
Mark off the packet that each batch includes:
If it, is individually divided into a batch by Hamming weight value Yi=N；
If its Hamming weight value, is assigned to s, by Hamming weight value Yi≤N-s and meets encoding strip by Hamming weight value Yi < N
The column packet of part is divided into a batch, the batch needed for completing；
S43, for each batch packet first by maximum Hamming weight value YiCorresponding packet and remaining packet
It is adaptively encoded, then is begun looking for from remaining information packet, if two packets meet sending strategy, i.e., assigned this column
Value is 0, and the number of packet is put into array C, and 1 number is assigned to s again in two data packets, if s=N at this time,
The two packets of coded combination carry out broadcast re-transmission；
S44, timely update the feedback matrix W according to the reception condition of receiving end, if new matrix is a non-zero matrix,
Step S43 is repeated, until the feedback matrix W is full 0 matrix.
3. a kind of broadcast repeating method based on Hamming weight coding according to claim 2, which is characterized in that the volume
Code-bar part are as follows: assuming that when the M times re-transmission,For coded combination packet, P1, P2, P3 ...,
The corresponding Hamming weight value of Pn, Pk is Y1, Y2, Y3 ..., Yn, and Yk, and if only if receiving end, Ti only has 1 packets lost
In the case of, it is likely to solve 1 original packet, receiving end Ti wants to be correctly decoded out the packet lost in coded combination packet
Data need to meet: Y1+Y2+Y3+...Yn=Yk.
4. a kind of broadcast repeating method based on Hamming weight coding according to claim 2, which is characterized in that by institute
Stating the channel between satellite light source node and receiving end, there is consistent statistical property can recognize when packet amount M is sufficiently large
It is the satellite light source node after the completion of packets of single batch, the lost packets number substantially phase generated
Together, it may be assumed that
T=Q ((1-pc)(1-pe)L-pc(1-pu)L)
Wherein, T is the lost packets number generated, and Q is the quantity for sending original packet, pcpepuIt is parameter, L is letter
Packet length is ceased, to guarantee that receiving end can be properly received the packet of a batch, what the satellite light source node needed to broadcast
Packet total amount are as follows:
Wherein, N is the packet total amount that the satellite light source node needs to broadcast, stochastic variable XkIt is properly received for receiving end k
The average transmission number that single packet needs, then, it is known that p (xk≤ i) indicate i-th send after receiving end k successful reception
Probability, it may be assumed that
Wherein,Indicate the quantity for the coded combination packet that broadcast retransmits, then all receiving ends are properly received
Individually average transmission number required for packet is
5. a kind of broadcast retransmission system based on Hamming weight coding characterized by comprising satellite light source node and N (N >=
2) a receiving end,
The satellite light source node broadcasts M packet, institute for period Δ t at regular intervals, to a receiving end N (N >=2)
It states and obeys Bernoulli Jacob's distribution between satellite light source node and receiving end, and its packet loss is mutually indepedent；
After the satellite light source node is also used to broadcast M original packet to receiving end, each receiving end sends ACK/NACK control
System packet arrives its loss situation of the satellite light source node feeding back, and the loss situation includes: whether packet loses, and loses
The label of packet and the label for losing node；
The satellite light source node is also used to the lost packets number fed back according to receiving end, and by it, whether lost packets are remembered
Record is in feedback matrix W, wherein the feedback matrix W is the matrix of N × M, and row indicates N (N >=2) a receiving end, and column indicate M
A packet, W (i, j)=1 indicate that i-th of receiving end Ti does not receive j-th packet Pj, W (i, j)=0 expression, i-th of reception
End Ti receives j-th of packet Pj；；
The satellite light source node is also used to pass through the Chinese according to the packets lost distributed data recorded in the feedback matrix W
The packet that bright weight coding mode loses receiving end carries out coded combination, and broadcast is retransmitted to all receiving ends, until
Until the packet of its loss is all restored in all receiving ends.
6. a kind of broadcast retransmission system based on Hamming weight coding according to claim 5, which is characterized in that described to defend
Starlight source node is specifically used for:
The Hamming weight value Yi (0≤Yi≤N, 1≤i≤M) for calculating each column packet in the feedback matrix W, according to calculating
Hamming weight value out is arranged in descending order M column information packet, updates the feedback matrix W；
According to batch sending strategy, the batch size of packet needs is calculated, is divided according to the Hamming weight value being calculated
The packet that each batch includes out:
If it, is individually divided into a batch by Hamming weight value Yi=N；
If its Hamming weight value, is assigned to s, by Hamming weight value Yi≤N-s and meets encoding strip by Hamming weight value Yi < N
The column packet of part is divided into a batch, the batch needed for completing；
For each batch packet first by maximum Hamming weight value YiCorresponding packet and remaining packet are adaptive
It is encoded with answering, then is begun looking for from remaining information packet, if two packets meet sending strategy, i.e., is assigned a value of this column
0, the number of packet is put into array C, 1 number is assigned to s again in two data packets, if s=N at this time, encodes
It combines the two packets and carries out broadcast re-transmission；
It is repeated according to the reception condition of the receiving end feedback matrix W that timely updates if new matrix is a non-zero matrix
The encoding submodule is executed, until the feedback matrix W is full 0 matrix.
7. a kind of broadcast retransmission system based on Hamming weight coding according to claim 6, which is characterized in that the volume
Code-bar part are as follows: assuming that when the M times re-transmission,For coded combination packet, P1, P2, P3 ...,
The corresponding Hamming weight value of Pn, Pk is Y1, Y2, Y3 ..., Yn, and Yk, and if only if receiving end, Ti only has 1 packets lost
In the case of, it is likely to solve 1 original packet, receiving end Ti wants to be correctly decoded out the packet lost in coded combination packet
Data need to meet: Y1+Y2+Y3+...Yn=Yk.
8. a kind of broadcast retransmission system based on Hamming weight coding according to claim 6, which is characterized in that by institute
Stating the channel between satellite light source node and receiving end, there is consistent statistical property can recognize when packet amount M is sufficiently large
It is the satellite light source node after the completion of packets of single batch, the lost packets number substantially phase generated
Together, it may be assumed that
T=Q ((1-pc)(1-pe)L-pc(1-pu)L)
Wherein, T is the lost packets number generated, and Q is the quantity for sending original packet, pcpepuIt is parameter, L is letter
Packet length is ceased, to guarantee that receiving end can be properly received the packet of a batch, what the satellite light source node needed to broadcast
Packet total amount are as follows:
Wherein, N is the packet total amount that the satellite light source node needs to broadcast, stochastic variable XkIt is properly received for receiving end k
The average transmission number that single packet needs, then, it is known that p (xk≤ i) indicate i-th send after receiving end k successful reception
Probability, it may be assumed that
Wherein,Indicate the quantity for the coded combination packet that broadcast retransmits, then all receiving ends are properly received
Individually average transmission number required for packet is
Priority Applications (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN201811408968.2A CN109495213A (en) | 2018-11-23 | 2018-11-23 | A kind of broadcast repeating method and system based on Hamming weight coding |
Applications Claiming Priority (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN201811408968.2A CN109495213A (en) | 2018-11-23 | 2018-11-23 | A kind of broadcast repeating method and system based on Hamming weight coding |
Publications (1)
| Publication Number | Publication Date |
|---|---|
| CN109495213A true CN109495213A (en) | 2019-03-19 |
Family
ID=65697582
Family Applications (1)
| Application Number | Title | Priority Date | Filing Date |
|---|---|---|---|
| CN201811408968.2A Pending CN109495213A (en) | 2018-11-23 | 2018-11-23 | A kind of broadcast repeating method and system based on Hamming weight coding |
Country Status (1)
| Country | Link |
|---|---|
| CN (1) | CN109495213A (en) |
Cited By (2)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN114928471A (en) * | 2022-04-20 | 2022-08-19 | 江门职业技术学院 | Data transmission method and device and computer readable storage medium |
| WO2023143021A1 (en) * | 2022-01-27 | 2023-08-03 | 华为技术有限公司 | Data retransmission encoding method and apparatus |
Citations (7)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| US20110320922A1 (en) * | 2006-10-30 | 2011-12-29 | Interdigital Technology Corporation | Method and apparatus for encoding and decoding high speed shared control channel |
| CN102594529A (en) * | 2012-03-16 | 2012-07-18 | 哈尔滨工业大学深圳研究生院 | Transmitting terminal radio retransmission method and system based on network code |
| CN102868484A (en) * | 2012-06-21 | 2013-01-09 | 中国人民解放军电子工程学院 | Blind identification method for linear block codes of satellite link |
| CN102983952A (en) * | 2006-11-29 | 2013-03-20 | 艾利森电话股份有限公司 | Reliable multicast with linear independent data grouping and encoding |
| CN103580803A (en) * | 2013-10-15 | 2014-02-12 | 中国人民解放军理工大学 | Weighted broadcast retransmission method based on network coding |
| US8929550B2 (en) * | 2013-02-01 | 2015-01-06 | Department 13, LLC | LPI/LPD communication systems |
| CN105827416A (en) * | 2016-05-10 | 2016-08-03 | 中国农业银行股份有限公司 | Data packet transmission method, sending end device and receiving end device |
-
2018
- 2018-11-23 CN CN201811408968.2A patent/CN109495213A/en active Pending
Patent Citations (7)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| US20110320922A1 (en) * | 2006-10-30 | 2011-12-29 | Interdigital Technology Corporation | Method and apparatus for encoding and decoding high speed shared control channel |
| CN102983952A (en) * | 2006-11-29 | 2013-03-20 | 艾利森电话股份有限公司 | Reliable multicast with linear independent data grouping and encoding |
| CN102594529A (en) * | 2012-03-16 | 2012-07-18 | 哈尔滨工业大学深圳研究生院 | Transmitting terminal radio retransmission method and system based on network code |
| CN102868484A (en) * | 2012-06-21 | 2013-01-09 | 中国人民解放军电子工程学院 | Blind identification method for linear block codes of satellite link |
| US8929550B2 (en) * | 2013-02-01 | 2015-01-06 | Department 13, LLC | LPI/LPD communication systems |
| CN103580803A (en) * | 2013-10-15 | 2014-02-12 | 中国人民解放军理工大学 | Weighted broadcast retransmission method based on network coding |
| CN105827416A (en) * | 2016-05-10 | 2016-08-03 | 中国农业银行股份有限公司 | Data packet transmission method, sending end device and receiving end device |
Non-Patent Citations (2)
| Title |
|---|
| JING CHEN ET AL.: "Lightweight Retransmission for Random Access in Satellite Networks", 《IEEE INFOCOM 2018 -IEEE CONFERENCE ON COMPUTER COMMUNICATIONS》 * |
| 徐光宪 等: "基于汉明重量网络编码的广播重传算法", 《计算机工程》 * |
Cited By (3)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| WO2023143021A1 (en) * | 2022-01-27 | 2023-08-03 | 华为技术有限公司 | Data retransmission encoding method and apparatus |
| CN114928471A (en) * | 2022-04-20 | 2022-08-19 | 江门职业技术学院 | Data transmission method and device and computer readable storage medium |
| CN114928471B (en) * | 2022-04-20 | 2023-08-22 | 江门职业技术学院 | Data transmission method and device and computer readable storage medium |
Similar Documents
| Publication | Publication Date | Title |
|---|---|---|
| Rossi et al. | Synapse: A network reprogramming protocol for wireless sensor networks using fountain codes | |
| CN101714915B (en) | Data retransmission method and system | |
| CN101867443B (en) | Rate matching method and device | |
| CN101938334B (en) | Adaptive error control method combining random network coding and automatic repeat request | |
| Parag et al. | On real-time status updates over symbol erasure channels | |
| CN109510687A (en) | A kind of fountain code encoding method based on satellite communication | |
| CN103905152B (en) | Using the effective throughput randomized optimization process of layer-span combined coding in erasure channel | |
| CN101741527B (en) | Rate adaption method and device | |
| CN101227259B (en) | Method for data reading of limited length circulating buffer memory rate adaption | |
| CN104243096A (en) | Deep space multi-file transmission method based on fountain codes | |
| CN102833051B (en) | Fountain coding broadcast method based on feedback | |
| CN101951556A (en) | Wireless sensor network data distribution method based on network coding | |
| CN109495213A (en) | A kind of broadcast repeating method and system based on Hamming weight coding | |
| US20150333874A1 (en) | A transmitting and a receiving device and respective methods performed thereby for improving retransmissions in wireless networks | |
| CN103067137A (en) | Multicast retransmission method based on network codes | |
| KR102002939B1 (en) | On-demand file recovery methods and systems | |
| CN101540778B (en) | Method, device and system for transmitting data | |
| Bobbili et al. | Real-time status updates with perfect feedback over erasure channels | |
| CN102546096B (en) | Real-time multicasting self-adaptation optimization method based on unequal error protection | |
| CN110086870A (en) | The parallel method for reliable transmission of the multipath of data-oriented central site network | |
| CN105721119A (en) | Retransmission method for searching optimal associated packet based on opportunity type network coding | |
| CN106254044B (en) | Dynamic linear combination retransmission method based on multicast network coding | |
| CN103346859B (en) | The encoding and decoding method of distributed unequal error protection LT code | |
| CN113438055A (en) | Convolutional network coding transmission method based on unequal redundancy insertion | |
| CN109417432A (en) | Data encoding and decoding |
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 | ||
| RJ01 | Rejection of invention patent application after publication | ||
| RJ01 | Rejection of invention patent application after publication |
Application publication date: 20190319 |