CN103763193B - Multi-replication routing method for selecting eruption range in vehicular vdhoc networks - Google Patents
Multi-replication routing method for selecting eruption range in vehicular vdhoc networks Download PDFInfo
- Publication number
- CN103763193B CN103763193B CN201410060371.9A CN201410060371A CN103763193B CN 103763193 B CN103763193 B CN 103763193B CN 201410060371 A CN201410060371 A CN 201410060371A CN 103763193 B CN103763193 B CN 103763193B
- Authority
- CN
- China
- Prior art keywords
- vehicle
- message
- node
- eruption
- vehicular
- 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.)
- Active
Links
Abstract
The invention discloses a multi-replication routing method for selecting an eruption range in vehicular vdhoc networks, and belongs to the technical field of the vehicular vdhoc networks. The multi-replication routing method for selecting the eruption range in the vehicular vdhoc networks comprises the steps that a method for limiting the multi-replication eruption range is adopted, message replications of different numbers are erupted in different ranges in different directions according to movement of a vehicle, and directivity of message transmission can be better; three node performance indexes are added, and neighbor nodes with best performance are selected to serve as forwarding nodes according to the node performance indexes through a fuzzy logic learning system; a cache scheduling strategy used for having control over jamming is adopted. According to the multi-replication routing method for selecting the eruption range in the vehicular vdhoc networks, the problem that network overheads are overlarge due to blind flooding of the message replication number in multi-replication routing is solved, and the problems that due to the fact that direct transmission is passively adopted, the delivery rate is low, and delay is large are solved; compared with a traditional method, timeliness, reliability and other performance are better, and the multi-replication routing method is more applicable to the vehicular vdhoc networks with high-dynamic topology.
Description
Technical field
The invention belongs to vehicular ad hoc network technical field, it is related in a kind of vehicular ad hoc network select eruption scope
Many copies method for routing.
Background technology
Vehicular ad hoc network network (VehicularAdhocNetworks, VANET) designs specifically for vehicle communication
Self-organizing network.Due to the continuous high-speed motion of vehicle so its network transmission environment is general relatively more severe.VANET was standby in recent years
Concerned, in VANTE, point-to-point communication is highly desirable to for many applications, including drive assist system, linking Internet,
Collection with Traffic Information.Due to the mobility of vehicle, the finiteness of Radio Resource and the lossy of wireless channel, pass through
It is very big challenge that a series of intermediate nodes find an effective path from source node to destination node.The efficiency of route
It is to rely on all nodes and participates in data transfer, a series of this situation makes routing problem relatively difficult.
Many copies routing policy is considered as the method for most suitable message transmission, so infect routing mode being suggested.Pass
Dye Routing Protocol be a kind of the flooding Routing Protocol of pass-through mode is carried based on storage, it has very high delivery ratio and relatively low
Complexity, but also there are very high expense and time delay simultaneously, and traditional routing algorithm is to pursue high transmission success rate, low biography
It will usually carry out substantial amounts of packet forwarding, substantial amounts of invalid packets forward becomes that node resource consumes for defeated delay
Outstanding problem.Therefore, in order to maximize transfer rate, minimize end-to-end time delay and aggregate resource consumption, need to route to infecting
Agreement carries out the control of message copy quantity, infect route on the basis of propose flooding control algolithm SprayandWait and
BinarySpray andWait Routing Protocol is controlling the degree of flooding.
SprayandWait route comprises two stages：Eruptive stages and loitering phase.In injection phase, similar to infection
The eruption mode of route, source node message generates L message copy, and the node having this message copy forwards it to L not
The same node that can receive message copy, subsequently into loitering phase.Loitering phase, if that is, destination node does not have in injection phase
It is found, the L node carrying message copy waits until to meet destination node and message dilivery to it always, or arrival disappears
The life span of breath abandons message.
BinarySprayandWait is the improvement to SprayandWait, is to quickly message dilivery be gone out,
Its different part is in the Spray stage.As a node A（Source node or via node）Have more than one message pair
This and meet node B, and B does not have this message copy, and node A forwards the message copy of half to node B, and oneself retains one
Half message copy.When in network, each node only remains next one copy, it is converted into the Wait stage, when it meets purpose section
During point, message is abandoned using direct mode or arrival life span.
Although preferably, its own there is also some defects to both the above protocol capabilities, such as, it forwards fixed qty
Copy, for applying in different networks, there is no considerable flexibility.In vehicular ad hoc network, due to its own
Some features, it can obtain the various information with regard to surrounding it is possible to improve to basic S＆W agreement,
So that being more suitable for the application in vehicular ad hoc network.And, in second stage, the direct biography to be employed such as it is passive always
Defeated or when message reach life span, be highly detrimental to message and be quickly and effectively delivered to destination.Based on these not
In place of foot, the present invention proposes technical scheme below.
Content of the invention
In view of this, it is an object of the invention to provide selecting many copies of eruption scope in a kind of vehicular ad hoc network
Method for routing, for improving the delivery ratio of message in inter-vehicle communication, reduces time delay and reduces loss and the expense of resource.
For reaching above-mentioned purpose, the present invention provides following technical scheme：
Many copies method for routing of eruption scope is selected, in eruptive stages in a kind of vehicular ad hoc network：Vehicle source section
Point obtains L message copy first；Current location information, destination locations information and vehicle motion side are obtained by alignment system
To, and calculate the vehicle meeting whether in the angular range limiting towards destination；Combining position information if it is judged that
The neighbours' vehicle met, in the range of angle limits, proceeds the pair to select to erupt with regard to the judgement of direction of vehicle movement
This number, if it is judged that vehicle not in the range of angle limits, then sends 1 message copy；Continue judgement to meet vehicle
The direction of motion whether consistent with destination, if the direction of motion of the vehicle that meets is also consistent with destination, sends L/2 and disappear
Breath copy, if the direction of motion of the vehicle that meets is inconsistent with destination, sends a message copy, finally each vehicle section
Point terminates eruptive stages when carrying a message copy, enters loitering phase.
Further, in vehicular ad hoc network, vehicle can more easily obtain oneself and neighbor node and purpose
The position on ground, direction, the nodal information in the range of one neighbor list record one jump of each vehicle maintenance, it is possible to use these letters
What breath made message copy is injected with certain guidance quality and purposiveness, rather than blindly erupts in a network, so at this
In bright, when determining eruption scope, vehicle makes message copy using oneself with neighbor node and the position of destination, directional information
Eruption there is certain guidance quality and purposiveness it is assumed that Current vehicle travel direction be unit vectorSource node and purpose
The vector of nodeWith travel direction vectorAngle is θ, in { θth+θ,θth- θ } it is possible be using the model of two way classification eruption
Enclose, wherein θthFor 90 degree.
Further, vehicle calculates direction of motion source node vehicle and the mesh of the neighbours' vehicle in the range of oneself jump
Ground direction vector angle, orientation angle then illustrates travel direction and destination node place direction one less than angle threshold pi/2
Cause, at this moment select the vehicle meeting above-mentioned condition to send L/2 copy；Meanwhile, orientation angle is more than pi/2, and the row of vehicle is described
Sail the in opposite direction of direction and destination, then only select to forward a copy；Angle calculation is as follows：
Wherein φ is angle,It is the direction of motion vector of neighbours' vehicle,
It is the vector of Current vehicle and destination.
Further, in described method for routing, adopt and performance indications are actively selected next-hop by fuzzy logic algorithm
Method, specifically include：Obtain node essential information, recency is calculated by the information obtaining, node enlivens the factor；By workshop
Distance and relative velocity draw car speed by fuzzy logic system；Node recency, node are enlivened the factor and vehicle speed
Degree, again by fuzzy logic system, obtains effect assessment result；It is routed by the assessment result obtaining.
Further, when the copies of information number that each car carries an only surplus copy, terminate eruptive stages, enter and wait rank
Section；Traditional Wait stage will not go actively to find next-hop, but selects passively wait to meet destination node, so unfavorable
In the efficient delivery of message, the selection of next-hop in repeating process, in the present invention, consider impact message copy and forward
Each factor of efficiency, selects more suitable node, can be greatly enhanced the delivery ratio of message, in loitering phase according to commenting
Estimate the selection that result actively carries out next-hop.
Further, node recency（NR）Enliven the factor with node（A）It is come more by mobile Weighted Index averaging method
Newly, the data weighting of the data and current state of choosing laststate updates.According to emulation, the value of α is set to 0.7 effect
Good, such as node new progress defined formula is：
NR←(1-α)*NRi-1+α*NRi
In the same manner, the formula that node enlivens the factor is：
A←(1-α)*Ai-1+α*Ai
Current state is combined by the history in past, the index of calculating has more dynamic, more conform to vehicle-mounted from group
Knitmesh network.In VANET, the motion of vehicle is dominated by anthropic factor, has larger uncertainty, so using fuzzy
Logical algorithm is solving probabilistic problem.By relative velocity and the vehicle headway of vehicle, in conjunction with the behavior of driver, pass through
Constantly study mechanism, draws the acceleration of vehicle, finally calculates the car speed meeting real-time condition.
Further, process is gone to have probabilistic index using a fuzzy logic algorithm, by node recency, node
Enliven the factor and these factors are become fuzzy using predefined linguistic variable and membership function by three indexs of car speed
Value, then passes through predefined IF-THEN regular and combine these rules and carry out ranking to the performance of neighbor node, finally
Fuzzy output is converted to by a numerical value by defuzzification.
Further, additionally use a kind of buffer scheduling management method in described method for routing, including：Receiving data bag, sentences
Disconnected spatial cache whether congestion；Judge spatial cache not congestion, illustrate to can also continue to use, the packet that can will receive
It is cached；During cache congestion, calculate message prioritization function and be ranked up, high the taking out of priority is stored in caching, preferentially
The low direct discarding of level.
Further, it is assumed that the spatial cache size of vehicle is ξ, if spatial cache uses ξ in buffer scheduling management method
3/4 when be judged as cache congestion；First determine whether caching whether congestion, if the also non-congestion of node, enter caching, if
Congestion, then carry out the calculating of precedence function to message i, and the definition of the precedence function of message is：The remaining life span of message i with
The product of the size ratio with cache size and message i of node for the ratio of all message initialization life spans in network；Section
Point is according to the precedence function of message by the message according to priority descending in caching；One node is pressed from upper from its caching
To under mode carry out scheduling message, take out message, and abandon unwanted message.
The beneficial effects of the present invention is：The method for routing that the present invention provides solves message copy in many copies route
Number blindly floods the excessive problem of the network overhead bringing, and also solves due to passively making to deliver using direct transmission simultaneously
The problem that rate is not high and time delay is larger, the method is higher compared to performances such as traditional method promptness, reliabilities, is more suitable for height
The vehicular ad hoc network of dynamic topology.
Brief description
In order that the purpose of the present invention, technical scheme and beneficial effect are clearer, the present invention provides drawings described below to carry out
Explanation：
Fig. 1 is the eruptive stages flow chart that many copies provided in an embodiment of the present invention select eruption scope；
Fig. 2 is the flow chart actively selecting the next-hop stage in method for routing of the present invention；
Fig. 3 is the present invention is the flow chart reducing the buffer scheduling strategy that expense proposes；
Fig. 4 is the periodicity HELLO message packet form for obtaining neighbor information provided in an embodiment of the present invention；
Fig. 5 is the selection scene graph of improved first spray regime of injection phase in the present invention；
Fig. 6 be the present invention injection phase combine direction of vehicle movement schematic diagram of a scenario.
Specific embodiment
Below in conjunction with accompanying drawing, the preferred embodiments of the present invention are described in detail.
Fig. 1 is the flow chart of the selectivity injection phase in method for routing of the present invention.As illustrated, in the present invention, spray
The detailed process penetrated may include：
Step A1, vehicle source node obtains L message copy.
Specifically, L value to determine generally according to the scale of network, and typically acquired L-value is all far smaller than in network
Number M of node.
Step A2, obtains the direction of motion of current location information and destination locations information and vehicle.
Specifically, on the vehicle of movement, all device has GPS system it is possible to more easily obtain these information, and
And the in store neighbor list that have recorded nodal information in the range of a jump of vehicle.
Step A3, judges to meet vehicle whether in the range of limiting towards the angle of destination.
Specifically, in injection phase, blindly send message copy to all vehicles running into, be a kind of wave for resource
Take, the message copy quantity that the present invention proposes to forward vehicle is associated with eruption scope, in the eruption model towards purpose vehicle
In enclosing, that is, closer in an angular range of purpose vehicle, erupt more message copy；If in dorsad purpose vehicle
Eruption in the range of, then only erupt 1 message copy.
Step A4, judge meet vehicle the direction of motion whether consistent with destination.
Specifically, calculate the angle of the vector to destination for the Current vehicle and direction of vehicle movement.If this angle is less than
Pi/2, illustrates that the travel direction of vehicle is consistent with the direction that destination is located, simultaneously meet step A3 towards purpose vehicle
Spray regime, erupts the message copy of L/2 to these neighbor nodes；Direction and the mesh of vehicle traveling, if angle is more than pi/2, are described
Ground contrary, so can leave spray regime quickly, so also only erupting a message copy.
Step A5, terminates eruptive stages, enters second stage.
Specifically, the L copy gushing out, all entrained by vehicle node, enters second stage.
In embodiments of the present invention, compared with traditional injection agreement, the vehicle of movement makes data according to positional information
Bag distribute certain guidance quality and purposiveness, without consuming excessive Internet resources and will not blindly flood moreover it is possible to preferably
Raising message delivery ratio.
Fig. 2 is the flow chart actively selecting the next-hop stage in method for routing of the present invention.As illustrated, in the present embodiment
In, the motion of vehicle is dominated by anthropic factor, and the selection of the next-hop in repeating process is it is contemplated that how comprehensive shadow
Ring each factor of message copy forward efficiency, select more suitable next-hop, wherein step should include：
Step B1, obtains the essential information of calculative index.
Specifically, need to obtain Encounter Time, the vehicle time of staying in a network, neighbours by the interaction between vehicle
Interstitial content also has the essential informations such as relative distance and relative velocity.
Step B2, is updated to node recency calculating.
Specifically, because the probability of following foundation contact and nearest situation about contacting of setting up are very related between vehicle, institute
With the immediate cause index of calculate node, it is the last time interval ratio setting up connection between vehicle.The last contact
Shorter with current time interval, illustrate that the probability that following contact occurs is higher.It can be defined as last time foundation and contact and current
Time interval and vehicle time of staying in a network ratio.So that it more meets moving in vehicular ad hoc network
State property, is updated come the method for Weighted Index movement with the value of previous state and current state, and that is, previous state accounts for 0.3 ratio
Weight, current state value accounts for 0.7 proportion and carrys out more new node immediate cause index.
Step B3, enlivens the factor for node and is updated calculating.
Specifically, node enlivens the mobility of factor representation vehicle, and its vehicle that can contact of more active vehicle is more
Many, thus the chance running into destination is bigger.It is defined as the vehicle meansigma methodss of interior neighbor node number and network for a period of time
The ratio of the maximum of middle neighbor node number.
Step B4, three indexs go the best next-hop of assessment performance by FIS fuzzy logic system.
Specifically, first relative velocity is passed through fuzzy logic system with relative distance, the behavior in conjunction with driver uses
Learning algorithm draws the acceleration of vehicle, then draws dynamic and accurate car speed by acceleration calculation.Combine in step
The node recency that rapid B2 and B3 calculates and node enliven the factor, using these three indexs as |input paramete again by one
Fuzzy logic system.First by predefined linguistic variable and membership function, index is changed into fuzzy value, then pass through
To the selection ranking of next-hop, conciliating fuzzy method finally by an output membership function will obscure predefined rule
Output is converted into a numerical value, is routed according to result.
In embodiments of the present invention, different from the second stage of basic Routing Protocol, it is passive that node carries message copy
Wait runs into destination node and message is transferred to it, or when the life span of message abandons message.Carry message copy
Vehicle node is routed on one's own initiative, quickly message can be passed to destination.
Referring to Fig. 3, Fig. 3 is to propose one message of Routing Protocol in the present invention to need to carry multiple copies, so it needs
Using a preferable cache policy.Sent from caching by the higher message prioritization of priority by caching mechanism, because
This decreases the total transmission time delay of routing algorithm, and also can protect to the higher priority of the message of more efficient value during congestion
Deposit in the buffer, thus increased the handling capacity of system.
Step C1, receiving data bag, judge spatial cache whether congestion.
Specifically, in In-vehicle networking, connection breaking between vehicle node, each node is needed to be stored using caching and needs to pass
Export the message gone, but the space size of caching is limited, so it is necessary first to judge that spatial cache is after receiving data bag
No congestion, it is assumed that the space of caching is ξ in the present embodiment, when spatial cache uses 3/4 ξ, is then judged as cache congestion.
Step C2, judges caching not congestion.
Specifically, judge spatial cache not congestion, illustrate to can also continue to use, the data pack buffer that can will accept
Get up.
Step C3, when judging cache congestion, calculates message prioritization function and is ranked up.
Specifically, during cache congestion, message i is carried out with the calculating of precedence function, then the priority according to message will
Message carries out descending, and then mode from top to bottom carrys out scheduling message in the buffer.Message priority is high, enters slow
Deposit, the low direct discarding of message priority.Wherein, the definition of the precedence function of message is：The remaining life span of message i
(TTLi) with network in all message initialization life span (TTLo) ratio with node cache size (BSm) and message i
Size (Si) ratio product, concrete formula is：Because the remaining life span of message i is got over
Greatly, the probability that description messages i can arrive at is bigger, so priority is higher；Meanwhile, the caching of node m is bigger, preferentially
Level is also higher；And message i is bigger, i.e. SiBigger, the caching of consumption is bigger.
In embodiments of the present invention, vehicle node needs to carry multiple copies, but cache size is again limited, it is proposed that
A kind of cache management mechanism is increasing network throughput and to reduce propagation delay time and be very important.Reception transmits
Which bar message is message, abandon so that there being space all can affect delivery rate, handling capacity and time delay come the message to receive transmission.Its
In, basic format such as Fig. 4 of message.
For understanding the embodiment of the present invention in more detail, the concrete application scene of the present invention is given below.
Referring to Fig. 5, Fig. 5 be in the present invention determine spray regime schematic diagram of a scenario.Wherein, S is source vehicle node,
D is purpose node, and various vehicles travel in the road, after vehicle source node produces message it is desirable to promptly by message copy from
Source node S is sent to D.According to the geographical position of S and D, can calculateVector.Assume that Current vehicle travel direction is single
Bit vector isWithAngle is θ,Deflection be θSA=| θth±θ|（Take when Current vehicle is along due east direction+,
Take when Current vehicle is along direct north-）,Deflection be θSB=| θth±θ|（Take when Current vehicle is along due east direction-, when
Take when vehicle in front is along direct north+）, wherein θthFor 90 degree, for the scope that may be erupted using two way classification, i.e. being close in such as figure
In the range of the blue lines of destination, it is therefore possible to use two way classification sprays.Beyond blue line portion, that is, dorsad part sends 1
Individual message copy.Take this differentiation to treat pattern and be because the vehicle distances purpose on the area road in this angular range
Ground is closer to the chance being transmitted to destination is bigger, can transmit message copy faster to destination, so distributing some message more
The vehicle in this regional extent given by copy, such that it is able to improve delivery rate, reduces time delay.
Referring to Fig. 6, Fig. 6 is the schematic diagram of a scenario with reference to direction of vehicle movement for the injection phase of the present invention.Vehicle may
Towards deviate from one's purpose ground direction running, so understand its copy be carried to from destination node increasingly away from position, offset
The number of copies of breath causes substantial amounts of waste.S is source vehicle node, and D is purpose node, and the vehicle S carrying message copy calculates certainly
The direction of motion source node vehicle of neighbours' vehicle in the range of oneself jump and the angle of destination's direction vector, this angle is
Orientation angle, orientation angle is less than angle threshold pi/2 and illustrates that travel direction is consistent with destination node place direction, now selects same
When meet above-mentioned two angular range meet vehicle send L/2 copy.If orientation angle is more than the row of the explanation vehicle of pi/2
Sail in opposite direction, only 1 copy of forwarding in direction and destination.If figure is it is assumed that A, B meets the inlet zone determining in Fig. 5 simultaneously
In domain.φ 1 and φ 2 is two neighbours' vehicles A of S respectively, the movement direction angle of B, and by calculating, φ 1 is less than pi/2,
φ 2 is greater than pi/2, so the message copy number that node S is transmitted to vehicle B is L/2, only forwards 1 copy to A.
Finally illustrate, preferred embodiment above only in order to technical scheme to be described and unrestricted, although logical
Cross above preferred embodiment the present invention to be described in detail, it is to be understood by those skilled in the art that can be
In form and various changes are made to it, without departing from claims of the present invention limited range in details.
Claims (7)
1. in a kind of vehicular ad hoc network select eruption scope many copies method for routing it is characterised in that：In eruptive stages：
Source node vehicle obtains L message copy first；
Current location information, destination locations information and the neighbours' vehicle direction of motion are obtained by alignment system, and calculates neighbour
Occupy vehicle whether in the angular range limiting towards destination；
Combining position information is if it is judged that the neighbours' vehicle met, in the range of angle limits, proceeds with regard to neighbours' car
The judgement of the direction of motion selecting the copy number erupted, if it is judged that neighbours' vehicle is not in the range of angle limits,
Then send 1 message copy；
Continue to judge whether the direction of motion of neighbours' vehicle is consistent with destination, if the direction of motion of neighbours' vehicle and destination
Also consistent, then send L/2 message copy, if the direction of motion of neighbours' vehicle is inconsistent with destination, sends one and disappear
Cease copy, finally each neighbours' vehicle terminates eruptive stages when carrying a message copy, enter loitering phase；
When determining eruption scope, source node vehicle makes to disappear with neighbours' vehicle and the position of destination, directional information using oneself
The eruption of breath copy has certain guidance quality and purposiveness it is assumed that source node vehicle heading is unit vectorSource node
Vehicle and the vector of destination nodeWith travel direction vectorAngle is θ, in { θth+θ,θth- θ } for two way classification may be adopted
The scope of eruption, wherein θthFor 90 degree；
Source node vehicle calculates direction of motion source node vehicle and the destination of the neighbours' vehicle in the range of oneself jump
The angle of direction vector, less than angle threshold pi/2, orientation angle then illustrates that travel direction is consistent with destination node place direction, this
When select meet above-mentioned condition neighbours' vehicle send L/2 copy；Meanwhile, orientation angle is more than pi/2, and neighbours' vehicle is described
Travel direction is in opposite direction with destination, then only select to forward a copy；Angle calculation is as follows：
Wherein φ1For angle,It is the direction of motion vector of neighbours' vehicle,It is source node
Vehicle and the vector of destination,Vector for neighbours' vehicle and destination.
2. in vehicular ad hoc network according to claim 1, select many copies method for routing of eruption scope, its feature
It is：In described method for routing, adopt the method that performance indications are actively selected next-hop by fuzzy logic algorithm, specifically
Including：Obtain node essential information, recency is calculated by the information obtaining, node enlivens the factor；By vehicle headway with relative
Speed draws car speed by fuzzy logic system；By node recency, node enliven the factor and car speed again by
Fuzzy logic system, obtains effect assessment result；It is routed by the assessment result obtaining.
3. in vehicular ad hoc network according to claim 2, select many copies method for routing of eruption scope, its feature
It is：When the copies of information number that each car carries an only surplus copy, terminate eruptive stages, enter loitering phase；Waiting
Stage actively carries out the selection of next-hop according to assessment result.
4. in vehicular ad hoc network according to claim 3, select many copies method for routing of eruption scope, its feature
It is：It is to be updated by mobile Weighted Index averaging method that node recency and node enliven the factor, chooses laststate
The data weighting of data and current state updates.
5. in vehicular ad hoc network according to claim 4, select many copies method for routing of eruption scope, its feature
It is：Go process to have probabilistic index using a fuzzy logic algorithm, by node recency, node enliven the factor and
These factors are become fuzzy value using predefined linguistic variable and membership function by three indexs of car speed, then pass through
Predefined IF-THEN rule simultaneously combines these rules and carries out ranking to the performance of neighbours' vehicle, finally by ambiguity solution
Change and fuzzy output is converted to a numerical value.
6. in vehicular ad hoc network according to claim 1, select many copies method for routing of eruption scope, its feature
It is：A kind of buffer scheduling management method is additionally used in described method for routing, including：Receiving data bag, judges spatial cache
Whether congestion；Judge spatial cache not congestion, illustrate to can also continue to use, the data pack buffer of reception can be got up；
During cache congestion, calculate message prioritization function and be simultaneously ranked up, high the taking out of priority is stored in caching, low direct of priority
Abandon.
7. in vehicular ad hoc network according to claim 6, select many copies method for routing of eruption scope, its feature
It is：In buffer scheduling management method it is assumed that the spatial cache size of vehicle be ξ, if spatial cache use the 3/4 of ξ when
Time is judged as cache congestion；First determine whether caching whether congestion, if the also non-congestion of node, enter caching, if congestion, right
Message i carries out the calculating of precedence function, and the definition of the precedence function of message is：The remaining life span of message i and institute in network
There is the product of the ratio of the message initialization life span cache size with node and the size ratio of message i；Node is according to disappearing
Breath precedence function by cache in message according to priority descending；One node presses side from top to bottom from its caching
Formula carrys out scheduling message, takes out message, and abandons unwanted message.
Priority Applications (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN201410060371.9A CN103763193B (en) | 2014-02-21 | 2014-02-21 | Multi-replication routing method for selecting eruption range in vehicular vdhoc networks |
Applications Claiming Priority (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN201410060371.9A CN103763193B (en) | 2014-02-21 | 2014-02-21 | Multi-replication routing method for selecting eruption range in vehicular vdhoc networks |
Publications (2)
| Publication Number | Publication Date |
|---|---|
| CN103763193A CN103763193A (en) | 2014-04-30 |
| CN103763193B true CN103763193B (en) | 2017-02-15 |
Family
ID=50530355
Family Applications (1)
| Application Number | Title | Priority Date | Filing Date |
|---|---|---|---|
| CN201410060371.9A Active CN103763193B (en) | 2014-02-21 | 2014-02-21 | Multi-replication routing method for selecting eruption range in vehicular vdhoc networks |
Country Status (1)
| Country | Link |
|---|---|
| CN (1) | CN103763193B (en) |
Families Citing this family (10)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN105228215B (en) * | 2015-09-01 | 2018-07-06 | 重庆邮电大学 | More copy method for routing based on decision tree mechanism in vehicular ad hoc network |
| CN105792306A (en) * | 2016-02-29 | 2016-07-20 | 重庆邮电大学 | Vehicular delay tolerant network multi-copy routing method based on classification and regression tree algorithm |
| CN106211260B (en) * | 2016-07-31 | 2019-12-10 | 华南理工大学 | Position information self-adaptive opportunistic routing method in Internet of vehicles |
| CN106209627B (en) * | 2016-08-05 | 2019-06-14 | 中山大学 | Vehicle-mounted distribute based on node-node transmission ability focuses Routing Protocol method |
| CN110300390A (en) * | 2018-03-21 | 2019-10-01 | 华为技术有限公司 | A kind of method and apparatus of wireless communication |
| CN109831758B (en) * | 2019-03-19 | 2020-12-04 | 南京邮电大学 | Method for selecting content forwarding node in vehicle-mounted self-organizing network based on service type |
| CN110068323B (en) * | 2019-05-15 | 2021-02-02 | 北京邮电大学 | Network time delay positioning error compensation method and device and electronic equipment |
| CN110139245B (en) * | 2019-05-20 | 2022-09-02 | 重庆邮电大学 | Vehicle networking relay node selection method based on fuzzy logic |
| CN110446185B (en) * | 2019-07-22 | 2021-01-19 | 西安交通大学 | Routing method for communication between vehicles based on node familiarity model |
| CN113938976B (en) * | 2021-10-20 | 2023-11-07 | 广州新华学院 | Intelligent utility planning passive perception routing algorithm of Internet of things |
Citations (3)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN102045809A (en) * | 2009-10-16 | 2011-05-04 | 南京理工大学 | Routing method of opportunistic network based on wireless radio frequencies |
| CN102546393A (en) * | 2011-12-12 | 2012-07-04 | 华中科技大学 | Social network route optimizing method based on integral liveness |
| CN103078872A (en) * | 2013-01-30 | 2013-05-01 | 南京理工大学连云港研究院 | Adaptive seed spray and focus routing (ASSFR) protocol based on auditory steady state response (ASSR) |
Family Cites Families (1)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| US9119226B2 (en) * | 2012-04-13 | 2015-08-25 | Massachusetts Institute Of Technology | Architecture for content and host-centric information dissemination in delay-tolerant MANETs |
-
2014
- 2014-02-21 CN CN201410060371.9A patent/CN103763193B/en active Active
Patent Citations (3)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN102045809A (en) * | 2009-10-16 | 2011-05-04 | 南京理工大学 | Routing method of opportunistic network based on wireless radio frequencies |
| CN102546393A (en) * | 2011-12-12 | 2012-07-04 | 华中科技大学 | Social network route optimizing method based on integral liveness |
| CN103078872A (en) * | 2013-01-30 | 2013-05-01 | 南京理工大学连云港研究院 | Adaptive seed spray and focus routing (ASSFR) protocol based on auditory steady state response (ASSR) |
Also Published As
| Publication number | Publication date |
|---|---|
| CN103763193A (en) | 2014-04-30 |
Similar Documents
| Publication | Publication Date | Title |
|---|---|---|
| CN103763193B (en) | Multi-replication routing method for selecting eruption range in vehicular vdhoc networks | |
| Abbas et al. | Clustering-based reliable low-latency routing scheme using ACO method for vehicular networks | |
| Ji et al. | SDGR: An SDN-based geographic routing protocol for VANET | |
| CN105208616B (en) | Adaptive more copy method for routing based on road topology in vehicular ad hoc network | |
| CN102255973B (en) | Routing method in vehicle wireless communication network and vehicle wireless communication network | |
| Ji et al. | Efficient and reliable cluster-based data transmission for vehicular ad hoc networks | |
| Saleh et al. | A reliable routing protocol for vehicular ad hoc networks | |
| CN107645417A (en) | Towards the adaptive routing method of expressway car networking scene | |
| CN103702387A (en) | Social network-based vehicle-mounted self-organization network routing method | |
| CN106792977A (en) | Double cluster head method for routing based on traffic density in vehicular ad hoc network | |
| CN106211260B (en) | Position information self-adaptive opportunistic routing method in Internet of vehicles | |
| CN104135436A (en) | Self-organizing network route selecting method for vehicles | |
| Qureshi et al. | Distance and signal quality aware next hop selection routing protocol for vehicular ad hoc networks | |
| CN111741448A (en) | Clustering AODV (Ad hoc on-demand distance vector) routing method based on edge computing strategy | |
| CN108650656A (en) | A kind of distributed urban car networking method for routing based on intersection | |
| CN109640369A (en) | A kind of vehicle-mounted net reliable communication method based on adaptive power | |
| CN107690169A (en) | A kind of retransmission method of GPSR Routing Protocols suitable for car networking | |
| CN105228215B (en) | More copy method for routing based on decision tree mechanism in vehicular ad hoc network | |
| WO2020215530A1 (en) | Node performance-based opportunity forwarding method in internet of vehicles | |
| Li et al. | An intersection-based delay sensitive routing for VANETs using ACO algorithm | |
| Wolterink et al. | Dissemination protocols to support cooperative adaptive cruise control (CACC) merging | |
| CN108768852B (en) | Opportunistic routing method based on multi-copy congestion avoidance in Internet of vehicles | |
| CN105101262B (en) | Mobility Prediction Method in Mobile Ad based on TDMA agreements in a kind of highly dynamic radio In-vehicle networking | |
| CN104837173B (en) | A kind of metropolitan area Vehicular communication system of band parking node | |
| CN106900026B (en) | Method for selecting route backbone path based on network communication |
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 |