CN106332296A - Method for scheduling radio resources in car-mounted communication system - Google Patents
Method for scheduling radio resources in car-mounted communication system Download PDFInfo
- Publication number
- CN106332296A CN106332296A CN201610902493.7A CN201610902493A CN106332296A CN 106332296 A CN106332296 A CN 106332296A CN 201610902493 A CN201610902493 A CN 201610902493A CN 106332296 A CN106332296 A CN 106332296A
- Authority
- CN
- China
- Prior art keywords
- vehicle node
- val
- resource block
- vehicle
- smear
- Prior art date
- Legal status (The legal status is an assumption and is not a legal conclusion. Google has not performed a legal analysis and makes no representation as to the accuracy of the status listed.)
- Pending
Links
Classifications
-
- H—ELECTRICITY
- H04—ELECTRIC COMMUNICATION TECHNIQUE
- H04W—WIRELESS COMMUNICATION NETWORKS
- H04W72/00—Local resource management
- H04W72/12—Wireless traffic scheduling
Abstract
The invention provides a method for scheduling radio resources in a car-mounted communication system. All car nodes in a V2X network execute the following operation that a car node set competing with the car nodes for the same resource block in neighbor car nodes is acquired, whether the car nodes can succeed or not in the competition of the corresponding resource block is judged through a random selection function, and if the competition succeeds, data to be transmitted is transmitted through the competed resource block; if the car nodes fail in the competition, the currently competed resource block is given up, and the car nodes continue to compete for the next resource block till the car nodes succeed in the competition. Concentrated resource scheduling is not needed, distributed resource scheduling can be carried out according to information of the car nodes and information of the neighbor car nodes, therefore, the use efficiency of the resources is improved, and conflicts in the communication process are avoided as much as possible.
Description
Technical field
The present invention relates to in-vehicle wireless communication technical field, the scheduling of Radio Resource in a kind of Vehicular communication system
Method.
Background technology
V2X is the core technology of intelligent transportation system (ITS).It is one using move vehicle as network node from group
Knitmesh network, is highly important network.ITS relies on short-range communication technique to realize between car and car and car and roadside base station
Communication.Compared with traditional infrastructure network, V2X network has two main advantages: first, and V2X network has low cost, appearance
Easily disposing and the advantage of operation, consumer can enjoy service without subscribing to；Next, from the technical point of view, intelligent transportation system
The a lot of information propagated in system have the strongest position correlation, V2X network can easily for proximate vehicle set up real-time or
The non real-time short haul connection of person.
Information between vehicle and vehicle, between vehicle and other devices is one of critical function of car networking alternately, V2X
Technology is the basis of the information interaction realizing vehicle.V2X network rely on short-range communication technique realize car and car and car with
Communication between trackside node, it is achieved car interior (CAN-Controller Area Network), bus or train route (Vehicle-2-RSU),
Workshop (Vehicle-2-Vehicle), car outer (vehicle-2-Infrastructure), people's car (Vehicle-2-Person)
Various information mutual, thus provide the comprehensive services such as safety, traffic administration and amusement.
V2X technology makes automatically to interconnect by the way of single-hop or multi-hop between vehicle, and this cans be compared to car and car
Between can talk mutually as people, play and improve safety and the effect such as flow that relieves traffic congestion that vehicle runs.The car of movement
ITS Information can be obtained by the communication between vehicle or between vehicle and infrastructure or complete between vehicle between
Communication.Its object is to avoid the jams as far as possible, save the energy, protection environment, make the operation that traffic is safer, more efficient,
Facilitate the exchange of information between vehicle simultaneously.
Wireless resource scheduling refers to the process of the vehicle distributing radio resource into mutually there is conflict, as it is shown in figure 1, wireless
The scheduling process of resource can be divided into centralized (centralized) and distributed (distributed) two kinds of methods, the two district
It is not: if scheduling of resource is by a central equipment, as base station is carried out, be then centralized scheduling, if scheduling of resource is
Oneself complete by each vehicle, be then distributed scheduling.Distributed resource scheduling is that non-coordinating dispatches (un-
And coordinated scheduling (coordinated) two ways coordinated).
Existing in-vehicle wireless communication network generally uses non-coordinating scheduling mode.Non-coordinating scheduling refers to exist mutually interference
Vehicle can select to use same Radio Resource, the consequence of do so is to there may be the generation of conflict.Conflict is avoided to produce
Raw it is critical only that can carry out certain information between mutual afoul vehicle avoids the generation of conflict alternately.
Summary of the invention
Goal of the invention: for solving above-mentioned technical problem, it is provided that one avoids in-vehicle wireless communication network radio resources to dispatch
During occur conflict technical scheme, the present invention proposes the dispatching method of Radio Resource in a kind of Vehicular communication system.
Technical scheme: for realizing above-mentioned technique effect, the technical scheme that the present invention proposes is:
The dispatching method of Radio Resource in a kind of Vehicular communication system, including step:
(1) it is all vehicle node in V2X network and wireless resource block distribution numbering, defines any one vehicle node
Numbered k, k ∈ [1,2 ..., K], the numbered p of any one wireless resource block, p ∈ [1,2 ..., P], K and P is respectively vehicle
Node and the sum of wireless resource block；Any one vehicle node is neighbours by the way of broadcasting and broadcasting with reception and in one jumping
It is mutual that vehicle node in set carries out information of vehicles；For any one vehicle node, one jumps interior neighbours for being in this car
Vehicle node in node communication radius, its information of vehicles include this vehicle node data message to be sent, send current
The information of the Resource Block that data are used and this vehicle node one jump the information of vehicles of the vehicle node in interior neighborhood；
(2) when vehicle node k competes any one Resource Block p, vehicle node k is selected neighborhood in self double bounce
Go out the vehicle node competing same Resource Block with it, and these vehicle node are attributed to mono-conflict set of vehicle node k；Definition car
Conflict set during node k competitive resource block p is Ck[p], Ck[p]=and 1,2 ..., i ... I}；
(3) vehicle node k builds the random selection function of competitive resource block p, and ties according to the output of random selection function
Fruit judges whether vehicle node k can obtain Resource Block p；If vehicle node k obtains Resource Block p, then perform step (4), otherwise, hold
Row step (5)；
(4) vehicle node k transmits data to be transmitted n on Resource Block p；After being transmitted, it is judged that whether vehicle node k deposits
In other data to be transmitted, if existing, then perform step (5)；If not existing, then vehicle node k stops competitive resource block, until
Receive new data to be transmitted；
(5) p=p is made*, return step (2)；Wherein, Resource Block p*Represent except other any one resources of Resource Block p
Block.
Further, in the double bounce of described vehicle node k, neighborhood includes the interior neighbours of jumping and a double bounce of vehicle node k
Interior neighbours；Wherein, in the double bounce of vehicle node k, neighbours are the interior neighbours of jumping that vehicle node k mono-jumps interior neighbours.
Further, in described step (3), the random selection function of the competitive resource block p that vehicle node k builds is:
S1: the binary value of val is added with val to the result of left dislocation 12, is assigned to val；
S2: by the result of the binary value of val displacement to the right 22 and val phase XOR, be assigned to val；
S3: the binary value of val is added with val to the result of left dislocation 4, is assigned to val；
S4: by the result of the binary value of val displacement to the right 9 and val phase XOR, be assigned to val；
S5: the binary value of val is added with val to the result of left dislocation 10, is assigned to val；
S6: by the result of the binary value of val displacement to the right 2 and val phase XOR, be assigned to val；
S7: the binary value of val is added with val to the result of left dislocation 7, is assigned to val；
S8: by the result of the binary value of val displacement to the right 12 and val phase XOR, be assigned to smear；Wherein, val
With input variable and the output variable that smear is respectively random selection function model.
Further, by the output result of random selection function, described step (3) judges whether vehicle node k can obtain
The method obtaining Resource Block p is:
(3-1) orderPerform step S1 to S8 successively；Value by random selection function model output variable
It is designated as smear_k1；Make val=k+p, perform step S1 to S8 successively；The value of random selection function model output variable is designated as
smear_k2；
(3-2) i=1 is initialized；
(3-3) orderPerform step S1 to S8 successively；The value of random selection function model output variable is remembered
For smear_i1；Make val=i+p, perform step S1 to S8 successively；The value of random selection function model output variable is designated as
smear_i2；
(3-4) judging whether to meet smear_i1 ＞ smear_k1, if meeting, then judging vehicle node k competitive resource block p
Failure；If being unsatisfactory for, then perform step (3-5)；
(3-5) judging whether to meet smear_i1 ＜ smear_k1, if meeting, then performing step (3-9)；If being unsatisfactory for,
Then perform step (3-6)；
(3-6) judging whether to meet smear_i2 ＞ smear_k2, if meeting, then judging vehicle node k competitive resource block p
Failure；If being unsatisfactory for, then perform step (3-7)；
(3-7) judging whether to meet smear_i2 ＜ smear_k2, if meeting, then performing step (3-9)；If being unsatisfactory for,
Then perform step (3-8)；
(3-8) definition tpRepresent the judged result judging that whether p is even number, if p is even number, then make tp=1, if p is strange
Number, then make tp=0；Definition tqRepresent the judged result judging whether i is more than k, if i is ＞ k, then make tq=1, if i is ＜ k, then make tq
=0；Definition Boolean is flag, flag=tp∩tq；If flag=1, then judge vehicle node k competitive resource block p failure；If
Flag=0, performs step (3-9)；
(3-9) judge whether to meet i=I, if i=I, then judge vehicle node k competitive resource block p success, if i ≠ I, then
Make i=i+1, return step (3-3).
Further, the method for the conflict set finding out vehicle node k competitive resource block p in described step (2) is:
Whether the vehicle that vehicle node k judges in oneself double bounce in neighborhood one by one meets following condition:
P ＞ m, m ∈ Dp
Wherein, DpFor neighborhood in the double bounce of vehicle node k；
If judged result is satisfied, then vehicle node m is included into the conflict set of vehicle node k competitive resource block p.
Beneficial effect: compared with prior art, present invention have the advantage that
The dispatching method that the present invention provides be vehicle arrangement in communication process, by mutual with the information of neighbours' vehicle node
Obtain neighbours' vehicle node information, judge oneself to obtain which communication resource by these information.Whole process is all logical
Crossing oneself complete independently of each vehicle node, base station does not carries out unified scheduling of resource.Make the utilization rate of resource
Improve, avoid the generation of conflict in communication process simultaneously.
Accompanying drawing explanation
Fig. 1 is the classification schematic diagram of scheduling of resource；
Fig. 2 is a kind of numbering result schematic diagram of data field Resource Block；
Fig. 3 is vehicle node position view in In-vehicle networking；
Fig. 4 is the content structure figure of information of vehicles；
Fig. 5 is the flow chart of scheduling of resource；
Fig. 6 is the average normalized throughput schematic diagram of each vehicle node.
Detailed description of the invention
It is an object of the invention to provide in a kind of Vehicular communication system and carry out distributed radio communication between vehicle arrangement
Resource regulating method so that the utilization rate of resource increases, and avoids in communication process the generation of conflict simultaneously.Tie below
Close accompanying drawing and illustrate the correlation step of technical scheme proposed by the invention.
A kind of numbering result schematic diagram of data field Resource Block as shown in Figure 2, Radio Resource is divided into two regions, controls
Region and data transmission region, the Resource Block in the present invention refers to the resource in data transmission region.Data are transmitted by we
The Radio Resource in district has precedence over the ascending number consecutively of mode of time domain according to frequency domain, as shown in Figure 2.Present invention assumes that all
Vehicle works asynchronously regardless of primary and secondary, and may be by all Radio Resources of data transmission range.Carried performing the present embodiment
Before the technical scheme of confession, first it is all vehicle node in V2X network and wireless resource block distribution numbering, defines any one
The numbered k of vehicle node, k ∈ [1,2 ..., K], the numbered p of any one wireless resource block, p ∈ [1,2 ..., P], K and P divides
Wei vehicle node and the sum of wireless resource block.Vehicle node k and wireless resource block p in literary composition refer to numbered k vehicle respectively
Node and the wireless resource block of numbered p.
Fig. 3 show vehicle node position view in In-vehicle networking, for any one vehicle node k, effective at it
Vehicle in communication radius is one hop neighbor, as shown in Figure 3 the vehicle in border circular areas, the two-hop neighbors of vehicle node k
Refer to a hop neighbor of one hop neighbor, such as the vehicle in two border circular areas adjacent in Fig. 3.Vehicle node k by with one
The information of hop neighbor is mutual, it is possible to obtain the relevant information of vehicle in the range of oneself two-hop neighbors, say, that neighbours in double bounce
Vehicle node be likely to become the competition vehicle that vehicle node k is potential, if vehicle node k and neighbours arbitrary in its double bounce
Vehicle uses identical Resource Block to carry out data transmission, the generation that all can lead to a conflict.
Fig. 4 is the content structure figure of information of vehicles, the information of vehicles that vehicle node k sends in the Resource Block being assigned to
Form as shown in Figure 4.Information of vehicles content, in addition to some data messages that need to transmit, further comprises distributed resource
Some extraneous informations required for scheduling.Part I is the information about vehicle node k, refers mainly to the transmission of vehicle node k and works as
The information of the Resource Block that front data are used.Part II is the relevant information of a hop neighbor vehicle arrangement of vehicle node k.The
Three parts are data waiting for transmission.
Fig. 5 is the implementing procedure schematic diagram of resource scheduling scheme of the present invention.For vehicle node k, first ask its
Neighborhood in the double bounce in competition wireless resource block p moment, thus try to achieve the conflict set of vehicle node k.Afterwards by build with
Machine selects function to determine whether vehicle node k obtains wireless resource block p, if obtaining, then records this resource block number and continues
The continuous Resource Block judging that next vehicle is used.If not obtaining Resource Block p, then continue to judge whether vehicle node k can obtain
Obtain next Resource Block, till vehicle node k have successfully been obtained a Resource Block.
The effect of random selection function is to make vehicle node k once send information used resource on current time determines
Block.Its operating mechanism is as follows:
Input is resource block number p, conflict set and vehicle node numbering k, is output as success or failure, successfully represents car
K obtains Resource Block p, unsuccessfully represents that vehicle k does not obtains Resource Block p.
First, random selection function has little module, referred to as a subfunction.Its effect is that input is carried out displacement,
Be added and or wait operate, be output as the result after sequence of operations.Concrete operations are as follows: assume that input is val,
Then:
S1: the binary value of val is added with val to the result of left dislocation 12, is assigned to val；
S2: by the result of the binary value of val displacement to the right 22 and val phase XOR, be assigned to val；
S3: the binary value of val is added with val to the result of left dislocation 4, is assigned to val；
S4: by the result of the binary value of val displacement to the right 9 and val phase XOR, be assigned to val；
S5: the binary value of val is added with val to the result of left dislocation 10, is assigned to val；
S6: by the result of the binary value of val displacement to the right 2 and val phase XOR, be assigned to val；
S7: the binary value of val is added with val to the result of left dislocation 7, is assigned to val；
S8: by the result of the binary value of val displacement to the right 12 and val phase XOR, be assigned to smear；
The value of this smear is final result.Moving to left in above-mentioned random selection function moves to right and refers to current val number
In the binary representation of value, the situation of movement of each, for example: assume being represented in binary as of current val numerical value:
1001, the result moving to left is 0011, and moving to right a result is 1100.
Secondly, using the result of the XOR value of k Yu p as input, calculate the output result of its subfunction, be denoted as smear_
k1；Obtain the subfunction output result that input is k Yu p sum again, be denoted as smear_k2.
Similarly, obtain the numbering of vehicle node in vehicle node k conflict set respectively with the sub-letter of resource block number p XOR value
Number output results, the vehicle node being denoted as in smear_i1, and vehicle node k conflict set numbering respectively with the sub-letter of p sum
Number output result, is denoted as smear_i2.
Finally, judge whether vehicle node k can obtain Resource Block p according to the output result of above subfunction:
If smear_i1 is bigger than smear_k1, then judges that vehicle k takies Resource Block p failure, and then repeat above step, sentence
Whether disconnected vehicle node k can obtain next Resource Block.If smear_i1 is less than smear_k1, then explanation vehicle node k with
In conflict set, in the comparison procedure of vehicle node i, vehicle node k is successful, then vehicle node k start with conflict set under
One vehicle arrangement compares.
If smear_i1 with smear_k1 is equal, then continue to compare the magnitude relationship of smear_i2 Yu smear_k2.If
Smear_i2 is bigger than smear_k2, then it represents that vehicle node k competitive resource block p failure, enters the mistake of the next Resource Block of competition
Journey.If smear_i2 is less than smear_k2, then explanation vehicle node k and vehicle in the comparison procedure of vehicle node i in conflict set
Node k is successful, and then next vehicle compares with conflict set.
If smear_i1 with smear_k1 is equal and smear_i2 with smear_k2 is the most equal, then continue to judge that Resource Block is compiled
The size of vehicle node numbering i and k in the parity of number p and conflict set, to determine that in the comparison procedure of k Yu i, k whether
Can be successful.
Definition tpRepresent the judged result judging that whether p is even number, if p is even number, then make tp=1, if p is odd number, then make
tp=0；Definition tqRepresent the judged result judging whether i is more than k, if i is ＞ k, then make tq=1, if i is ＜ k, then make tq=0；Note
Boolean flag, flag=tp∩tq；If flag=1, then judge vehicle node k competitive resource block p failure；If flag=0, then
Carry out next round judgement again.
All become in the comparison of vehicle node all with the conflict set of oneself by above step, only vehicle node k
Merit, just can be determined that vehicle node k obtains Resource Block p, otherwise, as long as vehicle node k is saving with a vehicle in conflict set
Failure in the comparison of point, is judged as the failure of vehicle node k, subsequently enters in the comparison of next Resource Block, until vehicle node k becomes
Merit, random selection process just completes.
Fig. 6 show the average normalized throughput schematic diagram of each vehicle node, illustrates the broadcast of each vehicle node
When radius is respectively 15 meters and 30 meters, total number of users is respectively each vehicle node when 20,50,80,110,140 and 170
Average normalized throughput.It can be seen that broadcast radius is the biggest, the value of average normalized throughput is the least, and reason exists
The biggest in broadcast radius, the vehicle node in conflict set can be the most, and so certain vehicle node is competitive resource block when, competing
Strive successful probability can reduce, thus result in the reduction of the average normalized throughput of each vehicle node.Lateral comparison can
Finding, other variable is constant, and when only changing total vehicle node number, vehicle node is the most, and the value of average normalized throughput is the least.
Reason is that increasing of vehicle node causes on road traffic density to increase, and this can make car in the conflict set of each vehicle node equally
Number of nodes increases, thus reduces each vehicle node successful probability of competitive resource block.
The above is only the preferred embodiment of the present invention, it should be pointed out that: for the ordinary skill people of the art
For Yuan, under the premise without departing from the principles of the invention, it is also possible to make some improvements and modifications, these improvements and modifications also should
It is considered as protection scope of the present invention.
Claims (5)
1. the dispatching method of Radio Resource in a Vehicular communication system, it is characterised in that include step:
(1) it is all vehicle node in V2X network and wireless resource block distribution numbering, defines any one vehicle node numbering
For k, k ∈ [1,2 ..., K], the numbered p of any one wireless resource block, p ∈ [1,2 ..., P], K and P is respectively vehicle node
Sum with wireless resource block；Any one vehicle node is neighborhood by the way of broadcasting and broadcasting with reception and in one jumping
In vehicle node to carry out information of vehicles mutual；For any one vehicle node, in one is jumped, neighbours save for being in this vehicle
Vehicle node in some communication radius, its information of vehicles includes this vehicle node data message to be sent, sends current data
The information of the Resource Block used and this vehicle node one jump the information of vehicles of the vehicle node in interior neighborhood；
(2) when vehicle node k competes any one Resource Block p, vehicle node k is selected neighborhood in the double bounce of oneself
Compete the vehicle node of same Resource Block with it, and these vehicle node are attributed to mono-conflict set of vehicle node k；Definition vehicle
Conflict set during node k competitive resource block p is Ck[p], Ck[p]=and 1,2 ..., i ... I}；
(3) vehicle node k builds the random selection function of competitive resource block p, and sentences according to the output result of random selection function
Whether disconnected vehicle node k can obtain Resource Block p；If vehicle node k obtains Resource Block p, then perform step (4), otherwise, perform step
Suddenly (5)；
(4) vehicle node k transmits data to be transmitted n on Resource Block p；After being transmitted, it is judged that whether vehicle node k exists it
His data to be transmitted, if existing, then performs step (5)；If not existing, then vehicle node k stops competitive resource block, until receiving
To new data to be transmitted；
(5) p=p is made*, return step (2)；Wherein, Resource Block p*Represent except other any one Resource Block of Resource Block p.
The dispatching method of Radio Resource in a kind of Vehicular communication system the most according to claim 1, it is characterised in that described
In the double bounce of vehicle node k, neighborhood includes that the one of vehicle node k jumps neighbours in interior neighbours and double bounce；Wherein, vehicle node k
Double bounce in neighbours be vehicle node k mono-jump interior neighbours one jumping in neighbours.
The dispatching method of Radio Resource in a kind of Vehicular communication system the most according to claim 2, it is characterised in that described
In step (3), the random selection function of the competitive resource block p that vehicle node k builds is:
S1: the binary value of val is added with val to the result of left dislocation 12, is assigned to val；
S2: by the result of the binary value of val displacement to the right 22 and val phase XOR, be assigned to val；
S3: the binary value of val is added with val to the result of left dislocation 4, is assigned to val；
S4: by the result of the binary value of val displacement to the right 9 and val phase XOR, be assigned to val；
S5: the binary value of val is added with val to the result of left dislocation 10, is assigned to val；
S6: by the result of the binary value of val displacement to the right 2 and val phase XOR, be assigned to val；
S7: the binary value of val is added with val to the result of left dislocation 7, is assigned to val；
S8: by the result of the binary value of val displacement to the right 12 and val phase XOR, be assigned to smear；
Wherein, val and smear is respectively input variable and the output variable of random selection function model.
The dispatching method of Radio Resource in a kind of Vehicular communication system the most according to claim 3, it is characterised in that described
By the output result of random selection function, step (3) judges whether vehicle node k can obtain the method for Resource Block p and be:
(2-1) orderPerform step S1 to S8 successively；The value of random selection function model output variable is designated as
smear_k1；Make val=k+p, perform step S1 to S8 successively；The value of random selection function model output variable is designated as
smear_k2；
(2-2) i=1 is initialized；
(2-3) orderPerform step S1 to S8 successively；The value of random selection function model output variable is designated as
smear_i1；Make val=i+p, perform step S1 to S8 successively；The value of random selection function model output variable is designated as
smear_i2；
(2-4) judging whether to meet smear_i1 ＞ smear_k1, if meeting, then judging that vehicle node k competitive resource block p loses
Lose；If being unsatisfactory for, then perform step (2-5)；
(2-5) judging whether to meet smear_i1 ＜ smear_k1, if meeting, then performing step (2-9)；If being unsatisfactory for, then hold
Row step (2-6)；
(2-6) judging whether to meet smear_i2 ＞ smear_k2, if meeting, then judging that vehicle node k competitive resource block p loses
Lose；If being unsatisfactory for, then perform step (2-7)；
(2-7) judging whether to meet smear_i2 ＜ smear_k2, if meeting, then performing step (2-9)；If being unsatisfactory for, then hold
Row step (2-8)；
(2-8) definition tpRepresent the judged result judging that whether p is even number, if p is even number, then make tp=1, if p is odd number, then
Make tp=0；Definition tqRepresent the judged result judging whether i is more than k, if i is ＞ k, then make tq=1, if i is ＜ k, then make tq=0；
Definition Boolean is flag, flag=tp∩tq；If flag=1, then judge vehicle node k competitive resource block p failure；If flag
=0, perform step (2-9)；
(2-9) judge whether to meet i=I, if i=I, then judge vehicle node k competitive resource block p success, if i ≠ I, then make i
=i+1, returns step (2-3).
The dispatching method of Radio Resource in a kind of Vehicular communication system the most according to claim 4, it is characterised in that described
The method of the conflict set finding out vehicle node k competitive resource block p in step (2) is:
Whether the vehicle that vehicle node k judges in oneself double bounce in neighborhood one by one meets following condition:
P ＞ m, m ∈ Dp
Wherein, DpFor neighborhood in the double bounce of vehicle node k；
If judged result is satisfied, then vehicle node m is included into the conflict set of vehicle node k competitive resource block p.
Priority Applications (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN201610902493.7A CN106332296A (en) | 2016-10-17 | 2016-10-17 | Method for scheduling radio resources in car-mounted communication system |
Applications Claiming Priority (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN201610902493.7A CN106332296A (en) | 2016-10-17 | 2016-10-17 | Method for scheduling radio resources in car-mounted communication system |
Publications (1)
| Publication Number | Publication Date |
|---|---|
| CN106332296A true CN106332296A (en) | 2017-01-11 |
Family
ID=57818159
Family Applications (1)
| Application Number | Title | Priority Date | Filing Date |
|---|---|---|---|
| CN201610902493.7A Pending CN106332296A (en) | 2016-10-17 | 2016-10-17 | Method for scheduling radio resources in car-mounted communication system |
Country Status (1)
| Country | Link |
|---|---|
| CN (1) | CN106332296A (en) |
Cited By (4)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN109391671A (en) * | 2017-08-10 | 2019-02-26 | 财团法人工业技术研究院 | Internet of vehicles resource allocation method and user equipment |
| CN110224888A (en) * | 2019-06-10 | 2019-09-10 | 公安部交通管理科学研究所 | A kind of test method of vehicle-mounted V2X communication equipment, apparatus and system |
| CN110521225A (en) * | 2017-03-23 | 2019-11-29 | 高通股份有限公司 | Realize the method and apparatus communicated in efficient queue |
| CN116782185A (en) * | 2023-08-25 | 2023-09-19 | 交通运输部公路科学研究所 | Resource scheduling method and device for vehicle-mounted wireless short-distance communication |
Citations (5)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN101801065A (en) * | 2010-01-08 | 2010-08-11 | 北京交通大学 | Mesh election competition method improved based on 802.16d |
| CN103096327A (en) * | 2013-01-08 | 2013-05-08 | 河南工业大学 | Vehicle-mounted ad hoc network self-adaptive time slot distributing method based on a time division multiple address (TDMA) |
| WO2014014394A1 (en) * | 2012-07-17 | 2014-01-23 | Telefonaktiebolaget L M Ericsson (Publ) | A network node and a method therein for scheduling a downlink data transmission to a ue, and a ue and a method therein for receiving a downlink data transmission |
| CN104349280A (en) * | 2013-08-07 | 2015-02-11 | 电信科学技术研究院 | Time slot allocation method and system |
| CN105848295A (en) * | 2016-05-13 | 2016-08-10 | 中国科学院计算技术研究所 | Heterogeneous Internet of Vehicles time slot allocation method |
-
2016
- 2016-10-17 CN CN201610902493.7A patent/CN106332296A/en active Pending
Patent Citations (5)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN101801065A (en) * | 2010-01-08 | 2010-08-11 | 北京交通大学 | Mesh election competition method improved based on 802.16d |
| WO2014014394A1 (en) * | 2012-07-17 | 2014-01-23 | Telefonaktiebolaget L M Ericsson (Publ) | A network node and a method therein for scheduling a downlink data transmission to a ue, and a ue and a method therein for receiving a downlink data transmission |
| CN103096327A (en) * | 2013-01-08 | 2013-05-08 | 河南工业大学 | Vehicle-mounted ad hoc network self-adaptive time slot distributing method based on a time division multiple address (TDMA) |
| CN104349280A (en) * | 2013-08-07 | 2015-02-11 | 电信科学技术研究院 | Time slot allocation method and system |
| CN105848295A (en) * | 2016-05-13 | 2016-08-10 | 中国科学院计算技术研究所 | Heterogeneous Internet of Vehicles time slot allocation method |
Non-Patent Citations (1)
| Title |
|---|
| ROGER B.MARKS等: "Part16:Air Intrface for Fixed Broadband Wireless Access Systems", 《IEEE 802.16D》 * |
Cited By (7)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN110521225A (en) * | 2017-03-23 | 2019-11-29 | 高通股份有限公司 | Realize the method and apparatus communicated in efficient queue |
| CN109391671A (en) * | 2017-08-10 | 2019-02-26 | 财团法人工业技术研究院 | Internet of vehicles resource allocation method and user equipment |
| CN109391671B (en) * | 2017-08-10 | 2021-07-27 | 财团法人工业技术研究院 | Internet of vehicles resource allocation method and user equipment |
| CN110224888A (en) * | 2019-06-10 | 2019-09-10 | 公安部交通管理科学研究所 | A kind of test method of vehicle-mounted V2X communication equipment, apparatus and system |
| CN110224888B (en) * | 2019-06-10 | 2023-03-07 | 公安部交通管理科学研究所 | Test method, device and system for vehicle-mounted V2X communication equipment |
| CN116782185A (en) * | 2023-08-25 | 2023-09-19 | 交通运输部公路科学研究所 | Resource scheduling method and device for vehicle-mounted wireless short-distance communication |
| CN116782185B (en) * | 2023-08-25 | 2023-10-27 | 交通运输部公路科学研究所 | Resource scheduling method and device for vehicle-mounted wireless short-distance communication |
Similar Documents
| Publication | Publication Date | Title |
|---|---|---|
| Bao et al. | Efficient clustering V2V routing based on PSO in VANETs | |
| CN106332296A (en) | Method for scheduling radio resources in car-mounted communication system | |
| CN105722231B (en) | A kind of design method for the vehicle-mounted net MAC protocol of multichannel continuously coordinated | |
| CN104994583B (en) | Multi-channel MAC protocols method based on cluster mechanism in vehicular ad hoc network | |
| CN105848295B (en) | A kind of isomery car networking slot allocation method | |
| Zhang et al. | Software-defined and fog-computing-based next generation vehicular networks | |
| CN102625237B (en) | Method for selecting optimum relay in communication between wayside device and vehicle | |
| Wang et al. | Cell-less communications in 5G vehicular networks based on vehicle-installed access points | |
| CN107846434A (en) | A kind of car networking method for processing business, device and car networking system | |
| CN106331008A (en) | Method and device for managing vehicle groups in vehicle to everything | |
| CN106332122A (en) | Method and device for managing vehicles in Internet of Vehicles | |
| CN103269478A (en) | Rapid broadcasting method based on position information in vehicular network | |
| CN108029125A (en) | A kind of communication equipment and the method for V2X communications | |
| CN102291687B (en) | Delivering method for vehicular wireless ad hoc network safety information based on information relativity | |
| Zhang et al. | Fuzzy logic-based resource allocation algorithm for V2X communications in 5G cellular networks | |
| CN107343024A (en) | A kind of centralized car networking MAC layer merges prediction of collision and avoiding method | |
| CN104010047B (en) | A kind of disconnected transport information of appearance based on Android propagates prototype system | |
| CN109905921A (en) | Car networking V2R/V2V collaboration data transmission dispatching method under a kind of multichannel environment | |
| CN106160993A (en) | A kind of power system capacity expansion method based on D2D traffic model in ITS | |
| CN110139245A (en) | A kind of car networking relay node selecting method based on fuzzy logic | |
| CN108616952B (en) | MAC layer data transmission method based on neighbor node cooperative communication in Internet of vehicles | |
| CN109474897A (en) | Car networking security message single-hop cooperation broadcasting method based on hidden Markov model | |
| Zhou et al. | DRL-based low-latency content delivery for 6G massive vehicular IoT | |
| CN102842241A (en) | Collection and transition method of real-time traffic information of limited region in front of car | |
| CN106255225A (en) | The media access mechanism of a kind of new car networking MAC layer and channel collaboration method |
Legal Events
| Date | Code | Title | Description |
|---|---|---|---|
| PB01 | Publication | ||
| PB01 | Publication | ||
| C10 | Entry into substantive examination | ||
| SE01 | Entry into force of request for substantive examination | ||
| RJ01 | Rejection of invention patent application after publication |
Application publication date: 20170111 |
|
| RJ01 | Rejection of invention patent application after publication |