CN110381466A - The automatic switch switching method of the road side base station of car networking - Google Patents
The automatic switch switching method of the road side base station of car networking Download PDFInfo
- Publication number
- CN110381466A CN110381466A CN201910633409.XA CN201910633409A CN110381466A CN 110381466 A CN110381466 A CN 110381466A CN 201910633409 A CN201910633409 A CN 201910633409A CN 110381466 A CN110381466 A CN 110381466A
- Authority
- CN
- China
- Prior art keywords
- base station
- road side
- side base
- model
- morp
- 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
- H04W24/00—Supervisory, monitoring or testing arrangements
- H04W24/06—Testing, supervising or monitoring using simulated traffic
-
- H—ELECTRICITY
- H04—ELECTRIC COMMUNICATION TECHNIQUE
- H04W—WIRELESS COMMUNICATION NETWORKS
- H04W4/00—Services specially adapted for wireless communication networks; Facilities therefor
- H04W4/02—Services making use of location information
- H04W4/029—Location-based management or tracking services
-
- 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]
-
- H—ELECTRICITY
- H04—ELECTRIC COMMUNICATION TECHNIQUE
- H04W—WIRELESS COMMUNICATION NETWORKS
- H04W52/00—Power management, e.g. TPC [Transmission Power Control], power saving or power classes
- H04W52/02—Power saving arrangements
- H04W52/0203—Power saving arrangements in the radio access network or backbone network of wireless communication networks
- H04W52/0206—Power saving arrangements in the radio access network or backbone network of wireless communication networks in access points, e.g. base stations
-
- 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/51—Allocation or scheduling criteria for wireless resources based on terminal or device properties
-
- 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 automatic switch switching method of the road side base station of car networking, belongs to wireless communication technology field.This method establishes total model of the automatic switch switching method of the road side base station of car networking to maximize operator's income as target；Then total model of the automatic switch switching method of the road side base station of car networking is divided into t-MORP and two model solutions of T-MORP, first obtains the optimal case of each time slot road side base station switch；The switch state figure of the optimal result of t-MORP model road side base station is indicated again, finally obtains the optimal solution of total model of the automatic switch switching method of the road side base station of car networking.Method proposed by the present invention meets the communication requirement of different type user；The Bandwidth Dynamic Allocation of road side base station is also given to the vehicle user communicated with, is not interfere with each other between vehicle user, improves the handling capacity of road side base station；It is optimized by the state to time slot Road side group station, so that the overall income of operator is maximum, reduces the unnecessary wasting of resources.
Description
Technical field
The invention belongs to wireless communication technology fields, and in particular to a kind of automatic switch switching of the road side base station of car networking
Method.
Background technique
In recent years, due to the fast development of network, between vehicle and vehicle (V2V) and vehicle and infrastructure (V2I)
Communication have received widespread attention.Vehicle self-organizing network has very road safety, traffic administration and other business applications
Big influence, simultaneously because mobility and flexibility with higher, vehicle can be used as mobile node and collect data and carry out
Forwarding, improves the utilization rate of vehicle self-organizing network.In vehicle self-organizing network, road side base station is one indispensable group
At part.With the development of 5G, in order to meet vehicle and a large amount of data requirements of user, Mobile Network Operator (Mobile
Network Operators) a large amount of road side base station (Roadside station) will be disposed.However, densely disposing road
The problems such as side group standing-meeting brings vast resources to waste.Therefore, it on the basis of guaranteeing vehicle, user and the normal communication of base station, grinds
The switching for studying carefully road side base station has great importance for the application and development of car networking.
Under 5G super-intensive network environment, in order to reduce the energy loss of base station, most effective power save mode is to close not
User is simultaneously diverted on adjacent base station by the base station that makes full use of.In cellular network communication field, there are many documents pair at present
Base station is closed to be studied to reduce energy loss.The first kind, which is researched and proposed, to be changed based on daily traffic to close base station,
Consider that the flow load in cellular network changes greatly, dynamic is closed into base station to reduce energy consumption, but does not account for base station switching
Brought power consumption issues (Traffic-Aware Base Station Sleeping Control and Power
Matching for Energy-Delay Tradeoffs in Green Cellular Networks[J].IEEE
Transactions on Wireless Communications,2013,12(8):4196-4209.).Second class is researched and proposed
Solution relevant to position selects two groups of different activities in day and night respectively according to the difference of user demand
Base station.However, these researchs are without discussing dynamic resource allocation relevant to base station switch switchover policy and user-association mechanism.
In addition, being only divided into two periods, i.e. daytime (peak period) and period at night (idle period) for one day, switch the time of switch
Granularity is rough, and this can be unfavorable (Green BSN:Enabling Energy- to the optimization of base station energy consumption
Proportional Cellular Base Station Networks[J].IEEE Transactions on Mobile
Computing,2014,13(11):2537-2551.)。
In conclusion current research work is primarily present following problems:
(1) most of researchs only considered the communication between cellular base station and ordinary user's (without mobility) and not
Consider in car networking, the mobility of vehicle is influenced on brought by vehicle and base station communication.
(2) many researchs will be only rough to divide the period, and not account for being brought when base station switch switching
Switching cost.
Therefore, the present invention has studied the automatic switch switching problem of the road side base station of car networking.For disposing road side base station
Network operator for, when the data that vehicle user is uploaded by road side base station can bring certain receipts to network operator
Enter；Conversely, can then bring one to network operator when (such as cellular network) uploads data to vehicle user otherwise
Divide loss.Therefore, network operator it is expected that vehicle user can select to communicate with road side base station as much as possible.The present invention considers
The problem of following several respects: (1) how to vehicle user bandwidth allocation resource road side base station coverage area in, trackside is improved
The handling capacity of base station.(2) consider the cost when automatic switch switching of road side base station, how to optimize the switch state of road side base station
So that the maximum revenue of operator.
Summary of the invention
The purpose of the present invention is to provide the automatic switch switching method of the road side base station of car networking, main thought is root
It is dynamically vehicle user bandwidth allocation in the case where guaranteeing the normal communication of vehicle user and road side base station according to the mobility of vehicle user
Resource optimizes the switch state of the road side base station of different time-gap, and is built using maximizing operator's income as target
Total model of the automatic switch switching method of the road side base station of vertical car networking；Then by the automatic switch of the road side base station of car networking
Total model of switching method is divided into t-MORP (t-Maximum Operator Revenue Problem) and T-MORP (T-
Maximum Operator Revenue Problem) two model solutions, first using McCormick method to t-MORP mould
0-1 variable in type is relaxed and is converted, and obtains each time slot to t-MORP model solution using Branch-and-Bound Algorithm
The optimal case of road side base station switch；Again by the switch state chart of the optimal result road side base station of t-MORP model
Show, utilizes Dijkstra ' s algorithm to solve T-MORP model, finally obtain the automatic switch switching side of the road side base station of car networking
The optimal solution of total model of method.
The object of the present invention is achieved like this:
The automatic switch switching method of the road side base station of car networking, includes the following steps:
Step 1: speed, position and the data volume for needing to upload of known vehicle user, using Markov Chain to vehicle
The mobility of user models；Road side base station provides the vehicle user dynamic bandwidth allocation in its communication range simultaneously
Source, considers the automatic switch switching cost between road side base station different time-gap, and the income of maximization network operator simultaneously obtains vehicle
Total model Φ of the automatic switch switching method of the road side base station of networking；
Step 2: according in step 1 road side base station of car networking automatic switch switching method total model Φ characteristic,
Total model Φ is divided to for t-MORP and two model solutions of T-MORP, is not considering switching cost of the road side base station between time slot
In the case where, total model Φ is reduced to t-MORP model Φ1, and using McCormick method to t-MORP model Φ1In
0-1 variable is relaxed and is converted；Then using Branch-and-Bound Algorithm to the t-MORP model Φ after relaxation1It is solved, is asked
The optimal solution of the switch state of each time slot road side base station out；
Step 3: by opening for the optimal solution road side base station of the switch state of each time slot road side base station found out in step 2
Off status transition diagram indicates, in the case where considering the switching cost between road side base station different time-gap, by the trackside of car networking
Total model Φ equivalence of the automatic switch switching method of base station is converted into T-MORP model Φ2, asked using Dijkstra ' s algorithm
Solve T-MORP model Φ2, so that the Income Maximum of network operator.
Total model Φ of the automatic switch switching method of the road side base station of car networking includes step in the step 1 are as follows:
(1.1) total amount of data Q of the t time slot vehicle user in section [0, D] is calculatedi(t) are as follows:
To wherein be divided within one day L time slot, t is wherein any one time slot, road side base station i from start the section of covering to
It is D that road side base station i+1, which starts the distance between section of covering, the section between [0, D] expression, ui,k(t) indicate that t time slot exists
Vehicle user k in [0, D] section, it is λ that the data volume that vehicle user needs to transmit, which obeys parameter,tPoisson distribution；
(1.2) t time slot is calculated in the vehicle user quantity C of region xi,x(t):
WhereinIndicate vehicle user ui,k(t) in the steady-state distribution probability of region x, H=1,2,3 ..., x,
... X } it indicates for [0, D] to be divided into X isometric region, the length of region x is dx；
(1.3) calculate the vehicle user in the x of region in the coverage area of road side base station i can call duration time Tx(t):
Tx(t)=hi,x(t)/speedi,x(t)
Wherein hi,x(t) at a distance from indicating that vehicle user and the road side base station i coverage area of region x are farthest, speedi,x(t)
For the vehicle user travel speed in the x of region；
(1.4) data volume that road side base station i can be obtained is calculated
Wherein ai,tIndicate the switch state of t time slot road side base station i, bi,x(t) indicate that road side base station i is to belong in the region x
Vehicle user distribution bandwidth resources, R be road side base station covering radius；0≤ai,tbi,x(t)
≤ B, B are the total bandwidth of road side base station,
(1.5) the total losses P of the data volume uploaded without road side base station is calculated:
Wherein p2Indicate the unit data quantity cost that do not transmit by road side base station, p3Indicate that each time slot road side base station is opened
Maintenance cost when opening, p4Indicate the cost of a road side base station switch state of every switching；
(1.6) using the total revenue of maximization network operator as target, opening automatically for the road side base station of car networking is obtained
Total model Φ that concern is changed:
Wherein p1For the income of unit data volume, a is solvedi,tAnd obtain the maximum return of network operator.
The specific implementation steps are as follows for the step 2:
(2.1) do not consider that the road side base station in the total model Φ of automatic switch switching method of the road side base station of car networking is often cut
Change the cost p of a next state4, t-MORP model Φ is converted by total model Φ1:
(2.2) a new variables w is introducedi(t)=ai,tbi,x(t) to t-MORP model Φ1In 0-1 variable relax
Conversion
0≤wi(t)≤ai,tBi
bi,x(t)-Bi(1-ai,t)≤wi(t)≤bi,x(t)
Wherein ai,t={ 0,1 }, 0≤bi,x(t)≤1；
(2.3) w is usedi(t) equivalencing t-MORP model Φ1With a occurred in constrainti,tbi,x(t):
(2.4) by wi(t) the t-MORP model Φ after equivalencing1Optimal solution is acquired using Branch-and-Bound Algorithm.
Specific step is as follows for the step 3:
(3.1) optimal solution obtained in step 2 is drawn as to the switch state figure G of t time slot road side base station ii=(Vi,
Ei), wherein ViIt is digraph GiIn all vertex set, EiIt is digraph GiIn all sides set, vertexWherein
z∈{1,0+, 0 } and represent able state of the road side base station i in t time slot；Work as ai,tWhen=1, only one vertexIndicate trackside
Base station i only exists open state in t time slot；And work as ai,tWhen=0, vertexWithIt indicates that road side base station i exists in time slot t to open
Open or close two states；
(3.2) according to the state of road side base station i different time-gap, there are two types of the side costs of different situations: ifAndThen
IfAndThen
WhereinIt indicatesWithSide cost between two vertex,
(3.3) a network flow diagrams G=(V, E), G are constructedi=(Vi, Ei) be G=(V, E) subgraph, wherein V represents net
The set on all vertex in network flow graph G=(V, E), E represent the set on all sides in network flow diagrams G=(V, E), T-MORP
Model Φ2Form are as follows:
Wherein (v, v') ∈ E represent vertex v in network flow diagrams G to vertex v ' a directed edge, cv,v'Vertex v is represented to arrive
Vertex v ' between side cost, yv,v'Represent vertex v to vertex v ' between side upstream quantity.
(3.4) T-MORP model Φ2It is solved using Dijkstra ' s shortest path first, finally by the trackside base of car networking
The total model Φ equivalence for the automatic switch switching method stood is converted into T-MORP model Φ2, and acquire optimal solution.
The beneficial effects of the invention are that:
(1) method proposed by the present invention considers the mobility problem of the vehicle user communicated with road side base station, full
The foot communication requirement of different type user.
(2) Bandwidth Dynamic Allocation of road side base station is given the vehicle user communicated with, vehicle by method proposed by the present invention
It is not interfere with each other between user, improves the handling capacity of road side base station.
(3) road side base station Switching method proposed by the present invention is carried out excellent by the state to time slot Road side group station
Change, so that the overall income of operator is maximum, reduces the unnecessary wasting of resources.
Detailed description of the invention
Fig. 1 is the automatic switch switching method flow chart of the road side base station of car networking；
Fig. 2 is the modeling procedure figure of the automatic switch total model Φ of switching method of the road side base station of car networking；
Fig. 3 is using McCormick algorithm in the automatic switch switching method of the road side base station of car networking to t-MORP mould
Type Φ1The flow chart of relaxation conversion；
T-MORP mould is solved using Dijkstra ' s algorithm in the automatic switch switching method of the road side base station of Fig. 4 car networking
Type Φ2Flow chart；
The switch state figure of road side base station i in the automatic switch switching method of the road side base station of Fig. 5 car networking；
The automatic switch switching method scene figure of the road side base station of Fig. 6 car networking.
Specific embodiment
The present invention is further described with reference to the accompanying drawing.
The present invention proposes a kind of automatic switch switching method of the road side base station of car networking, and the invention is by car networking and trackside
The automatic switch of base station combines, and not only can guarantee the communication between vehicle user and road side base station but also can be reduced resource consumption, most
The income of great Hua operator.
The present invention proposes that the automatic switch switching method of the road side base station of car networking, road side base station carry out vehicle user dynamic
The bandwidth resource allocation of state, and the handling capacity of road side base station is improved in this way；Consider road side base station open when maintenance at
Bring switching cost when the automatic switch switching of this and road side base station, to road side base station each time slot switch state into
Row optimization reduces the wasting of resources of road side base station and keeps the total revenue of network operator maximum.
The present invention proposes the automatic switch switching method of the road side base station of car networking.Its main thought is according to vehicle user
Mobility, be dynamically vehicle user bandwidth allocation resource under the normal communication for guaranteeing vehicle user and road side base station, to not
Switch state with the road side base station of time slot optimizes, and establishes car networking to maximize operator's income as target
Total model of the automatic switch switching method of road side base station；Then by the automatic switch switching method of the road side base station of car networking
Total model is divided into t-MORP (t-Maximum Operator Revenue Problem) and T-MORP (T-Maximum
Operator Revenue Problem) two model solutions, first using McCormick method to the 0- in t-MORP model
1 variable is relaxed and is converted, and obtains each time slot road side base station to t-MORP model solution using Branch-and-Bound Algorithm
The optimal case of switch；The switch state figure of the optimal result of t-MORP model road side base station is indicated again, is utilized
Dijkstra ' s algorithm solves T-MORP model, finally obtains total mould of the automatic switch switching method of the road side base station of car networking
The optimal solution of type.
The automatic switch switching method of the road side base station of above-mentioned car networking, it is main comprising the following specific steps
(1) speed of known vehicle user, position and the data volume for needing to upload use vehicle using Markov Chain
The mobility at family is modeled；Road side base station examines the vehicle user dynamic bandwidth allocation resource in its communication range simultaneously
Consider the automatic switch switching cost between road side base station different time-gap, the income of maximization network operator simultaneously obtains car networking
Total model Φ of the automatic switch switching method of road side base station.
It (2), will be total according to the characteristic of total model Φ of the automatic switch switching method of the road side base station of previous step car networking
It is t-MORP and two model solutions of T-MORP that model Φ, which is divided to, in the feelings for not considering switching cost of the road side base station between time slot
Under condition, total model Φ is reduced to t-MORP model Φ1, and using McCormick method to t-MORP model Φ1In 0-1 become
Amount is relaxed and is converted；Then using Branch-and-Bound Algorithm to the t-MORP model Φ after relaxation1It is solved, is found out each
The optimal solution of the switch state of time slot road side base station.
(3) by the switch state chart of the optimal solution road side base station of the switch state of each time slot road side base station
Show.In the case where considering the switching cost between road side base station different time-gap, by the automatic switch of the road side base station of car networking
Total model Φ equivalence of switching method is converted into T-MORP model Φ2, T-MORP model Φ is solved using Dijkstra ' s algorithm2,
So that the Income Maximum of network operator.
Assuming that road side base station is deployed in the both sides of the road of highway under highway scene.Present invention contemplates that
The bandwidth of the uplink communication of road side base station and vehicle user, each road side base station is total to by the vehicle user communicated with it
It enjoys.When road side base station is in the open state, road side base station is dynamically distributed according to the vehicle user quantity in coverage area for it
Bandwidth is to meet the data transfer demands of vehicle user.And the vehicle user outside road side base station range then selects other way
(such as cellular network) uploads data.
Major parameter table of the invention is as shown in table 1:
The automatic switch switching method parameter list of the road side base station of 1 car networking of table
Specific implementation step in the step of automatic switch switching method of the road side base station of car networking above-mentioned (1) is such as
Under:
(1.1) assume will to be divided within one day L time slot, and t is wherein any one time slot.Assuming that there is N number of road side base station etc.
Distance is deployed in the both sides of the road of highway, enables ai,tIndicate the switch state of t time slot road side base station i.
Assuming that the distance between the section that road side base station i is covered since the section to road side base station i+1 for starting covering is
D, and with [0, D] expression between section.Enable Ui(t)={ ui,1(t),ui,2(t),...,ui,k(t),...,ui,K(t) } it indicates
Vehicle user in [0, D] section, ui,k(t) vehicle user k of the t time slot in [0, D] section is indicated, vehicle user needs
It is λ that the data volume of transmission, which obeys parameter,tPoisson distribution.Vehicle user can constantly change itself position in highway driving
It sets, present invention assumes that only considering the case where vehicle user is communicated with road side base station when each time slot starts.Then t time slot vehicle
Total amount of data Q of the user in section [0, D]i(t) it can be obtained by following formula:
(1.2) H={ 1,2,3 ..., x ... X } is enabled to indicate for [0, D] to be divided into X isometric region, the length of region x
Degree is dx.It is θ that residence time of the vehicle user in region x (x ∈ H), which obeys mean value,xGeometry distribution, wherein θxIt is long by region
Spend dxWith the average speed speed of the vehicle user in region xxIt codetermines, i.e. θx=dx/speedx.Therefore, vehicle user exists
In one small period Δ or with Δ/θxProbability be transferred to next region or with 1- Δ/θxProbability stay in and work as
Forefoot area, then vehicle user be in the probability of region x Represent vehicle user ui,k(t) in the stable state of region x
Distribution probability, at given transition probability matrix P, vehicle user ui,k(t) in the steady-state distribution in X regionIt can be indicated by each state probability in Markov Chain.
It can thus be concluded that t time slot is in region x vehicle user quantity Ci,x(t):
(1.3) calculate the vehicle user in the x of region in the coverage area of road side base station i can call duration time Tx(t):
Tx(t)=hi,x(t)/speedi,x(t)
Wherein hi,x(t) at a distance from indicating that vehicle user and the road side base station i coverage area of region x are farthest, same time slot exists
The vehicle user of the same area regards an entirety, speed asi,xIt (t) is the vehicle user travel speed in the x of region, and with often
The center in a region indicates the vehicle user in the position in the region.
(1.4) data volume that road side base station i can be obtained is calculated
Wherein bi,x(t) indicate that road side base station i is the bandwidth resources of the vehicle user distribution belonged in the region x, R is trackside
The covering radius of base station.
(1.5) since the total bandwidth B of road side base station is limited, road side base station i is the bandwidth of all vehicle users distribution
Resource has following constraint no more than B:
Correspondingly, it can not be more than B that road side base station i, which is the bandwidth of the vehicle user distribution in the x of region, constrain as follows:
0≤ai,tbi,x(t)≤B
(1.6) vehicle user of region x uploads to the data volume of road side base station no more than its all data volume, constraint
It is as follows:
(1.7) vehicle user on [0, D] section uploads to the data volume of road side base station no more than total amount of data Qi
(t), it constrains as follows:
(1.8) the total losses P of the data volume uploaded without road side base station is calculated:
Wherein p2Indicate the unit data quantity cost that do not transmit by road side base station, p3Indicate that each time slot road side base station is opened
Maintenance cost when opening, p4Indicate the cost of a road side base station switch state of every switching.
(1.9) using the total revenue of maximization network operator as target, opening automatically for the road side base station of car networking is obtained
Total model Φ of switching method is closed, i.e.,Wherein p1For the income of unit data volume, a is solvedi,t
And obtain the maximum return of network operator.
Step (2) in the automatic switch switching method of the road side base station of car networking above-mentioned is by the road side base station of car networking
The total model Φ of automatic switch switching method be reduced to t-MORP model Φ1, and using McCormick method to t-MORP model
Φ1In 0-1 variable relaxed and converted, and using branch and bound method solve t-MORP model Φ1Specific implementation step
It is as follows:
(2.1) road side base station in the automatic switch total model Φ of switching method of the road side base station of car networking is not considered first
Cost (the p of one next state of every switching4), t-MORP model Φ is converted by total model Φ1:
(2.2) a new variables w is introducedi(t)=ai,tbi,x(t) come to t-MORP model Φ1In 0-1 variable carry out pine
Relax conversion, because of ai,t={ 0,1 }, 0≤bi,x(t)≤1, so increasing following constraint:
0≤wi(t)≤ai,tBi
bi,x(t)-Bi(1-ai,t)≤wi(t)≤bi,x(t)
(2.3) w is usedi(t) equivalencing t-MORP model Φ1With a occurred in constrainti,tbi,x(t), then it can be obtained as follows
Form:
(2.4) by wi(t) the t-MORP model Φ after equivalencing1Optimal solution can be acquired using Branch-and-Bound Algorithm.
Step (3) in the automatic switch switching method of the road side base station of car networking above-mentioned is by road side base station different time-gap
Under switch state indicated with road side base station switch state figure.In the automatic switch switching for considering the road side base station of car networking
Cost (the p of road side base station one next state of every switching in the total model Φ of method4), T-MORP mould is converted by total model Φ equivalence
Type Φ2, and T-MORP model Φ is solved using Dijkstra ' s algorithm2Specific step is as follows:
(3.1) after obtaining the optimal solution of switch state of t time slot road side base station, obtained optimal solution is drawn as t time slot
The switch state figure G of road side base station ii=(Vi, Ei).Wherein ViIt is digraph GiIn all vertex set, EiIt is oriented
Scheme GiIn all sides set, vertexWherein z ∈ { 1,0+, 0 } and represent able state of the road side base station i in t time slot；
Work as ai,tWhen=1, only one vertexIndicate that road side base station i only exists open state in t time slot；And work as ai,tWhen=0, vertexWithIt indicates that road side base station i exists in time slot t and is turned on or off two states.
(3.2) it enablesIt indicatesWithSide cost between two vertex,According to trackside base
It stands the state of i different time-gap, there are two types of the side costs of different situations:
1. ifAndThen:
2. ifAndThen:
(3.3) a network flow diagrams G=(V, E), G are constructedi=(Vi, Ei) be G=(V, E) subgraph, wherein V represents net
The set on all vertex in network flow graph G=(V, E), E represent the set on all sides in network flow diagrams G=(V, E).It enablesS and e is increased starting point and terminal, E in network flow diagramssIt has been
Set of the beginning node s to the side of all vertex (t=0 time slot), EeIt is the collection of all vertex (t=L time slot) to the side of terminal e
It closes.T-MORP model Φ is converted by the total model Φ of the automatic switch switching method of the road side base station of car networking2.At this point, T-
MORP model Φ2Form it is as follows:
Wherein (v, v') ∈ E represent vertex v in network flow diagrams G to vertex v ' a directed edge, cv,v'Vertex v is represented to arrive
Vertex v ' between side cost, yv,v'Represent vertex v to vertex v ' between side upstream quantity.
(3.4) for any node v ∈ V, the difference between the quantity always flowed into and the quantity always flowed out is supplied equal to the node
The quantity of the stream of (or demand) is answered, is constrained as follows:
Wherein, yvRepresent the quantity of the stream of vertex v supply (or demand).
(3.5) T-MORP model Φ2It can be solved using Dijkstra ' s shortest path first, finally by the road of car networking
Total model Φ equivalence of the automatic switch switching method at side group station is converted into T-MORP model Φ2, and acquire optimal solution.
Such as Fig. 6, in the embodiment, there are three vehicle users in the coverage area of road side base station RSU1, on the road Wei Bei
There are four vehicle users in the coverage area of side group station RSU1.Assuming that in t, in t={ 1,2,3 ..., 12 } time slot, each vehicle
The data volume λ of user's upload all in needt, t=1,2,3 ..., 12 }.
The automatic switch switching method of the road side base station of car networking it is main comprising the following specific steps
(1) the total amount of data Q in section in from road side base station RSU1 coverage area to road side base station RSU2 coverage area is calculatedi
(t), section [0, D] is divided into seven regions by i=1, t={ 1,2,3 ..., 12 }, i.e. region 7 is arrived in region 1.
(2) steady-state distribution in region 7 is arrived in region 1 according to given transition probability matrix P and vehicle user, calculated every
Vehicle number C in a regioni,x(t), x={ 1,2,3 ..., 7 }, i=1, t=1,2,3 ..., 12 }.
(3) vehicle user in zoning x, x={ 1,2,3 ..., 7 } is in the coverage area of road side base station RSU1
It can call duration time Tx(t), x={ 1,2,3 ..., 7 }, t=1,2,3 ..., 12 }.
(4) data volume obtained by road side base station RSU1 when road side base station RSU1 is in the open state is calculated
(5) the total losses P of the data volume uploaded without road side base station is calculated.With the total revenue of maximization network operator
As target, total model Φ of the automatic switch switching of the road side base station of car networking is obtained.
(6) the total model Φ of the automatic switch switching method of the road side base station of car networking is reduced to t-MORP model Φ1.?
Road side base station one next state of every switching in the automatic switch total model Φ of switching method of the road side base station of car networking is not considered
The total model Φ of the automatic switch switching method of the road side base station of car networking is converted t-MORP model Φ by cost1。
(7) a new variables w is addedi(t)=ai,tbi,x(t), i=1, t=1,2,3 ..., 12 } and two constraints 0
≤wi(t)≤ai,tBi, i=1, t={ 1,2,3 ..., 12 }, bi,x(t)-Bi(1-ai,t)≤wi(t)≤bi,x(t), i=1, t=
1,2,3 ..., and 12 } come to t-MORP model Φ1In 0-1 variable carry out relax conversion.
(8) by the t-MORP model Φ after conversion1Optimal solution is found out with branch and bound method.
(9) t is being obtained, after the optimal solution of the switch state of t={ 1,2,3 ..., 12 } time slot road side base station, by what is obtained
Optimal solution is drawn as t, and the switch state of t={ 1,2,3 ..., 12 } time slot road side base station i, i=1, t={ 1,2,3 ..., 12 } turns
Change figure Gi=(Vi, Ei), i=1.Calculate switch state figure GiIn two adjacent vertexBetween side cost
(10) a network flow diagrams G=(V, E) is constructed, wherein
S and e is increased starting point and terminal in network flow diagrams.T-MORP model Φ is converted by total model Φ2。
(11) T-MORP model Φ2It can be solved using Dijkstra ' s shortest path first, finally by car networking
Total model Φ equivalence of automatic switch switching is converted into T-MORP model Φ2, and acquire optimal solution.
Finally, this patent propose car networking road side base station automatic switch switching method can reach it is following the utility model has the advantages that
(1) method proposed by the present invention considers the mobility problem of the vehicle user communicated with road side base station, full
The foot communication requirement of different type user.
(2) Bandwidth Dynamic Allocation of road side base station is given the vehicle user communicated with, vehicle by method proposed by the present invention
It is not interfere with each other between user, improves the handling capacity of road side base station.
(3) road side base station Switching method proposed by the present invention is carried out excellent by the state to time slot Road side group station
Change, so that the overall income of operator is maximum, reduces the unnecessary wasting of resources.
Claims (4)
1. the automatic switch switching method of the road side base station of car networking characterized by comprising
Step 1: the speed of known vehicle user, position and the data volume for needing to upload, use vehicle using Markov Chain
The mobility at family is modeled；Road side base station examines the vehicle user dynamic bandwidth allocation resource in its communication range simultaneously
Consider the automatic switch switching cost between road side base station different time-gap, the income of maximization network operator simultaneously obtains car networking
Total model Φ of the automatic switch switching method of road side base station；
Step 2: according to the characteristic of total model Φ of the automatic switch switching method of the road side base station of car networking in step 1, it will
It is t-MORP and two model solutions of T-MORP that total model Φ, which is divided to, is not considering switching cost of the road side base station between time slot
In the case of, total model Φ is reduced to t-MORP model Φ1, and using McCormick method to t-MORP model Φ1In 0-1
Variable is relaxed and is converted；Then using Branch-and-Bound Algorithm to the t-MORP model Φ after relaxation1It is solved, is found out every
The optimal solution of the switch state of a time slot road side base station；
Step 3: by the switch of the optimal solution road side base station of the switch state of each time slot road side base station found out in step 2
State transition graph indicates, in the case where considering the switching cost between road side base station different time-gap, by the trackside base of car networking
The total model Φ equivalence for the automatic switch switching method stood is converted into T-MORP model Φ2, solved using Dijkstra ' s algorithm
T-MORP model Φ2, so that the Income Maximum of network operator.
2. the automatic switch switching method of the road side base station of car networking according to claim 1, it is characterised in that: described
Total model Φ of the automatic switch switching method of the road side base station of calculating car networking includes: in step 1
(1.1) total amount of data Q of the t time slot vehicle user in section [0, D] is calculatedi(t) it is
Wherein it was divided into L time slot for one day, t is wherein any one time slot, and road side base station i is from the section for starting to cover to trackside
It is D that base station i+1, which starts the distance between section of covering, the section between [0, D] expression, ui,k(t) indicate t time slot in [0, D]
Vehicle user k in section, it is λ that the data volume that vehicle user needs to transmit, which obeys parameter,tPoisson distribution；
(1.2) t time slot is calculated in the vehicle user quantity C of region xi,x(t)
WhereinIndicate vehicle user ui,k(t) in the steady-state distribution probability of region x, H=1,2,3 ..., x ... and X } table
Show and [0, D] is divided into X isometric region, the length of region x is dx；
(1.3) the call duration time T in the vehicle user in the x of region in the coverage area of road side base station i is calculatedx(t):
Tx(t)=hi,x(t)/speedi,x(t)
Wherein hi,x(t) at a distance from indicating that vehicle user and the road side base station i coverage area of region x are farthest, speedi,xIt (t) is area
Vehicle user travel speed in the x of domain；
(1.4) data volume that road side base station i is obtained is calculated
Wherein ai,tIndicate the switch state of t time slot road side base station i, bi,x(t) indicate that road side base station i is the vehicle belonged in the region x
The bandwidth resources of user distribution, R are the covering radius of road side base station；
(1.5) the total losses P of the data volume uploaded without road side base station is calculated
Wherein p2Indicate the unit data quantity cost that do not transmit by road side base station, p3When indicating that each time slot road side base station is opened
Maintenance cost, p4Indicate the cost of a road side base station switch state of every switching；
(1.6) using the total revenue of maximization network operator as target, the automatic switch for obtaining the road side base station of car networking is cut
The total model Φ changed
Wherein p1For the income of unit data volume, a is solvedi,tAnd obtain the maximum return of network operator.
3. the automatic switch switching method of the road side base station of car networking according to claim 2, it is characterised in that: described
The optimal solution that the switch state of each time slot road side base station is found out in step 2 includes:
(2.1) the every switching one of road side base station in the automatic switch total model Φ of switching method of the road side base station of car networking is not considered
The cost p of next state4, t-MORP model Φ is converted by total model Φ1:
(2.2) a new variables w is introducedi(t)=ai,tbi,x(t) to t-MORP model Φ1In 0-1 variable carry out relax conversion；
(2.3) w is usedi(t) equivalencing t-MORP model Φ1With a occurred in constrainti,tbi,x(t):
(2.4) by wi(t) the t-MORP model Φ after equivalencing1Optimal solution is acquired using Branch-and-Bound Algorithm.
4. the automatic switch switching method of the road side base station of car networking according to claim 2 or 3, it is characterised in that: institute
The optimal solution of total model of the automatic switch switching method of the road side base station of calculating car networking includes: in the step of stating three
(3.1) optimal solution obtained in step 2 is drawn as to the switch state figure G of t time slot road side base station ii=(Vi, Ei),
Wherein ViIt is digraph GiIn all vertex set, EiIt is digraph GiIn all sides set, vertexWherein z ∈
{1,0+, 0 } and represent able state of the road side base station i in t time slot；
(3.2) according to the state of road side base station i different time-gap, there are two types of the side costs of different situations: if
AndThenIfAndThenWherein
It indicatesWithSide cost between two vertex,
(3.3) T-MORP model Φ2Form are as follows:Wherein (v, v') ∈ E represents vertex in network flow diagrams G
V to vertex v ' a directed edge, cv,v'Represent vertex v to vertex v ' between side cost, yv,v'Represent vertex v to vertex v '
Between side upstream quantity；
(3.4) T-MORP model Φ2It is solved using Dijkstra ' s shortest path first, finally by the road side base station of car networking
Total model Φ equivalence of automatic switch switching method is converted into T-MORP model Φ2, and acquire optimal solution.
Priority Applications (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN201910633409.XA CN110381466B (en) | 2019-07-10 | 2019-07-10 | Automatic switch switching method for road side base station of Internet of vehicles |
Applications Claiming Priority (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN201910633409.XA CN110381466B (en) | 2019-07-10 | 2019-07-10 | Automatic switch switching method for road side base station of Internet of vehicles |
Publications (2)
| Publication Number | Publication Date |
|---|---|
| CN110381466A true CN110381466A (en) | 2019-10-25 |
| CN110381466B CN110381466B (en) | 2022-07-15 |
Family
ID=68253167
Family Applications (1)
| Application Number | Title | Priority Date | Filing Date |
|---|---|---|---|
| CN201910633409.XA Active CN110381466B (en) | 2019-07-10 | 2019-07-10 | Automatic switch switching method for road side base station of Internet of vehicles |
Country Status (1)
| Country | Link |
|---|---|
| CN (1) | CN110381466B (en) |
Citations (10)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| US20080119982A1 (en) * | 2006-11-22 | 2008-05-22 | Denso Corporation | Power consumption recording apparatus and program for the same |
| EP2280573A2 (en) * | 2009-06-30 | 2011-02-02 | Vodafone Group PLC | Reducing power consumption of indoor base stations |
| US20140295905A1 (en) * | 2011-03-18 | 2014-10-02 | Nokia Corporation | Switching Cells On And Off On A Need Basis In A Wireless Communications Systems |
| CN104954983A (en) * | 2015-05-14 | 2015-09-30 | 清华大学 | Dynamic base station on-off control method and device based on fingerprint database |
| US20150334659A1 (en) * | 2014-05-16 | 2015-11-19 | Telefonaktiebolaget L M Ericsson (Publ) | Methods and Nodes of a Wireless Network for Deciding on Switching Off of a Network Node |
| CN105227221A (en) * | 2015-09-01 | 2016-01-06 | 东南大学 | The base station switch system of selection of high energy efficiency in a kind of CRAN |
| CN105263147A (en) * | 2015-11-25 | 2016-01-20 | 中国联合网络通信集团有限公司 | Base station regulation method and equipment |
| CN107682919A (en) * | 2017-09-12 | 2018-02-09 | 南京邮电大学 | A kind of park mode research based on 5G femtocells |
| WO2018125686A2 (en) * | 2016-12-30 | 2018-07-05 | Intel Corporation | Methods and devices for radio communications |
| CN108629470A (en) * | 2017-03-17 | 2018-10-09 | 华北电力大学 | System capacity management of providing multiple forms of energy to complement each other based on non-cooperative game is run with optimization |
-
2019
- 2019-07-10 CN CN201910633409.XA patent/CN110381466B/en active Active
Patent Citations (10)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| US20080119982A1 (en) * | 2006-11-22 | 2008-05-22 | Denso Corporation | Power consumption recording apparatus and program for the same |
| EP2280573A2 (en) * | 2009-06-30 | 2011-02-02 | Vodafone Group PLC | Reducing power consumption of indoor base stations |
| US20140295905A1 (en) * | 2011-03-18 | 2014-10-02 | Nokia Corporation | Switching Cells On And Off On A Need Basis In A Wireless Communications Systems |
| US20150334659A1 (en) * | 2014-05-16 | 2015-11-19 | Telefonaktiebolaget L M Ericsson (Publ) | Methods and Nodes of a Wireless Network for Deciding on Switching Off of a Network Node |
| CN104954983A (en) * | 2015-05-14 | 2015-09-30 | 清华大学 | Dynamic base station on-off control method and device based on fingerprint database |
| CN105227221A (en) * | 2015-09-01 | 2016-01-06 | 东南大学 | The base station switch system of selection of high energy efficiency in a kind of CRAN |
| CN105263147A (en) * | 2015-11-25 | 2016-01-20 | 中国联合网络通信集团有限公司 | Base station regulation method and equipment |
| WO2018125686A2 (en) * | 2016-12-30 | 2018-07-05 | Intel Corporation | Methods and devices for radio communications |
| CN108629470A (en) * | 2017-03-17 | 2018-10-09 | 华北电力大学 | System capacity management of providing multiple forms of energy to complement each other based on non-cooperative game is run with optimization |
| CN107682919A (en) * | 2017-09-12 | 2018-02-09 | 南京邮电大学 | A kind of park mode research based on 5G femtocells |
Non-Patent Citations (3)
| Title |
|---|
| CHENLU WEN: "An RSU On/Off Scheduling Mechanism for Energy Efficiency in Sparse Vehicular Networks", 《IEEE》 * |
| YU WANG: "Multiple RSUs Scheduling for Energy Efficiency in Vehicular Ad Hoc Networks", 《WIRELESS PERSONAL COMMUNICATIONS》 * |
| 苗宇庭: "基于基站开关策略的无线网节能技术研究", 《信息科技辑》 * |
Also Published As
| Publication number | Publication date |
|---|---|
| CN110381466B (en) | 2022-07-15 |
Similar Documents
| Publication | Publication Date | Title |
|---|---|---|
| Yang et al. | Intelligent resource management based on reinforcement learning for ultra-reliable and low-latency IoV communication networks | |
| Wang et al. | Offloading mobile data traffic for QoS-aware service provision in vehicular cyber-physical systems | |
| CN104507144B (en) | Wireless take can junction network joint relay selection and resource allocation methods | |
| CN102917446B (en) | Environmental protection and energy conservation oriented dynamic cell dormancy method | |
| CN107708214A (en) | Network utility based on Liapunov maximizes virtual resource allocation method | |
| CN102014410A (en) | Communication control device | |
| Jiang et al. | Base station association game in multi-cell wireless networks (special paper) | |
| CN102196579A (en) | Quick algorithm for joint resource allocation in heterogeneous wireless network parallel multi-access system | |
| Piovesan et al. | Joint load control and energy sharing for autonomous operation of 5G mobile networks in micro-grids | |
| CN102523559B (en) | A kind of multi-cast and unicast federated resource dispatching algorithm for improving terminal energy consumption efficiency | |
| Li et al. | An energy-effective network deployment scheme for 5G Cloud Radio Access Networks | |
| Zhong et al. | EMPC: Energy-minimization path construction for data collection and wireless charging in WRSN | |
| CN108601036A (en) | It is a kind of based on the gradually convex car networking priority scheduling of resource method and apparatus approached | |
| Jian et al. | Energy-efficient user association with load-balancing for cooperative IIoT network within B5G era | |
| Lee et al. | Opportunistic power scheduling for multi-server wireless systems with minimum performance constraints | |
| CN106209336A (en) | A kind of resource allocation methods in software definition mobile network | |
| CN102711259B (en) | Wireless heterogeneous network throughput optimization method based on Markov process | |
| Shi et al. | A Network architecture for load balancing of heterogeneous wireless networks | |
| CN110381466A (en) | The automatic switch switching method of the road side base station of car networking | |
| Yin et al. | Load-adaptive energy-saving strategy based on matching game in edge-enhanced metro FiWi | |
| Wang et al. | Multiple RSUs scheduling for energy efficiency in vehicular ad hoc networks | |
| Phan et al. | Joint medium access control, routing and energy distribution in multi-hop wireless networks | |
| CN107995034A (en) | A kind of dense cellular network energy and business collaboration method | |
| CN111047227B (en) | Robust energy scheduling method based on two-stage energy and service space-time matching | |
| Qiao et al. | Multiple time-scale energy scheduling with energy harvesting aided heterogeneous cloud radio access networks |
Legal Events
| Date | Code | Title | Description |
|---|---|---|---|
| PB01 | Publication | ||
| PB01 | Publication | ||
| SE01 | Entry into force of request for substantive examination | ||
| SE01 | Entry into force of request for substantive examination | ||
| GR01 | Patent grant | ||
| GR01 | Patent grant |