CN108990016A - A kind of calculating task unloading of more vehicles collaboration and transmission method - Google Patents
A kind of calculating task unloading of more vehicles collaboration and transmission method Download PDFInfo
- Publication number
- CN108990016A CN108990016A CN201810938485.7A CN201810938485A CN108990016A CN 108990016 A CN108990016 A CN 108990016A CN 201810938485 A CN201810938485 A CN 201810938485A CN 108990016 A CN108990016 A CN 108990016A
- Authority
- CN
- China
- Prior art keywords
- vehicle
- opposed
- demand
- calculating task
- rsu
- Prior art date
- Legal status (The legal status is an assumption and is not a legal conclusion. Google has not performed a legal analysis and makes no representation as to the accuracy of the status listed.)
- Granted
Links
Classifications
-
- H—ELECTRICITY
- H04—ELECTRIC COMMUNICATION TECHNIQUE
- H04W—WIRELESS COMMUNICATION NETWORKS
- H04W4/00—Services specially adapted for wireless communication networks; Facilities therefor
- H04W4/30—Services specially adapted for particular environments, situations or purposes
- H04W4/40—Services specially adapted for particular environments, situations or purposes for vehicles, e.g. vehicle-to-pedestrians [V2P]
- H04W4/44—Services specially adapted for particular environments, situations or purposes for vehicles, e.g. vehicle-to-pedestrians [V2P] for communication between vehicles and infrastructures, e.g. vehicle-to-cloud [V2C] or vehicle-to-home [V2H]
-
- G—PHYSICS
- G06—COMPUTING; CALCULATING OR COUNTING
- G06N—COMPUTING ARRANGEMENTS BASED ON SPECIFIC COMPUTATIONAL MODELS
- G06N3/00—Computing arrangements based on biological models
- G06N3/12—Computing arrangements based on biological models using genetic models
- G06N3/126—Evolutionary algorithms, e.g. genetic algorithms or genetic programming
-
- 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/01—Protocols
- H04L67/10—Protocols in which an application is distributed across nodes in the network
-
- 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/10—Protocols in which an application is distributed across nodes in the network
- H04L67/104—Peer-to-peer [P2P] networks
- H04L67/1074—Peer-to-peer [P2P] networks for supporting data block transmission mechanisms
- H04L67/1078—Resource delivery mechanisms
- H04L67/108—Resource delivery mechanisms characterised by resources being split in blocks or fragments
-
- 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/12—Protocols specially adapted for proprietary or special-purpose networking environments, e.g. medical networks, sensor networks, networks in vehicles or remote metering networks
-
- H—ELECTRICITY
- H04—ELECTRIC COMMUNICATION TECHNIQUE
- H04W—WIRELESS COMMUNICATION NETWORKS
- H04W4/00—Services specially adapted for wireless communication networks; Facilities therefor
- H04W4/30—Services specially adapted for particular environments, situations or purposes
- H04W4/40—Services specially adapted for particular environments, situations or purposes for vehicles, e.g. vehicle-to-pedestrians [V2P]
- H04W4/46—Services specially adapted for particular environments, situations or purposes for vehicles, e.g. vehicle-to-pedestrians [V2P] for vehicle-to-vehicle communication [V2V]
Abstract
The calculating task that the present invention discloses a kind of more vehicle collaborations unloads and transmission method, applied to onboard wireless communication technique field, to solve the problems, such as that automobile takes a long time in downloading and processing mass file, the present invention is by the requested service decomposition of demand vehicle at muti-piece subtask, allow Facing Movement vehicle that demand vehicle is allowed still to can receive file after leaving RSU coverage area by way of Collaboration computing and transmission, it can be continued to without driving to next RSU, shorten the waiting time that demand vehicle obtains and handles file；Under the premise of in view of being likely to occur V2V Communication Jamming when transmitting, the present invention selects one group without repelling each other vehicle and the file that can undertake meets the vehicles of mission requirements by genetic algorithm, corresponding calculating task unloading and transmission plan are obtained, so that the waiting time that demand vehicle obtains complete processed file is most short.
Description
Technical field
The invention belongs to wireless communication technology field, in particular to a kind of calculating task unloading and transmission technology.
Background technique
In order to solve explosive growth with terminal and application to calculating and the huge consumption problem of storage resource, move
Dynamic edge calculations (MEC) technology is deployed in the edge of network by that will calculate with storage resource, under the premise of guaranteeing low time delay,
Both it had solved terminal device to the use demand of calculating and storage resource, while having also mitigated the burden of communication network.
Currently, the research for mobile edge calculations has:
(1) it calculates and storage resource is deployed in base station (bibliography: the .Mobile- such as Zhang K, Mao Y, Leng S
Edge Computing for Vehicular Networks:A Promising Network Paradigm with
Predictive Off-Loading[J].IEEE Vehicular Technology Magazine,2017,12(2):36–
44.): this article proposes a kind of calculating unloading frame based on cloud for car networking scene, proposes two different unloading sides
Case: directly upload calculating task and predictable relay transmission scheme.Calculating task is according to the shifting the time required to calculating with vehicle
The adaptively selected unloading scheme of dynamic characteristic, is greatly decreased computing cost and improves the efficiency of transmission of task.However, the program is not
Consider that RSU exists and covers incomplete situation.
(2) directly using mobile terminal calculating and storage resource (bibliography: the .AVE such as Feng J, Liu Z, Wu C:
Autonomous Vehicular Edge Computing Framework with ACO-Based Scheduling[J]
.IEEE Transactions on Vehicular Technology, 2017,66 (12): 10660-10675.): this article utilizes
The idle computing resources of automobile propose a kind of automobile edge computing architecture of self-organizing formula.By the position for collecting surrounding automobile
Confidence ceases to realize efficient task buffer mechanism, meanwhile, this article uses ant colony optimization algorithm to carry out task assignment.
Automobile and infrastructure (V2I communication), automobile and automobile (V2V may be implemented in dedicated short-range communication (DSRC) technology
Communication) between communication, by immediately exchanging information, DSRC technology can provide safer environment and more for driver
Add efficient road traffic.Meanwhile various commercial application, such as charge station, advertisement dispensing, information service, entertainment service can also
Pass through the passenger services that this technology is on vehicle.
DSRC agreement is mainly made of IEEE 1609.x and IEEE 802.11p.IEEE 1609.x agreement relates generally to
MAC layers and network layer.IEEE 802.11p be it is modified in 802.11 standard of IEEE get, relate generally to physical layer
And MAC layer.For physical-layer techniques, IEEE 802.11p still uses the OFDM skill occurred in IEEE 802.11a
Art.Access for MAC layer, IEEE 802.11p use mixing synergistic function (HCF) and enhanced distributed channel access
(EDCA) technology.
It is usually difficult since the communication coverage of DSRC technology only has several hundred rice, and during the RSU of early stage deployment
To accomplish to cover comprehensively, the less region of vehicle flowrates such as similar highway is even more so, this allows for passing through RSU when automobile
The case where will appear interruption when obtaining service.Although traditional cellular network has accomplished extremely wide coverage area, lead to
The cost for crossing cellular network downloading ultra-large type file is very high, this is for allowing to select vehicle for the application there are a fixed response time
Networking downloading file is more particularly suitable.
Currently, having for the research for solving file transmission problem in car networking:
(1) (bibliography: Yu Ge, Su Wen, Yew-Hock Ang, Ying-Chang is communicated based on multi-hop V2V
Liang. Optimal Relay Selection in IEEE 802.16j Multihop Relay Vehicular
Networks [J] .IEEE Transactions on Vehicular Technology, 2010,59 (5): 2198-2206.):
This article proposes a multi-hop relay selection scheme, under the premise of considering automobile position, selects have maximum link capacity
Automobile is as relaying.But due to the variability of car networking topology and complicated wireless channel, text is transmitted by multi-hop relay
The mode of part can not ensure the handling capacity of entire Radio Link.
(2) based on storage-carrying-forwarding mode (bibliography: Wang Y, Liu Y, Zhang J, Ye H, Tan Z.
Cooperative Store-Carry-Forward Scheme for Intermittently Connected Vehicular
Networks [J] IEEE Transactions on Vehicular Technology, 2016:1-1.): this article is for double
To highway scene, a kind of scheme for selecting vehicle on the move as relaying is proposed, is travelled in the same direction from demand vehicle
Data are carried with an automobile is respectively selected in the vehicle of Facing Movement.Although demand vehicle is leaving RSU (Road Side
Unit, roadside unit) after coverage area the time of Transmission be reduced, but when due to the communication of relay vehicle and RSU
Between, the limitation such as relay vehicle self-capacity, the transmission of ultra-large type file can not be effectively treated in this scheme.
Summary of the invention
To solve the problems, such as that automobile takes a long time in downloading and processing mass file, the present invention proposes a kind of more vehicle collaborations
Calculating task unloading and transmission method, handled by opposed vehicle collaboration, shorten demand vehicle obtain processed file etc.
To the time.
The technical solution adopted by the present invention are as follows: a kind of calculating task unloading of more vehicles collaboration and transmission method are chosen several
Opposed vehicle participates in the processing of calculating task, and calculating task is resolved into corresponding several pieces of subtasks, each opposed vehicle point
Manage corresponding subtask, and the son when opposed vehicle meets with the demand vehicle filed a request, after being processed in other places
Task is transferred to demand vehicle by V2V mode.
Further, including it is following step by step:
S1, demand vehicle send the request that need to obtain certain service scripts by place RSU to server；
S2, server calculate the service scripts size to be processed calculated by the opposed vehicle of the demand vehicle according to request；
S3, server obtain calculating task unloading and transmission plan using genetic algorithm, and calculating task is unloaded and passed
Transmission scheme is sent to RSU where demand vehicle；
RSU where S4, demand vehicle is unloaded according to calculating task and transmission plan, the business to be processed that server is sent
File is cut into the block of corresponding size；
S5, where corresponding opposed vehicle enters demand vehicle when RSU coverage area, RSU where demand vehicle will be to
Processing business blocks of files is transferred to the corresponding opposed vehicle, after opposed vehicle is handled, the opposed vehicle with demand vehicle
When meeting, by it is processed at service scripts block demand vehicle is transferred to by V2V mode.
Further, the calculating formula of the file size to be processed calculated described in step S2 by the opposed vehicle of the demand vehicle
Are as follows:
Wherein, StotalThe service scripts total size of expression demand vehicle request, RRSUIndicate the communication radius of RSU, v0It indicates
Demand vehicle V0Speed,Expression demand vehicle V0At the time of issuing request,Expression demand vehicle V0Into
RSU1At the time of communication coverage, rI2VIndicate the traffic rate between RSU and automobile.
Further, step S2 further include: the determining all opposed vehicle set met with demand vehicle of server.
Further, step S2 further include: server determines the file to be processed that each opposed vehicle maximum can undertake
Size.
Further, step S3 specifically include it is following step by step:
S31, the opposed vehicle not mutually repulsive two-by-two for selecting specified quantity at random from opposed vehicle set, as heredity
An individual in algorithm initial population, the shared Q individual of the initial population of genetic algorithm；
The sum of S32, the file size to be processed that can be undertaken when all opposed vehicle maximums in certain individual are greater than step
The service scripts size to be processed that the opposed vehicle by the demand vehicle that S2 is calculated calculates, then according to fitness function
The fitness of the individual is calculated, otherwise the fitness of the individual is 0；
S33, two individuals are chosen with certain probability, as parent；
S34, crossover operation is executed to the chromosome of two obtained parent individualities of step S33, generates two new filial generations
Individual；The chromosome of the parent individuality is the number group by selecting the opposed vehicle not mutually repulsive two-by-two of specified quantity at random
At sequence；
S35, it morphs when the obtained offspring individual chromosome of step S34, then at random from the institute to meet with demand vehicle
Have and the replacement of opposed vehicle is selected to repel each other or duplicate vehicle in opposed vehicle set；
If number of individuals is less than Q in S36, current population, repeatedly step S33, S34, S35；It is no to then follow the steps S37；
S37, when meeting iteration stopping condition, obtain calculating task unloading and transmission plan；Calculating task unloading and
Transmission plan is specially that the opposed vehicle for including executes calculating task unloading and transmission in individual corresponding to highest fitness.
Further, opposed vehicle not mutually repulsive two-by-two described in step S31, specifically: if certain opposed vehicle with
When demand vehicle meets, there are other opposed vehicles also in demand vehicle communication coverage area, then these opposed vehicles with work as
Preceding opposed vehicle repels each other；Otherwise do not repel each other.
Further, if other vehicle mutual exclusions of the opposed vehicle Yu chromosome of crossover sites or repetition in step S34,
An opposed vehicle replacement is then selected to repel each other or repeat from all opposed vehicle set met with demand vehicle at random
Vehicle.
Further, iteration stopping condition are as follows: the number of iterations reaches T times, or the overall fitness that continuous n times iteration obtains
Variation is less than ε.
Beneficial effects of the present invention: method of the invention is by the calculating, communication and storage resource of Facing Movement vehicle idle
It uses, by the mobility of opposite automobile, provides processed file for demand vehicle；The present invention is by demand vehicle institute
The service decomposition of request allows Facing Movement vehicle that demand vehicle is allowed to exist by way of Collaboration computing and transmission at muti-piece subtask
It still can receive file after leaving RSU coverage area, can be continued to without driving to next RSU, shorten demand vehicle
Obtain and processing file waiting time；Under the premise of in view of being likely to occur V2V Communication Jamming when transmitting, the present invention
One group is selected without vehicle is repelled each other and the file that can undertake meets the vehicles of mission requirements by genetic algorithm, obtains corresponding calculating
Task unloading and transmission plan, so that the waiting time that demand vehicle obtains complete processed file is most short.
Detailed description of the invention
Fig. 1 is the car networking schematic diagram of a scenario of the embodiment of the present invention.
Fig. 2 is the solution of the present invention flow chart.
Fig. 3 is the genetic algorithm flow chart in the embodiment of the present invention.
Specific embodiment
For convenient for those skilled in the art understand that technology contents of the invention, with reference to the accompanying drawing to the content of present invention into one
Step is illustrated.
It is as shown in Figure 1 the car networking scene of the embodiment of the present invention, specifically: long range highway scene, two-way four
Lane, the car speed value range travelled on road are 60km/h~100km/h, are driven at a constant speed, vehicle unit arrives in the time
Quantity up to RSU obeys the Poisson distribution that intensity is λ.RSU (roadside unit) is disposed along highway, and highway is not completely covered by RSU,
Standoff distance is larger, and all RSU are connected to a background server by wired mode.As shown in Figure 1, demand vehicle passes through
RSU1The request for obtaining a certain business is issued to server, since demand vehicle is in RSU1In residence time it is limited, the file of acquisition
Size is limited, and if all files calculation processing task completed by demand vehicle oneself, it is total to spend the time longer, influence user
Experience.If making full use of the mobility of the idle computing resources of opposed vehicle, storage resource and vehicle, by text to be processed
Part resolves into suitable size, and part opposed vehicle is allowed to undertake calculating and transformation task, then can shorten demand vehicle and obtain completely
The time of processed file promotes user experience.
Based on above-mentioned scene, the present invention provides a kind of calculating task unloading of more vehicle collaborations and transmission methods, such as Fig. 2 institute
Show, comprising the following steps:
S1, demand vehicle generate after the request that remote server obtains a certain business, are sent out by place RSU to server
The service request out；
After S2, server receive request, determines the file size for needing to be calculated by opposed vehicle, be denoted as S；Server calculates
All opposed vehicle set that will be met with demand vehicle out, are denoted asServer is according to demand
Vehicle and opposed vehicle V2V communicate sustainable time, the computing capability of opposed vehicle, the factors such as memory space of opposed vehicle,
It determines the file size to be processed that each opposed vehicle maximum can undertake, is denoted as Di, i=1,2 ..., M.
Server determines the file size S calculating formula for needing to be calculated and transmitted by opposed vehicle are as follows:
Wherein, StotalThe service scripts total size of expression demand vehicle request, RRSUIndicate the communication radius of RSU, v0It indicates
Demand vehicle V0Speed,Expression demand vehicle V0At the time of issuing request,Expression demand vehicle V0Into
RSU1At the time of communication coverage, rI2VIndicate the traffic rate between RSU and automobile.
All opposed vehicle set that server determination can meet with demand vehicleTool
Body process are as follows: if opposed vehicle VjRSU will be left2At the time of coverage areaMeet condition:ThenWhereinFor demand vehicle V0RSU will be entered2Coverage area
Moment, dtjFor opposed vehicle VjThe sustainable time is communicated with demand vehicle V2V,RvehicleIndicate V2V communication
Radius, vjFor opposed vehicle VjSpeed.
Server determines the file size D to be processed that each opposed vehicle maximum can undertakei, i=1,2 ..., M, tool
Body are as follows:Wherein Indicate opposite vehicle
ViMaximum processed file size, comp before meeting with demand vehicleiFor opposed vehicle ViUnit computing capability,Indicate opposed vehicle ViLongest can use calculating time, dRSUIt indicates
RSU1And RSU2Spacing distance,Indicate opposed vehicle ViLeave RSU2At the time of coverage area,It indicates
Demand vehicle V0Leave RSU1At the time of communication coverage, viAnd v0Respectively indicate ViAnd V0Speed, RV2VIndicate V2V communication
Radius； Indicate opposed vehicle ViWith demand vehicle V0It can be transmitted when meeting by V2V communication
Handle file size, rV2VIndicate V2V traffic rate,Indicate opposed vehicle ViWith demand vehicle V0V2V when meeting
Communication can be with duration, RvehicleIndicate the radius of V2V communication；Indicate opposed vehicle ViFree memory；The expansion rate of expression demand vehicle institute requested service, i.e., processed file size S ' (are walked with untreated file size S
The ratio between the file size for needing to be calculated by opposed vehicle in rapid S2), general expansion rate is known value, by taking video decodes as an example,
So S is to need decoded file size, and the decoded file size of S ' expression, α here can be understood as compression factor, table
It can be expanded after showing file decoding.
S3, server calculate opposed vehicle V according to the speed of each opposed vehicleiWith demand vehicle V0When meeting, position
In demand vehicle V0Other opposed vehicles in communication range, and remember that these vehicles are opposed vehicle ViThe vehicle that repels each other, with ViPhase
The vehicle set of reprimand is denoted asIf it does not exist with ViThe opposed vehicle to repel each other, thenThe purpose for determining the vehicle that repels each other is: since automobile is using the identical V2V communication resource, if there is more
Vehicle is all in the communication range of demand vehicle, and at the same time can generate serious interference problem when transmitting file to demand vehicle.
Therefore, allowing repel each other in vehicle can only at most have a vehicle to participate in calculating and transformation task, then can eliminate this problem.Judge VjWith Vi
The method whether repelled each other specifically: if | disi-disj|≤RV2V, then opposed vehicle VjWith ViRepel each other.
Wherein,Indicate opposed vehicle ViLeaving RSU2After arrive
Encounter demand vehicle V0When the distance that runs over.
S4, can only use N (N≤M) vehicle execute calculate and the limitation of transformation task under, server is calculated using heredity
Method selects N not mutually repulsive opposed vehicle two-by-two, noteFor its composition set so that meetingItem
Under part, the time that demand vehicle receives complete processed file is most short.
For the genetic algorithm in step S4, as shown in figure 3, detailed process are as follows:
S41, from opposed vehicle setIn select at random N two-by-two not mutually repulsive vehicle as initial kind of genetic algorithm
An individual in group, noteFor first of individual, the shared Q individual of the initial population of genetic algorithm.
S42, according to fitness functionCalculate individualFitness, if
It is then individualFitnessWherein,
max{...,etk... } and indicate individualAt the time of last in N vehicle for being included and demand vehicle meet；E is certainly
The right logarithm truth of a matter,Indicate individualIn N vehicle for being included, possess the vehicle and demand vehicle at maximum moment of meeting
The order that meets,
S43, according to probability two individuals are selected from population, as the parent for generating two offspring individuals, chooses individualProbability as one of parent is
S44, crossover operation is executed to the chromosome of two parent individualities obtained by step S43, generates two new sons
Generation individual, individual chromosome are the sequence being made of the number of N vehicle.If the vehicle of crossover sites and other vehicles of chromosome
Mutual exclusion or repetition, then at random from setMiddle selection vehicle replacement repels each other or duplicate vehicle, until newly generated filial generation
There is no repel each other or duplicate vehicle in individual.
S45, the offspring individual chromosome obtained by step S44 have certain probability and morph, mutation probability ρ.
If morphing, from setIn select one at random and do not repel each other with other individual vehicles and the replacement of unduplicated vehicle occurs
The vehicle of variation.
S46, judge whether number of individuals reaches Q in population of new generation, if not up to, repeatedly step S43, S44, S45；
S47, judge whether algorithm meets termination condition, if the number of iterations reaches T times, or continuous n times iteration obtain it is total
The variation of body fitness is less than ε, then stops iteration, using the individual with highest fitness as last solution.
Q, T value are bigger in the present embodiment, and ε value is smaller, and final iteration result more approaches optimal solution；In practice according to need
Value is carried out to Q, T, ε.
The need that S5, server request the calculating task obtained by genetic algorithm unloading and transmission plan and demand vehicle
The file for being calculated by opposed vehicle and being transmitted is sent to RSU2, RSU2Scheme is unloaded by file cutting to be processed according to calculating task
At the block of corresponding size, when corresponding vehicle enters RSU2When coverage area, RSU2File to be processed is transferred to the vehicle, which receives
Start to execute calculating task after to file and store processed file, with demand vehicle V0Processed file is passed through when meeting
V2V mode is transferred to V0。
It can be seen from above-described embodiment that the present invention downloads text to be processed using the communication resource of opposed vehicle free time
Part transmits processed file to demand vehicle, using the mobility of opposed vehicle demand reduction vehicle obtain it is complete processed
The time of file, while calculated using opposed vehicle with storage resource is the processing of demand vehicle and store files in advance, more into one
Step saves the time.The present invention formulates calculating task unloading and the transmission plan of business using genetic algorithm, is selected by genetic algorithm
It does not interfere with each other and calculates and transformation task deadline shortest opposed vehicle undertakes task for one group out, be effectively improved user's body
It tests.
Those of ordinary skill in the art will understand that the embodiments described herein, which is to help reader, understands this hair
Bright principle, it should be understood that protection scope of the present invention is not limited to such specific embodiments and embodiments.For ability
For the technical staff in domain, the invention may be variously modified and varied.All within the spirits and principles of the present invention, made
Any modification, equivalent substitution, improvement and etc. should be included within scope of the presently claimed invention.
Claims (9)
1. calculating task unloading and the transmission method of a kind of more vehicle collaborations, which is characterized in that choose several opposed vehicles and participate in meter
The processing of calculation task, and calculating task is resolved into corresponding several pieces of subtasks, each opposed vehicle handles respective corresponding respectively
Subtask, and when opposed vehicle meets with the demand vehicle filed a request, the subtask after being processed to passes through V2V mode
It is transferred to demand vehicle.
2. calculating task unloading and the transmission method of a kind of more vehicle collaborations according to claim 1, which is characterized in that including
Below step by step:
S1, demand vehicle send the request that need to obtain certain service scripts by place RSU to server；
S2, server calculate the service scripts size to be processed calculated by the opposed vehicle of the demand vehicle according to request；
S3, server using genetic algorithm obtain calculating task unloading and transmission plan, and by calculating task unloading and transmission side
Case is sent to RSU where demand vehicle；
RSU where S4, demand vehicle is unloaded according to calculating task and transmission plan, the service scripts to be processed that server is sent
It is cut into the block of corresponding size；
S5, where corresponding opposed vehicle enters demand vehicle when RSU coverage area, RSU where demand vehicle will be to be processed
Service scripts block is transferred to the corresponding opposed vehicle, and after opposed vehicle is handled, which meets with demand vehicle
When, by it is processed at service scripts block demand vehicle is transferred to by V2V mode.
3. calculating task unloading and the transmission method of a kind of more vehicle collaborations according to claim 2, which is characterized in that step
The calculating formula of the file size to be processed calculated described in S2 by the opposed vehicle of the demand vehicle are as follows:
Wherein, StotalThe service scripts total size of expression demand vehicle request, RRSUIndicate the communication radius of RSU, v0Expression demand
Vehicle V0Speed,Expression demand vehicle V0At the time of issuing request,Expression demand vehicle V0Into RSU1
At the time of communication coverage, rI2VIndicate the traffic rate between RSU and automobile.
4. calculating task unloading and the transmission method of a kind of more vehicle collaborations according to claim 3, which is characterized in that step
S2 further include: the determining all opposed vehicle set met with demand vehicle of server.
5. calculating task unloading and the transmission method of a kind of more vehicle collaborations according to claim 4, which is characterized in that step
S2 further include: server determines the file size to be processed that each opposed vehicle maximum can undertake.
6. calculating task unloading and the transmission method of a kind of more vehicle collaborations according to claim 2, which is characterized in that step
S3 specifically include it is following step by step:
S31, the opposed vehicle not mutually repulsive two-by-two for selecting specified quantity at random from opposed vehicle set, as genetic algorithm
An individual in initial population, the shared Q individual of the initial population of genetic algorithm；
The sum of S32, the file size to be processed that can be undertaken when all opposed vehicle maximums in certain individual are greater than step S2 and count
The service scripts size to be processed that the obtained opposed vehicle by the demand vehicle calculates, then being calculated according to fitness function should
The fitness of individual, otherwise the fitness of the individual is 0；
S33, two individuals are chosen with certain probability, as parent；
S34, crossover operation is executed to the chromosome of two obtained parent individualities of step S33, generates two new offspring individuals；
The chromosome of the parent individuality is to be made of the number for selecting the opposed vehicle not mutually repulsive two-by-two of specified quantity at random
Sequence；
S35, it morphs when the obtained offspring individual chromosome of step S34, then it is all right from meeting with demand vehicle at random
The replacement of opposed vehicle is selected to repel each other or duplicate vehicle into vehicle set；
If number of individuals is less than Q in S36, current population, repeatedly step S33, S34, S35；It is no to then follow the steps S37；
S37, when meeting iteration stopping condition, obtain calculating task unloading and transmission plan；The calculating task unloading and transmission
Scheme is specially that the opposed vehicle for including executes calculating task unloading and transmission in individual corresponding to highest fitness.
7. calculating task unloading and the transmission method of a kind of more vehicle collaborations according to claim 6, which is characterized in that step
Opposed vehicle not mutually repulsive two-by-two described in S31, specifically: if certain opposed vehicle and demand vehicle meet, there are other
Opposed vehicle is also in demand vehicle communication coverage area, then these other opposed vehicles repel each other with current opposed vehicle；Otherwise
Do not repel each other.
8. calculating task unloading and the transmission method of a kind of more vehicle collaborations according to claim 7, which is characterized in that in step
If the opposed vehicle of crossover sites and other vehicle mutual exclusions of chromosome or repetition, meet from demand vehicle at random in rapid S34
All opposed vehicle set in selection one opposed vehicle replacement repel each other or duplicate vehicle.
9. calculating task unloading and the transmission method of a kind of more vehicle collaborations according to claim 6, which is characterized in that iteration
Stop condition are as follows: the number of iterations reaches T times, or the overall fitness variation that continuous n times iteration obtains is less than ε.
Priority Applications (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN201810938485.7A CN108990016B (en) | 2018-08-17 | 2018-08-17 | A kind of calculating task unloading of more vehicles collaboration and transmission method |
Applications Claiming Priority (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN201810938485.7A CN108990016B (en) | 2018-08-17 | 2018-08-17 | A kind of calculating task unloading of more vehicles collaboration and transmission method |
Publications (2)
| Publication Number | Publication Date |
|---|---|
| CN108990016A true CN108990016A (en) | 2018-12-11 |
| CN108990016B CN108990016B (en) | 2019-11-26 |
Family
ID=64554130
Family Applications (1)
| Application Number | Title | Priority Date | Filing Date |
|---|---|---|---|
| CN201810938485.7A Active CN108990016B (en) | 2018-08-17 | 2018-08-17 | A kind of calculating task unloading of more vehicles collaboration and transmission method |
Country Status (1)
| Country | Link |
|---|---|
| CN (1) | CN108990016B (en) |
Cited By (13)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN109756378A (en) * | 2019-01-12 | 2019-05-14 | 大连理工大学 | A kind of intelligence computation discharging method under In-vehicle networking |
| CN110097753A (en) * | 2019-04-04 | 2019-08-06 | 安徽中交汇能网络科技有限公司 | Method for early warning, device, system and the road monitoring device of second accident |
| CN110234092A (en) * | 2019-06-14 | 2019-09-13 | 长安大学 | The method for improving car networking transmission signal reliability based on multilevel optimization |
| CN110519345A (en) * | 2019-08-14 | 2019-11-29 | 杭州师范大学 | Based on the car networking information securities cooperation method for down loading for assisting vehicle independently to select more |
| CN111148110A (en) * | 2020-03-30 | 2020-05-12 | 汉腾汽车有限公司 | Vehicle networking road side unit deployment method based on genetic ant colony hybrid algorithm |
| CN111385734A (en) * | 2020-02-19 | 2020-07-07 | 重庆邮电大学 | Internet of vehicles content caching decision optimization method |
| CN111464976A (en) * | 2020-04-21 | 2020-07-28 | 电子科技大学 | Vehicle task unloading decision and overall resource allocation method based on fleet |
| CN111526495A (en) * | 2020-04-22 | 2020-08-11 | 华中科技大学 | Internet of vehicles AoI optimization task unloading method based on improved genetic algorithm |
| CN111611063A (en) * | 2020-05-27 | 2020-09-01 | 江南大学 | Cloud-aware mobile fog computing system task unloading method based on 802.11p |
| CN111970318A (en) * | 2020-05-18 | 2020-11-20 | 北京邮电大学 | Vehicle and roadside unit cooperative task unloading method and device based on mobile edge calculation |
| CN112512018A (en) * | 2020-07-24 | 2021-03-16 | 北京航空航天大学 | Method for dynamically unloading tasks among cooperative vehicles based on mobile edge calculation |
| CN112566070A (en) * | 2020-12-09 | 2021-03-26 | 重庆邮电大学 | Cooperative data transmission method in Internet of vehicles environment |
| CN112929850A (en) * | 2021-02-02 | 2021-06-08 | 天津理工大学 | Internet of vehicles data returning method facing edge computing environment |
Citations (3)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN104158855A (en) * | 2014-07-24 | 2014-11-19 | 浙江大学 | Mobile service combined calculation discharge method based on genetic algorithm |
| US20180183855A1 (en) * | 2016-12-28 | 2018-06-28 | Intel Corporation | Application computation offloading for mobile edge computing |
| CN108259573A (en) * | 2017-12-26 | 2018-07-06 | 西安电子科技大学 | A kind of vehicle self-organizing network system for mixing SDN and mist and calculating |
-
2018
- 2018-08-17 CN CN201810938485.7A patent/CN108990016B/en active Active
Patent Citations (3)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN104158855A (en) * | 2014-07-24 | 2014-11-19 | 浙江大学 | Mobile service combined calculation discharge method based on genetic algorithm |
| US20180183855A1 (en) * | 2016-12-28 | 2018-06-28 | Intel Corporation | Application computation offloading for mobile edge computing |
| CN108259573A (en) * | 2017-12-26 | 2018-07-06 | 西安电子科技大学 | A kind of vehicle self-organizing network system for mixing SDN and mist and calculating |
Non-Patent Citations (1)
| Title |
|---|
| GUANHUA QIAO 等: "Collaborative Task Offloading in Vehicular Edge Multi-Access Networks", 《IEEE COMMUNICATIONS MAGAZINE》 * |
Cited By (20)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN109756378B (en) * | 2019-01-12 | 2021-07-16 | 大连理工大学 | Intelligent computing unloading method under vehicle-mounted network |
| CN109756378A (en) * | 2019-01-12 | 2019-05-14 | 大连理工大学 | A kind of intelligence computation discharging method under In-vehicle networking |
| CN110097753A (en) * | 2019-04-04 | 2019-08-06 | 安徽中交汇能网络科技有限公司 | Method for early warning, device, system and the road monitoring device of second accident |
| CN110234092A (en) * | 2019-06-14 | 2019-09-13 | 长安大学 | The method for improving car networking transmission signal reliability based on multilevel optimization |
| CN110234092B (en) * | 2019-06-14 | 2022-04-29 | 长安大学 | Method for improving reliability of internet-of-vehicles transmission signals based on multi-stage optimization |
| CN110519345A (en) * | 2019-08-14 | 2019-11-29 | 杭州师范大学 | Based on the car networking information securities cooperation method for down loading for assisting vehicle independently to select more |
| CN110519345B (en) * | 2019-08-14 | 2022-04-08 | 杭州师范大学 | Internet of vehicles information safety cooperation downloading method based on multi-assistance vehicle autonomous selection |
| CN111385734A (en) * | 2020-02-19 | 2020-07-07 | 重庆邮电大学 | Internet of vehicles content caching decision optimization method |
| CN111385734B (en) * | 2020-02-19 | 2021-07-30 | 重庆邮电大学 | Internet of vehicles content caching decision optimization method |
| CN111148110A (en) * | 2020-03-30 | 2020-05-12 | 汉腾汽车有限公司 | Vehicle networking road side unit deployment method based on genetic ant colony hybrid algorithm |
| CN111464976B (en) * | 2020-04-21 | 2021-06-22 | 电子科技大学 | Vehicle task unloading decision and overall resource allocation method based on fleet |
| CN111464976A (en) * | 2020-04-21 | 2020-07-28 | 电子科技大学 | Vehicle task unloading decision and overall resource allocation method based on fleet |
| CN111526495B (en) * | 2020-04-22 | 2021-03-26 | 华中科技大学 | Internet of vehicles AoI optimization task unloading method based on improved genetic algorithm |
| CN111526495A (en) * | 2020-04-22 | 2020-08-11 | 华中科技大学 | Internet of vehicles AoI optimization task unloading method based on improved genetic algorithm |
| CN111970318A (en) * | 2020-05-18 | 2020-11-20 | 北京邮电大学 | Vehicle and roadside unit cooperative task unloading method and device based on mobile edge calculation |
| CN111611063A (en) * | 2020-05-27 | 2020-09-01 | 江南大学 | Cloud-aware mobile fog computing system task unloading method based on 802.11p |
| CN111611063B (en) * | 2020-05-27 | 2023-04-11 | 江南大学 | Cloud-aware mobile fog computing system task unloading method based on 802.11p |
| CN112512018A (en) * | 2020-07-24 | 2021-03-16 | 北京航空航天大学 | Method for dynamically unloading tasks among cooperative vehicles based on mobile edge calculation |
| CN112566070A (en) * | 2020-12-09 | 2021-03-26 | 重庆邮电大学 | Cooperative data transmission method in Internet of vehicles environment |
| CN112929850A (en) * | 2021-02-02 | 2021-06-08 | 天津理工大学 | Internet of vehicles data returning method facing edge computing environment |
Also Published As
| Publication number | Publication date |
|---|---|
| CN108990016B (en) | 2019-11-26 |
Similar Documents
| Publication | Publication Date | Title |
|---|---|---|
| CN108990016B (en) | A kind of calculating task unloading of more vehicles collaboration and transmission method | |
| Zhou et al. | Energy-efficient edge computing service provisioning for vehicular networks: A consensus ADMM approach | |
| Sun et al. | Task replication for vehicular edge computing: A combinatorial multi-armed bandit based approach | |
| Zhang et al. | Mobile-edge computing for vehicular networks: A promising network paradigm with predictive off-loading | |
| Ni et al. | Toward reliable and scalable internet of vehicles: Performance analysis and resource management | |
| Mekrache et al. | Deep reinforcement learning techniques for vehicular networks: Recent advances and future trends towards 6G | |
| Saad et al. | Coalition formation games for distributed cooperation among roadside units in vehicular networks | |
| CN112954651B (en) | Low-delay high-reliability V2V resource allocation method based on deep reinforcement learning | |
| CN112995951B (en) | 5G Internet of vehicles V2V resource allocation method adopting depth certainty strategy gradient algorithm | |
| Ho et al. | Next-generation wireless solutions for the smart factory, smart vehicles, the smart grid and smart cities | |
| CN113543074B (en) | Joint computing migration and resource allocation method based on vehicle-road cloud cooperation | |
| Wu et al. | Fog computing model and efficient algorithms for directional vehicle mobility in vehicular network | |
| CN103607737B (en) | A kind of heterogeneous-network service shunt method and system | |
| Hossain et al. | Multi-objective Harris hawks optimization algorithm based 2-Hop routing algorithm for CR-VANET | |
| Wu et al. | Integrating licensed and unlicensed spectrum in the Internet of vehicles with mobile edge computing | |
| CN111339554A (en) | User data privacy protection method based on mobile edge calculation | |
| CN106160993A (en) | A kind of power system capacity expansion method based on D2D traffic model in ITS | |
| CN106254474A (en) | Heterogeneous nodes cooperation caching method based on fountain codes under car networking | |
| Tian et al. | A dynamic task offloading algorithm based on greedy matching in vehicle network | |
| Ouyang | Task offloading algorithm of vehicle edge computing environment based on Dueling-DQN | |
| Wu et al. | Performance evaluation of the V2I fair access with a finite retry limit | |
| CN103634923B (en) | Scheduling decision-making method for maximizing effective transmission times of bus in-vehicle network | |
| Ko et al. | Towards efficient data services in vehicular networks via cooperative infrastructure-to-vehicle and vehicle-to-vehicle communications | |
| Yang et al. | Task-driven semantic-aware green cooperative transmission strategy for vehicular networks | |
| Tyagi et al. | Seamless handoff through information retrieval in VANET using mobile agent |
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 |