CN102098230B - Resource scheduling method based on time and space correlation in vehicle communication - Google Patents

Resource scheduling method based on time and space correlation in vehicle communication Download PDF

Info

Publication number
CN102098230B
CN102098230B CN2011100582210A CN201110058221A CN102098230B CN 102098230 B CN102098230 B CN 102098230B CN 2011100582210 A CN2011100582210 A CN 2011100582210A CN 201110058221 A CN201110058221 A CN 201110058221A CN 102098230 B CN102098230 B CN 102098230B
Authority
CN
China
Prior art keywords
resource
vehicle
time
resources
max
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.)
Expired - Fee Related
Application number
CN2011100582210A
Other languages
Chinese (zh)
Other versions
CN102098230A (en
Inventor
杨清海
孙健
高雪
傅丰林
王天翊
Current Assignee (The listed assignees may be inaccurate. Google has not performed a legal analysis and makes no representation or warranty as to the accuracy of the list.)
Xidian University
Original Assignee
Xidian University
Priority date (The priority date 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 date listed.)
Filing date
Publication date
Application filed by Xidian University filed Critical Xidian University
Priority to CN2011100582210A priority Critical patent/CN102098230B/en
Publication of CN102098230A publication Critical patent/CN102098230A/en
Application granted granted Critical
Publication of CN102098230B publication Critical patent/CN102098230B/en
Expired - Fee Related legal-status Critical Current
Anticipated expiration legal-status Critical

Links

Landscapes

  • Mobile Radio Communication Systems (AREA)

Abstract

The invention discloses a resource scheduling method based on time and space correlation in vehicle communication, which is used for mainly solving the problem of high resource collision probability caused by simultaneous channel competition of different priorities of resources in the traditional vehicle communication network during the distribution. The resource scheduling method comprises the steps of: 1, establishing a resource attribute data packet; 2, sending the resource attribute data packet; 3, checking whether the data packet exists or not; 4, judging whether resources meet the condition of received resources or not; and 5, calculating the correlation and receiving the resources. Aiming at different resource setting priorities, the invention ensures that the resources being high in urgent degree and important in vehicle users can be preferentially transmitted. In a process of receiving the resources, the defect of high resource collision rate caused by the adoption of a random switching manner is overcome according to a method for receiving correlation function values in a descending order by adopting a time and space correlation function. According to the invention, the problem of the dynamic priority change is solved in the process of propagating the resources.

Description

In the vehicle communication based on the resource regulating method of time and spatial coherence
Technical field
The present invention relates to communication technical field, further relate to a kind of time of resource and the method that spatial coherence is realized scheduling of resource utilized in the vehicle wireless communication field.This method realizes transmission and the reception of different priorities resource in the vehicle communication network, can be used as important component part of intelligent traffic control system.
Background technology
In recent years, along with the explosive growth of vehicle and ubiquitous information requirement, the communication service demand of people in the vehicle moving process increases day by day, and vehicle mobile network's research has become the focus of attracting attention in the world, also promoted vehicle to development intelligent, networked direction simultaneously.
People such as Bo Xu are at document " Opportunistic Resource Exchange in Inter-vehicle Ad-hoc Networks ", Proceedings of the 2004 IEEE International Conference on Mobile Data Management (MDM ' 04), 0-7695-2070-7/04$20.00.2004IEEE, the method that a kind of resource-based time and spatial coherence are realized inquiry and the storage of resource has been proposed.This method has realized effective storage and the renewal of resource in limited memory space, can realize resource discovering than faster simultaneously.This method according to " correlation " of resource descending sequential storage in internal memory.When internal memory is filled with, when having new resource to arrive again, recomputate the relevance function value of all resources in the internal memory, being eliminated of correlation minimum, new resources are saved.Because this method only relates to the discovery of resource, for the distribution of resource, then exchange with at random mode, the resource collision takes place a plurality of resources being arranged simultaneously during competitive channel in this method easily.Simultaneously, owing to not to resource settings priority, can not satisfy the user to the different demands of the different resource of urgency level.
Summary of the invention
The objective of the invention is to overcome the deficiency of above-mentioned technology, propose a kind of resource regulating method based on time and spatial coherence, to transmission and the reception of different priorities resource, reduce the probability of resource collision in the realization vehicle communication network.
The step that the present invention realizes comprises as follows:
(1) sends vehicle foundation and resource " Resource Properties " packet one to one;
(2) " Resource Properties " packet is sent to the reception vehicle by wireless channel;
Whether (3) receive the vehicle inspection packet and exist in memory headroom, if exist, then reject resource, transmission course finishes; If do not exist, then carry out step (4);
(4) by " Resource Properties " packet, judge that whether resource satisfies the condition that is received, if satisfy, then carries out step (5); If do not satisfy, then rejection, transmission course finishes;
(5) receive resource: if having only a resource to wait to receive, then directly receive resource; If have a plurality of resources to need simultaneously to receive, then carry out step 5a) and 5b);
5a) calculate relevance function value F (R)
F ( R ) = α j · t + β j · d + γ j ( α j ≤ 0 , β j ≤ 0 ) d = [ ( x i - x 0 ) 2 + ( y i - y 0 ) 2 ] 1 2 t = t i - t 0
Wherein: t is the moment t that vehicle receives packet iProduce t constantly to resource 0The time interval;
Position (x when d is vehicle reception packet i, y i) produce ground (x to resource 0, y 0) distance;
α j, β j, γ jBe constant, α j, β jRepresent time interval t respectively and apart from the decay factor of d, γ jBe the priority regulatory factor; α j, β j, γ jThe size of numerical value is called according to the kind j of resource;
5b) queuing: rank according to the order that the relevance function value is descending, receive resource successively.
Compared with prior art, the present invention has the following advantages:
The first, because the present invention when receiving resource successively, adopts the method at different resource settings priority, make can access prioritised transmission to the vehicle user important resource by the urgency level height, satisfy the needs of different user.
The second, because the present invention adopts the temporal correlation function in the resource receiving course, by the method for the descending order reception of relevance function value, overcome that prior art adopts exchanged form at random and the high shortcoming of resource collision rate that causes.
The 3rd, the present invention is in the resource receiving course, though to the resource settings of different urgency levels priority, but in the communication process of reality, be not to receive according to priority order from high to low, but adopt the method that receives according to the descending order of relevance function value, solved resource in communication process, because of the problem that the duration increases and the propagation distance increase causes the reduction of resource urgency level, actual priority to reduce, can better satisfy user's actual needs.
Description of drawings
Fig. 1 is flow chart of the present invention
Fig. 2 is priority regulatory factor γ of the present invention jThe establishing method key diagram
Embodiment
The present invention will be further described below in conjunction with accompanying drawing 1:
Step 1 is set up " Resource Properties " packet.Send vehicle with the place (x of the initial generation of resource 0, y 0), time t 0, classification j, the user u that produces this resource set up " Resource Properties " packet (x 0, y 0, t 0, j, u).Resource can with space correlation, time correlation or temporal and spatial correlations, so the Resource Properties of different resource also is different.With the resource of time correlation as " stock information in some time ", its form is (t 0, j, u); With the resource of space correlation as " positional information of gas station ", its form is (x 0, y 0, j, u); With the resource of temporal and spatial correlations as " traffic accident takes place in the some time somewhere ", its form is (x 0, y 0, t 0, j, u).Each resource is one to one with " Resource Properties " packet.To have amount of information little for " Resource Properties " packet of Jian Liing thus, and channel resource is taken few characteristics.
Step 2 sends " Resource Properties " packet.Send vehicle before sending resource, " Resource Properties " packet with this resource sends to the reception vehicle by wireless channel earlier.
Step 3 checks whether packet exists.Receive vehicle by check whether " Resource Properties " packet exists, and can learn whether this resource received in memory headroom.If exist, then reject resource, transmission course finishes.Can avoid the reception that repeats to same resource like this, reduce the waste to channel resource; If do not exist, then carry out step (4) reception vehicle and judge further whether resource satisfies the condition that is received.
Step 4 judges whether resource satisfies the condition that is received.Because the finiteness of channel resource, the propagation of resource needs to set certain boundary in duration and spread scope.Beyond the mark, resource can not be sent out or receive.Resource is propagated boundary, set according to actual conditions (resource coverage, effective time etc.).As: " traffic lights at certain crossing of some time is red light " this information need not be propagated the vehicle to entire city, as long as allow the interior vehicle of this crossing 1 km left and right sides scope know, can allow vehicle in time adjust and get final product.Simultaneously, because the red light duration is shorter, generally at 30-60 between second, if the time of reception is oversize to the time at intervals that this information produces, this information has lost value concerning vehicle user, so its event horizon can be arranged on 20-40 between second.
By " Resource Properties " packet, judge whether to satisfy time domain and spatial domain restrictive condition.If satisfy, then carry out step (5); If do not satisfy, then rejection, transmission course finishes.
Judge if desired whether j class resource satisfies when being received condition, and the event horizon of j class resource will be set to t J (max), the space boundary will be set to d J (max)Receive vehicle at t iCorrespondence position when receiving " Resource Properties " packet constantly is (x i, y i).Calculate the t time of reception iProduce t constantly to resource 0Time interval t=t i-t 0With reception vehicle location (x i, y i) produce position (x to resource 0, y 0) between distance
Figure BSA00000448591400031
Judge whether t, d satisfy t<=t simultaneously J (max)And d<=d J (max)Two conditions.If satisfy, then carry out step 5a); If do not satisfy, then rejection, transmission course finishes.
Step 5 is calculated correlation, receives resource successively.If have only a resource to wait to receive, then directly receive resource.If have a plurality of resources to need simultaneously to receive, then carry out step 5a) and 5b).
5a) calculate relevance function value F (R).According to following relevance function formula, the solving equation group obtains j class resource at position (x i, y i), moment t iThe relevance function value.
F ( R ) = α j · t + β j · d + γ j ( α j ≤ 0 , β j ≤ 0 ) d = [ ( x i - x 0 ) 2 + ( y i - y 0 ) 2 ] 1 2 t = t i - t 0
Wherein: t is the moment t that vehicle receives packet iProduce t constantly to resource 0The time interval;
Position (x when d is vehicle reception packet i, y i) produce ground (x to resource 0, y 0) distance;
α j, β j, γ jBe constant.α j, β jRepresent time interval t respectively and apart from the decay factor of d, γ jBe the priority regulatory factor.α j, β j, γ jThe size of numerical value is called according to the kind j of resource.
α j, β jSetting.
Because the correlation of resource reduces along with the increase of distance d, reduce along with the increase of time interval t, so α j≤ 0, β j≤ 0.α j/ β jValue more big, the expression correlation is for more strong than the space of the sensitiveness of time; On the contrary, then the sensitiveness to the space is stronger.Since some resource only with space correlation or time correlation, as with " position of certain building " of space correlation, perhaps with " stock information in some time " of time correlation.With space correlation, set α for only j=0, only with time correlation, set β j=0.
γ jSetting.
For different resources, on the one hand, because the difference of factors such as user's demand, urgency level, transmission sequence is just different in its transmission course, so need to set priority, makes its urgency level height, important information priority transmission; On the other hand, along with the increase of propagation distance d and the growth of duration t, resource can reduce for user's urgency level or influence degree, and its priority can reduce, and therefore needs to set the priority of a dynamic change.
Below in conjunction with 2 pairs of priority regulatory factors of accompanying drawing γ jSetting be further described:
Fig. 2 (a), expression resource R 1" traffic accident, traffic jam take place " during the somewhere, its parameter is α 1, β 1, t 1 (max), d 1 (max)Fig. 2 (b), expression resource R 2" vehicle is the state information in somewhere (speed, position, acceleration, brake ...) at a time ", its parameter is α 2, β 2, t 2 (max), d 2 (max)Fig. 2 (c), expression resource R 3" positional information of gas station ", its parameter are α 3=0, β 3, d 3 (max)This three category information, resource R 1Urgency level is the highest, resource R 2Take second place resource R 3Minimum.Though resource R 1Urgency level is the highest, and still along with the increase of distance, its importance for the user will descend.That is to say just do not have resource R for the significance level than this information of vehicle at a distance 2The degree height, the user more wishes to receive earlier resource R 2Therefore, be set in d 1(d 1<d 1 (max)) in the scope, resource R 1Have limit priority.
Resource R 1: at d 1In the scope,
Resource R 2: F (R 2) Max (d=0, t=0)2
F ( R 2 ) min ( d = d 2 ( max ) , t = t 2 ( max ) ) = α 2 · t 2 ( max ) + β 2 · d 2 ( max ) + γ 2
Resource R 3: F (R 3) Max (d=0)3
By following inequality group, determine γ 1, γ 2, γ 3Span.
F ( R 1 ) min ( d = d 1 , t = t 1 ( max ) ) ≥ F ( R 2 ) max ( d = 0 , t = 0 ) F ( R 2 ) min ( d = d 2 ( max ) , t = t 2 ( max ) ) ≥ F ( R 3 ) max ( d = 0 )
Abbreviation obtains
γ 1 ≥ γ 2 - α 1 · t 1 ( max ) - β 1 · d 1 γ 2 ≥ γ 3 - α 2 · t 2 ( max ) - β 2 · d 2 ( max )
So, γ 1, γ 2, γ 3As long as satisfying above-mentioned relation, the selection of numerical value can achieve the goal.
5b) queuing.Rank according to the order that the relevance function value is descending, receive resource successively.

Claims (4)

  1. One kind in vehicle communication based on the resource regulating method of time and spatial coherence, comprise the steps:
    (1) sends vehicle foundation and resource " Resource Properties " packet one to one;
    (2) " Resource Properties " packet is sent to the reception vehicle by wireless channel;
    Whether (3) receive the vehicle inspection packet and exist in memory headroom, if exist, then reject resource, transmission course finishes; If do not exist, then carry out step (4);
    (4) by " Resource Properties " packet, judge that whether resource satisfies the condition that is received, if satisfy, then carries out step (5); If do not satisfy, then rejection, transmission course finishes;
    (5) receive resource: if having only a resource to wait to receive, then directly receive resource; If have a plurality of resources to need simultaneously to receive, then carry out step 5a) and 5b);
    5a) calculate relevance function value F (R)
    F ( R ) = α j · t + β j · d + γ j ( α j ≤ 0 , β j ≤ 0 ) d = [ ( x i - x 0 ) 2 + ( y i - y 0 ) 2 ] 1 2 t = t i - t 0
    Wherein: t is the moment t that vehicle receives packet iProduce t constantly to resource 0The time interval;
    Position (x when d is vehicle reception packet i, y i) produce ground (x to resource 0, y 0) distance;
    α j, β j, γ jBe constant, α j, β jRepresent time interval t respectively and apart from the decay factor of d, γ jBe the priority regulatory factor, j is the classification of resource;
    5b) queuing: rank according to the order that the relevance function value is descending, receive resource successively.
  2. According to claim 1 in vehicle communication based on the resource regulating method of time and spatial coherence, it is characterized in that: the Resource Properties in the described step (1) refer to the initial generation of resource place, time, classification, produce the user of this resource.
  3. According to claim 1 in vehicle communication based on the resource regulating method of time and spatial coherence, it is characterized in that: the resource condition of acceptance in the described step (4) refers to that t, d must satisfy t≤t simultaneously J(max)And d≤d J (max)Two conditions; T and d are respectively by formula t=t i-t 0, d = [ ( x i - x 0 ) 2 + ( y i - y 0 ) 2 ] 1 2 Try to achieve, t is the moment t that vehicle receives packet iProduce t constantly to resource 0The time interval; Position (x when d is vehicle reception packet i, y i) produce ground (x to resource 0, y 0) distance; t J (max)Be the event horizon of j class resource, d J (max)Be the space boundary of j class resource, t J (max), d J (max)Be according to setting resource coverage, effective time.
  4. According to claim 1 in vehicle communication based on the resource regulating method of time and spatial coherence, it is characterized in that: attenuation factor in the described step (5) j, β jWith priority regulatory factor γ jSize call according to the kind j of resource.
CN2011100582210A 2011-03-10 2011-03-10 Resource scheduling method based on time and space correlation in vehicle communication Expired - Fee Related CN102098230B (en)

Priority Applications (1)

Application Number Priority Date Filing Date Title
CN2011100582210A CN102098230B (en) 2011-03-10 2011-03-10 Resource scheduling method based on time and space correlation in vehicle communication

Applications Claiming Priority (1)

Application Number Priority Date Filing Date Title
CN2011100582210A CN102098230B (en) 2011-03-10 2011-03-10 Resource scheduling method based on time and space correlation in vehicle communication

Publications (2)

Publication Number Publication Date
CN102098230A CN102098230A (en) 2011-06-15
CN102098230B true CN102098230B (en) 2013-09-25

Family

ID=44131101

Family Applications (1)

Application Number Title Priority Date Filing Date
CN2011100582210A Expired - Fee Related CN102098230B (en) 2011-03-10 2011-03-10 Resource scheduling method based on time and space correlation in vehicle communication

Country Status (1)

Country Link
CN (1) CN102098230B (en)

Families Citing this family (4)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
CN103220814B (en) * 2012-01-21 2016-05-18 电信科学技术研究院 A kind of method and apparatus of avoiding resource collision
US9666069B2 (en) * 2014-02-14 2017-05-30 Ford Global Technologies, Llc Autonomous vehicle handling and performance adjustment
CN105450511A (en) * 2015-12-23 2016-03-30 东软集团股份有限公司 Message scheduling method and device in vehicular ad hoc network VANET
CN110661830B (en) * 2018-06-29 2022-11-11 中国电信股份有限公司 Resource scheduling method and device, vehicle-mounted terminal, base station and vehicle networking system

Citations (2)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
CN101075945A (en) * 2006-05-19 2007-11-21 中国科学院沈阳自动化研究所 Method for determining realtime Ethernet tlecommunication
EP1890517B1 (en) * 2000-04-04 2009-07-08 Sony Deutschland GmbH Prioritisation method for users randomly accessing a common communication channel

Patent Citations (2)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
EP1890517B1 (en) * 2000-04-04 2009-07-08 Sony Deutschland GmbH Prioritisation method for users randomly accessing a common communication channel
CN101075945A (en) * 2006-05-19 2007-11-21 中国科学院沈阳自动化研究所 Method for determining realtime Ethernet tlecommunication

Also Published As

Publication number Publication date
CN102098230A (en) 2011-06-15

Similar Documents

Publication Publication Date Title
Lyu et al. Towards rear-end collision avoidance: Adaptive beaconing for connected vehicles
CN110351687B (en) V2V resource allocation method and device
CN107277855B (en) internet of vehicles media access method for guaranteeing security services
Jia et al. Improving the uplink performance of drive-thru Internet via platoon-based cooperative retransmission
Amer et al. A game theory approach for congestion control in vehicular ad hoc networks
Wu et al. Improving RSU service time by distributed sorting mechanism
Sharma et al. Transmission rate-based congestion control in vehicular ad hoc networks
Tomar et al. Enhanced SDMA for VANET communication
CN103929777A (en) Vehicle network data distribution congestion control method based on congestion game
Samara et al. Dynamic safety message power control in VANET using PSO
Zhang et al. A unified tdma-based scheduling protocol for vehicle-to-infrastructure communications
CN102098230B (en) Resource scheduling method based on time and space correlation in vehicle communication
Shen et al. Self-sorting-based MAC protocol for high-density vehicular ad hoc networks
Wang et al. A local information sensing‐based broadcast scheme for disseminating emergency safety messages in IoV
Pei et al. Analysis and optimization of multihop broadcast communication in the Internet of Vehicles based on C-V2X mode 4
Hadded et al. A fully distributed tdma based mac protocol for vehicular ad hoc networks
Sharma et al. Optimization transmit rate-based decentralized congestion control scheme in vehicular ad hoc networks
Yang et al. Priority‐Based Hybrid MAC Protocol for VANET with UAV‐Enabled Roadside Units
Wu et al. A reliable self-adaptive scheduling control protocol for cellular V2X mode 4
Xiong et al. Solving the performance puzzle of DSRC multi-channel operations
Verma et al. A method for improving data delivery efficiency in vehicular adhoc networks
Lee et al. Cluster-based stable BSM dissemination system for safe autonomous platooning
Bharati et al. Link-layer cooperative communication in vehicular networks
Mohammed et al. Adaptive and optimized control channel utilization in vehicular ad hoc networks
Hegde et al. Cellular-v2x for vulnerable road user protection in cooperative its

Legal Events

Date Code Title Description
C06 Publication
PB01 Publication
C10 Entry into substantive examination
SE01 Entry into force of request for substantive examination
C14 Grant of patent or utility model
GR01 Patent grant
CF01 Termination of patent right due to non-payment of annual fee
CF01 Termination of patent right due to non-payment of annual fee

Granted publication date: 20130925

Termination date: 20190310