CN105933855A - Internet of vehicles data download methods based on user satisfaction - Google Patents
Internet of vehicles data download methods based on user satisfaction Download PDFInfo
- Publication number
- CN105933855A CN105933855A CN201610506952.XA CN201610506952A CN105933855A CN 105933855 A CN105933855 A CN 105933855A CN 201610506952 A CN201610506952 A CN 201610506952A CN 105933855 A CN105933855 A CN 105933855A
- Authority
- CN
- China
- Prior art keywords
- data
- download
- rsu
- forwards
- downloaded
- Prior art date
- Legal status (The legal status is an assumption and is not a legal conclusion. Google has not performed a legal analysis and makes no representation as to the accuracy of the status listed.)
- Granted
Links
- 238000000034 method Methods 0.000 title claims abstract description 23
- 230000001413 cellular effect Effects 0.000 claims abstract description 15
- 230000006855 networking Effects 0.000 claims description 10
- 230000008569 process Effects 0.000 abstract description 7
- 238000005457 optimization Methods 0.000 abstract description 2
- 230000005540 biological transmission Effects 0.000 description 4
- 102100029106 Ethylmalonyl-CoA decarboxylase Human genes 0.000 description 2
- 101710134484 Ethylmalonyl-CoA decarboxylase Proteins 0.000 description 2
- 238000004364 calculation method Methods 0.000 description 2
- 230000007246 mechanism Effects 0.000 description 2
- 238000004458 analytical method Methods 0.000 description 1
- 230000003466 anti-cipated effect Effects 0.000 description 1
- 230000008901 benefit Effects 0.000 description 1
- 230000008859 change Effects 0.000 description 1
- 230000003111 delayed effect Effects 0.000 description 1
- 230000000694 effects Effects 0.000 description 1
- 238000005516 engineering process Methods 0.000 description 1
- 239000012634 fragment Substances 0.000 description 1
- 230000003993 interaction Effects 0.000 description 1
- JTJMJGYZQZDUJJ-UHFFFAOYSA-N phencyclidine Chemical compound C1CCCCN1C1(C=2C=CC=CC=2)CCCCC1 JTJMJGYZQZDUJJ-UHFFFAOYSA-N 0.000 description 1
- 238000012913 prioritisation Methods 0.000 description 1
- 230000003362 replicative effect Effects 0.000 description 1
Classifications
-
- H—ELECTRICITY
- H04—ELECTRIC COMMUNICATION TECHNIQUE
- H04W—WIRELESS COMMUNICATION NETWORKS
- H04W4/00—Services specially adapted for wireless communication networks; Facilities therefor
- H04W4/24—Accounting or billing
-
- H—ELECTRICITY
- H04—ELECTRIC COMMUNICATION TECHNIQUE
- H04W—WIRELESS COMMUNICATION NETWORKS
- H04W4/00—Services specially adapted for wireless communication networks; Facilities therefor
- H04W4/70—Services for machine-to-machine communication [M2M] or machine type communication [MTC]
-
- H—ELECTRICITY
- H04—ELECTRIC COMMUNICATION TECHNIQUE
- H04W—WIRELESS COMMUNICATION NETWORKS
- H04W8/00—Network data management
- H04W8/22—Processing or transfer of terminal data, e.g. status or physical capabilities
- H04W8/24—Transfer of terminal data
- H04W8/245—Transfer of terminal data from a network towards a terminal
-
- H—ELECTRICITY
- H04—ELECTRIC COMMUNICATION TECHNIQUE
- H04W—WIRELESS COMMUNICATION NETWORKS
- H04W84/00—Network topologies
- H04W84/18—Self-organising networks, e.g. ad-hoc networks or sensor networks
Landscapes
- Engineering & Computer Science (AREA)
- Computer Networks & Wireless Communication (AREA)
- Signal Processing (AREA)
- Business, Economics & Management (AREA)
- Accounting & Taxation (AREA)
- Databases & Information Systems (AREA)
- Mobile Radio Communication Systems (AREA)
Abstract
The present invention provides internet of vehicles data download methods based on user satisfaction. According to the method, a road driving process is divided into multiple time segments; each time in a new time segment, whether a vehicle enters a coverage area of an RSU is determined; if not, a cellular network downloads so as to use data traffic just within user consumption amount, if yes, the RSU downloads rest data. Further, the time may be divided into timeslots. In each timeslot, according to a principle of minimum cost, the cellular network or the RSU downloads data. According to the method, download optimization can be implemented, download cost is reduced as much as possible, good user experience, high satisfaction and high practicability are ensured, and the method has an important market value.
Description
Technical field
The present invention relates to car networked information interaction technique field, be specifically related to the side that car networking data based on user satisfaction is downloaded
Method.
Background technology
Vehicular Ad-hoc Network (VANET) vehicle self-organizing network is traditional mobile ad-hoc network (MANET)
Application on traffic route.It has the various features of mobile ad-hoc network, dynamically change, the multi-hop of such as network topology
Route etc.；Also having self distinctive characteristic, such as node contact rate is low, translational speed is fast.
Nowadays car networking quickly grows so that the information download of vehicle is more convenient, therefore, has also attracted a large amount of relevant vehicle to exist
Driving process is downloaded the research of data.The most popular is to study under WiFi, mobile cellular net etc. assist, and utilizes road
Survey unit R SU and carry out the strategy of data download: in such as [1], research is in the environment of outdoor wireless networks vehicle, and load shedding has
Effect property and the problem of average service delay.[2] in, research is under WiFi pattern, and user downloads time delay and cost in data procedures
Trade-off problem.Auction game-based offloading (AGO) and congestion game-based offloading is proposed in [3]
(CGO) mechanism, maximizes social welfare and increases the income of Mobile Network Operator.
The problem application that in car networking, data are downloaded is relatively broad, both can apply safe early warning aspect when driving, also
Can apply in terms of providing various amusement, advertising message to driver, passenger in driving route.Vehicle is asked in the process of moving
Downloading data, data can select to be downloaded by RSU, it is also possible to selects to be downloaded by 4G.Iff using drive test unit
RSU downloads data, it is understood that there may be time delay is the longest；Same, iff using 4G to download data, cost consumption can be very
Greatly.Therefore relating to how the problem values preferably utilizing mobile cellular net and VANET to carry out data download must go research.
List of references:
[1]Nan Cheng,Ning Lu,Ning Zhang,Xuemin(Sherman)Shen,Jon W.Mark,“Opportunistic
WiFi Offloading in Vehicular Environment:A Queueing Analysis,”in Globecom 2014-Ad Hoc
and Sensor Networking Symposium
[2]Ning Wang and Jie Wu,“Opportunistic WiFi Offloading in a Vehicular Environment:
Waiting or Downloading Now？”
[3]Nan Cheng,Ning Lu,Ning Zhang,Xiang Zhang,Xuemin(Sherman)Shen,and Jon W.
Mark,“Opportunistic WiFi Offloading in Vehicular Environment:A Game-Theory Approach”in
IEEE TRANSACTIONS ON INTELLIGENT TRANSPORTATION SYSTEMS
[4] propose in carry out data transmission under 3G auxiliary, it is possible to the efficiency of transmission making information is higher.(and by the letter of final problem
Turn to integer linear problem (ILP), propose an algorithm solved, i.e. by relaxed constraints, find out an initial solution,
The most constantly find out more excellent solution.) in [5] by collecting Beijing, the vehicle data in Shanghai, be given between RSUs and vehicle
Time of contact obey exponential, contact rate obey Poisson distribution conclusion.The system that proposes moves data mechanism by replicating,
Strengthen data sharing and the method for propagation efficiency.[6] mentioning in, in vehicle net system, data distribution can be passed through
Vehicle-to-vehicle (V2V), infrastructure-to-vehicle (V2I) assist, and RSU can select vehicle as centre
Medium transmits data to the vehicle of demand.[6] it is also proposed one simultaneously and control passage and the concept of two data channel.[7]
How main research downloads the data the highest to requirement of real-time, such as video and game on line.The download of user is asked to press by it
Deadline carrys out prioritization, one MMCD algorithm of final proposition, minimizes while realizing maximizing data download
The target of average delay.The most do not mention, more than, the satisfaction how ensureing user, do not account for the use that user can continue
The problem of the data downloaded.
Therefore, it is the most necessary for studying mail downloading charge optimization problem based on user satisfaction.
List of references:
[4]Qingwen Zhao,Yanmin Zhu,,Chao Chen,Hongzi Zhu,and Bo Li,Fellow,“When 3G
Meets VANET:3G-Assisted Data Delivery in VANETs,”in IEEE SENSORS JOURNAL,VOL.13,
NO.10,OCTOBER 2013.
[5]Yong Li,Depeng Jin,Pan Hui and Sheng Chen,“Contact-Aware Data Replication in
Roadside Unit
Aided Vehicular Delay Tolerant Networks,”in 1536-1233(c)2015IEEE
[6]Kai Liu,Joseph K.Y.Ng,Senior Victor C.S.Lee,Sang H.Son and Ivan
Stojmenovic,“Cooperative Data Scheduling in Hybrid Vehicular Ad Hoc Networks:VANET as a
Software Defined Network,”in 1063-66922015IEEE.
[7]Kaoru Ota,MianXiong Dong,Shan Chang and HongZi Zhu,“MMCD:Cooperative
Downloading for Highway VANETs,”in 2168-6750 2014IEEE.
Summary of the invention
According to prior art, the present invention provides car networking data method for down loading based on user satisfaction.
The present invention provides a kind of car networking data method for down loading based on user satisfaction, comprises the following steps:
Step1, inputs user's data total amount P to be downloaded and quantity n of time period, forwards Step2 to；
Step2, with variable j recording period, j ∈ (1,2,3 ..., n), ca/ M represents the expense using 3G/4G to download unit data
With, size is caEvery million；cb/ M represents the expense using RSU to download unit data, and size is cbEvery million；va/ s represents
4G downloads the speed of data, and size is vaPer second；vb/ s represents that RSU downloads the speed of data, and size is vbPer second；Q table
Show the user's basic amount of storage to data demand,
Initialize j=1, forward Step3 to；
Step3, it is judged that whether j, less than or equal to n, if so, forwards Step4 to, otherwise forward Step10 to；
Step4, vehicle started to judge whether in the coverage of RSU in the moment of entry time section j, if then forwarding to
Step5, otherwise forwards Step6 to；
Step5, within the whole time period, uses RSU to download remaining data, makes yj=1, forward Step7 to；
Step6, uses cellular network to download the data volume being just met for the consumption of jth time period, makes xj=1, forward Step7 to；
Step7, updates current mail downloading charge C, forwards Step8 to,
C=C+yj×vb×cb+xj×va×ca
Step8, it is judged that data are the most all downloaded successfully, if then forwarding Step10 to, otherwise forwards Step9 to；
Step9, vehicle enters the next time period by the time, makes j=j+1, forwards Step3 to；
Step10, expense C that output is downloaded, terminates；
The present invention still further provides a kind of car networking data method for down loading based on user satisfaction, by time subdivision, including following
Step,
Step1, data total amount P that input user is to be downloaded, initialize j=0, forward Step2 to；
Step2, it is judged that data are the most all downloaded successfully, if then forwarding Step10 to, otherwise forwards Step3 to；
Step3, makes j=j+1, enters next time slot, forwards Step4 to；
Step4, vehicle started to judge whether in the coverage of RSU, if then forwarding in the moment entering time slot j
Step5, otherwise forwards Step6 to；
Step5, in whole time slot, uses RSU to download remaining data, makes yj=1, forward Step9 to；
Step6, it is judged that the data of caching have run out of, if then forwarding Step7 to, otherwise forwards Step8 to；
Step7, in whole time slot, uses cellular network to download data xj=1, forward Step9 to；
Step8, does not download data in this time slot, makes yj=xj=0, forward Step9 to；
Step9, updates current mail downloading charge C, forwards Step2 to,
C=C+yj×vb×cb+xj×va×ca
Step10, expense C that output is downloaded, terminates.
The present invention is capable of downloading and optimizes, and reduces the cost consumption of download as far as possible, ensures that the experience of user is good simultaneously,
Satisfaction is high, and practical value is high.Owing to the present invention has the characteristics that in actual application aspect, there is important market value:
1) user satisfaction is ensured.In order to ensure to be able to the satisfaction meeting user to the data of download, such as see a film
Or listening a first fluency sung, the present invention needs to ensure that user does not haves because data buffer storage runs out of during enjoying
Situation about waiting for downloads, so can give user good experience.
2) minimize mail downloading charge to use.In actual applications, user, in addition to considering the facility of use data, is more to pay close attention to
Use the expense situation of data.If expense is much more expensive, then the user group of use will be the least.It is only used in expense to do and changes
Entering, the user used just can be made to increase, application is promoted.
Accompanying drawing explanation
Fig. 1 is the flow chart of the embodiment of the present invention one.
Fig. 2 is the flow chart of the embodiment of the present invention two.
Fig. 3 is that the present invention obtains road parted pattern figure.
Fig. 4 is the application example figure of the embodiment of the present invention one.
Fig. 5 is the application example figure of the embodiment of the present invention two.
Detailed description of the invention
Technical scheme is described in detail below in conjunction with drawings and Examples.
In order to be able to the satisfaction of the data meeting user to downloading, such as see a film or listen the fluency of a first song,
The problem that littleization downloads the cost consumption of data.Use cellular network (3G/4G) and RSU to download data and have respective advantage
And shortcoming, so that download scenarios is optimum, need, on the premise of ensureing user satisfaction, to use cellular network less
Downloading, the RSU download that more utilization is more cheap, how selecting when by what mode to download is that the present invention studies
Problem.BMA, TSA download scenarios provided by the present invention is used at mail downloading charge and is better than other contrast algorithms.
Road in system is divided into a section road by the present invention, and the distance of every section of road is that vehicle leaves previous drive test list
Unit RSU coverage to leave the next one drive test unit R SU coverage distance, embodiment is designated as L.So only
Solve the propagation delay time problem on one section of road L, be equivalent to solve the propagation delay time problem of system on whole road.L
Model as shown in Figure 3, discussed below is all the cost consumption problem on one section of road:
Embodiment of the present invention C represents the system cost consumption on L, and P represents the data total amount that request is downloaded.By on L time
Between to be divided into multiple time period, the time span of each time period be the τ second.In order to ensure user to download data satisfaction, than
As seen a film or listening the fluency of a song, the present invention needs to ensure that data the most certain within each time period are delayed
Storage consumes for user, and embodiment is defined as " basic buffer memory " q.If represented under the patient maximum data of user with n
Carry time delay, then have a following relation:
Embodiment of the present invention xjRepresent whether the jth time period downloads data, y with 4GjRepresent whether the jth time period uses RSU
Download data:
Such as: if the time period is expressed in seconds, within the 1-5 second, within first 2 seconds, download with 4G, situation about downloading with RSU for latter 2 seconds
X=(1,1,0,0,0), y=(0,0,0,1,1) can be expressed as.
Problem representation:
It is limited to
xj,yj∈(0,1),j∈(1,2,...,n) (5)
xj+yj＜=1 (6)
Wherein, caRepresent and use 3G/4G to download the expense of unit data, cbRepresent use RSU download unit data expense,
vaRepresent that 4G downloads the speed of data, vbRepresent that RSU downloads the speed of data.
Formula (3) ensures that the data total amount of actual download is greater than the data total amount that request is downloaded；
Formula (4) ensures that any time will meet user's data satisfaction to downloading.K represents the current time period,Representing the data total amount downloaded, up to the present k × q represents needs consumption
Data total amount；
Formula (5) represents xj,yj0 or 1 can only be selected；
Formula (6) represents that random time section can not select simultaneously by 4G and RSU download data；
The problem of the present invention can be regarded as a kind of deformation of knapsack problem, and knapsack problem is famous NP-Complete, institute
Also it is NP-Complete with the problem of the present invention.
It is an object of the present invention to minimize system costAnd use the transmission cost of 4G to be higher than
Use the transmission cost of RSU, i.e. ca＞ cb.In order to make target minimum, the present invention should make y as far as possiblej×vbMaximum, xj×va?
Little.
Seeing Fig. 1, the flow process of embodiment one comprises the following steps that
Step1, inputs user's data total amount P to be downloaded and quantity n of time period, forwards Step2 to.
Step2, with variable j recording period, j ∈ (1,2,3 ..., n), ca/ M represents the expense using 3G/4G to download unit data
With, size is caEvery million；cb/ M represents the expense using RSU to download unit data, and size is cbEvery million；va/ s represents
4G downloads the speed of data, and size is vaPer second；vb/ s represents that RSU downloads the speed of data, and size is vbPer second；Q table
Show the user's basic amount of storage to data demand,
Initialize j=1, forward Step3 to.
Step3, it is judged that whether j, less than or equal to n, if so, forwards Step4 to, otherwise forward Step10 to.
Step4, vehicle started to judge whether in the coverage of RSU, when being embodied as in the moment of entry time section j
Can test whether in coverage by RSU can be used to download data.If in the coverage of RSU, then turn
To Step5, otherwise forward Step6 to.
Step5, within the whole time period, uses RSU to download remaining data, makes yj=1, forward Step7 to.
Step6, uses cellular network (3G/4G) to download the data volume being just met for the consumption of jth time period, makes xj=1, turn
To Step7.
Step7, calculates current mail downloading charge C, forwards Step8 to,
C=C+yj×vb×cb+xj×va×ca
Step8, it is judged that data are the most all downloaded successfully, if so, forwards Step10 to, otherwise, forwards Step9 to.
Step9, vehicle enters next time period, j++ (even j=j+1) by the time, forwards Step3 to and re-executes step below
Suddenly.
Step10, expense C that output is downloaded, terminates.
Further, the present invention has made some improvements based on the technical scheme of embodiment one, by time subdivision, proposes one
Heuristic technique scheme so that final result is more excellent, sees Fig. 2, and the flow process of embodiment two comprises the following steps that
Step1, data total amount P that input user is to be downloaded, initialize j=0, forward Step2 to.
Step2, it is judged that data are the most all downloaded successfully, if so, forwards Step10 to, otherwise, forwards Step3 to.
Step3, j++ (even j=j+1), enter next time slot, forward Step4 to.
Step4, vehicle started to judge whether in the coverage of RSU in the moment entering time slot j, can when being embodied as
With by RSU download data can be used to test whether in coverage.If in the coverage of RSU, then forward to
Step5, otherwise forwards Step6 to.
Step5, in whole time slot, uses RSU to download remaining data, makes yj=1, forward Step9 to.
Step6, it is judged that the data of caching have run out of, if so, forwards Step7 to, otherwise forwards Step8 to.
Step7, in whole time slot, uses cellular network (3G/4G) to download data xj=1, forward Step9 to.
Step8, does not download data in this time slot, makes yj=xj=0, forward Step9 to.
Step9, calculates current mail downloading charge C, forwards Step2 to and re-executes step below:
C=C+yj×vb×cb+xj×va×ca
Step10, expense C that output is downloaded, terminates.
When being embodied as, those skilled in the art can use computer software technology to realize the automatic operation of flow process.
See Fig. 4, the application example of embodiment one:
Assume: it is 70M that data download total amount, and estimated cost is 55B, time period length τ=5s, basic buffer memory q=25M/ τ,
Anticipated vehicle comes into the time period t of the coverage of RSU0When=3,4G and RSU speed be respectively 15M/s,
25M/s, expense is respectively 1M/B, 0.1M/B.In Fig. 4, the square of white represents the moment of download, and the square of shade represents
There is the moment of data buffer storage.Upper row represents downloads data with RSU, below a line represent and download data with 4G.User
Case 1, then cost consumption C=50+20 × 0.1=52B.
See Fig. 5, the application example of embodiment two:
The size assuming a time slot is that 1s, 4G and RSU speed is respectively 15M/s, 25M/s, expense be respectively 1M/B,
0.1M/B, " basic buffer memory " q=5M/s.As it is shown in figure 5, a blockage means that a time slot.The square of white represents
The time slot of download limit, limit consumption data, the square of shade represents also data buffer storage, does not download the time slot only consumed.Then work as request
When the data total amount downloaded is 70M, as it is shown in figure 5, download data at the 1st, 4,7 time slots by 4G, at the 9th
Time slot downloads data by RSU and download completes, cost consumption C=15 × 3+25 × 0.1=47.5B.
The technical scheme of embodiment is designated as scheme 1, and principle is described below: road driving process is divided into multiple time period, uses j
Representing, the time span of each time period is the τ second.Enter a new time period, it is judged that whether vehicle has been enter into RSU every time
Coverage.If being also introduced into, just download data volume q being just met for customer consumption with cellular network.If having been enter into, then
Remaining data are downloaded with RSU.
The technical scheme of embodiment is designated as scheme 2, and principle is described below: the time in scheme 1 is divided into less, can not
The fragment split again, referred to as " time slot ".In each time slot, according to cost minimum principle, select by cellular network or RSU
Download data.Cost minimum principle is: if current time slots vehicle is in RSU coverage, then vehicle first-selection is by under RSU
Carry data；If current time slots vehicle is not in RSU coverage, then judge whether also have number when that vehicle entering current time slots
According to caching, if having, do not download data, nowIf without, by under cellular network
Data.
Scheme 1 is with the difference of scheme 2: due in scheme 1 vehicle carry out every time the time interval that judges than scheme 2 time
Between interval long, therefore, in the time interval of equal length, the calculating of the calculation times scheme be less than 2 that scheme 1 is made is secondary
Number, so the amount of calculation of scheme 1 is less than scheme 2.But, owing to the time slot of scheme 2 is less, therefore it is not subject to when calculating resource
Under conditions of limit, no matter scheme 2 downloads time delay or mail downloading charge is better than scheme 1.
Based on this, following suggestion is proposed: according to above-mentioned principle and example, when computation resources are limited, scheme 1 can be used；
When considering to download time delay or mail downloading charge used time, scheme 2 can be used.
Claims (2)
1. a car networking data method for down loading based on user satisfaction, it is characterised in that: comprise the following steps:
Step1, inputs user's data total amount P to be downloaded and quantity n of time period, forwards Step2 to；
Step2, with variable j recording period, j ∈ (1,2,3 ..., n), ca/ M represents the expense using 3G/4G to download unit data, and size is caEvery million；cb/ M represents the expense using RSU to download unit data, and size is cbEvery million；va/ s represents that 4G downloads the speed of data, and size is vaPer second；vb/ s represents that RSU downloads the speed of data, and size is vbPer second；Q represents the user's basic amount of storage to data demand,
Initialize j=1, forward Step3 to；
Step3, it is judged that whether j, less than or equal to n, if so, forwards Step4 to, otherwise forward Step10 to；
Step4, vehicle started to judge whether in the coverage of RSU in the moment of entry time section j, if then forwarding Step5 to, otherwise forwarded Step6 to；
Step5, within the whole time period, uses RSU to download remaining data, makes yj=1, forward Step7 to；
Step6, uses cellular network to download the data volume being just met for the consumption of jth time period, makes xj=1, forward Step7 to；
Step7, updates current mail downloading charge C, forwards Step8 to,
C=C+yj×vb×cb+xj×va×ca
Step8, it is judged that data are the most all downloaded successfully, if then forwarding Step10 to, otherwise forwards Step9 to；
Step9, vehicle enters the next time period by the time, makes j=j+1, forwards Step3 to；
Step10, expense C that output is downloaded, terminates.
2. a car networking data method for down loading based on user satisfaction, it is characterised in that: by time subdivision, comprise the following steps,
Step1, data total amount P that input user is to be downloaded, initialize j=0, forward Step2 to；
Step2, it is judged that data are the most all downloaded successfully, if then forwarding Step10 to, otherwise forwards Step3 to；
Step3, makes j=j+1, enters next time slot, forwards Step4 to；
Step4, vehicle starting to judge whether in the coverage of RSU in the moment entering time slot j, if then forwarding Step5 to, otherwise forwarding Step6 to；
Step5, in whole time slot, uses RSU to download remaining data, makes yj=1, forward Step9 to；
Step6, it is judged that the data of caching have run out of, if then forwarding Step7 to, otherwise forwards Step8 to；
Step7, in whole time slot, uses cellular network to download data xj=1, forward Step9 to；
Step8, does not download data in this time slot, makes yj=xj=0, forward Step9 to；
Step9, updates current mail downloading charge C, forwards Step2 to,
C=C+yj×vb×cb+xj×va×ca
Step10, expense C that output is downloaded, terminates.
Priority Applications (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN201610506952.XA CN105933855B (en) | 2016-06-30 | 2016-06-30 | Car networking data download method based on user satisfaction |
Applications Claiming Priority (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN201610506952.XA CN105933855B (en) | 2016-06-30 | 2016-06-30 | Car networking data download method based on user satisfaction |
Publications (2)
| Publication Number | Publication Date |
|---|---|
| CN105933855A true CN105933855A (en) | 2016-09-07 |
| CN105933855B CN105933855B (en) | 2019-03-15 |
Family
ID=56828441
Family Applications (1)
| Application Number | Title | Priority Date | Filing Date |
|---|---|---|---|
| CN201610506952.XA Expired - Fee Related CN105933855B (en) | 2016-06-30 | 2016-06-30 | Car networking data download method based on user satisfaction |
Country Status (1)
| Country | Link |
|---|---|
| CN (1) | CN105933855B (en) |
Cited By (2)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN109905848A (en) * | 2017-12-11 | 2019-06-18 | 上海交通大学 | A kind of converged network resource regulating method based on wireless traffic caching |
| WO2020238568A1 (en) * | 2019-05-29 | 2020-12-03 | Ningbo Geely Automobile Research & Development Co., Ltd. | A system and method for managing the storing of data in a vehicle |
Citations (3)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN104601667A (en) * | 2014-12-23 | 2015-05-06 | 武汉大学 | Gapless vehicle networking assist downloading method |
| CN105610935A (en) * | 2015-12-25 | 2016-05-25 | 北京奇虎科技有限公司 | Data download system and data download method |
| CN105657842A (en) * | 2016-01-15 | 2016-06-08 | 宇龙计算机通信科技(深圳)有限公司 | Resource allocation method and road side unit |
-
2016
- 2016-06-30 CN CN201610506952.XA patent/CN105933855B/en not_active Expired - Fee Related
Patent Citations (3)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN104601667A (en) * | 2014-12-23 | 2015-05-06 | 武汉大学 | Gapless vehicle networking assist downloading method |
| CN105610935A (en) * | 2015-12-25 | 2016-05-25 | 北京奇虎科技有限公司 | Data download system and data download method |
| CN105657842A (en) * | 2016-01-15 | 2016-06-08 | 宇龙计算机通信科技(深圳)有限公司 | Resource allocation method and road side unit |
Cited By (3)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN109905848A (en) * | 2017-12-11 | 2019-06-18 | 上海交通大学 | A kind of converged network resource regulating method based on wireless traffic caching |
| WO2020238568A1 (en) * | 2019-05-29 | 2020-12-03 | Ningbo Geely Automobile Research & Development Co., Ltd. | A system and method for managing the storing of data in a vehicle |
| US11928331B2 (en) | 2019-05-29 | 2024-03-12 | Ningbo Geely Automobile Research & Dev. Co., Ltd. | System and method for managing the storing of data in a vehicle |
Also Published As
| Publication number | Publication date |
|---|---|
| CN105933855B (en) | 2019-03-15 |
Similar Documents
| Publication | Publication Date | Title |
|---|---|---|
| Zhang et al. | Mobile-edge computing for vehicular networks: A promising network paradigm with predictive off-loading | |
| CN108012244B (en) | Cluster-based road vehicle-mounted self-organizing network data service communication system and method | |
| Chen et al. | CVCG: Cooperative V2V-aided transmission scheme based on coalitional game for popular content distribution in vehicular ad-hoc networks | |
| Campolo et al. | From today's VANETs to tomorrow's planning and the bets for the day after | |
| Zhou et al. | Chaincluster: Engineering a cooperative content distribution framework for highway vehicular communications | |
| Palazzi et al. | Delay-bounded data gathering in urban vehicular sensor networks | |
| Ahmad et al. | VANET–LTE based heterogeneous vehicular clustering for driving assistance and route planning applications | |
| CN106211260B (en) | Position information self-adaptive opportunistic routing method in Internet of vehicles | |
| Nguyen et al. | Dynamic V2I/V2V cooperative scheme for connectivity and throughput enhancement | |
| Luo et al. | CFT: A cluster-based file transfer scheme for highway VANETs | |
| Chiti et al. | Content sharing in Internet of Vehicles: Two matching-based user-association approaches | |
| Schwartz et al. | On the applicability of fair and adaptive data dissemination in traffic information systems | |
| Su et al. | Engineering a game theoretic access for urban vehicular networks | |
| Chang et al. | Adaptive message forwarding for avoiding broadcast storm and guaranteeing delay in active safe driving VANET | |
| Huang et al. | ECDS: Efficient collaborative downloading scheme for popular content distribution in urban vehicular networks | |
| Wu et al. | Improving RSU service time by distributed sorting mechanism | |
| Zhang et al. | Cluster-based content download and forwarding scheme for highway VANETs | |
| Li et al. | A probabilistic broadcasting scheme for emergent message dissemination in urban internet of vehicles | |
| CN105933855A (en) | Internet of vehicles data download methods based on user satisfaction | |
| Dua et al. | An energy efficient data dissemination and information retrieval scheme for VANET | |
| Nakamura et al. | A method for improving data delivery efficiency in delay tolerant vanet with scheduled routes of cars | |
| Verma et al. | A method for improving data delivery efficiency in vehicular adhoc networks | |
| Kumar et al. | Priority based data scheduling in VANETs | |
| Guo et al. | Enabling efficient content dissemination for cooperative vehicular networks | |
| Ansari et al. | Requirements and complexity analysis of cross-layer design optimization for adaptive inter-vehicle dsrc |
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 | ||
| CF01 | Termination of patent right due to non-payment of annual fee |
Granted publication date: 20190315 |
|
| CF01 | Termination of patent right due to non-payment of annual fee |