CN105072027B - Vehicle sets the method for downloading video in communicating with road - Google Patents
Vehicle sets the method for downloading video in communicating with road Download PDFInfo
- Publication number
- CN105072027B CN105072027B CN201510495930.3A CN201510495930A CN105072027B CN 105072027 B CN105072027 B CN 105072027B CN 201510495930 A CN201510495930 A CN 201510495930A CN 105072027 B CN105072027 B CN 105072027B
- Authority
- CN
- China
- Prior art keywords
- msub
- mrow
- request
- video
- road
- 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.)
- Active
Links
Landscapes
- Mobile Radio Communication Systems (AREA)
- Two-Way Televisions, Distribution Of Moving Picture Or The Like (AREA)
Abstract
The method for downloading video in communicating is set with road the invention discloses a kind of vehicle, mainly solving the problems, such as that the existing video within the link connection time is downloaded imperfect causes to play and waste of resource.Implementation step is：(1) there is the node of video requirement that solicited message is sent to road to set；(2) road, which is set, judges whether video request can be serviced；(3) road sets the request that can be serviced according to the importance pair of request video and is ranked up；(4) priority based on importance ranking computation requests；(5) resource allocation is carried out to request based on priority orders；(6) road is set based on resource allocation result foradownloaded video to requesting node.The present invention can provide preferential resource downloading for the required important video of multiple users, at utmost to meet that user requires, and improve the play quality of video, the communication between being set available for vehicle and road.
Description
Technical field：
The invention belongs to field of communication technology, relates generally to the method for downloading video in vehicle self-organizing network VANET, can
Communication between being set for vehicle and road.
Background technology：
Vehicle self-organizing network is a kind of service-oriented user oriented self-organizing network, it is by vehicle and vehicle
The wireless communication that between V2V and vehicle and road is set between i.e. V2I provides a variety of services to the user, these services will be divided into security
Service and non-safety service.Security Service includes auxiliary and drives and set caution system；Non-safety service includes facility
Sex service and amusement sex service.In security application, traffic thing can conveniently be understood by the transmission of video and picture
Therefore detailed circumstance in order to the processing of follow-up work；Non-safety application mainly based on recreational application, inherently needs
Substantial amounts of Voice ＆ Video is transmitted to meet the requirement of user.It can be seen from the above that transmission of video has in vehicle self-organizing network
Irreplaceable effect.However, when downloading required video during vehicle sets with road and to communicate, an existing problem is to download
Video it is imperfect, be mainly shown as vehicle and road set between in the presence of communication link, which can not be complete by the video of request
It is whole to download so that it cannot play and waste bandwidth resources.Another existing problem is not examined when being vehicle foradownloaded video
Consider video importance, be mainly reflected in, when the same video of multiple vehicles request, to illustrate video requirement amount height, if preferential full
The foot download of the video, then by the communication between vehicle and vehicle can meet the needs of several users at the same time, it is this
Mode can improve user demand to a certain degree.In addition, when multiple vehicles set initiation request to road at the same time, road
If also it is worthy of consideration to the scheduling problem of the service order of vehicle.Therefore, a rational vehicle sets the video in communicating with road
Download mechanism is very important for improving user experience.
In existing video download mechanism, most of deadlines for allowing for solicited message are big with request video
It is small to calculate a priority, carry out service requesting node according to the order of priority, do not take into account integrity of video and importance
Problem.Typical mechanism has vehicle environmental perception descending scheduling mechanism VECADS and vehicle to set access dispatching mechanism D*S to road.
VECADS mechanism is calculated a suitable dispatching sequence, reaches by considering real-time information of vehicles, i.e. position, speed etc.
A balance between network throughput and service fairness.The tracking of this process including vehicle real time data, transfer rate from
Adapt to, the selection and scheduling of vehicle.The process is considered not accounting for the request letter of vehicle when the information of actual vehicle
The deadline of breath, when the deadline of solicited message reaches, road, which is set, automatically to abandon the request data package simultaneously
And terminate ongoing transmitting procedure；And the mechanism does not account for video importance problem.D*S mechanism is asked by considering
Deadline and the data volume size of information are asked to calculate priority DS_value.According to the principle of Priority Service flash request,
Road sets request first small to priority DS_value and services.But in the deadline of solicited message, vehicle may roll away from
The communication zone that road is set, link interruption and can not communicate at this time.Therefore the mechanism is using deadline when calculating priority
Unreasonable, video may be caused to download incomplete problem.
The content of the invention：
It is an object of the invention to the deficiency for above-mentioned prior art, it is proposed that vehicle is set with road under the video in communicating
Support method, to improve mounted mass under video, meets user demand.
Technical scheme to achieve the above object, includes the following steps：
(1) there is the node of video requirement that solicited message is sent to road to set；
(2) road, which is set, judges whether video request can be serviced：
2a) when road, which is set, receives solicited message, its ID number i is recorded, according to the position in its solicited message, speed and is added
Velocity information calculates residence time t of the node in oneself communication rangei, and record is carried out to the residence time and establishes request
Table；
2b) road sets the deadline d for recording the solicited messagei, with reference to residence time tiCalculate effective time Ti, and record
In required list；
2c) road sets the video information feature V of record requesti, search for and record video size Di；
2d) estimate effective time TiInterior Downloadable video maximum capacity Ai；
2e) by video maximum capacity AiWith video size DiContrasted：If Ai≥Di, then the request can be serviced；It is no
Then, which cannot be serviced, and road sets the discarding solicited message and deletes its relevant information in required list；
(3) priority P is calculatedi：
3a) the request number of times N in initialization requests tableiFor 1, the video information feature V in required listi, will have phase
With video information feature ViRequest number be added, and result is recorded in corresponding request number of times NiIn；
3b) by the request in required list according to request number of times NiDescending arranges；
3c) for video information feature ViIdentical request, road set contrast its effective time Ti, with it is most long effective when
Between TiRequest ID number copy column at, record the ID number of other requests of the video, and delete the video other requests correspond to
Relevant information；
3d) road sets the priority P that video is asked in computation requests table respectivelyi；
3e) for same request times NiRequest, according to priority PiSize, road set to request carry out descending
Arrangement；
(4) resource allocation：
4a) regard the request of preceding j sequence number in required list as an entirety, j is by 1 increase, and j request is on road before calculating
If the minimum residence time t in communication rangej'=min { t1,t2..., tjAnd preceding j node minimum deadline dj'=
min{d1,d2..., dj, then by minimum residence time tj' and minimum deadline dj' calculate the minimum of preceding j request effectively
Time Tj'；
4b) estimate minimum effective time Tj' interior energy download it is preceding j ask maximum data capacity Aj'；
The sum of video size is asked before 4c) calculating for jJ+1 request before being calculated using identical method
The sum of video size Dj+1'；
4d) to the maximum data capacity A of first j requestj', preceding j request the sum of video size Dj' and first j+1 request
The sum of video size Dj+1' contrasted：If Dj'≤Aj' ＜ Dj+1', then road set can at the same time the preceding j in service request table please
Ask, and the first j bandwidth ratio asked in downloading process is arranged to the D of preceding j requestjThan；If Dj' ＜ Dj+1'≤Aj', then
By j plus 1, repeat the above process, until finding full then Dj'≤Aj' ＜ Dj+1' j values；
(5) video download communication：
5a) according to the resource allocation mechanism of step (4), road is set downloads its requested video to requesting node, if please
Seeking information ID number copy column, then road sets completion and downloads its requested video, and terminates the request task for sky；If request letter
It is not sky to cease ID number copy column, then road, which is set, adds the ID number in copy column in video data packet packet header, and gives requesting node
Download its requested video；
After 5b) requesting node receives video data packet, video data packet packet header is first checked, check whether it has other ask
Seek the ID number of node：If it is not, node terminates the request task；If so, then receive the node of video data packet with
Oneself it is source node, using the node of other ID numbers in packet header as purpose node, using wireless between node and node
Communicate to complete the video download request, and terminate the request task.
Compared with prior art, the present invention have the following advantages that：
(1) present invention using content integrity condition due to judging whether video can be serviced, so what is serviced please
Ask video to be downloaded, ensure that the integrality that video is downloaded；
(2) present invention aids in video as a result of resource allocation mechanism, and by the communication between vehicle and vehicle
Download, so can meet user demand.
Brief description of the drawings
Fig. 1 is the scene graph that the present invention uses；
Fig. 2 be the present invention realize flow chart.
Embodiment
With reference to Fig. 1, the scene that the present invention uses is two kinds of vehicles being distributed on one section of road that length is S, wherein ID
Number it is the node for having video requirement for 1~13 node, remaining node is the node of no video requirement, and road is set in S/2
Put place, road sets the video that node request is downloaded in access internet, and R is range for wireless communication, and R=S/2.
It is as follows with reference to Fig. 2, detailed implementation steps of the invention：
Step 1：Solicited message is sent to road and set by the node for having video requirement.
1a) when road set service be over one ask when, broadcast the idle state information of oneself；
1b) when the node for having video requirement listens to the idle state information, transmission solicited message is set to road, the request
The ID number of information including requesting node, speed, acceleration, positional information, the information characteristics for asking video and solicited message are cut
The only time.
Step 2：Road, which is set, judges whether video request can be serviced.
2a) when road, which is set, receives ID number as the solicited message of i, the ID number in solicited message is recorded and is established please
Seek table；
2b) road design is calculated and records residence time t of requesting node of the ID number for i in the communication range of oneselfi：
Wherein, ai、viAnd Lc-iRespectively ID number is acceleration, speed and the positional information of the requesting node of i；Lb-iIt is logical
Believe the position on border；
2c) road sets deadline d of the record ID number as the solicited message of ii, with reference to residence time tiCalculate effective time Ti,
And be recorded in required list, its calculation formula is as follows：
Wherein, diIt is that ID number is solicited message deadline, tcIt is current time；
2d) road sets solicited message video information feature V of the record ID number as ii, search for and record video size Di；
2e) road sets the effective time T as the request of i using ID numberi, estimate request effective time TiInterior energy transmission
Maximum amount of data Ai：
Ai=Ti×r
Wherein, r is maximum data transfer rate；
2f) road sets the video maximum capacity A as the request of i by ID numberiVideo size D with ID number for the request of iiCarry out
Contrast：If Ai≥Di, then the ID number is that the request of i can be serviced；Otherwise, ID number be i request cannot be serviced, road set by
Abandon the solicited message that ID number is i and delete its relevant information in required list；
After completing this process, the request recorded in required list can all be serviced, as shown in Table 1.
The node request that table one can be serviced
Step 3：Road sets pair request that can be serviced and is ranked up according to the importance of request video.
3a) the request number of times N in initialization requests tableiFor 1；
It is 3b) overall to check video information feature V in required listi, will have same video information characteristics ViRequest number phase
Add, and result is recorded in corresponding request number of times NiIn；It can be seen that wherein ID number is 3,10,8 from required list table one
Node asks identical video Va, the node of ID number 7,5 asks identical video Vf, the node request of node ID number 9,11
Same video Vz, therefore ID number is that 3,8,10 corresponding request number of times are 3；ID number is that 7,5 corresponding request number of times are 2；ID number
It is 2 for 9,11 corresponding request number of times, the corresponding request number of times of other ID numbers is 1；
3c) road, which is set, arranges this 11 requests according to request number of times, as shown in Table 2；
Table two is asked by the node of request video importance sequence
3d) for video information feature V in table twoiIdentical request, road set contrast its effective time Ti, with most long
Effective time TiRequest ID number copy column at, record the ID number of other requests of the video, and delete the video it is other please
Seek corresponding relevant information；
According to above-mentioned narration, ID number 3,8 recorded in the copy that ID number is 10, ID number 7 be recorded into the pair that ID number is 5
In this, ID number 11 recorded in the copy that ID number is 9, and it is 3,8,7,11 corresponding solicited messages to delete ID number.
Step 4：Priority based on importance ranking computation requests.
4a) road set calculate respectively at this time ID number as the priority P of 10,5,9,12,2,4,6 requesti, its calculation formula is such as
Under：
Dm=Tm×r
Wherein, TiBe ID number be i request effective time, DiIt is the request video size that ID number is i, R is maximum communication
Distance, vmIt is average nodal travel speed, TmThe average time in communication distance, D are rested on for nodemIt is the maximum residence time
TmThe average data volume of time interior energy transmission, r is maximum data transfer rate, w1And w2For the different weight of two values because
Son and respectively value are 0.4 and 0.6；
4c) calculate after completing, for same request times NiRequest, according to priority PiSize, road is set pair
Request carries out descending, as shown in Table 3.
Node of the table three with priority is asked
Step 5：Resource allocation is carried out to request based on priority orders.
After 5a) road sets completion Request Priority calculating, according to the order in table three, the download that road sets to request provides
Source is distributed；First with formula tj'=min { t1,t2..., tjAnd dj'=min { d1,d2..., djCalculate previous request
Minimum residence time t1' and previous node minimum deadline d1'；
5b) according to Tj'=min { tj',dj'-tcCalculate the minimum effective time T of previous request1'=min { t1',
d1'-tc}；
5c) utilize Aj'=Tj' × r calculates the maximum data capacity A of previous request1'；
5d) utilizeCalculate the sum of previous request video size D1The sum of ' and the first two request video size
D2'；
5e) by the maximum data capacity A of previous request1', previous request the sum of video size D1' and the first two request
The sum of video size D2' this three contrasted：If D1' ＜ D2'≤A1', then add 1 to j, calculate the first two maximum number successively
According to capacity A2', the first two request the sum of video size D2' and first three ask the sum of video size D3'；
5f) the maximum data capacity A for asking the first two2', the first two request the sum of video size D2' and first three request
The sum of video size D3' this three contrasted：If D2'≤A2' ＜ D3', then road set can at the same time to ID number as 10 and 5 this two
A request is serviced, and the bandwidth ratio that the two in downloading process are asked is D10:D5。
Step 6：Foradownloaded video is set to requesting node based on resource allocation result road.
6a) by being drawn in step 5, road sets while services ID number as 10 and 5 request, first checks the pair that ID number is 10 and 5
This column, if find there are ID number 3 and 8 in the copy that ID number is 10, and the request copy intermediate hurdles that ID number is 5 then will there are ID number 7
ID number 3 and 8, be added to ID number be 10 request video data packet packet header, and by ID number 7 be added to ID number be 5 please
The video data packet packet header asked；
6b) road set download and transmit respectively from internet corresponding request video to ID number as 10 and 5 node；
6c) requesting node that ID number is 10 and 5 receives request video data packet, checks respectively for video data packet packet header letter
There is ID number 3 and 8 in breath, the video data packet packet header that the node that ID number is 10 finds to receive, then the node that ID number is 10 is with oneself
For source node, successively using ID number as 3 and 8 node node as a purpose, using greedy edge stateless route GPSR agreements or
Other are adapted to the agreement that communicates between vehicle and vehicle to complete；If ID number, which is 5 node, finds the video data received
There is ID number 7 in bag packet header, then the node that ID number is 5 is using oneself as source node, using the node node as a purpose that ID number is 7, use
Greedy edge stateless route GPSR agreements or other be adapted to the agreement that communicates between vehicle and vehicle to complete.
Claims (4)
1. vehicle sets the method for downloading video in communicating with road, include the following steps：
(1) there is the node of video requirement that solicited message is sent to road to set；
(2) road, which is set, judges whether video request can be serviced：
2a) when road, which is set, receives solicited message, its ID number i is recorded, according to the position in its solicited message, speed and acceleration
Information calculates residence time t of the node in oneself communication rangei, and record is carried out to the residence time and establishes required list；
2b) road sets the deadline d for recording the solicited messagei, with reference to residence time tiCalculate effective time Ti, and be recorded in and ask
Ask in table；
2c) road sets the video information feature V of record requesti, search for and record video size Di；
2d) estimate effective time TiInterior Downloadable video maximum capacity Ai：
2d1) the residence time t for the requesting node that ID number is i is calculated in road designi：
<mrow>
<msub>
<mi>t</mi>
<mi>i</mi>
</msub>
<mo>=</mo>
<mfrac>
<mrow>
<msqrt>
<mrow>
<msub>
<mi>v</mi>
<mi>i</mi>
</msub>
<mo>-</mo>
<mn>2</mn>
<msub>
<mi>a</mi>
<mi>i</mi>
</msub>
<mrow>
<mo>(</mo>
<msub>
<mi>L</mi>
<mrow>
<mi>b</mi>
<mo>-</mo>
<mi>i</mi>
</mrow>
</msub>
<mo>-</mo>
<msub>
<mi>L</mi>
<mrow>
<mi>c</mi>
<mo>-</mo>
<mi>i</mi>
</mrow>
</msub>
<mo>)</mo>
</mrow>
</mrow>
</msqrt>
<mo>-</mo>
<msub>
<mi>v</mi>
<mi>i</mi>
</msub>
</mrow>
<msub>
<mi>a</mi>
<mi>i</mi>
</msub>
</mfrac>
<mo>,</mo>
</mrow>
Wherein ai、viAnd Lc-iRespectively ID number be i requesting node acceleration, speed and positional information, Lb-iFor communication boundary
Position；
2d2) use residence time tiTo calculate the effective time T for the request that ID number is ii：
<mrow>
<mtable>
<mtr>
<mtd>
<mrow>
<msub>
<mi>T</mi>
<mi>i</mi>
</msub>
<mo>=</mo>
<mfenced open = "{" close = "">
<mtable>
<mtr>
<mtd>
<mrow>
<msub>
<mi>t</mi>
<mi>i</mi>
</msub>
<mo>,</mo>
</mrow>
</mtd>
<mtd>
<mrow>
<msub>
<mi>t</mi>
<mi>i</mi>
</msub>
<mo><</mo>
<msub>
<mi>d</mi>
<mi>i</mi>
</msub>
<mo>-</mo>
<msub>
<mi>t</mi>
<mi>c</mi>
</msub>
</mrow>
</mtd>
</mtr>
<mtr>
<mtd>
<mrow>
<msub>
<mi>d</mi>
<mi>i</mi>
</msub>
<mo>-</mo>
<msub>
<mi>t</mi>
<mi>c</mi>
</msub>
<mo>,</mo>
</mrow>
</mtd>
<mtd>
<mrow>
<msub>
<mi>t</mi>
<mi>i</mi>
</msub>
<mo>&GreaterEqual;</mo>
<msub>
<mi>d</mi>
<mi>i</mi>
</msub>
<mo>-</mo>
<msub>
<mi>t</mi>
<mi>c</mi>
</msub>
</mrow>
</mtd>
</mtr>
</mtable>
</mfenced>
</mrow>
</mtd>
</mtr>
<mtr>
<mtd>
<mrow>
<mo>=</mo>
<mi>min</mi>
<mo>{</mo>
<msub>
<mi>t</mi>
<mi>i</mi>
</msub>
<mo>,</mo>
<msub>
<mi>d</mi>
<mi>i</mi>
</msub>
<mo>-</mo>
<msub>
<mi>t</mi>
<mi>c</mi>
</msub>
<mo>}</mo>
</mrow>
</mtd>
</mtr>
</mtable>
<mo>,</mo>
</mrow>
Wherein, diIt is that ID number is solicited message deadline, tcIt is current time；
2d3) use effective time TiTo estimate request largest data transfer amount A of the ID number for ii：
Ai=Ti× r,
Wherein, r is maximum data transfer rate, TiFor effective time；
2e) by video maximum capacity AiWith video size DiContrasted：If Ai≥Di, then the request can be serviced；Otherwise, should
Request cannot be serviced, and road sets the discarding solicited message and deletes its relevant information in required list；
(3) priority P is calculatedi：
3a) the request number of times N in initialization requests tableiFor 1, the video information feature V in required listi, will have identical regard
Frequency information characteristics ViRequest number be added, and result is recorded in corresponding request number of times NiIn；
3b) by the request in required list according to request number of times NiDescending arranges；
3c) for video information feature ViIdentical request, road set contrast its effective time Ti, with most long effective time Ti
Request ID number copy column at, record the ID number of other requests of the video, and delete the corresponding phase of other requests of the video
Close information；
3d) road sets the priority P that video is asked in computation requests table respectivelyi；
3e) for same request times NiRequest, according to priority PiSize, road set to request carry out descending arrangement；
(4) resource allocation：
4a) regard the request of preceding j sequence number in required list as an entirety, j by 1 increase, before calculating j ask to set on road it is logical
Minimum residence time t in the range of letterj'=min { t1,t2..., tjAnd preceding j node minimum deadline dj'=min
{d1,d2..., dj, then by minimum residence time tj' and minimum deadline dj' calculate the preceding j minimum effective time asked
Tj'；
4b) estimate minimum effective time Tj' interior energy download it is preceding j ask maximum data capacity Aj'；
The sum of video size is asked before 4c) calculating for jJ+1 request video is big before being calculated using identical method
The sum of small Dj+1'；
4d) to the maximum data capacity A of first j requestj', preceding j request the sum of video size Dj' and first j+1 request video
The sum of size Dj+1' contrasted：If Dj'≤Aj' ＜ Dj+1', then road sets can be at the same time in service request table first j and asks, and
The D of j request before the first j bandwidth ratio asked in downloading process is arranged tojThan；If Dj' ＜ Dj+1'≤Aj', then j is added
1, repeat the above process, until finding full then Dj'≤Aj' ＜ Dj+1' j values；
(5) video download communication：
5a) according to the resource allocation mechanism of step (4), road is set downloads its requested video to requesting node, if request letter
ID number copy column is ceased for sky, then road sets completion and downloads its requested video, and terminates the request task；If solicited message ID
Number copy column is not sky, then road, which is set, adds the ID number in copy column in video data packet packet header, and gives requesting node to download
Its requested video；
After 5b) requesting node receives video data packet, video data packet packet header is first checked, check whether it there are other request sections
The ID number of point：If it is not, node terminates the request task；If so, the node of video data packet is then received with oneself
For source node, using the node of other ID numbers in packet header as purpose node, using the wireless communication between node and node
To complete the video download request, and terminate the request task.
2. according to the method described in claim 1, wherein the step 3d) in calculate the preferential of requesting node that ID number is i
Level Pi, its calculation formula is as follows：
<mrow>
<msub>
<mi>P</mi>
<mi>i</mi>
</msub>
<mo>=</mo>
<msub>
<mi>w</mi>
<mn>1</mn>
</msub>
<mo>&times;</mo>
<mrow>
<mo>(</mo>
<mfrac>
<msub>
<mi>T</mi>
<mi>i</mi>
</msub>
<msub>
<mi>T</mi>
<mi>m</mi>
</msub>
</mfrac>
<mo>)</mo>
</mrow>
<mo>+</mo>
<msub>
<mi>w</mi>
<mn>2</mn>
</msub>
<mo>&times;</mo>
<mrow>
<mo>(</mo>
<mfrac>
<msub>
<mi>D</mi>
<mi>i</mi>
</msub>
<msub>
<mi>D</mi>
<mi>m</mi>
</msub>
</mfrac>
<mo>)</mo>
</mrow>
</mrow>
<mfenced open = "" close = "">
<mtable>
<mtr>
<mtd>
<mrow>
<mi>s</mi>
<mo>.</mo>
<mi>t</mi>
<mo>.</mo>
</mrow>
</mtd>
<mtd>
<mrow>
<msub>
<mi>T</mi>
<mi>m</mi>
</msub>
<mo>=</mo>
<mfrac>
<mrow>
<mn>2</mn>
<mi>R</mi>
</mrow>
<msub>
<mi>v</mi>
<mi>m</mi>
</msub>
</mfrac>
<mo>,</mo>
</mrow>
</mtd>
</mtr>
</mtable>
</mfenced>
Dm=Tm×r
Wherein, TiBe ID number be i request effective time, DiThe request video size that ID number is i, R be maximum communication away from
From vmIt is average nodal travel speed, TmThe average time in communication distance, D are rested on for nodemIt is maximum residence time Tm
The average data volume of time interior energy transmission, w1And w2For the different weight factor of two values and w1+w2=1.
3. according to the method described in claim 1, wherein the step 4b) in before estimation j node minimum effective time
Tj' interior energy download maximum data capacity Aj', carry out as follows：
The minimum effective time T of j node before 4b1) calculatingj'：
<mfenced open = "" close = "">
<mtable>
<mtr>
<mtd>
<mrow>
<msup>
<msub>
<mi>T</mi>
<mi>j</mi>
</msub>
<mo>&prime;</mo>
</msup>
<mo>=</mo>
<mfenced open = "{" close = "">
<mtable>
<mtr>
<mtd>
<mrow>
<msup>
<msub>
<mi>t</mi>
<mi>j</mi>
</msub>
<mo>&prime;</mo>
</msup>
<mo>,</mo>
</mrow>
</mtd>
<mtd>
<mrow>
<msup>
<msub>
<mi>t</mi>
<mi>j</mi>
</msub>
<mo>&prime;</mo>
</msup>
<mo><</mo>
<msup>
<msub>
<mi>d</mi>
<mi>j</mi>
</msub>
<mo>&prime;</mo>
</msup>
<mo>-</mo>
<msub>
<mi>t</mi>
<mi>c</mi>
</msub>
</mrow>
</mtd>
</mtr>
<mtr>
<mtd>
<mrow>
<msup>
<msub>
<mi>d</mi>
<mi>j</mi>
</msub>
<mo>&prime;</mo>
</msup>
<mo>-</mo>
<msub>
<mi>t</mi>
<mi>c</mi>
</msub>
<mo>,</mo>
</mrow>
</mtd>
<mtd>
<mrow>
<msup>
<msub>
<mi>t</mi>
<mi>j</mi>
</msub>
<mo>&prime;</mo>
</msup>
<mo>&GreaterEqual;</mo>
<msup>
<msub>
<mi>d</mi>
<mi>j</mi>
</msub>
<mo>&prime;</mo>
</msup>
<mo>-</mo>
<msub>
<mi>t</mi>
<mi>c</mi>
</msub>
</mrow>
</mtd>
</mtr>
</mtable>
</mfenced>
</mrow>
</mtd>
</mtr>
<mtr>
<mtd>
<mrow>
<mo>=</mo>
<mi>min</mi>
<mo>{</mo>
<msup>
<msub>
<mi>t</mi>
<mi>j</mi>
</msub>
<mo>&prime;</mo>
</msup>
<mo>,</mo>
<msup>
<msub>
<mi>d</mi>
<mi>j</mi>
</msub>
<mo>&prime;</mo>
</msup>
<mo>-</mo>
<msub>
<mi>t</mi>
<mi>c</mi>
</msub>
<mo>}</mo>
</mrow>
</mtd>
</mtr>
</mtable>
</mfenced>
Wherein, tj' it is the first j minimum residence time for asking to set on road in communication range and dj' cut for the minimum of preceding j node
Only time limit, tcIt is current time；
4b2) with minimum effective time Tj' come the minimum effective time T of j node before calculatingj' interior energy download the first two request
Maximum data capacity most Aj'：
Aj'=Tj'×r
Wherein, r is maximum data transfer rate.
4. according to the method described in claim 1, wherein described step 5b) in communication protocol between vehicle and vehicle V2V adopt
With greedy edge stateless route GPSR or other be adapted to the agreement that communicates between vehicle and vehicle and complete.
Priority Applications (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN201510495930.3A CN105072027B (en) | 2015-08-12 | 2015-08-12 | Vehicle sets the method for downloading video in communicating with road |
Applications Claiming Priority (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN201510495930.3A CN105072027B (en) | 2015-08-12 | 2015-08-12 | Vehicle sets the method for downloading video in communicating with road |
Publications (2)
| Publication Number | Publication Date |
|---|---|
| CN105072027A CN105072027A (en) | 2015-11-18 |
| CN105072027B true CN105072027B (en) | 2018-05-11 |
Family
ID=54501313
Family Applications (1)
| Application Number | Title | Priority Date | Filing Date |
|---|---|---|---|
| CN201510495930.3A Active CN105072027B (en) | 2015-08-12 | 2015-08-12 | Vehicle sets the method for downloading video in communicating with road |
Country Status (1)
| Country | Link |
|---|---|
| CN (1) | CN105072027B (en) |
Citations (6)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN201100956Y (en) * | 2007-10-16 | 2008-08-13 | 鹰达科技有限公司 | Training multimedia control system |
| CN102509310A (en) * | 2011-11-18 | 2012-06-20 | 上海电机学院 | Video tracking analysis method and system combined with geographic information |
| CN102663894A (en) * | 2012-05-20 | 2012-09-12 | 杭州妙影微电子有限公司 | Road traffic condition foreknowing system and method based on internet of things |
| CN102917054A (en) * | 2012-10-18 | 2013-02-06 | 北京邮电大学 | Vehicle-mounted network stream media prefetching method and device |
| CN103888848A (en) * | 2014-03-27 | 2014-06-25 | 西安电子科技大学 | Video transmission routing method based on receiving nodes in vehicular ad hoc network |
| US9699592B2 (en) * | 2011-05-20 | 2017-07-04 | Telefonaktiebolaget Lm Ericsson (Publ) | Methods and devices for content distribution |
Family Cites Families (1)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| US20120010977A1 (en) * | 2005-09-14 | 2012-01-12 | Jorey Ramer | System for targeting advertising content to a plurality of mobile communication facilities |
-
2015
- 2015-08-12 CN CN201510495930.3A patent/CN105072027B/en active Active
Patent Citations (6)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN201100956Y (en) * | 2007-10-16 | 2008-08-13 | 鹰达科技有限公司 | Training multimedia control system |
| US9699592B2 (en) * | 2011-05-20 | 2017-07-04 | Telefonaktiebolaget Lm Ericsson (Publ) | Methods and devices for content distribution |
| CN102509310A (en) * | 2011-11-18 | 2012-06-20 | 上海电机学院 | Video tracking analysis method and system combined with geographic information |
| CN102663894A (en) * | 2012-05-20 | 2012-09-12 | 杭州妙影微电子有限公司 | Road traffic condition foreknowing system and method based on internet of things |
| CN102917054A (en) * | 2012-10-18 | 2013-02-06 | 北京邮电大学 | Vehicle-mounted network stream media prefetching method and device |
| CN103888848A (en) * | 2014-03-27 | 2014-06-25 | 西安电子科技大学 | Video transmission routing method based on receiving nodes in vehicular ad hoc network |
Non-Patent Citations (2)
| Title |
|---|
| 数字电视数据下载器的设计应用;郝永刚等;《电视技术》;20091031(第9期);全文 * |
| 车辆自组织网仿真研究;霍梅梅等;《计算机应用研究》;20100531;第27卷(第5期);全文 * |
Also Published As
| Publication number | Publication date |
|---|---|
| CN105072027A (en) | 2015-11-18 |
Similar Documents
| Publication | Publication Date | Title |
|---|---|---|
| Feng et al. | AVE: Autonomous vehicular edge computing framework with ACO-based scheduling | |
| Cheng et al. | Opportunistic WiFi offloading in vehicular environment: A game-theory approach | |
| CN102946637B (en) | Methods and apparatus for creation and transport of multimedia content flows | |
| CN110536262A (en) | A kind of direct link communications method, apparatus and storage medium | |
| CN103621151B (en) | For managing the technology that stream broadcasts media business in network entity | |
| WO2017076037A1 (en) | Vehicle network v2x service sending method and apparatus | |
| WO2021163895A1 (en) | Network model management method, session establishment or modification method, and apparatus | |
| CN103905378B (en) | Data transmission method and device thereof | |
| JP4658124B2 (en) | Method for setting up a call request for push-to-talk (PTT) communication in a wireless communication network using a signaling channel | |
| CN102948205A (en) | Techniques for initiating communication in a wireless network | |
| US20140310339A1 (en) | Content delivery method and apparatus, and access network device | |
| EP3010270B1 (en) | Device, method and user equipment in a wireless communication system | |
| CN109803385A (en) | Request the method and device of resource, the method and device of process resource request | |
| CN106412043B (en) | CDN network flow bootstrap technique and device | |
| CN106060944A (en) | Method for combination of multichannel MAC protocol and TDMA in IOV | |
| CN102891858A (en) | Method and system for network data transmission and proxy server | |
| CN104753812A (en) | Systems and methods for cooperative applications in communication systems | |
| JP2022517664A (en) | Sidelink communication quality of service control methods, equipment, computer programs and electronic devices | |
| CN103987091A (en) | Service bandwidth changing method, controller and system | |
| JP6383485B2 (en) | Access method and apparatus in heterogeneous network | |
| CN101433102A (en) | Profile modification for roaming in a communications environment | |
| CN103533452B (en) | The transfer control method and device of a kind of Streaming Media | |
| CN105072027B (en) | Vehicle sets the method for downloading video in communicating with road | |
| CN106686635A (en) | Data transmission method and device based on control and provisioning of wireless access points protocol specification | |
| Jiao et al. | Proactive content delivery for vehicles over cellular networks: The fundamental benefits of computing and caching |
Legal Events
| Date | Code | Title | Description |
|---|---|---|---|
| C06 | Publication | ||
| PB01 | Publication | ||
| C10 | Entry into substantive examination | ||
| SE01 | Entry into force of request for substantive examination | ||
| GR01 | Patent grant | ||
| GR01 | Patent grant |