CN108847992A - A kind of video machine meeting transmission route algorithm based on multi-user Cooperation game - Google Patents
A kind of video machine meeting transmission route algorithm based on multi-user Cooperation game Download PDFInfo
- Publication number
- CN108847992A CN108847992A CN201810777098.XA CN201810777098A CN108847992A CN 108847992 A CN108847992 A CN 108847992A CN 201810777098 A CN201810777098 A CN 201810777098A CN 108847992 A CN108847992 A CN 108847992A
- Authority
- CN
- China
- Prior art keywords
- video
- video data
- data packet
- frame
- node
- 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
- 230000005540 biological transmission Effects 0.000 title claims abstract description 82
- 238000004422 calculation algorithm Methods 0.000 title claims abstract description 40
- 238000000034 method Methods 0.000 claims abstract description 47
- 230000008569 process Effects 0.000 claims abstract description 27
- 230000015572 biosynthetic process Effects 0.000 claims abstract description 6
- 238000003786 synthesis reaction Methods 0.000 claims abstract description 6
- 238000005457 optimization Methods 0.000 claims description 12
- 238000011084 recovery Methods 0.000 claims description 5
- 230000001419 dependent effect Effects 0.000 claims description 3
- 239000011248 coating agent Substances 0.000 claims description 2
- 238000000576 coating method Methods 0.000 claims description 2
- 238000004088 simulation Methods 0.000 abstract description 2
- 238000013480 data collection Methods 0.000 abstract 1
- 238000013461 design Methods 0.000 description 7
- 230000008859 change Effects 0.000 description 6
- 238000007726 management method Methods 0.000 description 6
- 230000001413 cellular effect Effects 0.000 description 5
- 238000004891 communication Methods 0.000 description 5
- 238000005516 engineering process Methods 0.000 description 4
- 238000011161 development Methods 0.000 description 3
- 238000012986 modification Methods 0.000 description 3
- 230000004048 modification Effects 0.000 description 3
- 238000010586 diagram Methods 0.000 description 2
- 241001269238 Data Species 0.000 description 1
- 208000001613 Gambling Diseases 0.000 description 1
- 208000003443 Unconsciousness Diseases 0.000 description 1
- 238000013459 approach Methods 0.000 description 1
- 230000009286 beneficial effect Effects 0.000 description 1
- 230000008901 benefit Effects 0.000 description 1
- 238000004364 calculation method Methods 0.000 description 1
- 230000007812 deficiency Effects 0.000 description 1
- 238000009792 diffusion process Methods 0.000 description 1
- 239000002360 explosive Substances 0.000 description 1
- 230000005484 gravity Effects 0.000 description 1
- 238000005259 measurement Methods 0.000 description 1
- 230000007246 mechanism Effects 0.000 description 1
- 238000004377 microelectronic Methods 0.000 description 1
- 238000010295 mobile communication Methods 0.000 description 1
- 238000013139 quantization Methods 0.000 description 1
- 230000007115 recruitment Effects 0.000 description 1
- 230000010076 replication Effects 0.000 description 1
- 238000011160 research Methods 0.000 description 1
- 230000004044 response Effects 0.000 description 1
- 238000005303 weighing Methods 0.000 description 1
Classifications
-
- H—ELECTRICITY
- H04—ELECTRIC COMMUNICATION TECHNIQUE
- H04L—TRANSMISSION OF DIGITAL INFORMATION, e.g. TELEGRAPHIC COMMUNICATION
- H04L41/00—Arrangements for maintenance, administration or management of data switching networks, e.g. of packet switching networks
- H04L41/14—Network analysis or design
- H04L41/145—Network analysis or design involving simulating, designing, planning or modelling of a network
-
- H—ELECTRICITY
- H04—ELECTRIC COMMUNICATION TECHNIQUE
- H04L—TRANSMISSION OF DIGITAL INFORMATION, e.g. TELEGRAPHIC COMMUNICATION
- H04L45/00—Routing or path finding of packets in data switching networks
- H04L45/38—Flow based routing
-
- H—ELECTRICITY
- H04—ELECTRIC COMMUNICATION TECHNIQUE
- H04N—PICTORIAL COMMUNICATION, e.g. TELEVISION
- H04N21/00—Selective content distribution, e.g. interactive television or video on demand [VOD]
- H04N21/40—Client devices specifically adapted for the reception of or interaction with content, e.g. set-top-box [STB]; Operations thereof
- H04N21/43—Processing of content or additional data, e.g. demultiplexing additional data from a digital video stream; Elementary client operations, e.g. monitoring of home network or synchronising decoder's clock; Client middleware
- H04N21/44—Processing of video elementary streams, e.g. splicing a video clip retrieved from local storage with an incoming video stream or rendering scenes according to encoded video stream scene graphs
- H04N21/4402—Processing of video elementary streams, e.g. splicing a video clip retrieved from local storage with an incoming video stream or rendering scenes according to encoded video stream scene graphs involving reformatting operations of video signals for household redistribution, storage or real-time display
Landscapes
- Engineering & Computer Science (AREA)
- Signal Processing (AREA)
- Computer Networks & Wireless Communication (AREA)
- Multimedia (AREA)
- Data Exchanges In Wide-Area Networks (AREA)
Abstract
A kind of video machine meeting transmission route algorithm based on multi-user Cooperation game, first two factors of video data synthesis itself and transmission network, establish the edge quality gain model of video data packet；Secondly the multiple nodes to meet are regarded as the network of a connection, and data exchange process therebetween is modeled as the process of a multi-user Cooperation game；The optimal Nash solution finally indicated based on geometric space carries out decision to the duplication or forwarding of each video data packet.The algorithm guarantees in the case where video transmission quality is optimal, video data packet backup number in network is minimum, simulation result based on generated data collection and real data set shows, video transmission quality of the present invention is higher by 1 ~ 2dB than analogous algorithms, but average maximum data packet backup number is only 25% of analogous algorithms or so；The algorithm can not only make video transmission quality maximize, while can reduce the average maximum backup number of data packet, so that the minimum transmission overhead of network.
Description
Technical field
The present invention relates to wireless communication technology field, specifically a kind of video machine meeting based on multi-user Cooperation game
Transmission route algorithm.
Background technique
The rapid development of microelectronics and wireless communication technique so that intelligent terminal be able between last decade it is quickly universal,
And its embedded various sensing equipment also gives the ability that people carry out video-aware to external environment.Meanwhile benefiting from shifting
The fast development of dynamic internet, video data can be shared between user whenever and wherever possible, and can provide the user with various
Application and service.But the surge of mobile device brings the explosive growth of mobile data flow, and wherein video data accounts for
According to very big specific gravity, according to the prediction of Cisco, which is up to 84% at year ends 2018.However mobile data flow mainly leads to
Mobile cellular network (3G/4G, LTE) is crossed to be transmitted, although mobile communication technology is able to tremendous development in recent years,
Still be unable to satisfy the data flow of magnanimity transmission rate and in terms of demand to network.
Network that the mobile data stream for needing to be transmitted by mobile cellular network is assisted by other and means into
Row transmission and shunting, referred to as mobile data unloading (Mobile data offloading).Currently, mobile data unloading is recognized
To be the most efficient method for being able to solve above-mentioned predicament.Wi-Fi Hotspot is often used as the nondominant hand of mobile cellular network
Section carries out data transmission, but due to factors such as lower deployment cost and transmission ranges, is difficult to form one in the range of a wide area
The wireless network of a all standing provides data transport service.Therefore, convenient, efficient mobile data unloading how is carried out, especially
It is the problem that video data unloading has become current academia and industry extensive concern.
For the transmission problem of general data in opportunistic network, many algorithms and mechanism are had existed, but due to following originals
Because it can not all be directly applied for the chance transmission of video data.Firstly, video data has with general data very greatly in itself
Difference, routing algorithm should fully consider its uniqueness, such as duration, local correlations in design；Secondly, algorithm designs
Performance objective there are larger difference, general data transmission mainly using delivery ratio and propagation delay time as the standard of performance metric,
And video data transmission is then using the delivery quality of video data as the measurement index of Design of Routing Algorithm, not only includes transmission
Time delay, while further including the reconstruction quality of video data；Finally, existing chance routing algorithm mainly considers the number between two nodes
According to transmission, and multinode meets in urban environment, is normality, considers that the data exchange between multinode can then be transmitted to data
Performance provides more promotions and optimization space.
To sum up, the video data transmission become increasingly popular between mobile subscriber makes the flow in conventional wireless communication network explode
Property growing concern become more serious, and it is considered as that can be realized load shedding that the modem based on D2D communication, which can transmit,
Effective ways.However, mainly passing through data duplication and chance forwarding realization in moving machine meeting data transmission in network.In order to obtain
Higher delivery ratio and lower delivery time delay are obtained, data duplication is often overused, and the data packet of redundancy can not only consume
Fall a large amount of equipment and Internet resources, while also will increase the traffic load of network, reduces network performance.Video data is passed
Defeated, due to its stronger duration and much higher than the data volume of general scalar data, which can more be protruded.
Summary of the invention
In order to solve deficiency in the prior art, the present invention provides a kind of video machine based on multi-user Cooperation game and can pass
Defeated routing algorithm realizes the optimization to video transmission quality and transport overhead, can not only video transmission quality be maximized,
The average maximum backup number that can reduce data packet simultaneously, so that the minimum transmission overhead of network.
To achieve the goals above, the concrete scheme that the present invention uses for：A kind of video based on multi-user Cooperation game
Two factors of chance transmission route algorithm, first video data synthesis itself and transmission network, establish the edge of video data packet
Gain of quality model；Secondly the multiple nodes to meet are regarded as the network of a connection, and data exchange process therebetween is built
Mould is the process of a multi-user Cooperation game；Optimal Nash solution finally based on geometric space expression is to each video data packet
Duplication or forwarding carry out decision.
A kind of video machine meeting transmission route algorithm based on multi-user Cooperation game as described above, the algorithm specifically include
Following steps：
Two factors of step 1, video data synthesis itself and transmission network, establish the edge quality gain mould of video data packet
Type specifically comprises the following steps：
Step 1.1, the frame structure for considering video data：Each video-frequency band is divided into multiple GoP, belongs to the GoP of same video-frequency band
Frame structure all having the same, when video data transmits in a network, each frame can be divided into multiple video data packets,
Multiple video data packets include I, B and P three types；
Step 1.2 is quantified by delivery quality of the frame delivery ratio to video：Different types of video data packet is calculated same
The average delivery probability at one moment；
Step 1.3 calculates edge quality gain by partial differential equation discretization；
Step 2, the network for the multiple nodes to meet being regarded as a connection, and data exchange process therebetween is modeled as one
The process of a multi-user Cooperation game；
Step 3, the near-optimization Nash solution that the game is calculated based on geometric space representation method, respectively meet in step 2 node
The duplication or forwarding for carrying out data respectively according to the optimal solution, specifically comprise the following steps：
Step 3.1, the optimal solution of multiple person cooperational game meet following formula：
Wherein, Fi *Indicate optimal income of the user i under equilibrium state；Fi 0Indicate the income of the user i under non-cooperating state；
Assorted product is received in expression；
Step 3.2, building utility function；
Step 3.3, the near-optimization Nash solution that the game is calculated based on geometric space representation method.
As a preferred embodiment, in step 1.1, the video data packet from different frame has different importance,
In, I frame is reference frame, can independently be rebuild after video data coating successful delivery；P frame is forward predicted frame, is rebuild
Dependent on the video data packet of successful reception and the successful recovery of its previous I or P frame；B frame is bi-directional predicted frames, rebuilds and relies on
In the successful recovery of former and later two video frames.
As a preferred embodiment, frame delivery ratio described in step 1.2 is the view delivered in a network for one
Ratio of the frequency range between the number of the video frame of destination node successful reconstitution and all video frame quantity of delivery.
As a preferred embodiment, in step 1.2, the tool of the video data packet of I type in the average delivery probability of t moment
Body calculating process is as follows：
(1) for a video-frequency band, NG indicates that GoP number, NT indicate total video frame number；MI, MP and MB are respectively indicated often
A I, P and B frame is averaged the video data packet number being divided into；RI, RP and RB respectively indicate the video of I, P and B three types
The successful delivery probability of data packet；NI, NP and NB respectively indicate the desired value for I, P and B frame successfully delivered；Then there is following formula：
FDR=(NI+NP+NB)/NT；
(2) when a video-frequency band is divided and is transmitted in a network, relative parameter NG, MI, MP and MB are
Known, therefore, frame delivery ratio is the function using RI, RP, RB as variable, i.e.,：
FDR=f (RI,RP,RB)；
(3) in video transmitting procedure, it is assumed that the video data packet number of different I type is KI in moment t network
And TTL having the same (Time-to-Live) value (t),；To the video data packet i of any I type, TI, i (t) indicate when
The life duration that the t data packet has consumed is carved, MI, i (TI, i (t)) indicate the node for once receiving the video data packet
Number, NI, i (TI, i (t)) indicate the node number for currently still carrying the video data packet, and RI, i (t) indicate the video data
Wrap remaining life duration；In addition, NS indicates all node numbers for participating in transmission of video；So, following relationships are set up：
(4) exponential distribution of λ is obeyed at the time of contact interval between node, therefore video data packet i cannot be delivered successfully
Probability is equal to the time that its any one backup data package and destination node is met next time and is both greater than RI, the probability of i (t), i.e.,
exp(-λRI,i(t))；Therefore, indicate that the video data packet i of I type can be by successful delivery in its life span with PI, i
Probability, then have：
(5) to sum up, the data packet of I type is in the average delivery probability of moment t：
As a preferred embodiment, specific calculating of the video data packet of P and B type in the average delivery probability of t moment
Process is identical as the video data packet of I type.
As a preferred embodiment, in step 1.3, the specific of edge quality gain is calculated by partial differential equation discretization
Process is as follows：
S1, to the video data packet i of any I type, calculated in the edge quality gain of t moment as follows：
Edge quality gain MQGP, i and the MQGB of the video data packet i of video data packet i and the B type of S2, P type, i difference
It calculates as follows：
Wherein, RI, RP and RB respectively indicate the successful delivery probability of the video data packet of I, P and B three types；NI, NP and NB
Respectively indicate the desired value for I, P and B frame successfully delivered.
As a preferred embodiment, in step 3.2, the utility function of building is as follows：
Wherein, N indicates the node number met, and M indicates the different video data packet number that the node carries, and V indicates same
When the video-frequency band number transmitted, due to any video-frequency band v, there is a respective destination node, thus pn, v indicate node n and
Contact probability between the destination node of video-frequency band v, MQGn, v, video counts that m expression is carried by node n, belonging to video-frequency band v
According to the edge quality gain of packet m.
As a preferred embodiment, in step 3.3, the near-optimization of the game is calculated based on geometric space representation method
Detailed process is as follows for Nash solution：
T1, for video data transmission, indicate value of utility of the video data packet m relative to node n with pn, vMQGn, v, m, calculate
Effectiveness distance dn between them, it is specific as follows：
T2, video data transmission, the effectiveness distance product by normalized video data packet m relative to game user n are directed to
φ n, m specifically calculate as follows：
T3, to a given video data packet, correspond to all game users effectiveness distance product all having the same,
Equilibrium condition is expressed as follows：
Wherein, un is used to determine the threshold condition that video data packet distribution terminates；
T4, K video data packet distributes to n before choosing in the list Ln corresponding to mobile node n, so that this K video counts
Critical value un is reached to the effectiveness sum of the distance of node n according to packet, i.e. K meets following conditions：
Beneficial effect：(1) the present invention provides a kind of, and the video machine based on multi-user Cooperation game understands transmission route algorithm,
The algorithm guarantees that the video data packet backup number in the case where video transmission quality is optimal, in network is minimum, based on synthesis
Data set and the simulation result of real data set show that video transmission quality of the present invention is higher by 1~2dB than analogous algorithms, still
Average maximum data packet backup number is only 25% of analogous algorithms or so；
(2) the present invention provides a kind of, and the video machine based on multi-user Cooperation game understands transmission route algorithm, can not only make
Video transmission quality maximizes, while can reduce the average maximum backup number of data packet, so that the transport overhead of network
It minimizes；
(3) the present invention provides a kind of, and the video machine based on multi-user Cooperation game understands transmission route algorithm, fully considers video
The feature of data itself and opportunistic network itself establishes video data reconstruction quality model；Based on video data reconstruction quality mould
Type, defines a completely new Measure Indexes, i.e. edge quality gain quantifies the importance of each video data packet；
It is based on above-mentioned model and Measure Indexes later, to optimize video transmission quality, minimum transmission of video expense is target, is proposed
One opportunistic routing protocol towards transmission of video.
Detailed description of the invention
Fig. 1 is the system model figure of video data unloading of the present invention；
Fig. 2 is the frame structure schematic diagram of GoP of the present invention.
Specific embodiment
The present invention will be described in detail below with reference to specific embodiments, the present embodiment based on the technical solution of the present invention,
The detailed implementation method and specific operation process are given.
System model：Referring to Fig. 1, the vehicle of all mobile subscribers and configuration mobile intelligent terminal is all in urban area
It can be counted as mobile node；And from the perspective of network, these nodes are constituted in a manner of conscious or is unconscious
One mobile opportunistic network.Video data passes through the chance contact between node, is carried out data transmission in the way of D2D.Therefore,
Video data unloading is exactly the process that video data is transmitted by mobile opportunistic network in fact.As shown in Figure 1, Fig. 1 is provided
The system model of video data unloading, which mainly includes two parts, i.e. platform side and user side.In platform side,
Management platform can be regarded as being deployed in a server in traditional network, be mainly responsible for participating user recruitment and management,
Video data request and response management, video data packet diffusion information collection etc., can pass through mobile cellular net with mobile subscriber
Or Wi-Fi network is communicated and is interacted；In user side, all users are carrying out uncontrolled autonomous, therebetween may be used
Data exchange is directly carried out in a manner of through D2D, while each user can also be carried out by 3G/4G, Wi-Fi interface and platform
Information exchange.Task is unloaded when user participates in or exit video, must notify management platform, in time so that the latter slaps in real time
Hold the definite information of participating user；Meanwhile when carrying data change, each user is also situation of change with data packet
Form be reported to management platform.Since the information of user and data packet can be used to count value of utility and user's income
It calculates, so that secondary video data is delivered, these data are known as controlling information by the present invention.In the process of video data transmission
In, only control information can be transmitted by conventional wireless network.In Fig. 1,1. -5. give video data unloading
Process：If a user wants to obtain a video-frequency band, request message (1. 2.) can be sent to management platform first；Platform is received
The user's (3. 4.) for being stored with the video can be sent it to after to request message；Finally, the latter handle can be asked by way of D2D
The video data asked is sent to requestor.
Problem modeling：Video data unloading essence be exactly pass through mobile opportunistic network to carry out data transmission so that
Mobile data flow bypasses traditional wireless cellular network, therefore the root problem to be solved is that design can satisfy following requirements
Efficient video chance routing algorithm：1) video reconstruction quality is maximized；2) make transmission of video cost minimization；3) it fits
The scene met for multi-user.In order to model to the problem, the present invention is provided as given a definition：Edge quality gain, i.e.,
The video data packet delivered in a network for one can rebuild video if it is properly received by destination node
Quality generates certain contribution.The present invention is referred to as the contribution expectation edge quality gain of the video data packet, uses MQG
(Marginal Quality Gain) is indicated.
Assuming that N number of node meets in moment t, these nodes carry M different video data packets altogether, and these video counts
X different video-frequency bands are belonging respectively to according to packet.It is right if indicated with binary number δ to whether node carries data packet
Arbitrary node n (n ∈ { 1,2 ..., N }) can indicate the video counts of its carrying with vector β n=(δ n, 1, δ n, 2 ..., δ n, M)
According to packet, vector β=(β 1, β 2 ..., β N) indicates distribution situation of the M video data packet on this N number of node.Mesh of the invention
Mark is to maximize the reconstruction quality of video data while reducing transmission of video cost as much as possible, and therefore, to solve the problems, such as can
Video data is reduced as much as possible to the contribution of video reconstruction quality to be described as maximizing each node when node meets
The number of packet replication.Problem modeling is as follows：
Wherein, MQG ' n, m and MQGn, m respectively indicate the quality edge for the video data packet m that data transmission front and back node n is carried
Gain；δ ' n, m and δ n, whether node n carries data packet m before and after m respectively indicates data exchange；β * indicates optimal vector β,
Belong to vector space (1 × β of β 2 × ... × β N).In this way, according to optimal distribution vector β *, the node to meet does not just know that data
Packet should be forwarded or be replicated, while also know the object that data packet is forwarded or replicates.
The present invention provides a kind of, and the video machine based on multi-user Cooperation game understands transmission route algorithm, specific as follows：
One, two factors of video data synthesis itself and transmission network, model the edge quality gain of video data packet.
When video is transmitted in a network, it is first separated into many video data packets；When enough video datas
It is coated with destination node to receive, then the video data can be carried out rebuilding.During video data transmission, participates in node and all can
The data packet that it is carried is replicated and is perhaps forwarded but goes one video data packet of the forwarding of quantization node or duplication to view
The contribution of frequency reconstruction quality is very difficult.Reason mostlys come from video data itself and transmission network.The present invention is comprehensive
Two factors of video data itself and transmission network, model the edge quality gain of video data packet, specifically include as
Lower step：The frame structure of step 1.1, video data：Each video-frequency band is divided into multiple GoP (Group of Pictures), is belonged to
In the GoP of same video-frequency band frame structure all having the same, Fig. 2 gives the frame structure schematic diagram of a GoP, by fixed quantity
I frame, P frame and B frame form in a fixed order.The number of frame can be arbitrary integer in principle, for the convenience of description, this
For 9, each frame is successively respectively denoted as I1, B1, B2, P1, B3, B4, P2, B5, B6 for invention.When video data is in network
When middle transmission, each frame can be divided into multiple video data packets, and multiple video data packets include I, B and P three types.By
There are very strong correlations for interframe in the application of compress technique, same GoP, make different frames to the weight of video data
It builds with different importance, so that the video bag from different frame also correspondingly has different importance.It is specific next
It says, I frame is reference frame, when its data packet can independently be rebuild after successful delivery；P frame is forward predicted frame, is rebuild not
It only needs to be properly received its data packet, while also relying on the successful recovery of its previous I or P frame；B frame is bi-directional predicted frames,
Rebuild the successful recovery that depend on former and later two video frames.As shown in Fig. 2, P2 rebuild depend on P1, and the reconstruction of B2 then according to
Rely in I1 and P1.
Step 1.2 is quantified by delivery quality of the frame delivery ratio to video：Calculate different types of video data packet
In the average delivery probability of synchronization；
(1) node can all generate certain gain to the forwarding of video data packet and duplication every time to video reconstruction quality.In order to
The gain is quantified it may first have to select suitable Measure Indexes.PSRN is often used to quantify video quality, but
It can not be suitable for mobile opportunistic network, and reason is to surely belong to the frame when video data packet of some frame not yet receives completely
It can not just rebuild, so that its PSNR can not be calculated.Therefore, right the invention proposes a new module, i.e. frame delivery ratio
The delivery quality of video is quantified；Frame delivery ratio：The video-frequency band delivered in a network for one, frame deliver calibration
Justice is the ratio between the number of video frame and all video frame quantity of delivery of destination node successful reconstitution, uses variable
FDR (Frame Delivery Rate) is indicated；
Assuming that NG indicates that its GoP number, NT indicate its total video frame number for a video-frequency band；MI, MP, MB distinguish table
Show that each I, P, B frame can be averaged the video data packet number being divided into；RI, RP, RB respectively indicate I, P, B three types
The successful delivery probability of video data packet；NI, NP, NB respectively indicate the desired value for I, P, B frame successfully delivered.Then, it can obtain
To following formulas：
FDR=(NI+NP+NB)/NT；
(2) when a video-frequency band is divided and is transmitted in a network, relative parameter NG, MI, MP and MB are
Known, therefore, frame delivery ratio is the function using RI, RP, RB as variable, i.e.,：
FDR=f (RI,RP,RB)；
(3) in video transmitting procedure, it is assumed that the video data packet number of different I type is KI in moment t network
And TTL having the same (Time-to-Live) value (t),；To the video data packet i of any I type, TI, i (t) indicate when
The life duration that the t data packet has consumed is carved, MI, i (TI, i (t)) indicate the node for once receiving the video data packet
Number, NI, i (TI, i (t)) indicate the node number for currently still carrying the video data packet, and RI, i (t) indicate the video data
Wrap remaining life duration；In addition, NS indicates all node numbers for participating in transmission of video；So, following relationships are set up：
(4) since the exponential distribution of λ is obeyed at the time of contact interval between node, video data packet i cannot be delivered into
The probability of function is equal to its any one backup data package and is both greater than RI with the time that destination node is met next time, and i's (t) is general
Rate, i.e. exp (- λ RI, i (t))；Therefore, indicate that the video data packet i of I type can be by success in its life span with PI, i
The probability of delivery, then have：
(5) to sum up, the data packet of I type is in the average delivery probability of moment t：
Similarly, specific calculating process and I type of the video data packet of P and B type in the average delivery probability of t moment
Video data packet is identical.
Step 1.3 calculates edge quality gain by partial differential equation discretization；In video transmitting procedure, arbitrarily not
The video data packet being successfully received has a desired gain to video reconstruction quality.According to formula F DR=f (RI,RP,
RB) and formulaIt is found that the frame delivery ratio of video is actually the function of its video data packet backup number.To appoint
Meaning video data packet, backup number increase or reduce, and changes will occur for the functional value.The present invention is a certain video data packet
The size that frame delivery ratio changes caused by the unit change of backup number is referred to as the video data packet and rebuilds matter relative to video
The edge gain of amount.Edge gain calculate by partial differential equation discretization as follows：
S1, to the video data packet i of any I type, calculated in the edge quality gain of t moment as follows：
Edge quality gain MQGP, i and the MQGB of the video data packet i of video data packet i and the B type of S2, P type, i difference
It calculates as follows：
Wherein, RI, RP and RB respectively indicate the successful delivery probability of the video data packet of I, P and B three types；NI, NP and NB
Respectively indicate the desired value for I, P and B frame successfully delivered.
Two, the multiple nodes to meet are regarded as the network of a connection, and data exchange process therebetween is modeled as
The process of one multi-user Cooperation game；
Three, the near-optimization Nash solution that the game is calculated based on geometric space representation method, the equal foundation of node of respectively meeting
The optimal solution carries out the duplication or forwarding of data respectively, and the original intention of Design of Routing Algorithm of the present invention is to maximize video data
Transmission quality, while the cost of video data transmission is reduced as much as possible.In order to reach the purpose, the present invention is between multi-user
Transmission of video is modeled as a multi-user Cooperation game, provides optimal solution using Nash Pareto optimum theory.
Multiple person cooperational game is a non-zero game model, and each object for participating in game is all rationality and selfishness,
And the it is desirable that purpose for passing through competition and realization win-win of compromising.All users for participating in games set Q={ 1,2 ..., n } progress
It indicates；The all possible strategy taken of user i constitutes a policy space, is indicated with si, then S=s1 × s2 × ...
× sn indicates united set of strategies.In gambling process, any user i has a utility function Fi, and value of utility can be with
Strategy difference and change.For a multiple person cooperational game, if except when it is not present except preceding federation policies collection
His federation policies enable to each user while obtaining higher value of utility, are at this moment considered as the game and have reached
Weighing apparatus.
Step 3.1, the optimal solution of multiple person cooperational game can satisfy following four characteristics：Invariance, symmetry, independence
With Pareto optimality etc., the optimal solution of multiple person cooperational game meets following formula：
Wherein, Fi* indicates optimal income of the user i under equilibrium state；Fi0 indicates the income of the user i under non-cooperating state；Assorted product is received in expression.
Step 3.2, building utility function；When multiple mobile nodes are when the moment, t met, a full-mesh is just constituted
Subnet, the node to meet can use such touch opportunity and carries out video data transmission.The present invention indicates the section to meet with N
Point number, M indicate the different video data packet number that they are carried, and V indicates the video-frequency band number of simultaneous transmission.Because
To any video-frequency band v, there is a respective destination node, present invention pn, v indicate node n and video-frequency band v destination node it
Between contact probability, with MQGn, v, m indicate that the edge quality of video data packet m being carried by node n, belonging to video-frequency band v increases
Benefit.Then the sum of the edge quality gain of all video data packets that mobile node n can carry the contribution for delivering quality with it
To be quantified.Therefore, the utility function design of node n is as follows：
When node meets, each node, which is intended to increase as much as possible by current data exchange, respectively rebuilds matter to video
The contribution of amount, that is, max (Fn-Fn'), wherein Fn' indicate the value of utility before node n contact.Therefore, each node will not
Video data packet is carried out free directly forwarding；Equally, the duplication of video data packet can be such that its backup number will increase, and then reduce
Edge quality gain of the data packet to video reconstruction quality, thus mobile node be also reluctant the video data packet that it is carried into
The free duplication of row.Accordingly, it can be said that each node is that interests are runed counter to from the point of view of its own.And on the other hand, all participations
The node of transmission of video is intended to that transmission of video task can be completed, therefore it all has strong cooperation wish.Based on this, originally
Video data transmission when multinode is met in invention therebetween is modeled as a multi-node collaboration game.According to edge quality gain
Concept it is found that make to receive the maximum solution of assorted product be Nash Equilibrium Solution, enable to the multiple nodes to meet all to obtain
Maximum value.Therefore, following formula is obtained：
Wherein, FnAnd Fn' respectively indicate the edge quality gain that data exchange front and back node n carries data packet；In this way, if energy
Enough find β*, then the node that each meets can be according to β to the forwarding and duplication of video data packet*It carries out, to realize calculation
The purpose of method design.The solution of multiple person cooperational game can approach optimal solution by unlimited number of bargaining, but calculate
Complexity can exponentially increase with the increase of data packet number M.In order to solve this problem, the present invention proposes empty with geometry
Between indicate algorithm look for optimal solution.
Step 3.3, the near-optimization Nash solution that the game is calculated based on geometric space representation method.Based on geometric space
Representation method calculates the near-optimization Nash solution of the game, and detailed process is as follows：
T1, for video data transmission, indicate value of utility of the video data packet m relative to node n with pn, vMQGn, v, m, calculate
Effectiveness distance dn between them, it is specific as follows：
T2, video data transmission, the effectiveness distance product by normalized video data packet m relative to game user n are directed to
φ n, m specifically calculate as follows：
T3, to a given video data packet, correspond to all game users effectiveness distance product all having the same,
Equilibrium condition is expressed as follows：
Wherein, un is used to determine the threshold condition that video data packet distribution terminates；
T4, K video data packet distributes to n before choosing in the list Ln corresponding to mobile node n, so that this K video counts
Critical value un is reached to the effectiveness sum of the distance of node n according to packet, i.e. K meets following conditions：
Mobile data unloading is a research topic being concerned in recent years, and the modem based on D2D communication can pass
Defeated is considered as the ideal method for solving the problems, such as this.The invention proposes a kind of video machine meetings based on multi-user Cooperation game
Transmission route algorithm, for solving the problems, such as the video data high efficiency of transmission in mobile opportunistic network.The algorithm is between multi-user
Data transmission is modeled as multi-user Cooperation game, and the duplication and forwarding of video data packet are instructed using Nash optimization solution, thus
Realize the purpose for maximizing video transmission quality and minimizing transmission of video expense.The performance of algorithm is in artificial synthesized data set
Be all verified in real data set.
The above described is only a preferred embodiment of the present invention, be not intended to limit the present invention in any form, though
So the present invention is as above with preferred embodiment description, and however, it is not intended to limit the invention, any technology people for being familiar with this profession
Member, without departing from the scope of the present invention, when a little change or modification made using technology contents described above
It is the equivalent embodiment of equivalent variations, but without departing from the technical solutions of the present invention, according to the technical essence of the invention
Any simple modification, equivalent change and modification to the above embodiments, all of which are still within the scope of the technical scheme of the invention.
Claims (9)
1. a kind of video machine meeting transmission route algorithm based on multi-user Cooperation game, it is characterised in that：Comprehensive video number first
According to itself and two factors of transmission network, the edge quality gain model of video data packet is established；Secondly the multiple sections to meet
Point regards the network of a connection as, and data exchange process therebetween is modeled as the process of a multi-user Cooperation game；Most
The optimal Nash solution indicated afterwards based on geometric space carries out decision to the duplication or forwarding of each video data packet.
2. a kind of video machine meeting transmission route algorithm based on multi-user Cooperation game as described in claim 1, feature exist
In：The algorithm specifically comprises the following steps：
Two factors of step 1, video data synthesis itself and transmission network, establish the edge quality gain mould of video data packet
Type specifically comprises the following steps：
Step 1.1, the frame structure for considering video data：Each video-frequency band is divided into multiple GoP, belongs to the GoP of same video-frequency band
Frame structure all having the same, when video data transmits in a network, each frame can be divided into multiple video data packets,
Multiple video data packets include I, B and P three types；
Step 1.2 is quantified by delivery quality of the frame delivery ratio to video：Different types of video data packet is calculated same
The average delivery probability at one moment；
Step 1.3 calculates edge quality gain by partial differential equation discretization；
Step 2, the network for the multiple nodes to meet being regarded as a connection, and data exchange process therebetween is modeled as one
The process of a multi-user Cooperation game；
Step 3, the near-optimization Nash solution that the game is calculated based on geometric space representation method, respectively meet in step 2 node
The duplication or forwarding for carrying out data respectively according to the optimal solution, specifically comprise the following steps：
Step 3.1, the optimal solution of multiple person cooperational game meet following formula：
Wherein, Fi *Indicate optimal income of the user i under equilibrium state；Fi 0Indicate the income of the user i under non-cooperating state；Assorted product is received in expression；
Step 3.2, building utility function；
Step 3.3, the near-optimization Nash solution that the game is calculated based on geometric space representation method.
3. a kind of video machine meeting transmission route algorithm based on multi-user Cooperation game as claimed in claim 2, feature exist
In：In step 1.1, the video data packet from different frame has different importance, wherein I frame is reference frame, works as video counts
It can independently be rebuild later according to coating successful delivery；P frame is forward predicted frame, is rebuild dependent on the video data being properly received
The successful recovery of packet and its previous I or P frame；B frame is bi-directional predicted frames, is rebuild extensive dependent on the success of former and later two video frames
It is multiple.
4. a kind of video machine meeting transmission route algorithm based on multi-user Cooperation game as claimed in claim 2, feature exist
In：Frame delivery ratio described in step 1.2 is the video-frequency band delivered in a network for one in destination node successful reconstitution
The number of video frame and all video frame quantity of delivery between ratio.
5. a kind of video machine meeting transmission route algorithm based on multi-user Cooperation game as claimed in claim 2, feature exist
In：In step 1.2, the video data packet of I type is as follows in the specific calculating process of the average delivery probability of t moment：
(1) for a video-frequency band, NGIndicate GoP number, NTIndicate total video frame number；MI、MPAnd MBIt respectively indicates each
I, P and B frame is averaged the video data packet number being divided into；RI、RPAnd RBRespectively indicate the video data of I, P and B three types
The successful delivery probability of packet；NI、NPAnd NBRespectively indicate the desired value for I, P and B frame successfully delivered；Then there is following formula：
FDR=(NI+NP+NB)/NT；
(2) when a video-frequency band is divided and is transmitted in a network, relative parameter NG、MI、MPAnd MBIt is all
Know, therefore, frame delivery ratio is with RI、RP、RBFor the function of variable, i.e.,：
FDR=f (RI,RP,RB)；
(3) in video transmitting procedure, it is assumed that the video data packet number of different I type is K in moment t networkI(t),
And TTL (Time-to-Live) value having the same；To the video data packet i, T of any I typeI,i(t) indicating should in moment t
The life duration that data packet has consumed, MI,i(TI,i(t)) node number for once receiving the video data packet, N are indicatedI,i
(TI,i(t)) node number for currently still carrying the video data packet, R are indicatedI,i(t) the remaining life of the video data packet is indicated
Order duration；In addition, NSIndicate all node numbers for participating in transmission of video；So, following relationships are set up：
(4) exponential distribution of λ is obeyed at the time of contact interval between node, therefore video data packet i cannot be delivered successfully
Probability is equal to its any one backup data package and is both greater than R with the time that destination node is met next timeI,i(t) probability, i.e.,
exp(-λRI,i(t))；Therefore, P is usedI,iIndicate that the video data packet i of I type can be by successful delivery in its life span
Probability then has：
(5) to sum up, the data packet of I type is in the average delivery probability of moment t：
6. a kind of video machine meeting transmission route algorithm based on multi-user Cooperation game as claimed in claim 5, feature exist
In：The video data packet of P and B type is in the specific calculating process of the average delivery probability of t moment and the video data packet of I type
It is identical.
7. a kind of video machine meeting transmission route algorithm based on multi-user Cooperation game as claimed in claim 2, feature exist
In：In step 1.3, calculating edge quality gain by partial differential equation discretization, detailed process is as follows：
S1, to the video data packet i of any I type, calculated in the edge quality gain of t moment as follows：
The edge quality gain MQG of the video data packet i of video data packet i and the B type of S2, P typeP,iAnd MQGB,iIt counts respectively
It calculates as follows：
Wherein, RI、RPAnd RBRespectively indicate the successful delivery probability of the video data packet of I, P and B three types；NI、NPAnd NBPoint
Not Biao Shi successful delivery I, P and B frame desired value.
8. a kind of video machine meeting transmission route algorithm based on multi-user Cooperation game as claimed in claim 2, feature exist
In：
In step 3.2, the utility function of building is as follows：
Wherein, N indicates the node number met, and M indicates the different video data packet number that the node carries, and V indicates same
When the video-frequency band number transmitted, due to having respective destination node, therefore p to any video-frequency band vn,vIndicate node n and
Contact probability between the destination node of video-frequency band v, MQGn,v,mVideo data that expression is carried by node n, belonging to video-frequency band v
Wrap the edge quality gain of m.
9. a kind of video machine meeting transmission route algorithm based on multi-user Cooperation game as claimed in claim 2, feature exist
In：In step 3.3, calculating the near-optimization Nash solution of the game based on geometric space representation method, detailed process is as follows：
T1, for video data transmission, use pn,vMQGn,v,mIt indicates value of utility of the video data packet m relative to node n, calculates it
Between effectiveness distance dn, it is specific as follows：
T2, video data transmission, the effectiveness distance product by normalized video data packet m relative to game user n are directed to
φn,mSpecific calculating is as follows：
T3, to a given video data packet, correspond to all game users effectiveness distance product all having the same,
Equilibrium condition is expressed as follows：
Wherein, unFor determining the threshold condition of video data packet distribution termination；
T4, from correspond to mobile node n list LnK video data packet distributes to n before middle selection, so that this K video data
Packet reaches critical value u to the effectiveness sum of the distance of node nn, i.e. K meets following conditions：
Priority Applications (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN201810777098.XA CN108847992A (en) | 2018-07-16 | 2018-07-16 | A kind of video machine meeting transmission route algorithm based on multi-user Cooperation game |
Applications Claiming Priority (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN201810777098.XA CN108847992A (en) | 2018-07-16 | 2018-07-16 | A kind of video machine meeting transmission route algorithm based on multi-user Cooperation game |
Publications (1)
| Publication Number | Publication Date |
|---|---|
| CN108847992A true CN108847992A (en) | 2018-11-20 |
Family
ID=64197606
Family Applications (1)
| Application Number | Title | Priority Date | Filing Date |
|---|---|---|---|
| CN201810777098.XA Pending CN108847992A (en) | 2018-07-16 | 2018-07-16 | A kind of video machine meeting transmission route algorithm based on multi-user Cooperation game |
Country Status (1)
| Country | Link |
|---|---|
| CN (1) | CN108847992A (en) |
Cited By (2)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN109819422A (en) * | 2019-04-11 | 2019-05-28 | 南京大学 | A kind of isomery car networking multi-mode communication method based on Stackelberg game |
| CN115866189A (en) * | 2023-03-01 | 2023-03-28 | 吉视传媒股份有限公司 | Video data secure transmission method for cloud conference |
Citations (2)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN103997693A (en) * | 2014-06-11 | 2014-08-20 | 北京邮电大学 | Motivational method for optimizing video delivery quality in opportunity network |
| US20170142650A1 (en) * | 2015-03-09 | 2017-05-18 | Hewlett Packard Enterprise Development Lp | Predicting access point availability |
-
2018
- 2018-07-16 CN CN201810777098.XA patent/CN108847992A/en active Pending
Patent Citations (2)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN103997693A (en) * | 2014-06-11 | 2014-08-20 | 北京邮电大学 | Motivational method for optimizing video delivery quality in opportunity network |
| US20170142650A1 (en) * | 2015-03-09 | 2017-05-18 | Hewlett Packard Enterprise Development Lp | Predicting access point availability |
Non-Patent Citations (1)
| Title |
|---|
| HONGHAI WU等: "Quality of Video Oriented and Multi-Meeting Based Routing Algorithm for Video Data Offloading", 《HTTPS://IEEEXPLORE.IEEE.ORG/DOCUMENT/8403224》 * |
Cited By (3)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN109819422A (en) * | 2019-04-11 | 2019-05-28 | 南京大学 | A kind of isomery car networking multi-mode communication method based on Stackelberg game |
| CN115866189A (en) * | 2023-03-01 | 2023-03-28 | 吉视传媒股份有限公司 | Video data secure transmission method for cloud conference |
| CN115866189B (en) * | 2023-03-01 | 2023-05-16 | 吉视传媒股份有限公司 | Video data safety transmission method for cloud conference |
Similar Documents
| Publication | Publication Date | Title |
|---|---|---|
| CN105357068B (en) | The OpenFlow method for controlling network flow that a kind of application-oriented QoS is ensured | |
| CN106160800A (en) | Data transmission method and device | |
| CN101854697B (en) | Multi-constraint quality-of-service control routing method and system for wireless mesh network | |
| CN108512760A (en) | The method for routing of QoS of survice is ensured based on SDN | |
| CN105897575A (en) | Path computing method based on multi-constrained path computing strategy under SDN | |
| CN100574219C (en) | Introducing the peer-to-peer network super node of node importance selects and resource search method | |
| CN103532909A (en) | Multi-stream service concurrent transmission method, sub-system, system and multi-interface terminal | |
| CN103731373B (en) | The method of adjustment of bandwidth resources, apparatus and system | |
| CN108174412A (en) | A kind of RPL multi-path data transmission mechanisms of load balancing | |
| CN105704776B (en) | A kind of node messages retransmission method for taking into account network node energy and caching | |
| CN101965031B (en) | Maximum probability-based cognitive radio multi-path multicast routing method | |
| CN107249205B (en) | A kind of resource allocation methods, device and user terminal | |
| WO2013104147A1 (en) | Mobility management method, system and equipment for group terminals | |
| CN102186211B (en) | Load distribution method for end-to-end multilink parallel transmission | |
| CN104378790A (en) | Roam control strategy applied to cluster APs | |
| CN103888976A (en) | Link selection method combined with network scheduling and routing | |
| CN103067977A (en) | Data concurrence transmission method based on cross-layer optimization in wireless heterogeneous network system | |
| CN108847992A (en) | A kind of video machine meeting transmission route algorithm based on multi-user Cooperation game | |
| CN104219170B (en) | The bag dispatching method retransmitted in wireless network based on probability | |
| CN101247327B (en) | Method for implementing dynamic resource obligation of wireless self-organizing network by elephant flow detection | |
| CN207304583U (en) | A kind of edge network architecture of Internet of things based on software defined network | |
| CN114286382A (en) | Capacity-breaking reconfigurable routing strategy based on prior knowledge base | |
| CN108696880A (en) | A kind of orientation spanning tree cross-layer communication method based on power control | |
| Ren et al. | Joint social, energy and transfer rate to select cluster heads in D2D multicast communication | |
| CN107205286B (en) | A kind of RCC, RRS and distributed base station system |
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 |
Application publication date: 20181120 |
|
| RJ01 | Rejection of invention patent application after publication |