CN108769948A - A kind of resource allocation methods of isomery In-vehicle networking - Google Patents
A kind of resource allocation methods of isomery In-vehicle networking Download PDFInfo
- Publication number
- CN108769948A CN108769948A CN201810450956.XA CN201810450956A CN108769948A CN 108769948 A CN108769948 A CN 108769948A CN 201810450956 A CN201810450956 A CN 201810450956A CN 108769948 A CN108769948 A CN 108769948A
- Authority
- CN
- China
- Prior art keywords
- vehicle
- isomery
- resource allocation
- vehicles
- services
- Prior art date
- Legal status (The legal status is an assumption and is not a legal conclusion. Google has not performed a legal analysis and makes no representation as to the accuracy of the status listed.)
- Pending
Links
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]
-
- G—PHYSICS
- G06—COMPUTING; CALCULATING OR COUNTING
- G06N—COMPUTING ARRANGEMENTS BASED ON SPECIFIC COMPUTATIONAL MODELS
- G06N3/00—Computing arrangements based on biological models
- G06N3/004—Artificial life, i.e. computing arrangements simulating life
- G06N3/006—Artificial life, i.e. computing arrangements simulating life based on simulated virtual individual or collective life forms, e.g. social simulations or particle swarm optimisation [PSO]
-
- 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]
-
- H—ELECTRICITY
- H04—ELECTRIC COMMUNICATION TECHNIQUE
- H04W—WIRELESS COMMUNICATION NETWORKS
- H04W72/00—Local resource management
- H04W72/04—Wireless resource allocation
- H04W72/044—Wireless resource allocation based on the type of the allocated resource
- H04W72/0453—Resources in frequency domain, e.g. a carrier in FDMA
-
- H—ELECTRICITY
- H04—ELECTRIC COMMUNICATION TECHNIQUE
- H04W—WIRELESS COMMUNICATION NETWORKS
- H04W72/00—Local resource management
- H04W72/50—Allocation or scheduling criteria for wireless resources
- H04W72/53—Allocation or scheduling criteria for wireless resources based on regulatory allocation policies
-
- H—ELECTRICITY
- H04—ELECTRIC COMMUNICATION TECHNIQUE
- H04W—WIRELESS COMMUNICATION NETWORKS
- H04W72/00—Local resource management
- H04W72/50—Allocation or scheduling criteria for wireless resources
- H04W72/54—Allocation or scheduling criteria for wireless resources based on quality criteria
- H04W72/542—Allocation or scheduling criteria for wireless resources based on quality criteria using measured or perceived quality
-
- H—ELECTRICITY
- H04—ELECTRIC COMMUNICATION TECHNIQUE
- H04W—WIRELESS COMMUNICATION NETWORKS
- H04W88/00—Devices specially adapted for wireless communication networks, e.g. terminals, base stations or access point devices
- H04W88/02—Terminal devices
- H04W88/04—Terminal devices adapted for relaying to or from another terminal or user
Landscapes
- Engineering & Computer Science (AREA)
- Computer Networks & Wireless Communication (AREA)
- Signal Processing (AREA)
- Quality & Reliability (AREA)
- Physics & Mathematics (AREA)
- Theoretical Computer Science (AREA)
- Computational Linguistics (AREA)
- General Health & Medical Sciences (AREA)
- Biomedical Technology (AREA)
- Biophysics (AREA)
- Life Sciences & Earth Sciences (AREA)
- Data Mining & Analysis (AREA)
- Evolutionary Computation (AREA)
- Artificial Intelligence (AREA)
- Molecular Biology (AREA)
- Computing Systems (AREA)
- General Engineering & Computer Science (AREA)
- General Physics & Mathematics (AREA)
- Mathematical Physics (AREA)
- Software Systems (AREA)
- Health & Medical Sciences (AREA)
- Mobile Radio Communication Systems (AREA)
Abstract
The present invention provides a kind of resource allocation methods of isomery In-vehicle networking, can improve system service amount.The method includes：S101 determines the V2I link sen amounts of all vehicles in isomery In-vehicle networking, and the sum of vehicle is N；S102 obtains n small vehicle of V2I link sen amounts as DV vehicles, remaining N-n vehicle is as RV vehicles, wherein DV is communicated using RV with roadside infrastructure, and RV is directly communicated with roadside infrastructure；S103, based on heuritic approach ant group algorithm determine so that the isomery In-vehicle networking volume of services maximum when DV and RV between assembled scheme；S104 updates DV vehicle number n, if n does not change, selects the scheme when volume of services maximum of isomery In-vehicle networking described in S103 as resource scheduling scheme, if n changes, returns to the continuous execution of S102.The present invention is suitable for the resource allocation operations of isomery In-vehicle networking.
Description
Technical field
The present invention relates to isomery In-vehicle networking fields, particularly relate to a kind of resource allocation methods of isomery In-vehicle networking.
Background technology
With the continuous development of urbanization process and becoming increasingly popular for automobile, traffic problems become Modern Urban Development process
In be difficult to the obstacle gone beyond together.Countries in the world all take various methods to alleviate traffic pressure, including build subway, development
Ground public transport, vehicle restricted driving etc..But it only is difficult to solve to ask at all by increasing traffic roadside infrastructure input
Topic, and high roadside infrastructure construction cost enables national governments be difficult to bear.Therefore, the Department of Transportation of many countries
Door is sought for new technological means reduces operating cost and energy consumption to improve the conevying efficiency of existing traffic system in the hope of reaching
Purpose.Under the promotion of current demand, intelligent transportation system is come into being.
In-vehicle networking (Vehicular Ad Hoc Networks, VANETs) is the key that support intelligent transportation system skill
Art.In-vehicle networking management be high speed on highway motor vehicles, network topology is with vehicle dynamic change, based on In-vehicle networking
Traffic is applied more demanding to real-time communication.Scheduling of resource is when improving In-vehicle networking data throughout, reducing data transmission
The important technical prolonged is the primary study content of In-vehicle networking.The significant challenge of In-vehicle networking scheduling of resource be how
Efficiently using In-vehicle networking can realize between vehicle and vehicle (Vehicle-to-Vehicle, V2V) and vehicle to roadside base
The wireless communication function of Infrastructure (Vehicle-to-Infrastructure, V2I), to improve system service amount.
Invention content
It is existing to solve the technical problem to be solved in the present invention is to provide a kind of resource allocation methods of isomery In-vehicle networking
The low problem of system service amount present in technology.
In order to solve the above technical problems, the embodiment of the present invention provides a kind of resource allocation methods of isomery In-vehicle networking, packet
It includes：
S101 determines the V2I link sen amounts of all vehicles in isomery In-vehicle networking, and the sum of vehicle is N, the isomery
In-vehicle networking includes：V2I links and V2V links, V2V links refer to the link being connected to form between vehicle and vehicle, V2I chains
Road refers to that vehicle and roadside infrastructure are connected directly the link to be formed；
S102, obtains the small n vehicle of V2I link sen amounts as DV vehicles, remaining N-n vehicle as RV vehicles,
Wherein, DV is to need the vehicle that cooperates, and RV is cooperation vehicle, and DV is communicated using RV with roadside infrastructure, RV directly with
Roadside infrastructure is communicated；
S103, based on heuritic approach ant group algorithm determine so that the isomery In-vehicle networking volume of services maximum when
Assembled scheme between DV and RV；
S104 updates DV vehicle number n, if n does not change, selects the volume of services of isomery In-vehicle networking described in S103 maximum
When scheme as resource scheduling scheme, if n changes, return to that S102 is continuous to be executed.
Further, each DV can only utilize a RV facilitating communications, each RV that can at most assist two DV into row information
Transmission.
Wherein, DV vehicles are using DSRC radio resources and RV vehicle communications, RV using DV distribution LTE-Advanced without
Line resource helps DV to be communicated with roadside infrastructure.
Wherein, the calculation formula of volume of services is：
Wherein, S indicates link sen amount；B indicates the frequency bandwidth that vehicle is assigned to；LP (d (t)) indicates wireless signal certainly
By in space, the path loss formula of propagation；D (t) is t moment sending and receiving end distance；PsFor transmitting terminal transmission power；It indicates
The mean power of noise.
Further, in LTE-Advanced networks, the path loss formula is：
Wherein, d (t) indicates vehicle n and roadside infrastructure distance.
Further, in DSRC network, the path loss formula is：
LP (d (t))=49.4+27.5log10(d(t))
Wherein, d (t) indicates the distance between vehicle n and vehicle m.
Further, the n small vehicle of V2I link sen amounts that obtain includes as DV vehicles：
The V2I link sen amounts of N number of vehicle are ranked up, n vehicle for selecting V2I link sen amounts small is as DV vehicles
?.
Further, remember that n-th of vehicle is connected directly with roadside infrastructure, the volume of services of acquisition is Sn=Sn,I；N-th
The volume of services of m-th of vehicle of a vehicle pair is Sn,m, the service that obtains when m-th of vehicle selects n-th of vehicle as cooperation vehicle
Amount is Sn=Sm,n,I=min { Sn,I,Sn,m}；
The target of the scheduling of resource distribution method of isomery In-vehicle networking is to make isomery vehicle by channel dispatch, collaboration communication
The total volume of services of contained network network maximizes, i.e.,：
Wherein, assembled schemes of the s between DV and RV, s ∈ A, A are the set of all assembled schemes.
Further, in the ant group algorithm based on heuritic approach, ant carries out path probability choosing according to following formula
It selects：
Wherein, τm,n(t) it is that t moment connects remaining pheromone amount on the path (m, n) of vehicle m and vehicle n, β indicates letter
The significance level of element is ceased, list tabuk has recorded the vehicle node that ant k passes through；Indicate ant k in t moment, vehicle
When m selection vehicle n, the probability of path (m, n).
Further, the more new formula of pheromone amount is：
τm,n(t+1)=(1- ρ) τm,n(t)+△τm,n
Wherein, ρ indicates pheromones volatilization factor, △ τm,nIt is the amount for the process pheromone that destination is found by ant.
Further, the update DV vehicle numbers n includes：
Utilize binary chop update DV vehicle numbers n.
The above-mentioned technical proposal of the present invention has the beneficial effect that：
In said program, the V2I link sen amounts of all vehicles in isomery In-vehicle networking are determined, the sum of vehicle is N, institute
Stating isomery In-vehicle networking includes：V2I links and V2V links, V2V links refer to the chain being connected to form between vehicle and vehicle
Road, V2I links refer to that vehicle and roadside infrastructure are connected directly the link to be formed；Obtain V2I link sen amounts small n
Vehicle is as DV vehicles, remaining N-n vehicle is as RV vehicles, wherein and DV is the vehicle for needing to cooperate, and RV is cooperation vehicle,
DV is communicated using RV with roadside infrastructure, and RV is directly communicated with roadside infrastructure；Based on heuritic approach
Ant group algorithm determine so that the isomery In-vehicle networking volume of services maximum when DV and RV between assembled scheme；Update DV vehicles
Number n selects the scheme when volume of services maximum of isomery In-vehicle networking described in S103 as scheduling of resource if n does not change
Scheme returns to the continuous execution of S102 if n changes；In this way, based on being communicated with double bounce, link scheduling is combined with radio resource allocation
Get up to improve system service amount, and signaling overheads can be reduced, reduce algorithm complexity.
Description of the drawings
Fig. 1 is the flow diagram of the resource allocation methods of isomery In-vehicle networking provided in an embodiment of the present invention；
Fig. 2 is the topological structure schematic diagram of isomery In-vehicle networking provided in an embodiment of the present invention；
Fig. 3 is resource allocation principle schematic provided in an embodiment of the present invention.
Specific implementation mode
To keep the technical problem to be solved in the present invention, technical solution and advantage clearer, below in conjunction with attached drawing and tool
Body embodiment is described in detail.
The present invention provides a kind of resource allocation side of isomery In-vehicle networking for the low problem of existing system service amount
Method.
As shown in Figure 1, the resource allocation methods of isomery In-vehicle networking provided in an embodiment of the present invention, including：
S101 determines the V2I link sen amounts of all vehicles in isomery In-vehicle networking, and the sum of vehicle is N, the isomery
In-vehicle networking includes：V2I links and V2V links, V2V links refer to the link being connected to form between vehicle and vehicle, V2I chains
Road refers to that vehicle and roadside infrastructure (RIU) are connected directly the link to be formed；
S102, obtains the small n vehicle of V2I link sen amounts as DV vehicles, remaining N-n vehicle as RV vehicles,
Wherein, DV is to need the vehicle that cooperates, and RV is cooperation vehicle, and DV is communicated using RV with roadside infrastructure, RV directly with
Roadside infrastructure is communicated；
S103, based on heuritic approach ant group algorithm determine so that the isomery In-vehicle networking volume of services maximum when
Assembled scheme between DV and RV；
S104 updates DV vehicle number n, if n does not change, selects the volume of services of isomery In-vehicle networking described in S103 maximum
When scheme as resource scheduling scheme, if n changes, return to that S102 is continuous to be executed.
The resource allocation methods of isomery In-vehicle networking described in the embodiment of the present invention determine all vehicles in isomery In-vehicle networking
V2I link sen amounts, the sum of vehicle is N, and the isomery In-vehicle networking includes：V2I links and V2V links, V2V links
Refer to that the link being connected to form between vehicle and vehicle, V2I links refer to that vehicle and roadside infrastructure are connected directly shape
At link；N small vehicle of V2I link sen amounts is obtained as DV vehicles, remaining N-n vehicle is as RV vehicles, wherein
DV is to need the vehicle that cooperates, and RV is cooperation vehicle, and DV is communicated using RV with roadside infrastructure, RV directly with roadside base
Infrastructure is communicated；Based on heuritic approach ant group algorithm determine so that the isomery In-vehicle networking volume of services maximum when
DV and RV between assembled scheme；Update DV vehicle number n select isomery In-vehicle networking described in S103 if n does not change
Scheme when volume of services maximum is as resource scheduling scheme, if n changes, returns to the continuous execution of S102；In this way, being with double bounce communication
It is main, link scheduling and radio resource allocation are joined together to improve system service amount, and signaling overheads can be reduced, reduce algorithm
Complexity.
It is illustrated in figure 2 the topological structure of isomery In-vehicle networking.The isomery In-vehicle networking structure includes high speed on highway
The vehicle node and roadside infrastructure of traveling.All vehicles all can be logical by two kinds of links of V2I/V2V and roadside infrastructure
Letter.RV is connected directly with roadside infrastructure, forms V2I links, meanwhile, it is mutually communicated by V2V links between vehicle and vehicle
Letter shares information of road surface.Isomery In-vehicle networking in the present embodiment is made of V2I links and V2V links, wherein V2I chain roadbeds
It is transmitted into row information in LTE-Advanced agreements, V2V links are based on DSRC (Dedicated Short Range
Communication) agreement is transmitted into row information.
The resource allocation methods of isomery In-vehicle networking described in the embodiment of the present invention pass through management and running isomery In-vehicle networking
Transmission link resource (V2I and V2V) helps each vehicle within the scope of isomery In-vehicle networking to cooperate with each other, vehicle-mounted to improve isomery
Network overall data transmission performance.
In the present embodiment, the vehicle to cooperate is needed to be known as DV (Destination Vehide), cooperation vehicle is known as RV
(Relay Vehicle), DV is communicated with roadside infrastructure communicates (V2V) and RV is communicated with roadside infrastructure by DV with RV
(V2I) double bounce is completed.DV vehicles use the LTE- of DV distribution using the DSRC radio resources being assigned to and RV vehicle communications, RV
Advanced radio resources help DV to be communicated with roadside infrastructure, therefore collaboration communication has no effect on RV itself and roadside basis
Infrastructure communication.
In the present embodiment, each DV can only utilize a RV facilitating communications, each RV that two DV can at most be assisted to carry out letter
Breath transmission, the relay-model that RV is used decode a forward relay model for full duplex double bounce.When considering volume of services, link transmission
Amount considers relatively prior downlink.When vehicle is with roadside infrastructure direct communication, the frequency of communication is 2GHz, bandwidth
For 40MHz.When being communicated between vehicle and vehicle, using DSRC agreements, centre frequency is 5.9GHz, and bandwidth is 50MHz.
Fig. 2 illustrates vehicle driving scene.There are one the roadside bases that can provide radio resource covering beside highway
Facility, vehicle is connect by V2I Radio Links with roadside infrastructure, and then can access Internet, obtains various businesses
Service.Random distribution the vehicle travelled towards both direction on highway.Distance of the random vehicles apart from roadside infrastructure
Having closely has far, and the distance between vehicle is also different in size.All vehicles are intended to that the money from roadside infrastructure can be obtained
Source, then all with roadside infrastructure keep connect, but vehicle farther out due to signal decay it is larger, so being directly connected to roadside
Infrastructure rate is relatively low, and then the closer a part of vehicle of distance will assist in these vehicles and be communicated with roadside infrastructure.
Fig. 3 illustrates resource allocation principle.In LTE-Advanced networks, total frequency resource is B, when beginning, money
Source is averagely allocated to each car, and the frequency resource that each vehicle is assigned to isFrom the vehicle of roadside infrastructure farther out,
Path loss is larger, and volume of services is small.The vehicle closer from roadside infrastructure, path loss is small, and volume of services is larger.Therefore, from
Remote vehicle can by from close vehicle carry out collaboration communication, promote volume of services.When one DV of a RV cooperation is carried out
When communication, the frequency resource allocation of DV will be distributed to originally in LTE-Advanced networks to RV, then RV is in LTE-
The frequency resource being assigned in Advanced networks isAt the same time DV is distributed in LTE-Advanced networks
The frequency resource arrived is 0.When two DV of a RV cooperation are communicated, will be distributed to originally in LTE-Advanced networks
To RV, then the frequency resource that RV is assigned in LTE-Advanced networks is the frequency resource allocation of DVWith
This frequency resource that DV is assigned in LTE-Advanced networks simultaneously is 0.The DSRC nets communicated between vehicle and vehicle
In network, total frequency resource is B', and the frequency resource for giving each DV is
The resource allocation methods of isomery In-vehicle networking described in the embodiment of the present invention can specifically include：
A11 determines the V2I link sen amounts of all vehicles in isomery In-vehicle networking, and the sum of vehicle is N.
A12 is ranked up the V2I link sen amounts of N number of vehicle, n vehicle for selecting V2I link sen amounts small as
DV vehicles, for remaining N-n vehicle as RV vehicles, n is preset value.
In the present embodiment, for example, can be from small to large ranked up to the V2I link sens amount of determining N number of vehicle, select
N small vehicle of V2I link sen amounts is selected as DV, remaining N-n vehicle obtains DV set and RV collection as RV vehicles
It closes.
In the present embodiment, after obtaining DV set and RV set, the ant group algorithm based on heuritic approach finds DV and RV
Between best collaboration method.
A13, since a RV can only at most relay two DV vehicles, the relay-model used is full duplex double bounce decoding one
Forward relay model, link transmission amount only consider that relatively prior downlink, scheduling of resource period are 1s.The meter of volume of services
It is as follows to calculate formula：
Wherein, S indicates link sen amount；B indicates the frequency bandwidth that vehicle is assigned to；LP (d (t)) indicates wireless signal certainly
By in space, the path loss formula of propagation；D (t) is t moment sending and receiving end distance；PsFor transmitting terminal transmission power；It indicates
The mean power of noise.
In LTE-Advanced networks, the path loss formula is：
Wherein, d (t) indicates vehicle n and roadside infrastructure distance.
In DSRC network, the path loss formula is：
LP (d (t))=49.4+27.5log10(d(t))
Wherein, d (t) indicates the distance between vehicle n and vehicle m.
Remember that n-th of vehicle is connected directly with base station, the volume of services of acquisition is Sn=SN, I；N-th of vehicle pair, m-th of vehicle
Volume of services be SN, m, the volume of services that m-th of vehicle obtains when selecting n-th of vehicle as cooperation vehicle is Sn=Sm,n,I。
Vehicle needs far from roadside infrastructure are set by the vehicle cooperative close to roadside infrastructure with roadside basis
Communication is applied, the vehicle to cooperate is needed to be known as DV (Destination Vehide), cooperation vehicle is known as RV (Relay
Vehicle), DV is communicated with RV using DSRC, and DV vehicles are used using the DSRC radio resources being assigned to and RV vehicle communications, RV
The LTE-Advanced radio resources of DV distribution help DV to be communicated with roadside infrastructure, therefore collaboration communication has no effect on RV certainly
Body is communicated with roadside infrastructure.DV is communicated with roadside infrastructure is communicated (V2V) and RV and roadside infrastructure by DV with RV
It communicates (V2I) double bounce to complete, therefore, when DV is communicated with roadside infrastructure, whole link sen amount is V2I and V2V volumes of services
Smaller value:
SM, n, I=min { SN, I, SN, m}
The target of the scheduling of resource distribution method of isomery In-vehicle networking is to make isomery vehicle by channel dispatch, collaboration communication
The total volume of services of contained network network maximizes, i.e.,：
Wherein, assembled schemes of the s between DV and RV, s ∈ A, A are the set of all assembled schemes.
In the present embodiment, the service so that the isomery In-vehicle networking is determined using the ant group algorithm based on heuritic approach
The assembled scheme between DV and RV when amount is maximum in the present embodiment, is solved using the ant group algorithm based on heuritic approach
Acceptable complexity issue is (in other words：To solve that link scheduling and radio resource allocation are joined together to improve system service
Amount is extremely complex nondeterministic polynomial (NP) problem).
In the present embodiment, the ant group algorithm based on heuritic approach is the population established by using for reference ant colony foraging behavior
Collect intelligent algorithm, main thought is to imitate ant colony to look for food the optimizing paths of process, general by the Path selection for establishing ant
Rate formula, and Pheromone update mechanism is proposed to solve combinatorial optimization problem.
Ant group algorithm based on heuritic approach includes mainly two processes:
First, the selection node in ant path and constructing the process of fullpath；
Second is that on road network Pheromone update process.
Pheromone amount of ant colony when Path selection on Main Basiss path, single ant can preferentially select path length
Spend short and big pheromone amount path.Pheromones in reality are a kind of substances of ant secretion, and ant is marked with pheromones
Routing information.Assuming that ant is in an actual transportation network, ant is allowed to go selection towards the road of destination in intersection
Diameter, ant can go to carry out probability selection according to the pheromone amount on each paths, and ant selects the general of the big path of pheromone amount
Rate is larger.
In the ant group algorithm based on heuritic approach, ant carries out path probability selection according to following formula：
Wherein, τM, n(t) it is that t moment connects remaining pheromone amount on the path (m, n) of vehicle m and vehicle n；β indicates letter
Cease the significance level of element；List tabuk has recorded the vehicle node that ant k passes through, and ant will not iterate through a node；Ant k is indicated in t moment, vehicle m selection vehicle n, the probability of path (m, n).
The pheromones of ant secretion in nature are gradually volatilized in the natural environment, and the speed of volatilization is with specific ring
The difference in border and change.In the present embodiment, the speed that pheromones volatilization factor ρ indicates pheromones evaporation rate at any time is introduced,
The more new formula of all ant circulation primaries, Pheromone update, pheromone amount is as follows：
τM, n(t+1)=(1- ρ) τM, n(t)+△τM, n
Wherein, ρ indicates pheromones volatilization factor, ρ ∈ (0,1), (1- ρ) τM, n(t) it is process of the ant in searching destination
Pheromones remain remaining part, △ τ due to volatilization on middle pathM, nIt is the process secretion that destination is found by ant
The amount of pheromones.It is exactly pheromone amount possessed by path after ant arrives at that two parts, which are added together,.
In the present embodiment, the process of optimal combination between finding DV and RV using the ant group algorithm based on heuritic approach
In, the codomain scope limitation that the pheromones track of each path is measured is in [τmin, τmax] in, it can prevent from searching by this setting
The stagnation of rope process, while pheromones track amount is initialized as τmax, so that expand search model in the starting stage of search
It encloses and obtains more assembled scheme.
A14 can utilize binary chop update DV vehicle number n to select isomery described in A13 vehicle-mounted if n does not change
Scheme when the volume of services maximum of network is as resource scheduling scheme, if n changes, return to step A12 is continued to execute.
It should be noted that herein, relational terms such as first and second and the like are used merely to a reality
Body or operation are distinguished with another entity or operation, are deposited without necessarily requiring or implying between these entities or operation
In any actual relationship or order or sequence.
The above is the preferred embodiment of the present invention, it is noted that for those skilled in the art
For, without departing from the principles of the present invention, several improvements and modifications can also be made, these improvements and modifications
It should be regarded as protection scope of the present invention.
Claims (10)
1. a kind of resource allocation methods of isomery In-vehicle networking, which is characterized in that including：
S101 determines the V2I link sen amounts of all vehicles in isomery In-vehicle networking, and the sum of vehicle is N, and the isomery is vehicle-mounted
Network includes：V2I links and V2V links, V2V links refer to that the link being connected to form between vehicle and vehicle, V2I links refer to
Be that vehicle and roadside infrastructure are connected directly the link to be formed；
S102 obtains n small vehicle of V2I link sen amounts as DV vehicles, remaining N-n vehicle is as RV vehicles, wherein
DV is to need the vehicle that cooperates, and RV is cooperation vehicle, and DV is communicated using RV with roadside infrastructure, RV directly with roadside base
Infrastructure is communicated；
S103, based on heuritic approach ant group algorithm determine so that the isomery In-vehicle networking volume of services maximum when DV with
Assembled scheme between RV；
S104 updates DV vehicle number n, if n does not change, when selecting the volume of services maximum of isomery In-vehicle networking described in S103
Scheme is as resource scheduling scheme, if n changes, returns to the continuous execution of S102.
2. the resource allocation methods of isomery In-vehicle networking according to claim 1, which is characterized in that each DV can only be utilized
One RV facilitating communications, each RV can at most assist two DV to be transmitted into row information；
DV vehicles are helped using DSRC radio resources and RV vehicle communications, RV using the LTE-Advanced radio resources of DV distribution
DV is communicated with roadside infrastructure.
3. the resource allocation methods of isomery In-vehicle networking according to claim 1, which is characterized in that the calculating of volume of services is public
Formula is：
Wherein, S indicates link sen amount；B indicates the frequency bandwidth that vehicle is assigned to；LP (d (t)) indicates wireless signal in free sky
Between in, the path loss formula of propagation；D (t) is t moment sending and receiving end distance；PsFor transmitting terminal transmission power；Indicate noise
Mean power.
4. the resource allocation methods of isomery In-vehicle networking according to claim 3, which is characterized in that in LTE-Advanced
In network, the path loss formula is：
Wherein, d (t) indicates vehicle n and roadside infrastructure distance.
5. the resource allocation methods of isomery In-vehicle networking according to claim 3, which is characterized in that in DSRC network,
The path loss formula is：
LP (d (t))=49.4+27.5log10(d(t))
Wherein, d (t) indicates the distance between vehicle n and vehicle m.
6. the resource allocation methods of isomery In-vehicle networking according to claim 1, which is characterized in that the acquisition V2I chains
N small vehicle of road volume of services include as DV vehicles：
The V2I link sen amounts of N number of vehicle are ranked up, n vehicle for selecting V2I link sen amounts small is as DV vehicles.
7. the resource allocation methods of isomery In-vehicle networking according to claim 1, which is characterized in that n-th vehicle of note with
Roadside infrastructure is connected directly, and the volume of services of acquisition is Sn=Sn,I；The volume of services of n-th of vehicle pair, m-th of vehicle is Sn,m,
The volume of services that m-th of vehicle obtains when selecting n-th of vehicle as cooperation vehicle is Sn=Sm,n,I=min { Sn,I,Sn,m}；
The target of the scheduling of resource distribution method of isomery In-vehicle networking is to make the vehicle-mounted net of isomery by channel dispatch, collaboration communication
The total volume of services of network maximizes, i.e.,：
Wherein, assembled schemes of the s between DV and RV, s ∈ A, A are the set of all assembled schemes.
8. the resource allocation methods of isomery In-vehicle networking according to claim 1, which is characterized in that based on heuristic calculation
In the ant group algorithm of method, ant carries out path probability selection according to following formula：
Wherein, τm,n(t) it is that t moment connects remaining pheromone amount on the path (m, n) of vehicle m and vehicle n, β indicates pheromones
Significance level, list tabuk has recorded the vehicle node that ant k passes through；Indicate ant k in t moment, vehicle m choosings
When selecting vehicle n, the probability of path (m, n).
9. the resource allocation methods of isomery In-vehicle networking according to claim 8, which is characterized in that the update of pheromone amount
Formula is：
τm,n(t+1)=(1- ρ) τm,n(t)+△τm,n
Wherein, ρ indicates pheromones volatilization factor, △ τm,nIt is the amount for the process pheromone that destination is found by ant.
10. the resource allocation methods of isomery In-vehicle networking according to claim 1, which is characterized in that the update DV vehicles
Number n includes：
Utilize binary chop update DV vehicle numbers n.
Priority Applications (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN201810450956.XA CN108769948A (en) | 2018-05-11 | 2018-05-11 | A kind of resource allocation methods of isomery In-vehicle networking |
Applications Claiming Priority (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN201810450956.XA CN108769948A (en) | 2018-05-11 | 2018-05-11 | A kind of resource allocation methods of isomery In-vehicle networking |
Publications (1)
| Publication Number | Publication Date |
|---|---|
| CN108769948A true CN108769948A (en) | 2018-11-06 |
Family
ID=64010212
Family Applications (1)
| Application Number | Title | Priority Date | Filing Date |
|---|---|---|---|
| CN201810450956.XA Pending CN108769948A (en) | 2018-05-11 | 2018-05-11 | A kind of resource allocation methods of isomery In-vehicle networking |
Country Status (1)
| Country | Link |
|---|---|
| CN (1) | CN108769948A (en) |
Cited By (3)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN111917830A (en) * | 2020-07-02 | 2020-11-10 | 南昌工程学院 | Method and system for vehicle communication in Internet of vehicles |
| WO2021138888A1 (en) * | 2020-01-10 | 2021-07-15 | Qualcomm Incorporated | Communication resource reservation in vehicle-to-everything (v2x) communication network |
| CN113347606A (en) * | 2021-06-25 | 2021-09-03 | 长安大学 | V2I/V2V network cooperative transmission method and system based on elastic partition |
Citations (9)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| US20090122738A1 (en) * | 2007-11-13 | 2009-05-14 | Wai Chen | Method of broadcasting packets in ad-hoc network |
| CN101895421A (en) * | 2010-07-02 | 2010-11-24 | 北京邮电大学 | Communication resource allocating method |
| US20110128902A1 (en) * | 2009-12-02 | 2011-06-02 | Jianlin Guo | Broadcasting Messages in Multi-Channel Vehicular Networks |
| CN103052129A (en) * | 2013-01-09 | 2013-04-17 | 北京邮电大学 | Energy-saving route setup and power distribution method in wireless multi-hop relay network |
| CN105530680A (en) * | 2015-12-22 | 2016-04-27 | 重庆邮电大学 | VANET relay vehicle selecting method |
| CN105765640A (en) * | 2013-11-21 | 2016-07-13 | 三菱电机株式会社 | Vehicle-mounted unit, cloud server, vehicle-to-vehicle communication system, and vehicle-to-vehicle communication method |
| CN105959993A (en) * | 2016-04-21 | 2016-09-21 | 北京车网互联科技有限公司 | Multi-hop forwarding communication algorithm applied to vehicle self-organized network |
| CN106332122A (en) * | 2015-06-26 | 2017-01-11 | 中兴通讯股份有限公司 | Method and device for managing vehicles in Internet of Vehicles |
| CN107925854A (en) * | 2015-08-21 | 2018-04-17 | 日本电气株式会社 | Vehicle is to any object (V2X) communication means and system |
-
2018
- 2018-05-11 CN CN201810450956.XA patent/CN108769948A/en active Pending
Patent Citations (9)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| US20090122738A1 (en) * | 2007-11-13 | 2009-05-14 | Wai Chen | Method of broadcasting packets in ad-hoc network |
| US20110128902A1 (en) * | 2009-12-02 | 2011-06-02 | Jianlin Guo | Broadcasting Messages in Multi-Channel Vehicular Networks |
| CN101895421A (en) * | 2010-07-02 | 2010-11-24 | 北京邮电大学 | Communication resource allocating method |
| CN103052129A (en) * | 2013-01-09 | 2013-04-17 | 北京邮电大学 | Energy-saving route setup and power distribution method in wireless multi-hop relay network |
| CN105765640A (en) * | 2013-11-21 | 2016-07-13 | 三菱电机株式会社 | Vehicle-mounted unit, cloud server, vehicle-to-vehicle communication system, and vehicle-to-vehicle communication method |
| CN106332122A (en) * | 2015-06-26 | 2017-01-11 | 中兴通讯股份有限公司 | Method and device for managing vehicles in Internet of Vehicles |
| CN107925854A (en) * | 2015-08-21 | 2018-04-17 | 日本电气株式会社 | Vehicle is to any object (V2X) communication means and system |
| CN105530680A (en) * | 2015-12-22 | 2016-04-27 | 重庆邮电大学 | VANET relay vehicle selecting method |
| CN105959993A (en) * | 2016-04-21 | 2016-09-21 | 北京车网互联科技有限公司 | Multi-hop forwarding communication algorithm applied to vehicle self-organized network |
Non-Patent Citations (1)
| Title |
|---|
| 熊舸、张煜、杨勇: "基于服务量的异构车载网络资源调度算法", 《软件》 * |
Cited By (3)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| WO2021138888A1 (en) * | 2020-01-10 | 2021-07-15 | Qualcomm Incorporated | Communication resource reservation in vehicle-to-everything (v2x) communication network |
| CN111917830A (en) * | 2020-07-02 | 2020-11-10 | 南昌工程学院 | Method and system for vehicle communication in Internet of vehicles |
| CN113347606A (en) * | 2021-06-25 | 2021-09-03 | 长安大学 | V2I/V2V network cooperative transmission method and system based on elastic partition |
Similar Documents
| Publication | Publication Date | Title |
|---|---|---|
| US11064321B2 (en) | Content centric dynamic ad hoc networking | |
| CN104881710A (en) | Urban express delivering method based on vehicle self-organized network | |
| Ji et al. | Efficient and reliable cluster‐based data transmission for vehicular ad hoc networks | |
| WO2017071137A1 (en) | Information transmission method and road side unit | |
| Liu et al. | Parking-area-assisted spider-web routing protocol for emergency data in urban VANET | |
| CN108769948A (en) | A kind of resource allocation methods of isomery In-vehicle networking | |
| CN103475710B (en) | Inter-vehicle cooperation downloading scheme based on feedback method | |
| CN104080056B (en) | The message distributing method of the vehicular ad hoc network perceived based on degree of communication probability | |
| Luo et al. | CFT: A cluster-based file transfer scheme for highway VANETs | |
| CN104144193A (en) | Distributed distribution method and system of car networking emergent message transmission information | |
| CN109905921B (en) | Multi-channel environment Internet of vehicles V2R/V2V cooperative data transmission scheduling method | |
| Lin et al. | Multi-access edge computing-based vehicle-vehicle-RSU data offloading over the multi-RSU-overlapped environment | |
| CN109474897B (en) | Hidden Markov model-based vehicle networking safety message single-hop cooperative broadcasting method | |
| CN106603658B (en) | Internet of vehicles data transmission method and device based on software defined network | |
| Huang et al. | ECDS: Efficient collaborative downloading scheme for popular content distribution in urban vehicular networks | |
| CN110062017B (en) | Content distribution base station and method in dynamically-changed Internet of vehicles scene | |
| CN103118440A (en) | Construction method of dynamic mesh of vehicle-mounted ad hoc network | |
| CN109816979A (en) | Consider bus arrival frequency and by bus the public bus network recommended method of comfort level | |
| CN110428618A (en) | Two-way lane congestion detection and information forwarding method based on VANETs | |
| CN106657261A (en) | Coalition game and distance prediction based inter-vehicle data transmission method in Internet of Vehicles | |
| CN109600715A (en) | A kind of car networking V2X communication secondary file method for down loading | |
| Li et al. | Content retrieval based on prediction and network coding in vehicular named data networking | |
| CN108834100A (en) | A kind of efficient broadcast routing method | |
| CN106851765A (en) | A kind of method for optimizing of the transmission trunking node of In-vehicle networking emergency safety message | |
| Guo et al. | An adaptive V2R communication strategy based on data delivery delay estimation in VANETs |
Legal Events
| Date | Code | Title | Description |
|---|---|---|---|
| PB01 | Publication | ||
| PB01 | Publication | ||
| SE01 | Entry into force of request for substantive examination | ||
| SE01 | Entry into force of request for substantive examination | ||
| RJ01 | Rejection of invention patent application after publication | ||
| RJ01 | Rejection of invention patent application after publication |
Application publication date: 20181106 |