CN108848480A - The optimization method of efficiency resource allocation in a kind of car networking - Google Patents
The optimization method of efficiency resource allocation in a kind of car networking Download PDFInfo
- Publication number
- CN108848480A CN108848480A CN201811114722.4A CN201811114722A CN108848480A CN 108848480 A CN108848480 A CN 108848480A CN 201811114722 A CN201811114722 A CN 201811114722A CN 108848480 A CN108848480 A CN 108848480A
- Authority
- CN
- China
- Prior art keywords
- vehicle
- roadside unit
- rsu
- unit rsu
- energy efficiency
- 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]
-
- 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/04—Wireless resource allocation
- H04W72/044—Wireless resource allocation based on the type of the allocated resource
- H04W72/0473—Wireless resource allocation based on the type of the allocated resource the resource being transmission power
-
- Y—GENERAL TAGGING OF NEW TECHNOLOGICAL DEVELOPMENTS; GENERAL TAGGING OF CROSS-SECTIONAL TECHNOLOGIES SPANNING OVER SEVERAL SECTIONS OF THE IPC; TECHNICAL SUBJECTS COVERED BY FORMER USPC CROSS-REFERENCE ART COLLECTIONS [XRACs] AND DIGESTS
- Y02—TECHNOLOGIES OR APPLICATIONS FOR MITIGATION OR ADAPTATION AGAINST CLIMATE CHANGE
- Y02D—CLIMATE CHANGE MITIGATION TECHNOLOGIES IN INFORMATION AND COMMUNICATION TECHNOLOGIES [ICT], I.E. INFORMATION AND COMMUNICATION TECHNOLOGIES AIMING AT THE REDUCTION OF THEIR OWN ENERGY USE
- Y02D30/00—Reducing energy consumption in communication networks
- Y02D30/70—Reducing energy consumption in communication networks in wireless communication networks
Landscapes
- Engineering & Computer Science (AREA)
- Computer Networks & Wireless Communication (AREA)
- Signal Processing (AREA)
- Mobile Radio Communication Systems (AREA)
Abstract
The present invention relates to a kind of optimization methods of energy efficiency resource allocation in car networking, consider the probability that vehicle is connected to roadside unit RSU, then mitigate bandwidth by the way that caching mechanism is added, improve the rate of information throughput, delay is reduced, then carries out the resource allocation of energy efficiency, and processing is advanced optimized to the related parameter of resource allocation, energy efficiency can be improved to the maximum extent, can be preferably consistent with reality.
Description
Technical field
The invention belongs to vehicle networking technical field, it is related to efficiency resource allocation techniques in car networking, specifically, relating to
The optimization method of efficiency resource allocation in a kind of car networking.
Background technique
Car networking is the huge Internet being made of information such as vehicle location, speed and routes.In order to guarantee that traffic is transported
The correlated performances such as capable safety and conevying efficiency, car networking mainly provide two kinds of dedicated communication modes：V2V communication
(i.e. vehicle is to vehicle communication) and V2R communicate (i.e. vehicle is to roadside unit).Wherein, V2V communication mode helps to obtain and implement
Traffic Information reduces the time delay of network, improves network capacity etc.；V2R communication mode can be improved network reliability,
The level of comfort of safety and user.
In V2R communication mode, R indicates roadside unit (English：Road side unit, referred to as：RSU), function is straight
It connects and the on board unit (English in vehicle：On board unit, referred to as：OBU information exchange) is carried out, RSU can independently portion
It is deployed on road both sides, is used for wide area communications.RSU can not only be communicated by wireless network with vehicle, can also be accessed
Internet, extends the application service of car networking, and critically important status is occupied in car networking.
Distributing rationally in Internet resources is demand using people to network information resource as starting point, to pursue network
The efficiency and quality of information resources are target, and further planning distributes network information resource (such as：Time, space, frequency spectrum, energy
Etc.), it is finally reached and provides the purpose that convenient and information resources are used appropriately for user.Due to energy in current related car networking
The resource allocation problem research of amount efficiency is less, does not also occur carrying out resource allocation to energy efficiency in car networking having efficacious prescriptions
Therefore how method in the car networking using V2R communication mode, carries out efficient resource distribution to energy efficiency in car networking, makes
It is preferably consistent with reality, has a very important significance.
Summary of the invention
In view of the problems of the existing technology the present invention, provides a kind of optimization side of energy efficiency resource allocation in car networking
Method, this method consider the probability that vehicle is connected to roadside unit RSU, mitigate bandwidth by the way that caching mechanism is added, improve efficiency, then
The resource allocation for carrying out energy efficiency, obtains the optimum allocation of energy efficiency, can preferably be consistent with reality.
In order to achieve the above object, the present invention provides a kind of optimization method of energy efficiency resource allocation in car networking,
The specific steps are that：
By adjacent the distance between two roadside unit RSU, judge whether vehicle and roadside unit RSU can connect
It is logical；
If vehicle can be connected to roadside unit RSU and be communicated, when vehicle issues message request to roadside unit RSU
When, vehicle transmits information by buffer memory capacity between vehicle and roadside unit RSU to roadside unit RSU application buffer memory capacity, will
The average cache amount C of roadside unit RSU in unit timeaAs average cache rate, average cache amount is defined as Ca：
In formula,For the average single user data rate of roadside unit RSU；qa,mIt is each vehicle to the Shen roadside unit RSU
Buffer memory capacity please is known quantity；M is the set of vehicle user terminal；M is the vehicle in each V2R communication scenes；νa,mFor
Vehicle connection matrix, indicates whether vehicle is connected to roadside unit RSU；ya,mFor vehicle caching matrix, indicate whether vehicle is applied
To buffer memory capacity；
Average cache rate is added with the current rate of information throughput in real time the current rate of information throughput R of acquisition (A,
M) it is：
In formula, A is the set of roadside unit RSU, Ra,mFor the current real-time rate of information throughput,It is excellent for resource allocation
Change parameter, indicates radio resource from roadside unit RSU to the percentage of vehicle user terminal；
Frequency efficiency is calculated, spectrum efficiency is the ratio of rate of information throughput R (A, M) and bandwidth B, i.e.,：
ra,m=R (A, M)/B (3)
In formula, ra,mFor spectrum efficiency；
And then obtain maximum energy efficiency ηa,mIt is expressed as:
In formula, PcPower, P are consumed for circuita,mTo send power, P is power distribution matrix, and V is vehicle incidence matrix；
By maximum energy efficiency ηa,mFunction is as objective function, specifying constraint, then energy efficiency resource allocation
Optimization problem is expressed as：
In formula, χaFor specifying constraint；
The optimization solution of energy efficiency resource allocation optimization problem is solved using alternating direction multipliers method.
Preferably, when judging whether vehicle can be connected to roadside unit RSU, it is assumed that road vehicle obeys Poisson
Distribution, the distance between two neighboring roadside unit RSU indicate that the communication radius that each roadside unit RSU can be covered is used with L
RRSUIt indicates, the communication radius R of each carνIt indicates, the connected probability between vehicle and roadside unit RSU is indicated with P (ν), road
The traffic density of road is indicated with ρ；According to the distance between two neighboring roadside unit RSU, divide following four situation that vehicle is discussed
Connectivity between roadside unit RSU：
(1) as 0 < L≤2RRSUWhen, probability is：
P (ν)=1 (6)
At this point, the location of vehicle is within the communication coverage of two neighboring roadside unit RSU, vehicle and phase
Two roadside unit RSU of neighbour are connected to；
(2) work as 2RRSU< L≤2RRSU+RνWhen, probability is：
At this point, probability consists of two parts, a part is to jump to be directly accessed the general of any one roadside unit RSU by one
Rate, another part is the vehicle that vehicle finds that another is in roadside unit RSU communication range in communication range, and is led to
It crosses the vehicle repeater found and then accesses roadside unit RSU, any one company in vehicle and two neighboring roadside unit RSU
It is logical；
(3) work as 2RRSU+Rν< L≤2RRSU+2RνWhen, probability is：
At this point, probability equally consists of two parts, a part is to jump to be directly accessed any one roadside unit RSU by one
Probability, another part is the vehicle that vehicle finds that another is in roadside unit RSU communication range in communication range,
And roadside unit RSU is accessed and then the vehicle repeater by finding, any one in vehicle and two neighboring roadside unit RSU
Road connection or vehicle are only connected to one of roadside unit RSU；(4) as L > 2RRSU+2RνWhen, probability is：
At this point, vehicle can not simultaneously be connected to two neighboring roadside unit RSU, vehicle only with one of trackside list
First RSU connection.
Preferably, the specifying constraint χaIt is as follows：
Condition 1：Force vehicle that can be connected simultaneously with a roadside unit RSU；
Condition 2：Constraint distribution resource summation is no more than total resource and return bandwidth；
Condition 3：The maximum rate of restricted information transmission；
Condition 4：Constrain largest buffered amount of the buffer memory no more than roadside unit RSU of all vehicles；
Condition 5：Roadside unit RSU is constrained to the transmission power of vehicle no more than maximum transmission power；
I.e.：
In formula,For vehicle connection matrix, indicate that vehicle can only be successfully connected to some RSU, SaFor maximum information
Transmission rate,To cache allocation of parameters, Sa,mFor the buffer memory of all vehicles, ZaFor the largest buffered amount of roadside unit RSU,
PmaxFor the maximum transmission power of roadside unit RSU to vehicle.
Preferably, using alternating direction multipliers method solve energy efficiency resource allocation optimization problem the specific steps are：
(1) pass through formula (11) solution and νa,mRelevant minimization problem, more new variables νa,m, formula (11) is expressed as：
In formula, t is the number of iterations,Vehicle when the t+1 times iteration to be associated with specifying constraint is connected to square
Battle array, ρ ' are Lagrangian penalty coefficient,Lagrangian when the t times iteration to be associated with specifying constraint,For the initial connection situation of vehicle and other roadside units RSU,To be associated with repeatedly the t+1 time of specifying constraint
For when vehicle and other roadside units RSU connection；
(2) pass through formula (12) solution and ra,mRelevant minimization problem, more new variables ra,m, formula (12) is expressed as：
In formula,For the connection state of all vehicles and roadside unit RSU, uaFor the corresponding energy dose-effect of roadside unit RSUa
Rate function,For indicate vehicle and other roadside units RSU initial connection situation,To be associated with specifying constraint
The t times iteration when vehicle connection matrix；
(3) Lagrange multiplier is updated by formula (13) iteration, formula (13) is expressed as：
In formula,Lagrange multiplier when the t+1 times iteration to be associated with specifying constraint,For for pass
It is coupled to Lagrange multiplier when the t times iteration of specifying constraint,All vehicles when for the t+1 times iteration with
The connection state of roadside unit RSU, ν(t+1)The connection shape of all vehicles and all roadside unit RSU when for the t+1 times iteration
Condition；
While iteration updates Lagrange multiplier, according to the Lagrange multiplier of each iteration, pass through given constraint
Condition more new vehicle connection matrix νa,m, vehicle caching matrix ya,mAnd resource allocation optimization parameterThen find out respectively with
νa,mRelevant minimization problem and and ra,mThe optimization solution of relevant minimization problem；
(4) the optimization solution of energy efficiency resource allocation optimization problem is calculated and is connected to square to get to the vehicle after optimization
Battle array νa,m, vehicle caching matrix ya,mAnd resource allocation optimization parameterAnd then energy efficiency η is calculateda,mIf the energy
Efficiency etaa,mDifference between preset value is in default range, then it is assumed that energy efficiency ηa,mFor the most optimal sorting of energy efficiency
Match.
Compared with prior art, the beneficial effects of the present invention are：
(1) present invention introduces average cache amounts, can be faster and efficiently and in road by roadside unit RSU caching
Vehicle carries out information transmission, by caching mechanism, can reduce bandwidth, reduces delay, save the cost, to improve information transmission
Instant rate, reach the maximized purpose of energy efficiency.
(2) present invention calculates energy efficiency by average cache meter, and is optimized using alternating direction multipliers method, really
Lagrange multiplier is determined to cooperate iteration optimization, is joined eventually by the resource allocation optimization that alternating direction multipliers method obtains vehicle
Optimum results of number, vehicle connection matrix and vehicle caching matrix, and then energy efficiency is calculated, if obtained energy and pre-
If the difference of value then obtains the optimum allocation of optimum results within the scope of preset.
(3) the practical probability of the present invention indicates the state of connection, according to the distance between two neighboring roadside unit RSU,
The connected probability for calculating road vehicle Yu similar roadside unit RSU, by connectivity problem and buffer memory, energy efficiency meter
Combine, be of great practical significance, roadside unit RSU construction can also be proposed according to the analysis of connectivity
The suggestion of distance.
(4) present invention turns to original on the basis of considering the caching gain of each roadside unit RSU with energy efficiency maximum
Then, alternating direction multipliers method is used in loop iteration and combines vehicle connection matrix and vehicle caching matrix, determines trackside list
The power of first RSU to vehicle user terminal most has distribution, to improve energy efficiency to the maximum extent.
Detailed description of the invention
Fig. 1 is the flow chart of the optimization method of energy efficiency resource allocation in car networking of the embodiment of the present invention.
Fig. 2 is car networking of embodiment of the present invention V2R communication scenes figure.
Specific embodiment
In the following, the present invention is specifically described by illustrative embodiment.It should be appreciated, however, that not into one
In the case where step narration, element, structure and features in an embodiment can also be advantageously incorporated into other embodiments
In.
Referring to Fig. 1, present invention discloses a kind of optimization method of energy efficiency resource allocation in car networking, specific steps
For：
Step 1：By adjacent the distance between two roadside unit RSU, judge whether are vehicle and roadside unit RSU
It can be connected to.
When judging whether vehicle can be connected to roadside unit RSU, it is assumed that road vehicle obeys Poisson distribution (ginseng
See Fig. 2), the distance between two neighboring roadside unit RSU is indicated with L, the communication radius that each roadside unit RSU can be covered
Use RRSUIt indicates, the communication radius R of each carνIt indicating, the connected probability between vehicle and roadside unit RSU is indicated with P (ν),
Road vehicle density is indicated with ρ；According to the distance between two neighboring roadside unit RSU, divide following four situation discussion
Connectivity between vehicle and roadside unit RSU：
(1) as 0 < L≤2RRSUWhen, probability is：
P (ν)=1 (6)
At this point, the location of vehicle is within the communication coverage of two neighboring roadside unit RSU, vehicle and phase
Two roadside unit RSU of neighbour are connected to；
(2) work as 2RRSU< L≤2RRSU+RνWhen, probability is：
At this point, probability consists of two parts, a part is to jump to be directly accessed the general of any one roadside unit RSU by one
Rate, another part is the vehicle that vehicle finds that another is in roadside unit RSU communication range in communication range, and is led to
It crosses the vehicle repeater found and then accesses roadside unit RSU, any one company in vehicle and two neighboring roadside unit RSU
It is logical；
(3) work as 2RRSU+Rν< L≤2RRSU+2RνWhen, probability is：
At this point, probability equally consists of two parts, a part is to jump to be directly accessed any one roadside unit RSU by one
Probability, another part is the vehicle that vehicle finds that another is in roadside unit RSU communication range in communication range,
And roadside unit RSU is accessed and then the vehicle repeater by finding, any one in vehicle and two neighboring roadside unit RSU
Road connection or vehicle are only connected to one of roadside unit RSU；
(4) as L > 2RRSU+2RνWhen, probability is：
At this point, vehicle can not simultaneously be connected to two neighboring roadside unit RSU, vehicle only with one of trackside list
First RSU connection.
Step 2：If vehicle can be connected to roadside unit RSU and be communicated, when vehicle disappears to roadside unit RSU sending
When breath request, vehicle is transmitted between vehicle and roadside unit RSU by buffer memory capacity to roadside unit RSU application buffer memory capacity
Information, by the average cache amount C of roadside unit RSU in the unit timeaAs average cache rate, average cache amount is defined as Ca：
In formula,For the average single user data rate of roadside unit RSU；qa,mIt is each vehicle to the Shen roadside unit RSU
Buffer memory capacity please is known quantity；M is the set of vehicle user terminal；M is the vehicle in each V2R communication scenes；νa,mFor
Vehicle connection matrix, indicates whether vehicle is connected to roadside unit RSU；ya,mFor vehicle caching matrix, indicate whether vehicle is applied
To buffer memory capacity；
Average cache rate is added with the current rate of information throughput in real time the current rate of information throughput R of acquisition (A,
M) it is：
In formula, A is the set of roadside unit RSU, Ra,mFor the current real-time rate of information throughput,It is excellent for resource allocation
Change parameter, indicates radio resource from roadside unit RSU to the percentage of vehicle user terminal；
Frequency efficiency is calculated, spectrum efficiency is the ratio of rate of information throughput R (A, M) and bandwidth B, i.e.,：
ra,m=R (A, M)/B (3)
In formula, ra,mFor spectrum efficiency；
Since spectrum efficiency is higher, energy efficiency is higher；Power consumption is smaller, and energy efficiency is higher.That is, energy
Efficiency and spectrum efficiency are directly proportional, and energy efficiency and power consumption are in inverse ratio.Therefore according to frequency efficiency and power efficiency, in turn
Obtain maximum energy efficiency ηa,mIt is expressed as:
In formula, PcPower, P are consumed for circuita,mTo send power, P is power distribution matrix, and V is vehicle incidence matrix；
By maximum energy efficiency ηa,mFunction is as objective function, specifying constraint, then energy efficiency resource allocation
Optimization problem is expressed as：
In formula, χaFor specifying constraint；
The specifying constraint χaIt is as follows：
Condition 1：Force vehicle that can be connected simultaneously with a roadside unit RSU；
Condition 2：Constraint distribution resource summation is no more than total resource and return bandwidth；
Condition 3：The maximum rate of restricted information transmission；
Condition 4：Constrain largest buffered amount of the buffer memory no more than roadside unit RSU of all vehicles；
Condition 5：Roadside unit RSU is constrained to the transmission power of vehicle no more than maximum transmission power；
I.e.：
In formula,For vehicle connection matrix, indicate that vehicle can only be successfully connected to some RSU, SaFor maximum information
Transmission rate,To cache allocation of parameters, Sa,mFor the buffer memory of all vehicles, ZaFor the largest buffered amount of roadside unit RSU,
PmaxFor the maximum transmission power of roadside unit RSU to vehicle.
Step 3：The optimization solution of energy efficiency resource allocation optimization problem is solved using alternating direction multipliers method.It is specific
Step is：
(1) pass through formula (11) solution and νa,mRelevant minimization problem, more new variables νa,m, formula (11) is expressed as：
In formula, t is the number of iterations,Vehicle when the t+1 times iteration to be associated with specifying constraint is connected to square
Battle array, ρ ' are Lagrangian penalty coefficient,Lagrangian when the t times iteration to be associated with specifying constraint,For the initial connection situation of vehicle and other roadside units RSU,To be associated with repeatedly the t+1 time of specifying constraint
For when vehicle and other roadside units RSU connection；
(2) pass through formula (12) solution and ra,mRelevant minimization problem, more new variables ra,m, formula (12) is expressed as：
In formula,For the connection state of all vehicles and roadside unit RSU, uaFor the corresponding energy dose-effect of roadside unit RSUa
Rate function,For indicate vehicle and other roadside units RSU initial connection situation,To be associated with specifying constraint
The t times iteration when vehicle connection matrix；
(3) Lagrange multiplier is updated by formula (13) iteration, formula (13) is expressed as：
In formula,Lagrange multiplier when the t+1 times iteration to be associated with specifying constraint,For for pass
It is coupled to Lagrange multiplier when the t times iteration of specifying constraint,All vehicles when for the t+1 times iteration with
The connection state of roadside unit RSU, ν(t+1)The connection shape of all vehicles and all roadside unit RSU when for the t+1 times iteration
Condition；
While iteration updates Lagrange multiplier, according to the Lagrange multiplier of each iteration, pass through given constraint
Condition more new vehicle connection matrix νa,m, vehicle caching matrix ya,mAnd resource allocation optimization parameterThen find out respectively with
νa,mRelevant minimization problem and and ra,mThe optimization solution of relevant minimization problem；
(4) the optimization solution of energy efficiency resource allocation optimization problem is calculated and is connected to square to get to the vehicle after optimization
Battle array νa,m, vehicle caching matrix ya,mAnd resource allocation optimization parameterAnd then energy efficiency η is calculateda,mIf the energy
Efficiency etaa,mDifference between preset value is in default range, then it is assumed that energy efficiency ηa,mFor the most optimal sorting of energy efficiency
Match.
The above method of the present invention considers the probability that vehicle be connected to roadside unit RSU, then by addition caching mechanism come
Mitigate bandwidth, improve the rate of information throughput, reduces delay, then carry out the resource allocation of energy efficiency, and related to resource allocation
Parameter advanced optimize processing, energy efficiency can be improved to the maximum extent, be preferably consistent with reality.
In the prior art, spectrum efficiency is calculated by following formula：
ra,m=log2(1+γa,m) (14)
In formula, γa,mThe Signal-to-Noise obtained from a roadside unit RSU for vehicle m.
In the present invention, frequency efficiency is the ratio of rate of information throughput R (A, M) and bandwidth B, i.e.,：ra,m=R (A, M)/B.
Due to introducing caching mechanism, buffer memory is equivalent to the information back bandwidth between roadside unit RSU and network, from
And lower communication bandwidth, increase the rate of information throughput, so as to improve energy efficiency.
Embodiment provided above only with illustrating the present invention for convenience, and it is not intended to limit the protection scope of the present invention,
Technical solution scope of the present invention, person of ordinary skill in the field make various simple deformations and modification, should all include
In the above claim.
Claims (4)
1. the optimization method of energy efficiency resource allocation in a kind of car networking, which is characterized in that the specific steps are that：By adjacent
The distance between two roadside unit RSU, judge whether vehicle can be connected to roadside unit RSU；
If vehicle can be connected to roadside unit RSU and be communicated, when vehicle issues message request to roadside unit RSU, vehicle
To roadside unit RSU application buffer memory capacity, information is transmitted by buffer memory capacity between vehicle and roadside unit RSU, by unit
The average cache amount C of roadside unit RSU in timeaAs average cache rate, average cache amount is defined as Ca：
In formula,For the average single user data rate of roadside unit RSU；qa,mIt is each vehicle to roadside unit RSU application
Buffer memory capacity is known quantity；M is the set of vehicle user terminal；M is the vehicle in each V2R communication scenes；νa,mFor vehicle
Connection matrix, indicates whether vehicle is connected to roadside unit RSU；ya,mFor vehicle caching matrix, indicate whether vehicle is applied to slow
Deposit capacity；
Average cache rate, which is added the current rate of information throughput R (A, M) of acquisition with the current rate of information throughput in real time, is：
In formula, A is the set of roadside unit RSU, Ra,mFor the current real-time rate of information throughput,For resource allocation optimization ginseng
Number indicates radio resource from roadside unit RSU to the percentage of vehicle user terminal；
Frequency efficiency is calculated, spectrum efficiency is the ratio of rate of information throughput R (A, M) and bandwidth B, i.e.,：
ra,m=R (A, M)/B (3)
In formula, ra,mFor spectrum efficiency；
And then obtain maximum energy efficiency ηa,mIt is expressed as:
In formula, PcPower, P are consumed for circuita,mTo send power, P is power distribution matrix, and V is vehicle incidence matrix；
By maximum energy efficiency ηa,mFunction is as objective function, specifying constraint, the then optimization of energy efficiency resource allocation
Problem representation is：
In formula, χaFor specifying constraint；
The optimization solution of energy efficiency resource allocation optimization problem is solved using alternating direction multipliers method.
2. the optimization method of energy efficiency resource allocation in car networking as described in claim 1, which is characterized in that judge vehicle
When whether can be connected to roadside unit RSU, it is assumed that road vehicle obeys Poisson distribution, two neighboring roadside unit
The distance between RSU indicates with L, the communication radius R that each roadside unit RSU can be coveredRSUIt indicates, the communication of each car
Radius RνIt indicates, the connected probability between vehicle and roadside unit RSU is indicated with P (ν), road vehicle density ρ table
Show；According to the distance between two neighboring roadside unit RSU, following four situation is divided to discuss between vehicle and roadside unit RSU
Connectivity：
(1) as 0 < L≤2RRSUWhen, probability is：
P (ν)=1 (6)
At this point, the location of vehicle is within the communication coverage of two neighboring roadside unit RSU, vehicle and adjacent two
A roadside unit RSU is connected to；
(2) work as 2RRSU< L≤2RRSU+RνWhen, probability is：
At this point, probability consists of two parts, a part is that the probability for being directly accessed any one roadside unit RSU is jumped by one,
Another part is the vehicle that vehicle finds that another is in roadside unit RSU communication range in communication range, and is passed through
The vehicle repeater and then access roadside unit RSU, vehicle found is connected to any one in two neighboring roadside unit RSU；
(3) work as 2RRSU+Rν< L≤2RRSU+2RνWhen, probability is：
At this point, probability equally consists of two parts, a part is to jump to be directly accessed the general of any one roadside unit RSU by one
Rate, another part is the vehicle that vehicle finds that another is in roadside unit RSU communication range in communication range, and is led to
It crosses the vehicle repeater found and then accesses roadside unit RSU, any one road in vehicle and two neighboring roadside unit RSU connects
Logical or vehicle is only connected to one of roadside unit RSU；
(4) as L > 2RRSU+2RνWhen, probability is：
At this point, vehicle can not simultaneously be connected to two neighboring roadside unit RSU, vehicle only with one of roadside unit
RSU connection.
3. the optimization method of energy efficiency resource allocation in car networking as claimed in claim 2, which is characterized in that described given
Constraint condition χaIt is as follows：
Condition 1：Force vehicle that can be connected simultaneously with a roadside unit RSU；
Condition 2：Constraint distribution resource summation is no more than total resource and return bandwidth；
Condition 3：The maximum rate of restricted information transmission；
Condition 4：Constrain largest buffered amount of the buffer memory no more than roadside unit RSU of all vehicles；
Condition 5：Roadside unit RSU is constrained to the transmission power of vehicle no more than maximum transmission power；
I.e.：
In formula,For vehicle connection matrix, indicate that vehicle can only be successfully connected to some RSU, SaFor the transmission of maximum information
Rate,To cache allocation of parameters, Sa,mFor the buffer memory of all vehicles, ZaFor the largest buffered amount of roadside unit RSU, Pmax
For the maximum transmission power of roadside unit RSU to vehicle.
4. the optimization method of energy efficiency resource allocation in car networking as claimed in claim 3, which is characterized in that utilize alternating
Direction multiplier method solve energy efficiency resource allocation optimization problem the specific steps are：
(1) pass through formula (11) solution and νa,mRelevant minimization problem, more new variables νa,m, formula (11) is expressed as：
In formula, t is the number of iterations,Vehicle connection matrix when the t+1 times iteration to be associated with specifying constraint, ρ '
For Lagrangian penalty coefficient,Lagrangian when the t times iteration to be associated with specifying constraint,For
The initial connection situation of vehicle and other roadside units RSU,When the t+1 times iteration to be associated with specifying constraint
The connection of vehicle and other roadside units RSU；
(2) pass through formula (12) solution and ra,mRelevant minimization problem, more new variables ra,m, formula (12) is expressed as：
In formula,For the connection state of all vehicles and roadside unit RSU, uaFor the corresponding energy efficiency letter of roadside unit RSU a
Number,For indicate vehicle and other roadside units RSU initial connection situation,For the t for being associated with specifying constraint
Vehicle connection matrix when secondary iteration；
(3) Lagrange multiplier is updated by formula (13) iteration, formula (13) is expressed as：
In formula,Lagrange multiplier when the t+1 times iteration to be associated with specifying constraint,For to be associated with
Lagrange multiplier when the t times iteration of specifying constraint,All vehicles and trackside when for the t+1 times iteration
The connection state of unit R SU, ν(t+1)The connection state of all vehicles and all roadside unit RSU when for the t+1 times iteration；
While iteration updates Lagrange multiplier, according to the Lagrange multiplier of each iteration, pass through specifying constraint
More new vehicle connection matrix νa,m, vehicle caching matrix ya,mAnd resource allocation optimization parameterThen it finds out respectively and νa,m
Relevant minimization problem and and ra,mThe optimization solution of relevant minimization problem；
(4) the optimization solution of energy efficiency resource allocation optimization problem is calculated to get the vehicle connection matrix to after optimizing
νa,m, vehicle caching matrix ya,mAnd resource allocation optimization parameterAnd then energy efficiency η is calculateda,mIf the energy dose-effect
Rate ηa,mDifference between preset value is in default range, then it is assumed that energy efficiency ηa,mFor the most optimal sorting of energy efficiency
Match.
Priority Applications (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN201811114722.4A CN108848480B (en) | 2018-09-25 | 2018-09-25 | Optimization method for energy-efficient resource allocation in Internet of vehicles |
Applications Claiming Priority (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN201811114722.4A CN108848480B (en) | 2018-09-25 | 2018-09-25 | Optimization method for energy-efficient resource allocation in Internet of vehicles |
Publications (2)
| Publication Number | Publication Date |
|---|---|
| CN108848480A true CN108848480A (en) | 2018-11-20 |
| CN108848480B CN108848480B (en) | 2020-10-16 |
Family
ID=64187930
Family Applications (1)
| Application Number | Title | Priority Date | Filing Date |
|---|---|---|---|
| CN201811114722.4A Active CN108848480B (en) | 2018-09-25 | 2018-09-25 | Optimization method for energy-efficient resource allocation in Internet of vehicles |
Country Status (1)
| Country | Link |
|---|---|
| CN (1) | CN108848480B (en) |
Cited By (4)
| 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 |
| CN110177355A (en) * | 2019-06-11 | 2019-08-27 | 重庆邮电大学 | Link selection and resource allocation methods based on collection of energy in a kind of car networking |
| CN111372219A (en) * | 2020-02-19 | 2020-07-03 | 重庆邮电大学 | Internet of vehicles link selection and resource allocation method |
| CN114554451A (en) * | 2022-02-22 | 2022-05-27 | 广东利通科技投资有限公司 | Vehicle-road communication resource allocation method and device, computer equipment and storage medium |
Citations (5)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN104507051A (en) * | 2014-12-16 | 2015-04-08 | 大连理工大学 | Message broadcast-oriented MAC (Media Access Control) layer improving method in VAENT (vehicular Ad-hoc NETwork) |
| CN105722231A (en) * | 2016-04-12 | 2016-06-29 | 江苏大学 | Continuous coordinative multichannel vehicular network MAC ((Medium Access Control) protocol |
| US20170150299A1 (en) * | 2015-11-20 | 2017-05-25 | Veniam, Inc. | Systems and methods for network coded mesh networking in a network of moving things |
| CN108012244A (en) * | 2017-11-29 | 2018-05-08 | 南京工业大学 | Highway vehicular ad hoc network data services communication system and method based on cluster |
| CN108462546A (en) * | 2018-03-27 | 2018-08-28 | 青岛智能产业技术研究院 | The parameter selection method of low-power consumption wide area network LoRa for car networking V2X communications |
-
2018
- 2018-09-25 CN CN201811114722.4A patent/CN108848480B/en active Active
Patent Citations (5)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN104507051A (en) * | 2014-12-16 | 2015-04-08 | 大连理工大学 | Message broadcast-oriented MAC (Media Access Control) layer improving method in VAENT (vehicular Ad-hoc NETwork) |
| US20170150299A1 (en) * | 2015-11-20 | 2017-05-25 | Veniam, Inc. | Systems and methods for network coded mesh networking in a network of moving things |
| CN105722231A (en) * | 2016-04-12 | 2016-06-29 | 江苏大学 | Continuous coordinative multichannel vehicular network MAC ((Medium Access Control) protocol |
| CN108012244A (en) * | 2017-11-29 | 2018-05-08 | 南京工业大学 | Highway vehicular ad hoc network data services communication system and method based on cluster |
| CN108462546A (en) * | 2018-03-27 | 2018-08-28 | 青岛智能产业技术研究院 | The parameter selection method of low-power consumption wide area network LoRa for car networking V2X communications |
Cited By (6)
| 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 |
| CN109756378B (en) * | 2019-01-12 | 2021-07-16 | 大连理工大学 | Intelligent computing unloading method under vehicle-mounted network |
| CN110177355A (en) * | 2019-06-11 | 2019-08-27 | 重庆邮电大学 | Link selection and resource allocation methods based on collection of energy in a kind of car networking |
| CN111372219A (en) * | 2020-02-19 | 2020-07-03 | 重庆邮电大学 | Internet of vehicles link selection and resource allocation method |
| CN111372219B (en) * | 2020-02-19 | 2022-04-12 | 重庆邮电大学 | Internet of vehicles link selection and resource allocation method |
| CN114554451A (en) * | 2022-02-22 | 2022-05-27 | 广东利通科技投资有限公司 | Vehicle-road communication resource allocation method and device, computer equipment and storage medium |
Also Published As
| Publication number | Publication date |
|---|---|
| CN108848480B (en) | 2020-10-16 |
Similar Documents
| Publication | Publication Date | Title |
|---|---|---|
| CN108848480A (en) | The optimization method of efficiency resource allocation in a kind of car networking | |
| CN102098684B (en) | System and method for allocating cross-layer resources in cognitive radio network | |
| CN110312231A (en) | Content caching decision and resource allocation joint optimization method based on mobile edge calculations in a kind of car networking | |
| Deng et al. | A multi-hop VANETs-assisted offloading strategy in vehicular mobile edge computing | |
| CN111132191A (en) | Method for unloading, caching and resource allocation of joint tasks of mobile edge computing server | |
| CN108601074A (en) | A kind of network resource allocation method and device based on isomery joint caching | |
| Yang | A task offloading solution for internet of vehicles using combination auction matching model based on mobile edge computing | |
| Jia et al. | Hierarchical content caching in fog radio access networks: Ergodic rate and transmit latency | |
| CN113163365A (en) | Unmanned aerial vehicle support networking resource optimization method based on alternating direction multiplier algorithm | |
| CN110505601A (en) | Information transmission frequency optimization method based on vehicle driving situation field model in a kind of car networking | |
| Rahim et al. | An intelligent content caching protocol for connected vehicles | |
| CN109788540A (en) | Power control and method for channel allocation in D2D system based on energy acquisition | |
| Cacciapuoti et al. | Software-defined network controlled switching between millimeter wave and terahertz small cells | |
| CN105743783A (en) | Car-Networking Node Selecting Method based on BS-TS and Autoencoder Network, and Accessibility Routing Mechanism Thereof | |
| CN117255368B (en) | Edge dynamic integration method for vehicle-mounted edge server and cooperative fixed edge server | |
| CN111741438B (en) | Edge computing side-end cooperative task unloading method and system considering vehicle movement | |
| CN109327821A (en) | A kind of message propagating method of combination car networking vehicle sociability | |
| CN114928611B (en) | IEEE802.11p protocol-based energy-saving calculation unloading optimization method for Internet of vehicles | |
| Li et al. | Deep reinforcement learning for collaborative computation offloading on internet of vehicles | |
| Lin et al. | A novel coalition game based distributed cooperative content caching in mobile edge networks | |
| CN110213823A (en) | A kind of accidental access method and device of narrowband Internet of Things | |
| CN114501550A (en) | Multitask unloading method based on NOMA in Internet of vehicles | |
| CN107911404A (en) | A kind of big compressing file method for down loading of car networking cloud | |
| CN108810856B (en) | M2M terminal service optimization control method | |
| Dinesh Kumar et al. | Proactive flow control using adaptive beam forming for smart intra-layer data communication in wireless network on chip |
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 |