CN107786941B - File cooperation downloading method based on prefetching - Google Patents

File cooperation downloading method based on prefetching Download PDF

Info

Publication number
CN107786941B
CN107786941B CN201710910561.9A CN201710910561A CN107786941B CN 107786941 B CN107786941 B CN 107786941B CN 201710910561 A CN201710910561 A CN 201710910561A CN 107786941 B CN107786941 B CN 107786941B
Authority
CN
China
Prior art keywords
vehicle
road
target vehicle
data
communication
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
Application number
CN201710910561.9A
Other languages
Chinese (zh)
Other versions
CN107786941A (en
Inventor
蔡雪莲
汪素
郭涛
Current Assignee (The listed assignees may be inaccurate. Google has not performed a legal analysis and makes no representation or warranty as to the accuracy of the list.)
Xidian University
Original Assignee
Xidian University
Priority date (The priority date 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 date listed.)
Filing date
Publication date
Application filed by Xidian University filed Critical Xidian University
Priority to CN201710910561.9A priority Critical patent/CN107786941B/en
Publication of CN107786941A publication Critical patent/CN107786941A/en
Application granted granted Critical
Publication of CN107786941B publication Critical patent/CN107786941B/en
Active legal-status Critical Current
Anticipated expiration legal-status Critical

Links

Images

Classifications

    • H—ELECTRICITY
    • H04—ELECTRIC COMMUNICATION TECHNIQUE
    • H04W—WIRELESS COMMUNICATION NETWORKS
    • H04W4/00—Services specially adapted for wireless communication networks; Facilities therefor
    • H04W4/02—Services making use of location information
    • H04W4/023—Services making use of location information using mutual or relative location information between multiple location based services [LBS] targets or of distance thresholds
    • H—ELECTRICITY
    • H04—ELECTRIC COMMUNICATION TECHNIQUE
    • H04L—TRANSMISSION OF DIGITAL INFORMATION, e.g. TELEGRAPHIC COMMUNICATION
    • H04L67/00—Network arrangements or protocols for supporting network services or applications
    • H04L67/01—Protocols
    • H04L67/06—Protocols specially adapted for file transfer, e.g. file transfer protocol [FTP]
    • H—ELECTRICITY
    • H04—ELECTRIC COMMUNICATION TECHNIQUE
    • H04L—TRANSMISSION OF DIGITAL INFORMATION, e.g. TELEGRAPHIC COMMUNICATION
    • H04L67/00—Network arrangements or protocols for supporting network services or applications
    • H04L67/50—Network services
    • H04L67/56—Provisioning of proxy services
    • H04L67/568—Storing data temporarily at an intermediate stage, e.g. caching
    • H04L67/5681—Pre-fetching or pre-delivering data based on network characteristics
    • H—ELECTRICITY
    • H04—ELECTRIC COMMUNICATION TECHNIQUE
    • H04L—TRANSMISSION OF DIGITAL INFORMATION, e.g. TELEGRAPHIC COMMUNICATION
    • H04L67/00—Network arrangements or protocols for supporting network services or applications
    • H04L67/50—Network services
    • H04L67/60—Scheduling or organising the servicing of application requests, e.g. requests for application data transmissions using the analysis and optimisation of the required network resources
    • H04L67/63—Routing a service request depending on the request content or context

Landscapes

  • Engineering & Computer Science (AREA)
  • Computer Networks & Wireless Communication (AREA)
  • Signal Processing (AREA)
  • Mobile Radio Communication Systems (AREA)
  • Traffic Control Systems (AREA)

Abstract

本发明公开了一种基于预取的文件协作下载方法，包括步骤1：数据预取，发生在目标车辆刚驶入路设的通信范围时；步骤2：数据下载，发生在目标车辆和反向协作车辆在路设的覆盖范围内时；步骤3：数据转发，发生在目标车辆和簇成员在盲区相遇时；本发明结合数据预取和携带‑转发机制，可以进一步减少盲区，间接扩展RSU的覆盖范围，以满足大规模内容下载的需要，提高文件下载质量，满足用户需求，可用于车辆与路设、车辆与车辆之间的通信，解决高速公路上由于RSU分布稀疏和车辆的快速移动带来的通信覆盖范围小，通信盲区大的问题。

Figure 201710910561

The invention discloses a prefetch-based file cooperative downloading method, comprising step 1: data prefetching, which occurs when a target vehicle just drives into the communication range of a road set; step 2: data downloading, which occurs when the target vehicle and the reverse When the cooperative vehicle is within the coverage of the road set; Step 3: data forwarding, which occurs when the target vehicle and the cluster member meet in the blind spot; the present invention combines data prefetching and carry-forwarding mechanism, can further reduce the blind spot, and indirectly expand the RSU's The coverage is to meet the needs of large-scale content downloads, improve the quality of file downloads, and meet user needs. It can be used for communication between vehicles and road equipment, and between vehicles The communication coverage is small and the communication blind spot is large.

Figure 201710910561

Description

File cooperation downloading method based on prefetching
Technical Field
The invention belongs to the technical field of communication, and mainly relates to a file downloading method in a vehicle self-organizing network, which can be used for communication between vehicles and road facilities and between vehicles.
Background
Vehicle ad hoc networks are the basis for the development of intelligent transportation systems, aiming to provide drivers and passengers with a large number of safety and entertainment applications. For any type of application, efficient data transfer is the basis. In particular, many applications include multimedia content of the type of pictures, music, and video. These contents can provide data visualization, further enhancing the driving experience of the user. Thus, its downloading and distribution is becoming increasingly important and worthy of study. Multimedia files are typically large and the download of the file can be achieved from vehicle to vehicle and from communication between the vehicle (V2V) and the infrastructure (V2I). For V2V, the high speed mobility of the vehicle, severe channel fading and strong mutual interference cause communication instability, so that it can only provide a small file download capacity. The V2I communication also cannot satisfy the downloading requirement of large files, mainly because of the following two aspects: on the one hand, the high maintenance cost of the road layout makes its distribution sparse, and therefore, there are many areas on the road without signals. On the other hand, the high speed mobility of the vehicle makes the time during which it can stay within the coverage of the road infrastructure very short. Therefore, a reasonable vehicle-to-road setup, large file download mechanism in vehicle-to-vehicle communication is very important to improve the user experience.
In the existing file downloading mechanisms, most of the files are downloaded cooperatively only by considering cooperation between vehicles. Typical mechanisms are an assisted data distribution mechanism CCDSV and a content cooperative distribution strategy among a plurality of road facilities based on cooperative game theory. The CCDSV mechanism increases the diversity of content flow patterns in the vehicle ad hoc network by distributing data to the moving target vehicles with higher efficiency by considering mobility prediction of the vehicles, resource storage of the AP sites, and content sharing distribution. The cooperative game theory-based content cooperative distribution strategy among the multiple road facilities firstly considers the difference of data circulation sharing rates caused by the difference of factors such as density and speed of vehicle nodes in different areas of a bottom layer V2V network, and carries out level division on a large amount of data in the network based on the difference. On the basis, the problem of cooperatively distributing data by a plurality of routers is regarded as a cooperative game problem, and a distributed algorithm is proposed for realizing. However, none of the content distribution mechanisms based on the V2V communication technology can cope with the problems of intermittent and frequent network accesses to the road equipment by vehicles in a Drive-thru network, so recent research focuses mainly on joint communication between vehicles and road equipment.
Disclosure of Invention
The invention aims to provide a large file downloading method in vehicle-to-road installation and vehicle-to-vehicle communication aiming at the defects of the prior art so as to improve the file downloading quality and meet the user requirements.
In order to achieve the purpose, the invention adopts the following technical scheme:
a file collaboration downloading method based on prefetching comprises the following steps:
step 1, data pre-fetching stage: when the target vehicle just enters a communication range set by the road;
1a) registering the characteristic information of the vehicle, and randomly selecting a communication range of a road device with the nearest distance for the target vehicle to enter;
1b) the target vehicle sends a downloading request to a remote data server;
1c) the target vehicle sends a request for appropriately prefetching the residual part of the file to the next two adjacent road devices;
step 2, data downloading stage: when the target vehicle and the reverse cooperative vehicle are within the coverage of the road arrangement;
2a) by adopting a priority mechanism, the target vehicle directly downloads data from the nearest road arrangement through V2I communication;
2b) the next two adjacent road arrangements respectively select a plurality of vehicles to form a cluster, and the cluster members also adopt the mode in 2a) to download part of files for the target vehicles from the adjacent road arrangements in a cooperation manner;
step 3, data forwarding stage: when the target vehicle and the cluster member meet in the blind area;
3a) the target vehicle receives data from multiple clusters via V2V communication.
As a further aspect of the invention, wherein in step 2a) the amount of data E [ D ] that the target vehicle can receive from the road infrastructure in one cycle is calculatedI]The calculation formula is as follows:
Figure BDA0001424807280000021
wherein: m is the number of intervals divided according to the communication rate, and the communication rate of the M intervals can be expressed as: w ═ W1,W2,...,WM}，τiIndicating the time the target vehicle lingers in the ith zone.
As a further aspect of the present invention, wherein the target vehicle is calculated to be [0, t ] in the step 2b)]Average amount of data D that can be downloadedaveThe calculation formula is as follows:
Figure BDA0001424807280000022
wherein: p is a radical of0Indicating a probability of at least one cooperating vehicle being present in a coverage area of the roadway; p is a radical ofcRepresenting the probability that c cooperative vehicles exist in the coverage area of the road arrangement at the same time; m represents that the road arrangement coverage area is divided into M areas; wiThe transmission rate of the ith area in the routing coverage range is represented; lambda [ alpha ]wIs a parameter when an inverted vehicle arrives in poisson; t isiIs the target vehicle's sojourn time in the ith zone; t is the time required by the target vehicle to drive through two adjacent roads at a constant speed, and is also the cycle time.
As a further aspect of the present invention, wherein the data amount E [ D ] that can be obtained when the target vehicle passes through the blind area is calculated in said step 3a)V]The calculation formula is as follows:
Figure BDA0001424807280000031
wherein: e [ L ]c]Is the length of the ideal cluster, E [ L ]inter]Is the ideal spacing between two clusters, r is the communication distance between vehicles, ve,vwThe traveling speeds of the forward vehicle and the reverse vehicle, respectively, and w is the vehicle-to-vehicle communication rate.
The invention has the beneficial effects that: the invention designs a simple analysis framework for the throughput of downloaded files, combines a data prefetching mechanism and a carrying-forwarding mechanism, can further reduce blind areas, indirectly expand the coverage area of RSUs to meet the requirement of large-scale content downloading, improve the file downloading quality, meet the requirement of users, can be used for communication between vehicles and road facilities and between vehicles, and solve the problems of small communication coverage area and large communication blind area caused by the sparse distribution of the RSUs and the rapid movement of the vehicles on a highway.
Drawings
FIG. 1 is a diagram of a scenario in which the present invention is used;
fig. 2 is a flow chart of an implementation of the present invention.
Detailed Description
The invention is described in detail below with reference to the figures and specific embodiments.
The overall design of the invention is as follows: randomly selecting a target vehicle to enter a road set RSU closest to the vehicleiThe communication range of (1) sending a request for downloading data to a remote data server, sending a request for prefetching data to a plurality of selected RSUs, then selecting reverse vehicles to form linear clusters, and downloading partial file contents respectively when cluster members drive through the selected RSUs in sequence. And finally, when the target vehicle and the cluster member meet in the blind area, the cluster member forwards the downloaded data to the target vehicle, so that the blind area is reduced, and the data downloading amount is increased.
Referring to fig. 1, the present invention uses a scenario in which two vehicles running in opposite directions are distributed on a section of a road, and the road is regularly distributed on a road on one side of the two lanes by a distance d. Wherein R is the wireless communication range of a certain road device, 2R is the road length that the vehicle can directly communicate with the certain road device,
Figure BDA0001424807280000041
are all areas uncovered by road installations (blind areas), in which
Figure BDA0001424807280000042
Is the front half of the blind area,
Figure BDA0001424807280000043
is the rear half part of the blind area,
Figure BDA0001424807280000044
length of (1) and
Figure BDA0001424807280000045
are equal.
Referring to fig. 2, the detailed implementation steps of the present invention are as follows:
step 1: and (6) data prefetching.
1a) Registering feature information of a vehicle
The characteristic information can be represented by a three-dimensional array < idi,vi,tiIs represented by, wherein idiIs an identifier of the vehicle, viIs the speed of the vehicle, tiIs the current time;
1a) randomly selecting a target vehicle to enter the RSUiCommunication range of
Assuming that vehicles arrive in an approximate poisson process and the traffic flow densities in one direction are all constant rho, the arrival rate lambda of the vehicles is:
Figure BDA0001424807280000046
wherein: v. offIs the maximum speed, p, allowed for the vehiclejamIs the traffic jam density at which the traffic flow tends to stop;
1b) target vehicle sends download request to remote data server
Broadcasting own idle state information when the router service finishes one request; when a node with a downloading requirement listens the idle state information, sending request information to the router;
1c) the target vehicle gives two adjacent Road Sets (RSU)i+1,RSUi+2) A request is issued to appropriately prefetch the remaining portion of the file, respectively.
Step 2: and (6) downloading data.
2a) With the prioritization mechanism, the target vehicle communicates directly from the RSU via V2IiTo download data
It is assumed that the priority of communication between the vehicle and the road device is higher than the priority of communication between the vehicle and the vehicle, i.e., the target vehicle cannot communicate with other vehicles when downloading data from the road device. And assuming that the communication speed between the vehicle and the road arrangement is only dependent on the distance between the target vehicle and the corresponding road arrangement, the data quantity E [ D ] that the target vehicle can receive from the road arrangement in one periodI]Comprises the following steps:
Figure BDA0001424807280000051
wherein: m is the number of intervals divided according to the communication rate, and the communication rate of the M intervals can be expressed as: w ═ W1,W2,...,WM}，τiTo representThe time that the target vehicle lingers in the ith zone;
2b)RSUi+1and RSUi+2Selecting a number of vehicles to form a cluster, respectively, the cluster members likewise taking the form of 2a) for the target vehicle from the RSUi+1Or RSUi+2Process collaborative download of partial files
On-highway VANET networks are prone to intermittent connectivity, so it is necessary to assemble cooperating vehicles into a linear cluster. Target vehicle is at [0, t]Average amount of data D that can be downloadedaveComprises the following steps:
Figure BDA0001424807280000052
wherein: p is a radical of0Indicating a probability of at least one cooperating vehicle being present in a coverage area of the roadway; p is a radical ofcRepresenting the probability that c cooperative vehicles exist in the coverage area of the road arrangement at the same time; m represents that the road arrangement coverage area is divided into M areas; wiThe transmission rate of the ith area in the routing coverage range is represented; lambda [ alpha ]wIs a parameter when an inverted vehicle arrives in poisson; t isiIs the target vehicle's sojourn time in the ith zone; t is the time required by the target vehicle to drive through two adjacent roads at a constant speed, and is also the cycle time.
And step 3: and (6) forwarding the data.
3a) Target vehicles receive data from multiple clusters via V2V communication
Cooperating vehicles tend to be clustered, with vehicles in successive clusters typically moving a relatively large distance apart. The amount of data that the target vehicle can obtain via V2V communication depends on the one hand on the number of clusters that the target vehicle can encounter; on the other hand, it is also limited by the amount of data that the cluster can transmit to the target vehicle. The amount of data E D that can be obtained when the target vehicle passes through the blind zone, assuming that sufficient data is available for each cluster to transmit to the target vehicleV]Comprises the following steps:
Figure BDA0001424807280000061
wherein: e [ L ]c]Is the length of the ideal cluster, E [ L ]inter]Is the ideal spacing between two clusters, r is the communication distance between vehicles, ve,vwThe traveling speeds of the forward vehicle and the reverse vehicle, respectively, and w is the vehicle-to-vehicle communication rate.
The invention combines the data pre-fetching and carrying-forwarding mechanism, can further reduce the blind area, indirectly expand the coverage area of the RSU, meet the requirement of large-scale content downloading, improve the file downloading quality, meet the user requirement, can be used for the communication between vehicles and road facilities and between vehicles, and solves the problems of small communication coverage area and large communication blind area caused by the sparse distribution of the RSU and the rapid movement of the vehicles on the expressway.
The foregoing is a preferred embodiment of the present invention, and it will be apparent to those skilled in the art that variations, modifications, substitutions and alterations can be made in the embodiment without departing from the principles and spirit of the invention.

Claims (6)

1.一种基于预取的文件协作下载方法，其特征在于，包括如下步骤：1. a file collaboration download method based on prefetching, is characterized in that, comprises the steps: 步骤1：数据预取，发生在目标车辆刚驶入路设的通信范围时；Step 1: Data prefetching occurs when the target vehicle has just entered the communication range of the road set; 1a)注册车辆的特征信息，随机选择目标车辆进入距离最近的路设的通信范围；1a) Register the characteristic information of the vehicle, and randomly select the target vehicle to enter the communication range of the nearest road set; 1b)目标车辆给远程数据服务器发送下载请求；1b) The target vehicle sends a download request to the remote data server; 1c)目标车辆给下两个相邻的路设别发出适当预取剩余部分文件的请求；1c) The target vehicle sends a request to properly prefetch the remaining part of the file to the next two adjacent road devices; 步骤2：数据下载，发生在目标车辆和反向协作车辆在路设的覆盖范围内时；Step 2: Data download occurs when the target vehicle and the reverse cooperative vehicle are within the coverage of the road design; 2a)采用优先机制，目标车辆通过V2I通信直接从距离最近的路设处下载数据；2a) Using the priority mechanism, the target vehicle directly downloads data from the nearest road facility through V2I communication; 2b)下两个相邻的路设分别选择一些车辆形成簇，簇成员同样采用2a)中的方式为目标车辆从相邻路设处协作下载部分文件；2b) The next two adjacent road sets respectively select some vehicles to form clusters, and the cluster members also use the method in 2a) to collaboratively download some files from the adjacent road sets for the target vehicle; 步骤3：数据转发，发生在目标车辆和簇成员在盲区相遇时；Step 3: Data forwarding, which occurs when the target vehicle and the cluster member meet in the blind spot; 3a)目标车辆通过V2V通信从多个簇中接收数据，其中计算目标车辆通过盲区时可以获得的数据量E[DV]，其计算公式如下：3a) The target vehicle receives data from multiple clusters through V2V communication, wherein the amount of data E[D V ] that can be obtained when the target vehicle passes through the blind spot is calculated, and the calculation formula is as follows:
Figure FDA0002317544390000011
Figure FDA0002317544390000011
 其中：E[Lc]是理想的簇的长度，E[Linter]是两个簇之间的理想间隔，r是车辆之间的通信距离，ve,vw分别是正向车辆和反向车辆的行驶速度，w是车与车之间的通信速率，d是路设规律地分布在双车道一侧的道路上的距离，R是某个路设的无线通信范围。where: E[L c ] is the length of the ideal cluster, E[L inter ] is the ideal interval between two clusters, r is the communication distance between vehicles, v e , v w are the forward vehicle and reverse, respectively The running speed of the vehicle, w is the communication rate between vehicles, d is the distance that the road devices are regularly distributed on one side of the two-lane road, and R is the wireless communication range of a road device. 2.根据权利要求1所述的基于预取的文件协作下载方法，其特征在于，其中步骤2a)中计算目标车辆在一个周期里可以从路设接收到的数据量E[DI]，其计算公式如下：2. the prefetch-based file cooperative downloading method according to claim 1, wherein in the step 2a), calculate the amount of data E[D I ] that the target vehicle can receive from the road set in a cycle, which Calculated as follows:
Figure FDA0002317544390000021
Figure FDA0002317544390000021
 其中：M是根据通信速率划分的区间个数，这M个区间的通信速率可以表示为：W＝{W1,W2,...,WM}，τi表示目标车辆在第i个区域逗留的时间。Among them: M is the number of intervals divided according to the communication rate, the communication rate of these M intervals can be expressed as: W={W 1 ,W 2 ,...,W M }, τ i indicates that the target vehicle is in the ith time spent in the area. 3.根据权利要求1中所述的基于预取的文件协作下载方法，其特征在于，其中所述步骤2b)中计算目标车辆在[0,t]内可以下载的平均数据量Dave，其计算公式如下：3. The prefetch-based file cooperative downloading method according to claim 1, wherein in the step 2b), the average data amount Dave that can be downloaded by the target vehicle in [0, t] is calculated, which is Calculated as follows:
Figure FDA0002317544390000022
Figure FDA0002317544390000022
 其中：p0表示在路设的覆盖范围里至少存在一个协作车辆的概率；pc表示在路设的覆盖范围里同时存在c个协作车辆的概率；M表示路设覆盖范围被分成了M个区域；Wi表示路设覆盖范围内的第i个区域的传输速率；λw是反向车辆以泊松到达时的参数；Ti是目标车辆在第i个区域的逗留时间；T是目标车辆匀速驶过两个相邻路设所需要的时间，也是周期时间。Among them: p 0 represents the probability that there is at least one cooperative vehicle in the coverage area of the road design; p c represents the probability that c cooperative vehicles exist in the coverage area of the road design at the same time; M means that the coverage area of the road design is divided into M area; Wi represents the transmission rate of the ith area within the coverage of the road set; λw is the parameter when the reverse vehicle arrives in Poisson; T i is the stay time of the target vehicle in the ith area; T is the target The time required for a vehicle to drive through two adjacent road sets at a constant speed is also the cycle time. 4.根据权利要求1中所述的基于预取的文件协作下载方法，其特征在于，所述步骤1中注册车辆特征信息用一个三维数组＜idi,vi,ti＞表示，其中idi是车辆的标识符，vi是车辆的速度，ti是当前的时间。4. The prefetch-based collaborative file downloading method according to claim 1, wherein the registered vehicle feature information in the step 1 is represented by a three-dimensional array <id i ,vi ,t i >, wherein id i is the identifier of the vehicle, v i is the speed of the vehicle, and t i is the current time. 5.根据权利要求1中所述的基于预取的文件协作下载方法，其特征在于，所述步骤1中，随机选择目标车辆进入距离最近的路设的通信范围车辆的到达率为：假设车辆以近似泊松过程到达，且单方向的交通流密度均为常数ρ，则车辆的到达率λ为：5. The prefetch-based file cooperative downloading method according to claim 1, wherein in the step 1, the target vehicle is randomly selected to enter the communication range of the nearest road set and the arrival rate of the vehicle is: assuming that the vehicle Arrival by an approximate Poisson process, and the traffic flow density in one direction is constant ρ, then the arrival rate λ of the vehicle is:
Figure FDA0002317544390000031
Figure FDA0002317544390000031
 其中：vf是车辆允许的最大速度，ρjam是交通流趋向于停止时的交通堵塞密度。where: v f is the maximum speed allowed for the vehicle and ρ jam is the density of traffic jams when the traffic flow tends to stop. 6.根据权利要求1中所述的基于预取的文件协作下载方法，其特征在于，所述步骤1b)具体为当路设服务完了一个请求时，广播自己的空闲状态信息；当有下载需求的节点侦听到该空闲状态信息时，给路设发送请求信息。6. according to the prefetch-based file collaboration downloading method described in claim 1, it is characterized in that, described step 1b) is specifically when the road set service finished a request, broadcast own idle state information; When there is download demand When the node of the node detects the idle state information, it sends request information to the road device.
CN201710910561.9A 2017-09-29 2017-09-29 File cooperation downloading method based on prefetching Active CN107786941B (en)

Priority Applications (1)

Application Number Priority Date Filing Date Title
CN201710910561.9A CN107786941B (en) 2017-09-29 2017-09-29 File cooperation downloading method based on prefetching

Applications Claiming Priority (1)

Application Number Priority Date Filing Date Title
CN201710910561.9A CN107786941B (en) 2017-09-29 2017-09-29 File cooperation downloading method based on prefetching

Publications (2)

Publication Number Publication Date
CN107786941A CN107786941A (en) 2018-03-09
CN107786941B true CN107786941B (en) 2020-03-31

Family

ID=61434425

Family Applications (1)

Application Number Title Priority Date Filing Date
CN201710910561.9A Active CN107786941B (en) 2017-09-29 2017-09-29 File cooperation downloading method based on prefetching

Country Status (1)

Country Link
CN (1) CN107786941B (en)

Families Citing this family (5)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
CN109495561B (en) * 2018-11-07 2022-03-15 Oppo广东移动通信有限公司 Application download method, device, terminal and storage medium
CN109600715B (en) * 2018-11-29 2020-11-20 哈尔滨工程大学 A method for downloading auxiliary files for V2X communication of Internet of Vehicles
CN110519345B (en) * 2019-08-14 2022-04-08 杭州师范大学 A collaborative downloading method for Internet of Vehicles information security based on autonomous selection of multi-assist vehicles
CN112566070B (en) * 2020-12-09 2022-08-09 重庆邮电大学 Cooperative data transmission method in Internet of vehicles environment
CN117376848A (en) * 2023-12-07 2024-01-09 南昌大学 A road urban sensing system based on highway vehicle network

Citations (4)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
CN103491186A (en) * 2013-09-30 2014-01-01 中国石油大学(华东) Vehicle internet assisting downloading method based on dynamic time slot
CN104601667A (en) * 2014-12-23 2015-05-06 武汉大学 Gapless vehicle networking assist downloading method
CN105430616A (en) * 2015-12-04 2016-03-23 深圳北航新兴产业技术研究院 Data scheduling method based on vehicle collaboration in urban scene
CN105871831A (en) * 2016-03-28 2016-08-17 江苏大学 Data fragmenting and downloading service method in vehicular network

Patent Citations (4)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
CN103491186A (en) * 2013-09-30 2014-01-01 中国石油大学(华东) Vehicle internet assisting downloading method based on dynamic time slot
CN104601667A (en) * 2014-12-23 2015-05-06 武汉大学 Gapless vehicle networking assist downloading method
CN105430616A (en) * 2015-12-04 2016-03-23 深圳北航新兴产业技术研究院 Data scheduling method based on vehicle collaboration in urban scene
CN105871831A (en) * 2016-03-28 2016-08-17 江苏大学 Data fragmenting and downloading service method in vehicular network

Non-Patent Citations (1)

* Cited by examiner, † Cited by third party
Title
MobTorrent:A Framework for Mobile Internet Access from Vehicles;BinBin Chen;《IEEE INFOCOM 2009》;20090425;摘要，正文第3节 *

Also Published As

Publication number Publication date
CN107786941A (en) 2018-03-09

Similar Documents

Publication Publication Date Title
CN107786941B (en) File cooperation downloading method based on prefetching
Chen et al. CVCG: Cooperative V2V-aided transmission scheme based on coalitional game for popular content distribution in vehicular ad-hoc networks
Liu et al. The sharing at roadside: Vehicular content distribution using parked vehicles
Quan et al. Social cooperation for information-centric multimedia streaming in highway VANETs
Kumar et al. Peer-to-peer cooperative caching for data dissemination in urban vehicular communications
CN108990016B (en) A kind of calculating task unloading of more vehicles collaboration and transmission method
CN109600715B (en) A method for downloading auxiliary files for V2X communication of Internet of Vehicles
Huang et al. ECDS: Efficient collaborative downloading scheme for popular content distribution in urban vehicular networks
Babu et al. DTMR: An adaptive distributed tree-based multicast routing protocol for vehicular networks
Wang et al. Survey on cooperatively V2X downloading for intelligent transport systems
CN110248392B (en) Opportunity forwarding method based on node efficiency in Internet of vehicles
CN113347606B (en) V2I/V2V network cooperative transmission method and system based on elastic partition
Gasmi et al. Geographical information based clustering algorithm for internet of vehicles
Brik et al. ECDGP: extended cluster‐based data gathering protocol for vehicular networks
CN105873165B (en) A Cross-Layer Vehicle Network Routing Method Based on Forwarding Efficiency Prediction
Luan et al. Enabling content distribution in vehicular ad hoc networks
Badole et al. An optimized framework for VANET routing: A multi-objective hybrid model for data synchronization with digital twin
CN111194018A (en) Vehicle ad hoc network-oriented mobile edge data uploading method and system
WO2020186655A1 (en) Content forwarding node selection method in vehicle-mounted ad hoc network based on service type
Naouri et al. BusCache: V2V-based infrastructure-free content dissemination system for Internet of Vehicles
CN105933855B (en) Data download method of Internet of Vehicles based on user satisfaction
Husain et al. A receiver-based forwarding scheme to minimize multipath formation in VANET
Jeevitha et al. CPDD: Clustering and probabilistic based data dissemination in vehicular adhoc networks
Hsieh et al. Road layout adaptive overlay multicast for urban vehicular ad hoc networks
Chen et al. A data dissemination strategy in SDN enabled vehicular networks

Legal Events

Date Code Title Description
PB01 Publication
PB01 Publication
SE01 Entry into force of request for substantive examination
SE01 Entry into force of request for substantive examination
GR01 Patent grant
GR01 Patent grant