CN109257145A - D2D cooperation transmission process optimization method and apparatus towards RLNC auxiliary - Google Patents
D2D cooperation transmission process optimization method and apparatus towards RLNC auxiliary Download PDFInfo
- Publication number
- CN109257145A CN109257145A CN201811207685.1A CN201811207685A CN109257145A CN 109257145 A CN109257145 A CN 109257145A CN 201811207685 A CN201811207685 A CN 201811207685A CN 109257145 A CN109257145 A CN 109257145A
- Authority
- CN
- China
- Prior art keywords
- rlnc
- user
- coded data
- data packet
- transmission system
- 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
- H04L1/0077—Cooperative coding
-
- H—ELECTRICITY
- H04—ELECTRIC COMMUNICATION TECHNIQUE
- H04W—WIRELESS COMMUNICATION NETWORKS
- H04W24/00—Supervisory, monitoring or testing arrangements
- H04W24/02—Arrangements for optimising operational condition
-
- H—ELECTRICITY
- H04—ELECTRIC COMMUNICATION TECHNIQUE
- H04W—WIRELESS COMMUNICATION NETWORKS
- H04W4/00—Services specially adapted for wireless communication networks; Facilities therefor
- H04W4/70—Services for machine-to-machine communication [M2M] or machine type communication [MTC]
Landscapes
- Engineering & Computer Science (AREA)
- Computer Networks & Wireless Communication (AREA)
- Signal Processing (AREA)
- Mobile Radio Communication Systems (AREA)
- Data Exchanges In Wide-Area Networks (AREA)
Abstract
The invention discloses a kind of D2D cooperation transmission process optimization method and apparatus towards RLNC auxiliary.The described method includes: establishing the slot model towards the RLNC D2D cooperative transmission system assisted；According to Markov Chain principle and in conjunction with the slot model of foundation, the cooperation frequency in RLNC coding finite field size and D2D cooperative transmission system between user is obtained, the Discussion of Linear Model of time is transmitted to D2D cooperative transmission system；According to the Discussion of Linear Model of foundation, optimize the D2D cooperation transmission process assisted towards RLNC.The Discussion of Linear Model that the present invention passes through above-mentioned foundation, in the case where considering the influence factor of RLNC coding finite field size and cooperation among users frequency, the D2D cooperative transmission system of Accurate Analysis RLNC auxiliary is transmitted the time, and then can provide effective data and theory support towards the RLNC D2D cooperation transmission process assisted to optimization.
Description
Technical field
The present invention relates to D2D field of communication technology, in particular to a kind of D2D cooperation transmission process towards RLNC auxiliary is excellent
Change method and apparatus.
Background technique
Device-to-device (Device-to-Device, referred to as " D2D ") communication by the cooperation of equipment room, can make to damage
The data packet lost under transmission environment can be restored by neighbouring device, reduce the number of retransmissions of base station, can significantly improve money
The utilization rate in source and the time that is transmitted for reducing data, this D2D cooperation will all be played under the emerging application scenarios of many 5G
Important role.
When data packet is by there are when the repeated link of packet loss, if intermediate node can encode the grouping received
Forwarding, i.e. network code (Network Coding, referred to as " NC "), then the time that is transmitted of system will reduce.If
NC is applied in D2D cooperation scene, will further decrease and be transmitted the time.In addition, random linear network encoding
(Random Linearly Network Coding, referred to as " RLNC ") is used as a kind of widely used NC method, has similar
LT code, Raptor code without rate just delete characteristic.This means that coding side can Unknown Channel packet loss and without receiving end it is anti-
Coding packet is generated incessantly in the case where feedback until decoding is completed in receiving end.If changeable in network topology and channel condition
RLNC is used in D2D cooperative system, it will help simplify the design of cooperative system.
But using RLNC, there are some problems in D2D cooperation transmission.In practice, such as system as V2V
The data packet of transmission is often little, and RLNC needs to carry code coefficient in a packet, it will generates biggish overhead (i.e.
Overhead).The finite field size used in coding will have a direct impact overhead.On the one hand.Had using biggish
Confinement will increase overhead, and increase decoding complexity；But then, it then will lead to coding point using lesser finite field
The linearly related probability of group increases, so that being transmitted time extension.Additionally, due to system capacity is limited etc., constraint conditions, D2D are used
The cooperation frequency between family also will generate significant impact to the time is transmitted.Therefore, it is necessary to analyze above-mentioned factor to towards RLNC
The D2D cooperation transmission process of auxiliary carries out linear analysis, to provide for optimization towards the RLNC D2D cooperation transmission process assisted
Effective data supporting.
Summary of the invention
In order to solve problems in the prior art, it cooperates and passes the embodiment of the invention provides a kind of D2D towards RLNC auxiliary
Defeated process optimization method and apparatus.The technical solution is as follows:
On the one hand, the embodiment of the invention provides a kind of D2D cooperation transmission process optimization method towards RLNC auxiliary, institutes
The method of stating includes:
Establish the slot model towards the RLNC D2D cooperative transmission system assisted；
According to Markov Chain principle and in conjunction with the slot model of foundation, obtain RLNC coding finite field size and
The cooperation frequency in D2D cooperative transmission system between user is transmitted the linearly related mould of time to D2D cooperative transmission system
Type；
According to the Discussion of Linear Model of foundation, optimize the D2D cooperation transmission process assisted towards RLNC.
The embodiment of the present invention it is above-mentioned towards RLNC auxiliary D2D cooperation transmission process optimization method in, it is described towards
The slot model of the D2D cooperative transmission system of RLNC auxiliary, comprising:
Base station respectively to the first user and second user send RLNC coded data packet the first time slot and the first user with
Second time slot of cooperation transmission RLNC coded data packet between second user, second time slot include: the first user to second
The first sub-slots and second user of user collaboration transmission RLNC coded data packet transmit RLNC coded number to the first user collaboration
According to the second sub-slots of packet.
In the above-mentioned D2D cooperation transmission process optimization method towards RLNC auxiliary of the embodiment of the present invention, the basis
Markov Chain principle and the slot model in conjunction with foundation obtain RLNC coding finite field size and D2D cooperation transmission system
The cooperation frequency in system between user, the Discussion of Linear Model of time is transmitted to D2D cooperative transmission system, comprising:
According to Markov Chain principle and in conjunction with the slot model of foundation, it is general to obtain the transfer of D2D cooperative transmission system
Rate model, and establish corresponding Markov Chain transfer matrix；
According to Markov Chain transfer matrix, obtains D2D cooperative transmission system and be transmitted the time.
In the above-mentioned D2D cooperation transmission process optimization method towards RLNC auxiliary of the embodiment of the present invention, the D2D association
Make Transmission system transition probability model, comprising:
At the end of first time slot, following potential transfer occurs for D2D cooperative transmission system and corresponding probability is as follows:
Pr { (m, k, l) → (m-1, k+1, l) }=PΦm(1-δ2),
Wherein, δ1The packet loss of RLNC coded data packet, δ are sent to the first user for base station2It is sent out for base station to second user
The packet loss of RLNC coded data packet is sent, m indicates that the RLNC of linear independence received by only the first user encodes packet quantity, l
Indicate that the RLNC of linear independence received by only second user encodes packet quantity, k indicates that the first user and second user connect
The RLNC coded data packet quantity of the linear independence received, m, k, l are the integer less than or equal to M and m+k+l≤M, M are use
The quantity of RLNC coded data packet is successfully decoded out in family, and Φ m indicates the volume that the RLNC coded data packet of m linear independence is constituted
Code vector spatial aggregation, its corresponding probability areΦ k indicates the RLNC coded data of k linear independence
Constituted coding vector spatial aggregation is wrapped, its corresponding probability isΦ l indicates that l is a linear
The coding vector spatial aggregation that unrelated RLNC coded data packet is constituted, its corresponding probability areΦ
The coding vector spatial aggregation for the RLNC coded data packet that new indicates to be not belonging to the first user and second user has been received,
Its corresponding probability isQ is that RLNC encodes finite field size,
At the end of second time slot, following potential transfer occurs for D2D cooperative transmission system and corresponding probability is as follows:
Wherein, PD2DThe probability of cooperation between user in D2D cooperative transmission system, ε1It is the first user to second user
Send the packet loss of RLNC coded data packet, ε2The packet loss of RLNC coded data packet is sent to the first user for second user,
Vector space indicates in RLNC coded data packet coding vector and second user received RLNC coded data with set Ψ k
Packet belongs to same coding vector space, its corresponding probability isVector space indicates that RLNC is encoded with set Ψ m
The coding vector of data packet is not belonging in second user the coding vector space of received RLNC coded data packet, it is corresponded to
Probability beVector space is indicated in the coding vector and the first user of RLNC coded data packet with set omega k
Received RLNC coded data packet belongs to same coding vector space, its corresponding probability isVector space
Indicate that the coding vector of RLNC coded data packet is not belonging in the first user received RLNC coded data packet with set omega l
Coding vector space, its corresponding probability is
The Markov Chain transfer matrix isIM+1For the unit matrix of (M+1) * (M+1), Q
It is the matrix of (n-M-1) * (n-M-1) and element therein is made of the transition probability between transfer state, R is one
(n-M-1) matrix of * (M+1) and element therein is made of transfer state to the transition probability absorbing state, wherein each
The sequence number that state corresponds to Markov Chain transfer matrix is acquired by such as minor function:
Wherein, τ=m+k+l.
In the above-mentioned D2D cooperation transmission process optimization method towards RLNC auxiliary of the embodiment of the present invention, the D2D association
The time is transmitted as Transmission system are as follows:Wherein, matrix N meets N=(I-Q)-1, I is unit square
Battle array.
On the other hand, the embodiment of the invention provides it is a kind of towards RLNC auxiliary D2D cooperation transmission process optimization device,
Described device includes:
Module is established, for establishing the slot model of the D2D cooperative transmission system towards RLNC auxiliary；
Module is obtained, for obtaining RLNC coding according to Markov Chain principle and in conjunction with the slot model of foundation
The cooperation frequency in finite field size and D2D cooperative transmission system between user is transmitted the time to D2D cooperative transmission system
Discussion of Linear Model；
Optimization module optimizes the D2D cooperation transmission assisted towards RLNC for the Discussion of Linear Model according to foundation
Process.
The embodiment of the present invention it is above-mentioned towards RLNC auxiliary D2D cooperation transmission process optimization device in, it is described towards
The slot model of the D2D cooperative transmission system of RLNC auxiliary, comprising:
Base station respectively to the first user and second user send RLNC coded data packet the first time slot and the first user with
Second time slot of cooperation transmission RLNC coded data packet between second user, second time slot include: the first user to second
The first sub-slots and second user of user collaboration transmission RLNC coded data packet transmit RLNC coded number to the first user collaboration
According to the second sub-slots of packet.
In the above-mentioned D2D cooperation transmission process optimization device towards RLNC auxiliary of the embodiment of the present invention, the acquisition
Module includes:
First acquisition unit, for obtaining D2D association according to Markov Chain principle and in conjunction with the slot model of foundation
Make Transmission system transition probability model, and establishes corresponding Markov Chain transfer matrix；
Second acquisition unit, when being transmitted for obtaining D2D cooperative transmission system according to Markov Chain transfer matrix
Between.
In the above-mentioned D2D cooperation transmission process optimization device towards RLNC auxiliary of the embodiment of the present invention, the D2D association
Make Transmission system transition probability model, comprising:
At the end of first time slot, following potential transfer occurs for D2D cooperative transmission system and corresponding probability is as follows:
Pr { (m, k, l) → (m-1, k+1, l) }=PΦm(1-δ2),
Wherein, δ1The packet loss of RLNC coded data packet, δ are sent to the first user for base station2It is sent out for base station to second user
The packet loss of RLNC coded data packet is sent, m indicates that the RLNC of linear independence received by only the first user encodes packet quantity, l
Indicate that the RLNC of linear independence received by only second user encodes packet quantity, k indicates that the first user and second user connect
The RLNC coded data packet quantity of the linear independence received, m, k, l are the integer less than or equal to M and m+k+l≤M, M are use
The quantity of RLNC coded data packet is successfully decoded out in family, and Φ m indicates the volume that the RLNC coded data packet of m linear independence is constituted
Code vector spatial aggregation, its corresponding probability areΦ k indicates the RLNC coded data of k linear independence
Constituted coding vector spatial aggregation is wrapped, its corresponding probability isΦ l indicates that l is a linear
The coding vector spatial aggregation that unrelated RLNC coded data packet is constituted, its corresponding probability areΦ
The coding vector spatial aggregation for the RLNC coded data packet that new indicates to be not belonging to the first user and second user has been received,
Its corresponding probability isQ is that RLNC encodes finite field size,
At the end of second time slot, following potential transfer occurs for D2D cooperative transmission system and corresponding probability is as follows:
Wherein, PD2DThe probability of cooperation between user in D2D cooperative transmission system, ε1It is the first user to second user
Send the packet loss of RLNC coded data packet, ε2The packet loss of RLNC coded data packet is sent to the first user for second user,
Vector space indicates in RLNC coded data packet coding vector and second user received RLNC coded data with set Ψ k
Packet belongs to same coding vector space, its corresponding probability isVector space indicates that RLNC is encoded with set Ψ m
The coding vector of data packet is not belonging in second user the coding vector space of received RLNC coded data packet, it is corresponded to
Probability beVector space is indicated in the coding vector and the first user of RLNC coded data packet with set omega k
Received RLNC coded data packet belongs to same coding vector space, its corresponding probability isVector space
Indicate that the coding vector of RLNC coded data packet is not belonging in the first user received RLNC coded data packet with set omega l
Coding vector space, its corresponding probability is
The Markov Chain transfer matrix isIM+1For the unit matrix of (M+1) * (M+1), Q
It is the matrix of (n-M-1) * (n-M-1) and element therein is made of the transition probability between transfer state, R is one
(n-M-1) matrix of * (M+1) and element therein is made of transfer state to the transition probability absorbing state, wherein each
The sequence number that state corresponds to Markov Chain transfer matrix is acquired by such as minor function:
Wherein, τ=m+k+l.
In the above-mentioned D2D cooperation transmission process optimization device towards RLNC auxiliary of the embodiment of the present invention, the D2D association
The time is transmitted as Transmission system are as follows:Wherein, matrix N meets N=(I-Q)-1, I is unit square
Battle array.
Technical solution provided in an embodiment of the present invention has the benefit that
By establishing the slot model towards the RLNC D2D cooperative transmission system assisted, then according to Markov Chain original
It manages and in conjunction with the slot model of foundation, obtains in RLNC coding finite field size and D2D cooperative transmission system between user
Cooperate the frequency, the Discussion of Linear Model of time is transmitted to D2D cooperative transmission system, finally according to the linear phase of above-mentioned foundation
Model is closed, in the case where considering the influence factor of RLNC coding finite field size and cooperation among users frequency, Accurate Analysis RLNC is auxiliary
The D2D cooperative transmission system helped is transmitted time, and then the D2D cooperation transmission process that can be assisted towards RLNC optimization
Effective data and theory support are provided, realize optimization and improvement to the D2D cooperation transmission process assisted towards RLNC.
Detailed description of the invention
To describe the technical solutions in the embodiments of the present invention more clearly, make required in being described below to embodiment
Attached drawing is briefly described, it should be apparent that, drawings in the following description are only some embodiments of the invention, for
For those of ordinary skill in the art, without creative efforts, it can also be obtained according to these attached drawings other
Attached drawing.
Fig. 1 is a kind of D2D cooperation transmission schematic diagram of a scenario towards RLNC auxiliary that the embodiment of the present invention one provides；
Fig. 2 is a kind of D2D cooperation transmission process optimization method stream towards RLNC auxiliary that the embodiment of the present invention one provides
Cheng Tu；
Fig. 3 is a kind of analysis data that the embodiment of the present invention one provides and emulation data comparison figure；
Fig. 4 is another analysis data and emulation data comparison figure that the embodiment of the present invention one provides；
Fig. 5 is a kind of D2D cooperative transmission system performance analysis chart towards RLNC auxiliary that the embodiment of the present invention one provides；
Fig. 6 is another D2D cooperative transmission system performance evaluation towards RLNC auxiliary that the embodiment of the present invention one provides
Figure；
Fig. 7 is another D2D cooperative transmission system performance evaluation towards RLNC auxiliary that the embodiment of the present invention one provides
Figure；
Fig. 8 is another D2D cooperative transmission system performance evaluation towards RLNC auxiliary that the embodiment of the present invention one provides
Figure；
Fig. 9 is a kind of D2D cooperation transmission process optimization device knot towards RLNC auxiliary provided by Embodiment 2 of the present invention
Structure schematic diagram.
Specific embodiment
To make the object, technical solutions and advantages of the present invention clearer, below in conjunction with attached drawing to embodiment party of the present invention
Formula is described in further detail.
Embodiment one
The embodiment of the invention provides a kind of D2D cooperation transmission process optimization methods towards RLNC auxiliary, are suitable for
Transmission optimization analysis is carried out using the D2D cooperation transmission process of RLNC, referring to fig. 2, this method may include:
Step S11 establishes the slot model towards the RLNC D2D cooperative transmission system assisted.
Specifically, the slot model for the D2D cooperative transmission system towards RLNC auxiliary established in step S11 can be with packet
Include: base station sends the first time slot and the first user and second of RLNC coded data packet to the first user and second user respectively
Second time slot of cooperation transmission RLNC coded data packet between user, the second time slot include: that the first user cooperates to second user
The first sub-slots and second user for transmitting RLNC coded data packet are to the of the first user collaboration transmission RLNC coded data packet
Two sub-slots.
In the present embodiment, referring to Fig. 1, source node S (i.e. base station), user node U1(i.e. the first user) and user node
U2(i.e. second user) is transmitted in turn, and the transmission process of system is made of a series of network use, here each
Network use includes two stages: broadcast and cooperation.Wherein broadcast phase occupies a time slot (i.e. the first time slot), at this
One time slot, source node S send coded data packet to two user nodes；The cooperation stage occupies a time slot, and this time slot
It has been further divided into two sub-slots again, in first sub-slots, user U1It will be to user U2Coded data packet is sent,
In second sub-slots, user U2It will be to user U1Send coded data packet.Assuming that the finite field size that RLNC coding is selected
For q.
Step S12 according to Markov Chain principle and combines the slot model established, obtains RLNC and encode finite field size
And the cooperation frequency in D2D cooperative transmission system between user, the linearly related mould of time is transmitted to D2D cooperative transmission system
Type.
Specifically, above-mentioned steps S12 can be carried out by such as under type:
A obtains the transfer of D2D cooperative transmission system according to Markov Chain principle and in conjunction with the slot model of foundation
Probabilistic model, and establish corresponding Markov Chain transfer matrix.
Specifically, D2D cooperative transmission system transition probability model, comprising:
At the end of first time slot (i.e. after broadcast phase), following potential transfer and right occurs for D2D cooperative transmission system
The probability answered is as follows:
Pr { (m, k, l) → (m-1, k+1, l) }=PΦm(1-δ2),
Wherein, δ1The packet loss of RLNC coded data packet, δ are sent to the first user for base station2It is sent out for base station to second user
The packet loss of RLNC coded data packet is sent, m indicates that the RLNC of linear independence received by only the first user encodes packet quantity, l
Indicate that the RLNC of linear independence received by only second user encodes packet quantity, k indicates that the first user and second user connect
The RLNC coded data packet quantity of the linear independence received, m, k, l are the integer less than or equal to M and m+k+l≤M, M are use
The quantity of RLNC coded data packet is successfully decoded out in family, and Φ m indicates the volume that the RLNC coded data packet of m linear independence is constituted
Code vector spatial aggregation, its corresponding probability areΦ k indicates the RLNC coded data of k linear independence
Constituted coding vector spatial aggregation is wrapped, its corresponding probability isΦ l indicates that l is a linear
The coding vector spatial aggregation that unrelated RLNC coded data packet is constituted, its corresponding probability areΦ
The coding vector spatial aggregation for the RLNC coded data packet that new indicates to be not belonging to the first user and second user has been received,
Its corresponding probability isQ is that RLNC encodes finite field size.
In the present embodiment, the reception condition of system data packet can be described using a triple (m, k, l), wherein
M indicates only user U1The coding packet quantity of received linear independence, that is to say, that the coding vector of these coding packets does not belong to
In user U2In the coding vector space of the coding packet of received linear independence；Similarly, l indicates only user U2It is received
The coding packet quantity of the linear independence arrived；K indicates user U1With user U2The data packet number of the linear independence all received, this
In the coding vectors of these data packets belong to the coding vector space of data packet received in the other user's caching.
At the end of second time slot (i.e. after the cooperation stage), following potential transfer and right occurs for D2D cooperative transmission system
The probability answered is as follows:
Wherein, PD2DProbability (the P of cooperation between user in D2D cooperative transmission systemD2D=0 and PD2D=1 respectively corresponds
Two kinds of special situations: it can be executed in each network use absolutely not between cooperation transmission and user between user
Cooperation transmission), ε1The packet loss of RLNC coded data packet, ε are sent to second user for the first user2It is second user to first
User send RLNC coded data packet packet loss, vector space with set Ψ k indicate RLNC coded data packet coding vector and
Received RLNC coded data packet belongs to same coding vector space in second user, its corresponding probability isVector space indicates that the coding vector of RLNC coded data packet is not belonging to connect in second user with set Ψ m
The coding vector space of the RLNC coded data packet of receipts, its corresponding probability areVector space set omega k table
Show in the coding vector and the first user of RLNC coded data packet received RLNC coded data packet belong to it is same encode to
Quantity space, its corresponding probability areVector space indicates the coding vector of RLNC coded data packet not with set omega l
Belong in the first user that the coding vector space of received RLNC coded data packet, its corresponding probability are
Markov Chain transfer matrix isIM+1For the unit matrix of (M+1) * (M+1), Q is one
The matrix and element therein of a (n-M-1) * (n-M-1) are made of the transition probability between transfer state, and R is (a n-M-
1) matrix of * (M+1) and element therein is made of transfer state to the transition probability absorbing state, wherein each state pair
The sequence number of Markov Chain transfer matrix is answered to be acquired by such as minor function:
Wherein, τ=m+k+l.
In this example, it is assumed that source node S has M data packet hair to give two user node U1And U2, so there is m
∈ { 0,1,2 ..., M }, k ∈ { 0,1,2 ..., M }, l ∈ { 0,1,2 ..., M }, and meet m+k+l≤M, the state of such system
Sum are as follows:
Below to calculate user U1Deadline for, (user U is calculated using the model2Deadline it is same
Li Ke get).In this example, markovian original state be (0,0,0), final state meet (m, k, l) | m+k=
M }, this chance contains M+1 absorbing state, and meet probability P r { (m, k, l) → (m, k) l }=.1 will construct Markov
The transfer matrix of chain, can be by sorting to all system modes into property, and the corresponding sequence number of each state is by functionIt acquires.That is when in system two users do not have
When receiving any one data packet, it is original state, Serial No. 0 that we, which define this system mode,.
In system model, every to pass through a network use, the state of system will occur to shift three times, for example, 1)
After after broadcast phase is complete；2) after first cooperation sub-slots terminates；3) after second cooperation sub-slots terminates.
After one network use terminates, a complete state migration procedure are as follows: for { (m, k, l) → (m, k+2, l-1) }.
This complete state transfer includes two kinds of situations: 1) { (m, k, l) → (m+1, k, l) → (m, k+1, l) → (m, k+2, l-
1) }, 2) { (m, k, l) → (m, k+1, l) → (m, k+1, l) → (m, k+2, l-1) }.In the analysis model of Markov chain,
All state transfers are all to investigate every turntable transfer variation occurred after a network use.So the example
Transition probability in son are as follows:
Using Δ m, Δ k, Δ l indicate m, k, l in every increase or reduction amount after network use,
So Δ m, Δ l ∈ { -2, -1,0,1 }, Δ k ∈ { 0,1,2,3 }.If system mode sequence number i=f (m, k, l) and j=f
(m+ Δ m, k+ Δ k, l+ Δ l), i are the states before shifting, and j is the state after transfer.Our available n*n's
Transfer matrix:
Each element Π in matrixi,jTurn corresponding to the obtained state after network use each time in front
Shifting probability P r (m, k, l) → (m+ Δ m, k+ Δ k, l+ Δ l) }.The corresponding status switch number of original state (0,0,0) is 1, and
And the corresponding Serial No. n-M of M+1 absorbing state ..., n-1, n.I in matrixM+1For the unit of one (M+1) × (M+1)
Battle array, Q is the matrix of one (n-M-1) × (n-M-1) and element therein is made of the transition probability between transfer state, finally
R is the matrix of one (n-M-1) × (M+1) and element therein by transfer state to the transition probability structure absorbing state
At.
We use (Π)tCarry out the t power of representing matrix Π, then after t network use, matrix (Π)t
The position (i, j) on element be exactly probability that system mode is transferred to j by i, with [(Π)t]i,jIt indicates, so user U1?
The probability of the coding packet of m+k linear independence is received after t network use are as follows:
B obtains D2D cooperative transmission system and is transmitted the time according to Markov Chain transfer matrix.
Specifically, D2D cooperative transmission system is transmitted the time are as follows:Wherein, matrix N meets N
=(I-Q)-1, I is unit matrix.
In the present embodiment, have because each network use is accounted for there are two time slot, user U1M is successfully decoded out
Time slot needed for a file are as follows:Wherein, matrix N meets N=(I-Q)-1, I is unit matrix.
Step S13 optimizes the D2D cooperation transmission process assisted towards RLNC according to the Discussion of Linear Model of foundation.
In the present embodiment, it can be encoded in finite field size and D2D cooperative transmission system by the RLNC of above-mentioned foundation
The cooperation frequency between user, the Discussion of Linear Model of time is transmitted to D2D cooperative transmission system, is had in consideration RLNC coding
Under the influence factor of confinement size and cooperation among users frequency, the biography of the D2D cooperative transmission system of Accurate Analysis RLNC auxiliary
The defeated deadline, and then effective data and theoretical branch can be provided towards the RLNC D2D cooperation transmission process assisted to optimization
Support.
It should be noted that Fig. 3 and 4 gives analysis data and emulation data comparison figure, demonstrates and compiled in different RLNC
The assay value of system deadline and the comparison of simulation value under code finite field size and different cooperation Probability Conditions.Fig. 3 is provided
The comparison diagram of deadline assay value and simulation value under the conditions of different finite field sizes, it is assumed that PD2D=1, M=16；Fig. 4 gives
The comparison diagram of deadline assay value and simulation value under different cooperation Probability Conditions is gone out, it is assumed that q=256, M=32.This hair
Bright assay value and simulation value is coincide substantially.
Fig. 5-8 gives system performance analysis figure, and Fig. 5 gives function of the deadline about different finite field q, it is assumed that
PD2D=1, M=16.In two groups of different packet loss, with being continuously increased for q, the deadline will level off to minimum complete
At the time.Demonstrate the maximum current capacity that network may be implemented using RLNC.
Fig. 6 gives function of the transmission rate about different finite field q, it is assumed that PD2D=1, δ1=0.4, δ2=0.2, ε1=
0.3,ε2=0.3, M take different size of value.Here transmission rateTransmission rate increases with the increase of q,
And when q is sufficiently large, transmission rate curve can become very flat.In addition, will increase as M increases transmission rate also.It proves
As M is gradually increased, the maximum current capacity of network can be realized using RLNC.
Fig. 7 gives transmission rate about different cooperation probability PsD2DFunction curve, it is assumed that M=16, q=256.One side
Face increases the cooperation probability between user, the transmission speed of system when the packet loss of two broadcasting links of broadcast phase is not much different
Rate will not obtain apparent performance boost.Still further aspect, as link S → U1Packet loss be significantly greater than S → U2Packet loss
When, user U1Received data packet transmission rate can with cooperation probability increase and be obviously improved.So between user
Cooperating process be very suitable for the biggish application scenarios of broadcasting link state difference.
Fig. 8 gives function curve of the transmission rate about different finite field q, it is assumed that M=16, δ1=0.4, δ2=0.2,
ε1=0.3, ε2=0.3, the cooperation probability that we take multiple groups different.When there is cooperation between user, the transmission rate of system can be obtained
To being obviously improved.System transfer rate can increase with the increase of q.
The embodiment of the present invention, which passes through, establishes the slot model towards the RLNC D2D cooperative transmission system assisted, then basis
Markov Chain principle and the slot model in conjunction with foundation obtain RLNC coding finite field size and D2D cooperation transmission system
The cooperation frequency in system between user, the Discussion of Linear Model of time is transmitted to D2D cooperative transmission system, finally according to above-mentioned
The Discussion of Linear Model of foundation, in the case where considering the influence factor of RLNC coding finite field size and cooperation among users frequency, essence
The D2D cooperative transmission system that really analysis RLNC is assisted is transmitted time, and then the D2D that can be assisted towards RLNC optimization
Cooperation transmission process provides effective data and theory support, realizes to the excellent of the D2D cooperation transmission process assisted towards RLNC
Change and improves.
Embodiment two
The embodiment of the invention provides a kind of D2D cooperation transmission process optimization devices towards RLNC auxiliary, implement reality
Method described in example one is applied, referring to Fig. 9, the apparatus may include: it establishes module 100, obtain module 200 and optimization module
300。
Module 100 is established, for establishing the slot model of the D2D cooperative transmission system towards RLNC auxiliary.
Specifically, the slot model of the D2D cooperative transmission system towards RLNC auxiliary of above-mentioned foundation can be with, comprising: base
Stand respectively to the first user and second user send RLNC coded data packet the first time slot and the first user and second user it
Between cooperation transmission RLNC coded data packet the second time slot, the second time slot includes: the first user to second user cooperation transmission
The first sub-slots and second user of RLNC coded data packet transmit the second son of RLNC coded data packet to the first user collaboration
Time slot.
Module 200 is obtained, the slot model for establishing according to Markov Chain principle and combination, obtaining RLNC coding has
The cooperation frequency in confinement size and D2D cooperative transmission system between user, the line of time is transmitted to D2D cooperative transmission system
Property correlation model.
Optimization module 300 optimizes the D2D cooperation transmission assisted towards RLNC for the Discussion of Linear Model according to foundation
Process.
In the present embodiment, it can be encoded in finite field size and D2D cooperative transmission system by the RLNC of above-mentioned foundation
The cooperation frequency between user, the Discussion of Linear Model of time is transmitted to D2D cooperative transmission system, is had in consideration RLNC coding
Under the influence factor of confinement size and cooperation among users frequency, the biography of the D2D cooperative transmission system of Accurate Analysis RLNC auxiliary
The defeated deadline, and then effective data and theoretical branch can be provided towards the RLNC D2D cooperation transmission process assisted to optimization
Support.
Specifically, referring to Fig. 9, obtaining module 200 may include: first acquisition unit 201 and second acquisition unit 202,
First acquisition unit 201, for obtaining according to Markov Chain principle and in conjunction with the slot model of foundation
D2D cooperative transmission system transition probability model, and establish corresponding Markov Chain transfer matrix.
Specifically, D2D cooperative transmission system transition probability model, comprising:
At the end of first time slot (i.e. after broadcast phase), following potential transfer and right occurs for D2D cooperative transmission system
The probability answered is as follows:
Pr { (m, k, l) → (m-1, k+1, l) }=PΦm(1-δ2),
Wherein, δ1The packet loss of RLNC coded data packet, δ are sent to the first user for base station2It is sent out for base station to second user
The packet loss of RLNC coded data packet is sent, m indicates that the RLNC of linear independence received by only the first user encodes packet quantity, l
Indicate that the RLNC of linear independence received by only second user encodes packet quantity, k indicates that the first user and second user connect
The RLNC coded data packet quantity of the linear independence received, m, k, l are the integer less than or equal to M and m+k+l≤M, M are use
The quantity of RLNC coded data packet is successfully decoded out in family, and Φ m indicates the volume that the RLNC coded data packet of m linear independence is constituted
Code vector spatial aggregation, its corresponding probability areΦ k indicates the RLNC coded data of k linear independence
Constituted coding vector spatial aggregation is wrapped, its corresponding probability isΦ l indicates that l is a linear
The coding vector spatial aggregation that unrelated RLNC coded data packet is constituted, its corresponding probability areΦ
The coding vector spatial aggregation for the RLNC coded data packet that new indicates to be not belonging to the first user and second user has been received,
Its corresponding probability isQ is that RLNC encodes finite field size.
In the present embodiment, the reception condition of system data packet can be described using a triple (m, k, l), wherein
M indicates only user U1The coding packet quantity of received linear independence, that is to say, that the coding vector of these coding packets does not belong to
In user U2In the coding vector space of the coding packet of received linear independence；Similarly, l indicates only user U2It is received
The coding packet quantity of the linear independence arrived；K indicates user U1With user U2The data packet number of the linear independence all received, this
In the coding vectors of these data packets belong to the coding vector space of data packet received in the other user's caching.
At the end of second time slot (i.e. after the cooperation stage), following potential transfer and right occurs for D2D cooperative transmission system
The probability answered is as follows:
Wherein, PD2DProbability (the P of cooperation between user in D2D cooperative transmission systemD2D=0 and PD2D=1 respectively corresponds
Two kinds of special situations: it can be executed in each network use absolutely not between cooperation transmission and user between user
Cooperation transmission), ε1The packet loss of RLNC coded data packet, ε are sent to second user for the first user2It is second user to first
User send RLNC coded data packet packet loss, vector space with set Ψ k indicate RLNC coded data packet coding vector and
Received RLNC coded data packet belongs to same coding vector space in second user, its corresponding probability isVector space indicates that the coding vector of RLNC coded data packet is not belonging to connect in second user with set Ψ m
The coding vector space of the RLNC coded data packet of receipts, its corresponding probability areVector space set omega k table
Show in the coding vector and the first user of RLNC coded data packet received RLNC coded data packet belong to it is same encode to
Quantity space, its corresponding probability areVector space indicates the coding vector of RLNC coded data packet not with set omega l
Belong in the first user that the coding vector space of received RLNC coded data packet, its corresponding probability are
Markov Chain transfer matrix isIM+1For the unit matrix of (M+1) * (M+1), Q is one
The matrix and element therein of a (n-M-1) * (n-M-1) are made of the transition probability between transfer state, and R is (a n-M-
1) matrix of * (M+1) and element therein is made of transfer state to the transition probability absorbing state, wherein each state pair
The sequence number of Markov Chain transfer matrix is answered to be acquired by such as minor function:
Wherein, τ=m+k+l.
Second acquisition unit 202, for obtaining D2D cooperative transmission system and transferring according to Markov Chain transfer matrix
At the time.
Specifically, D2D cooperative transmission system is transmitted the time are as follows:Wherein, matrix N meets N
=(I-Q)-1, I is unit matrix.
The embodiment of the present invention, which passes through, establishes the slot model towards the RLNC D2D cooperative transmission system assisted, then basis
Markov Chain principle and the slot model in conjunction with foundation obtain RLNC coding finite field size and D2D cooperation transmission system
The cooperation frequency in system between user, the Discussion of Linear Model of time is transmitted to D2D cooperative transmission system, finally according to above-mentioned
The Discussion of Linear Model of foundation, in the case where considering the influence factor of RLNC coding finite field size and cooperation among users frequency, essence
The D2D cooperative transmission system that really analysis RLNC is assisted is transmitted time, and then the D2D that can be assisted towards RLNC optimization
Cooperation transmission process provides effective data and theory support, realizes to the excellent of the D2D cooperation transmission process assisted towards RLNC
Change and improves.
The serial number of the above embodiments of the invention is only for description, does not represent the advantages or disadvantages of the embodiments.
It should be understood that the D2D cooperation transmission process optimization device provided by the above embodiment towards RLNC auxiliary exists
When the D2D cooperation transmission process optimization method that realization is assisted towards RLNC, only illustrated with the division of above-mentioned each functional module
Illustrate, in practical application, can according to need and be completed by different functional modules above-mentioned function distribution, i.e., it will be in equipment
Portion's structure is divided into different functional modules, to complete all or part of the functions described above.In addition, above-described embodiment mentions
The D2D cooperation transmission process optimization device towards RLNC auxiliary supplied and the D2D cooperation transmission process optimization towards RLNC auxiliary
Embodiment of the method belongs to same design, and specific implementation process is detailed in embodiment of the method, and which is not described herein again.
Those of ordinary skill in the art will appreciate that realizing that all or part of the steps of above-described embodiment can pass through hardware
It completes, relevant hardware can also be instructed to complete by program, the program can store in a kind of computer-readable
In storage medium, storage medium mentioned above can be read-only memory, disk or CD etc..
The foregoing is merely presently preferred embodiments of the present invention, is not intended to limit the invention, it is all in spirit of the invention and
Within principle, any modification, equivalent replacement, improvement and so on be should all be included in the protection scope of the present invention.
Claims (10)
1. a kind of D2D cooperation transmission process optimization method towards RLNC auxiliary, which is characterized in that the described method includes:
Establish the slot model towards the RLNC D2D cooperative transmission system assisted；
According to Markov Chain principle and in conjunction with the slot model of foundation, RLNC coding finite field size and D2D association are obtained
Make the cooperation frequency in Transmission system between user, the Discussion of Linear Model of time is transmitted to D2D cooperative transmission system；
According to the Discussion of Linear Model of foundation, optimize the D2D cooperation transmission process assisted towards RLNC.
2. the method according to claim 1, wherein the D2D cooperative transmission system towards RLNC auxiliary
Slot model, comprising:
Base station sends the first time slot and the first user and second of RLNC coded data packet to the first user and second user respectively
Second time slot of cooperation transmission RLNC coded data packet between user, second time slot include: the first user to second user
The first sub-slots and second user of cooperation transmission RLNC coded data packet transmit RLNC coded data packet to the first user collaboration
The second sub-slots.
3. according to the method described in claim 2, it is characterized in that, the institute established according to Markov Chain principle and combination
Slot model is stated, the cooperation frequency in RLNC coding finite field size and D2D cooperative transmission system between user is obtained, D2D is assisted
The Discussion of Linear Model of time is transmitted as Transmission system, comprising:
According to Markov Chain principle and in conjunction with the slot model of foundation, D2D cooperative transmission system transition probability mould is obtained
Type, and establish corresponding Markov Chain transfer matrix；
According to Markov Chain transfer matrix, obtains D2D cooperative transmission system and be transmitted the time.
4. according to the method described in claim 3, it is characterized in that, the D2D cooperative transmission system transition probability model, packet
It includes:
At the end of first time slot, following potential transfer occurs for D2D cooperative transmission system and corresponding probability is as follows:
Pr { (m, k, l) → (m-1, k+1, l) }=PΦm(1-δ2),
Wherein, δ1The packet loss of RLNC coded data packet, δ are sent to the first user for base station2It is sent for base station to second user
The packet loss of RLNC coded data packet, m indicate that the RLNC of linear independence received by only the first user encodes packet quantity, l table
Show the RLNC coding packet quantity of linear independence received by only second user, k indicates that the first user and second user receive
The RLNC coded data packet quantity of the linear independence arrived, m, k, l are the integer less than or equal to M and m+k+l≤M, M are user
The quantity of RLNC coded data packet is successfully decoded out, Φ m indicates the coding that the RLNC coded data packet of m linear independence is constituted
Vector space set, its corresponding probability areΦ k indicates the RLNC coded data packet of k linear independence
The coding vector spatial aggregation constituted, its corresponding probability areΦ l indicates l linear nothings
The coding vector spatial aggregation that the RLNC coded data packet of pass is constituted, its corresponding probability areΦ
The coding vector spatial aggregation for the RLNC coded data packet that new indicates to be not belonging to the first user and second user has been received,
Its corresponding probability isQ is that RLNC encodes finite field size,
At the end of second time slot, following potential transfer occurs for D2D cooperative transmission system and corresponding probability is as follows:
Wherein, PD2DThe probability of cooperation between user in D2D cooperative transmission system, ε1It is sent for the first user to second user
The packet loss of RLNC coded data packet, ε2The packet loss of RLNC coded data packet, vector are sent to the first user for second user
Space indicates in RLNC coded data packet coding vector and second user received RLNC coded data packet category with set Ψ k
In same coding vector space, its corresponding probability isVector space indicates RLNC coded data with set Ψ m
The coding vector of packet is not belonging in second user the coding vector space of received RLNC coded data packet, it is corresponding general
Rate isVector space is indicated in the coding vector and the first user of RLNC coded data packet with set omega k
Received RLNC coded data packet belongs to same coding vector space, its corresponding probability isVector space collection
Closing Ω l indicates that the coding vector of RLNC coded data packet is not belonging in the first user the volume of received RLNC coded data packet
Code vector space, its corresponding probability are
The Markov Chain transfer matrix isIM+1For the unit matrix of (M+1) * (M+1), Q is one
The matrix and element therein of a (n-M-1) * (n-M-1) are made of the transition probability between transfer state, and R is (a n-M-
1) matrix of * (M+1) and element therein is made of transfer state to the transition probability absorbing state, wherein each state pair
The sequence number of Markov Chain transfer matrix is answered to be acquired by such as minor function:
Wherein, τ=m+k+l.
5. according to the method described in claim 4, it is characterized in that, the D2D cooperative transmission system passes
The defeated deadline are as follows:Wherein, matrix N meets N=(I-Q)-1, I is unit matrix.
6. a kind of D2D cooperation transmission process optimization device towards RLNC auxiliary characterized by comprising
Module is established, for establishing the slot model of the D2D cooperative transmission system towards RLNC auxiliary；
Module is obtained, for it is limited to obtain RLNC coding according to Markov Chain principle and in conjunction with the slot model of foundation
The cooperation frequency in domain size and D2D cooperative transmission system between user is transmitted the linear of time to D2D cooperative transmission system
Correlation model；
Optimization module optimizes the D2D cooperation transmission mistake assisted towards RLNC for the Discussion of Linear Model according to foundation
Journey.
7. device according to claim 6, which is characterized in that the D2D cooperative transmission system towards RLNC auxiliary
Slot model, comprising:
Base station sends the first time slot and the first user and second of RLNC coded data packet to the first user and second user respectively
Second time slot of cooperation transmission RLNC coded data packet between user, second time slot include: the first user to second user
The first sub-slots and second user of cooperation transmission RLNC coded data packet transmit RLNC coded data packet to the first user collaboration
The second sub-slots.
8. device according to claim 7, which is characterized in that the acquisition module includes:
First acquisition unit, for obtaining D2D cooperation and passing according to Markov Chain principle and in conjunction with the slot model of foundation
Defeated system transition probability model, and establish corresponding Markov Chain transfer matrix；
Second acquisition unit, for obtaining D2D cooperative transmission system and being transmitted the time according to Markov Chain transfer matrix.
9. device according to claim 8, which is characterized in that the D2D cooperative transmission system transition probability model, packet
It includes:
At the end of first time slot, following potential transfer occurs for D2D cooperative transmission system and corresponding probability is as follows:
Pr { (m, k, l) → (m-1, k+1, l) }=PΦm(1-δ2),
Wherein, δ1The packet loss of RLNC coded data packet, δ are sent to the first user for base station2It is sent for base station to second user
The packet loss of RLNC coded data packet, m indicate that the RLNC of linear independence received by only the first user encodes packet quantity, l table
Show the RLNC coding packet quantity of linear independence received by only second user, k indicates that the first user and second user receive
The RLNC coded data packet quantity of the linear independence arrived, m, k, l are the integer less than or equal to M and m+k+l≤M, M are user
The quantity of RLNC coded data packet is successfully decoded out, Φ m indicates the coding that the RLNC coded data packet of m linear independence is constituted
Vector space set, its corresponding probability areΦ k indicates the RLNC coded data packet of k linear independence
The coding vector spatial aggregation constituted, its corresponding probability areΦ l indicates l linear nothings
The coding vector spatial aggregation that the RLNC coded data packet of pass is constituted, its corresponding probability areΦ
The coding vector spatial aggregation for the RLNC coded data packet that new indicates to be not belonging to the first user and second user has been received,
Its corresponding probability isQ is that RLNC encodes finite field size,
At the end of second time slot, following potential transfer occurs for D2D cooperative transmission system and corresponding probability is as follows:
Wherein, PD2DThe probability of cooperation between user in D2D cooperative transmission system, ε1It is sent for the first user to second user
The packet loss of RLNC coded data packet, ε2The packet loss of RLNC coded data packet, vector are sent to the first user for second user
Space indicates in RLNC coded data packet coding vector and second user received RLNC coded data packet category with set Ψ k
In same coding vector space, its corresponding probability isVector space indicates RLNC coded data with set Ψ m
The coding vector of packet is not belonging in second user the coding vector space of received RLNC coded data packet, it is corresponding general
Rate isVector space is indicated in the coding vector and the first user of RLNC coded data packet with set omega k
Received RLNC coded data packet belongs to same coding vector space, its corresponding probability isVector space collection
Closing Ω l indicates that the coding vector of RLNC coded data packet is not belonging in the first user the volume of received RLNC coded data packet
Code vector space, its corresponding probability are
The Markov Chain transfer matrix isIM+1For the unit matrix of (M+1) * (M+1), Q is one
The matrix and element therein of a (n-M-1) * (n-M-1) are made of the transition probability between transfer state, and R is (a n-M-
1) matrix of * (M+1) and element therein is made of transfer state to the transition probability absorbing state, wherein each state pair
The sequence number of Markov Chain transfer matrix is answered to be acquired by such as minor function:
Wherein, τ=m+k+l.
10. device according to claim 9, which is characterized in that the D2D cooperative transmission system is transmitted the time are as follows:Wherein, matrix N meets N=(I-Q)-1, I is unit matrix.
Priority Applications (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN201811207685.1A CN109257145B (en) | 2018-10-17 | 2018-10-17 | RLNC (recursive least squares) -assisted D2D cooperative transmission process optimization method and device |
Applications Claiming Priority (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN201811207685.1A CN109257145B (en) | 2018-10-17 | 2018-10-17 | RLNC (recursive least squares) -assisted D2D cooperative transmission process optimization method and device |
Publications (2)
| Publication Number | Publication Date |
|---|---|
| CN109257145A true CN109257145A (en) | 2019-01-22 |
| CN109257145B CN109257145B (en) | 2020-10-09 |
Family
ID=65045524
Family Applications (1)
| Application Number | Title | Priority Date | Filing Date |
|---|---|---|---|
| CN201811207685.1A Active CN109257145B (en) | 2018-10-17 | 2018-10-17 | RLNC (recursive least squares) -assisted D2D cooperative transmission process optimization method and device |
Country Status (1)
| Country | Link |
|---|---|
| CN (1) | CN109257145B (en) |
Cited By (2)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN110086573A (en) * | 2019-04-17 | 2019-08-02 | 浙江工商大学 | It is a kind of based on network code and the peering data transmission method of user |
| CN113133033A (en) * | 2021-04-25 | 2021-07-16 | 重庆邮电大学 | Topology-aware random linear network coding retransmission scheme |
Citations (5)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN105915300A (en) * | 2016-04-16 | 2016-08-31 | 广西大学 | RLNC-based back-off frequency spectrum prediction method in CR network |
| EP3072350A1 (en) * | 2013-11-19 | 2016-09-28 | Telefonaktiebolaget LM Ericsson (publ) | Method and base station for supporting d2d communication |
| CN106304165A (en) * | 2016-08-12 | 2017-01-04 | 辛建芳 | The method for analyzing performance of the D2D honeycomb heterogeneous network based on queuing theory |
| CN106686683A (en) * | 2017-03-04 | 2017-05-17 | 西安电子科技大学 | D2D (Device-to-Device) communication power distribution and relay selection method based on network coding |
| CN106973362A (en) * | 2017-04-17 | 2017-07-21 | 南京邮电大学 | D2D communication means based on network code in a kind of cellular network |
-
2018
- 2018-10-17 CN CN201811207685.1A patent/CN109257145B/en active Active
Patent Citations (5)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| EP3072350A1 (en) * | 2013-11-19 | 2016-09-28 | Telefonaktiebolaget LM Ericsson (publ) | Method and base station for supporting d2d communication |
| CN105915300A (en) * | 2016-04-16 | 2016-08-31 | 广西大学 | RLNC-based back-off frequency spectrum prediction method in CR network |
| CN106304165A (en) * | 2016-08-12 | 2017-01-04 | 辛建芳 | The method for analyzing performance of the D2D honeycomb heterogeneous network based on queuing theory |
| CN106686683A (en) * | 2017-03-04 | 2017-05-17 | 西安电子科技大学 | D2D (Device-to-Device) communication power distribution and relay selection method based on network coding |
| CN106973362A (en) * | 2017-04-17 | 2017-07-21 | 南京邮电大学 | D2D communication means based on network code in a kind of cellular network |
Non-Patent Citations (2)
| Title |
|---|
| HANA KHAMFROUSH等: ""On Optimal Policies for Network-Coded Cooperation:Theory and Implementation"", 《IEEE JOURNAL ON SELECTED AREAS IN COMMUNICATIONS》 * |
| 杨军: ""网络编码的若干关键问题研究"", 《中国博士学位论文全文数据库》 * |
Cited By (3)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN110086573A (en) * | 2019-04-17 | 2019-08-02 | 浙江工商大学 | It is a kind of based on network code and the peering data transmission method of user |
| CN110086573B (en) * | 2019-04-17 | 2021-09-21 | 浙江工商大学 | Data transmission method based on network coding and user pairing |
| CN113133033A (en) * | 2021-04-25 | 2021-07-16 | 重庆邮电大学 | Topology-aware random linear network coding retransmission scheme |
Also Published As
| Publication number | Publication date |
|---|---|
| CN109257145B (en) | 2020-10-09 |
Similar Documents
| Publication | Publication Date | Title |
|---|---|---|
| CN100359839C (en) | Method for minimizing feedback responses in ARQ protocols | |
| KR20090067178A (en) | Group-wise secret key generation | |
| CN106170934B (en) | Wireless forward pass passive optical network PON system, optical network device and method | |
| TW201233107A (en) | Grouping small burst transmissions for downlink machine-to-machine communications | |
| CN103188810B (en) | Indicating bit table issuing method, indicating operation method, equipment and system | |
| CN104135452A (en) | Synchronous compression and recovery algorithm and device for IQ (Intelligence Quotient) data | |
| CN109257145A (en) | D2D cooperation transmission process optimization method and apparatus towards RLNC auxiliary | |
| CN106470212B (en) | Method for compressing and encrypting EIGRP protocol message based on LZW compression algorithm | |
| CN101257366B (en) | Encoding and decoding method, communication system and equipment | |
| WO2018113550A1 (en) | Channel encoding method, channel encoding apparatus, chip system and storage medium | |
| CN111447044B (en) | Distributed storage method and transmission decoding method | |
| CN107615810B (en) | Packet header compression system and method for online network code | |
| CN116915293A (en) | Construction method based on finite field multiple access codebook and network layer multi-user communication method and device | |
| CN105162554B (en) | Real-time interpretation method and device in a kind of coding slotted ALOHA system | |
| KR102471817B1 (en) | Information transmission method and device | |
| CN107360594B (en) | Information processing method and device | |
| CN108631977A (en) | A kind of sending method and sending device of broadcast message instruction | |
| CN108574493A (en) | The method and apparatus of data processing | |
| CN108631793A (en) | A method of construction coded sequence, device | |
| CN105242908A (en) | Method for transmitting very high frequency radio large file based on serial hardware flow control | |
| Chong et al. | Stepping-random code: a rateless erasure code for short-length messages | |
| CN114978349B (en) | Multi-hop lossless invisible state transmission method based on non-maximum entangled cluster state | |
| Dia et al. | Performance of polar codes in cooperative transmission systems | |
| Zeng et al. | Polar coded cooperative with Plotkin construction and quasi‐uniform puncturing based on MIMO antennas in half duplex wireless relay network | |
| CN112422277B (en) | Encrypted data transmission system and method between differential units in differential protection group |
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 |