CN105407517B - Method for routing, routing module, car-mounted terminal and vehicular ad hoc network route system - Google Patents
Method for routing, routing module, car-mounted terminal and vehicular ad hoc network route system Download PDFInfo
- Publication number
- CN105407517B CN105407517B CN201510696275.8A CN201510696275A CN105407517B CN 105407517 B CN105407517 B CN 105407517B CN 201510696275 A CN201510696275 A CN 201510696275A CN 105407517 B CN105407517 B CN 105407517B
- Authority
- CN
- China
- Prior art keywords
- node
- present
- distance
- destination
- judging
- 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
- 238000000034 method Methods 0.000 title claims abstract description 42
- 238000004891 communication Methods 0.000 claims description 22
- 230000005540 biological transmission Effects 0.000 claims description 19
- 230000000737 periodic effect Effects 0.000 claims description 3
- 230000003111 delayed effect Effects 0.000 claims 1
- 238000012546 transfer Methods 0.000 abstract description 15
- 230000001413 cellular effect Effects 0.000 abstract description 10
- 238000010586 diagram Methods 0.000 description 8
- 230000006855 networking Effects 0.000 description 4
- 230000008859 change Effects 0.000 description 2
- 238000005516 engineering process Methods 0.000 description 2
- 238000012986 modification Methods 0.000 description 2
- 230000004048 modification Effects 0.000 description 2
- 230000008569 process Effects 0.000 description 2
- FGRBYDKOBBBPOI-UHFFFAOYSA-N 10,10-dioxo-2-[4-(N-phenylanilino)phenyl]thioxanthen-9-one Chemical compound O=C1c2ccccc2S(=O)(=O)c2ccc(cc12)-c1ccc(cc1)N(c1ccccc1)c1ccccc1 FGRBYDKOBBBPOI-UHFFFAOYSA-N 0.000 description 1
- 230000009471 action Effects 0.000 description 1
- 230000000694 effects Effects 0.000 description 1
- 238000005538 encapsulation Methods 0.000 description 1
- 230000006870 function Effects 0.000 description 1
- 230000003993 interaction Effects 0.000 description 1
- 238000012423 maintenance Methods 0.000 description 1
- 230000007246 mechanism Effects 0.000 description 1
- 238000002834 transmittance Methods 0.000 description 1
Classifications
-
- H—ELECTRICITY
- H04—ELECTRIC COMMUNICATION TECHNIQUE
- H04W—WIRELESS COMMUNICATION NETWORKS
- H04W40/00—Communication routing or communication path finding
- H04W40/02—Communication route or path selection, e.g. power-based or shortest path routing
- H04W40/20—Communication route or path selection, e.g. power-based or shortest path routing based on geographic position or location
-
- H—ELECTRICITY
- H04—ELECTRIC COMMUNICATION TECHNIQUE
- H04W—WIRELESS COMMUNICATION NETWORKS
- H04W84/00—Network topologies
- H04W84/18—Self-organising networks, e.g. ad-hoc networks or sensor networks
Abstract
The invention discloses a kind of method for routing, routing module, car-mounted terminal and with vehicular ad hoc network route system, wherein the method for routing passes through in the neighbor node for judging present node with the presence or absence of destination node, and when judging result is "No", judged in neighbor node according to greedy algorithm with the presence or absence of suitable next-hop node, if judging at this time, there is no when suitable next-hop node in neighbor node, then judge according to greedy algorithm in adjacent street node with the presence or absence of suitable next-hop node, and when judging that there are when next-hop node in adjacent street node, next-hop node is selected by dijkstra's algorithm and greedy algorithm again.Method for routing provided by the invention can effectively reduce link down rate and improve data transfer efficiency in data transfer.More importantly, when carrying out data transmitting using method for routing provided by the invention, data packet transmitting is completed only by VANET network, so as to reduce the occupancy to cellular network resource.
Description
Technical field
The present invention relates to field of communication technology, in particular to a kind of method for routing, routing module,
Car-mounted terminal and vehicular ad hoc network route system.
Background technique
Vehicular ad hoc network (Vehicular Ad hoc Network, abbreviation VANET) is by Wireless Ad hoc network and wirelessly
Sensor network is combined, creative to apply ad hoc network between vehicle, in communication range, passes through what is set up
Mobile network can exchange information between vehicle in real time.Since the single-hop communication distance of each node is very short, communication is participated in
Vehicle node be not only a transceiver or a router, the vehicle in network is by the way of multi-hop data forwarding
To farther vehicle.VANET has wide in terms of traffic congestion control, traffic safety, trip planning and journey amusement
Prospect, VANET Routing Protocol provide data communication for these applications and support.
Since In-vehicle networking change in topology is frequent, vehicle node movement speed is fast, and route technology becomes vehicular ad hoc network
In one of significant challenge.Currently, the Routing Protocol used in vehicular ad hoc network can substantially be divided into 3 classes: based on topology
Routing Protocol, location-based Routing Protocol, the Routing Protocol based on map.Wherein, location-based Routing Protocol is not due to
Routing table or store path are needed, each node only needs to know the location information of neighbor node and destination node, so that it may certainly
The node for determining next-hop greatly reduces the expense of maintenance network topological information, can preferably adapt to the topology of In-vehicle networking
The variation of structure, therefore, location-based Routing Protocol uses also most extensive in In-vehicle networking.
Stateless greediness periphery, which routes (Greedy Perimeter stateless Routing, abbreviation GPSR) agreement, is
Classical location-based Routing Protocol.It is first used according to GPSR agreement when source node needs to send data to destination node
Greedy forward mode finds a node nearest apart from destination node as under data in oneself all neighbor nodes
One jumps, and then transfers data to the neighbor node.Next-hop node is if not destination node, and next-hop node is also in compliance with same
The method of sample continually looks for next-hop, which repeats always the row that spouts, until data reach destination node.When not having
There is the node than the node closer to destination node, but the wireless range of the node cannot directly transmit data to destination node
The case where when, data can not be transmitted, and GPSR consultation is changed to periphery forward mode, according to right-hand rule along other up to node after
Transmission of data is resumed to solve such case.But the hop count of node is increased in this way, routing cost is increased, data packet is increased
The delay time of transmission, and node density than it is sparse in the case where, GPSR cannot be guaranteed to have the node that can communicate real
Apply periphery forwarding.
Currently, having some improved Routing Protocols, by combining some information that can be obtained from automobile, such as position letter
Breath, electronic map information, projected trip path etc., can improve the performance of routing mechanism using these information, still, this side
The information that formula is capable of providing automobile itself has a very strong dependence, and these information can not different zones automobile it
Between transmit.There are also Routing Protocols, provide alternate links using mobile cellular network for VANET, can not incite somebody to action when by VANET
It when information sends destination node to, is transmitted by cellular network, this mode occupies the Internet resources of cellular network.
Therefore it provides a kind of link down rate is lower, efficiency of transmission is higher, occupy cellular network resource it is lesser it is vehicle-mounted from
The technical issues of network routing method is this field urgent need to resolve.
Summary of the invention
The present invention provides a kind of method for routing, routing module, car-mounted terminal and vehicular ad hoc network route system, can effectively drop
Link down rate in low data transfer and the occupancy to cellular network resource, while can also improve data transfer effect
Rate.
To achieve the above object, the present invention provides a kind of method for routing, for providing routing plan in vehicular ad hoc network
Slightly, comprising:
Judge that, with the presence or absence of destination node in the neighbor node of present node, the neighbor node is and the present node
The maximum communication distance for being less than the present node in identical street and with the distance between the present node node；
If judging that described prosthomere will be worked as there are when the destination node in the neighbor node of the present node
The data packet of point is sent to the destination node；
If judging to judge whether there is institute there is no when the destination node in the neighbor node of the present node
The distance between neighbor node and the destination node are stated less than the distance between the present node and the destination node；
If judging, there are the distance between the neighbor nodes and destination node to be less than the present node and the mesh
The distance between node when, then choose the smallest neighbor node of the distance between the destination node as next-hop
Node, and using the next-hop node as present node, re-execute in the neighbor node for judging present node whether
The step of there are destination nodes；
If judge there is no the distance between the neighbor node and destination node less than the present node with it is described
When the distance between destination node, then judge whether there is between the adjacent street node of the present node and destination node
Distance is less than the distance between the present node and the destination node, and the adjacent street node is and the present node
The node on street that locating street intersects；
If judging, there are the distance between the adjacent street node and destination nodes to be less than the present node and institute
When stating the distance between destination node, then Di jkstra algorithm picks next-hop street is used；
Next-hop node is chosen from next-hop street based on greedy algorithm, and using the next-hop node as working as prosthomere
Point, the step of re-executing in the neighbor node of the judgement present node with the presence or absence of destination node.
Optionally, if judging to be less than there is no the distance between the adjacent street node and destination node described current
When the distance between node and the destination node, then by the data pack buffer of the present node.
Optionally, after the step of present node is by data pack buffer, further includes:
Judge that whether the present node caches the total time of the data packet more than the first preset time；
If judge that the present node caches the time of the data packet more than the first preset time, work as by described in
The data packet discarding of prosthomere point cache；
If judge that the present node caches the time no first of the data packet more than preset time, judge
The present node whether there is neighbor node；
If judging the present node, there are the neighbours' sections for when neighbor node, re-executing the judgement present node
The step of whether there is destination node in point；
If judging, the present node is described there is no being re-executed when neighbor node after the second preset time
The step of judging the present node whether cache the total time of the data packet be more than first preset time.
To achieve the above object, the present invention also provides a kind of routing modules, for providing routing in vehicular ad hoc network
Strategy, comprising:
First judging unit is in the neighbor node of present node for judging after present node receives data packet
It is no there are destination node, the neighbor node is with the present node in identical street and between the present node
Distance be less than the present node maximum communication distance node；
Transmission unit, for existing in the neighbor node that first judging unit judges the present node
When the destination node, then the data packet of the present node is sent to the destination node；
Second judgment unit, for not deposited in the neighbor node that first judging unit judges the present node
In the destination node, then judges whether there is the distance between the neighbor node and the destination node and be less than described work as
The distance between front nodal point and the destination node；
First selection unit, for the second judgment unit judge there are the neighbor node and destination node it
Between distance be less than the distance between the present node and the destination node when, then selection and the destination node between
Apart from a smallest neighbor node as next-hop node；
Third judging unit, for judging that there is no the neighbor node and destination nodes in the second judgment unit
The distance between be less than the distance between the present node and the destination node when, then judge whether there is described in work as prosthomere
The distance between the adjacent street node of point and destination node are less than the distance between the present node and the destination node,
The adjacent street node is the node on the street to intersect with street locating for the present node；
Second selection unit, for judging that there are the adjacent street nodes and purpose section in the third judging unit
When the distance between point is less than the distance between the present node and the destination node, then chosen using dijkstra's algorithm
Next-hop street out；
Third selection unit, for selecting next-hop node from next-hop street based on greedy algorithm；
The transmission unit is also used to select in first selection unit or the third selection unit described next
When hop node, the data packet of the present node is sent to the next-hop node.
Optionally, further includes:
Cache unit, for judging that there is no the adjacent street node and destination nodes in the third judging unit
The distance between be less than the distance between the present node and the destination node when, then by the data packet of the present node
Caching.
Optionally, further includes:
4th judging unit, for judging whether in advance more than first cache unit caches the total time of the data packet
If the time；
5th judging unit, for judging that the present node caches the data packet in the 4th judging unit
When time is more than preset time without first, then judge the present node with the presence or absence of neighbor node；
First judging unit is also used to that there are neighbours judging the present node in the 5th judging unit
When node, then the step of execution in the neighbor node for judging the present node with the presence or absence of destination node.
The cache unit is also used to judge that the present node caches the data packet in the 4th judging unit
Time be more than the first preset time when, then by the data packet discarding of caching.
To achieve the above object, the present invention also provides a kind of car-mounted terminals, comprising: routing module, the routing module
Using above-mentioned routing module.
Optionally, further includes:
Information reading module, for periodically reading the nodal information of vehicle itself, the nodal information includes: vehicle
The mark of street locating for identity, vehicle position information and vehicle；
Wireless communication module, for the nodal information of vehicle itself to be uploaded to network side equipment, and described in reception
The nodal information of other vehicles of network side equipment broadcast；
The routing module is according to the nodal information of the vehicle itself, the nodal information of other vehicles and purpose section
The nodal information of point formulates routing policy.
Optionally, further includes:
Information storage module, for storing nodal information and the institute of the vehicle itself that the information reading module obtains
The nodal information for other vehicles that wireless communication module receives is stated, and parses institute from the packet header of the data packet
State the nodal information of destination node.
To achieve the above object, the present invention also provides a kind of vehicular ad hoc network route systems, comprising: car-mounted terminal, institute
Car-mounted terminal is stated using above-mentioned car-mounted terminal.
Optionally, further includes: network side equipment, the network side equipment include:
Information of vehicles memory module, the nodal information that all vehicles report in coverage area for storing, and periodically
It updates；
Multimedia broadcast multi-broadcasting business module, for whole nodes letter in periodic broadcast information of vehicles memory module
Breath.
The invention has the following advantages:
The present invention provides a kind of method for routing, routing module, car-mounted terminal and vehicular ad hoc network route systems, wherein should
Method for routing is first passed through with the presence or absence of destination node in the neighbor node for judge present node, and when judging result is "No"
Judged according to greedy algorithm with the presence or absence of suitable next-hop node in neighbor node, if judging not deposit in neighbor node at this time
In suitable next-hop node, then judge according to greedy algorithm in adjacent street node with the presence or absence of suitable next-hop section
Point, and selected when judging in adjacent street node there are when next-hop node, then by dijkstra's algorithm and greedy algorithm
Take out next-hop node.Method for routing provided by the invention can effectively reduce link down rate and raising in data transfer
Data transmission efficiency.More importantly, when carrying out data transmitting using method for routing provided by the invention, data packet is transmitted only
It is only completed by VANET network, so as to reduce the occupancy to cellular network resource.
Detailed description of the invention
Fig. 1 is a kind of flow chart for method for routing that the embodiment of the present invention one provides；
Fig. 2 is a kind of flow chart of method for routing provided by Embodiment 2 of the present invention；
Fig. 3 is a kind of structural block diagram for routing module that the embodiment of the present invention three provides；
Fig. 4 is a kind of structural block diagram for routing module that the embodiment of the present invention four provides；
Fig. 5 is a kind of structural block diagram for car-mounted terminal that the embodiment of the present invention five provides；
Fig. 6 is schematic diagram when car-mounted terminal is interacted with network side equipment.
Specific embodiment
To make those skilled in the art more fully understand technical solution of the present invention, the present invention is mentioned with reference to the accompanying drawing
A kind of method for routing, routing module, car-mounted terminal and the vehicular ad hoc network route system supplied is described in detail.
In order to better understand the present invention, first several technical terms are illustrated herein." node " so-called in the present invention,
Refer to that the vehicle for carrying out data transmitting, each vehicle are provided with corresponding nodal information in vehicular ad hoc network, the section
Point information includes at least: street mark locating for vehicle identification mark, vehicle position information and vehicle, and wherein vehicle identification mark is
The unique identity of corresponding vehicle is characterized, vehicle position information indicates specific location locating for vehicle, the mark of street locating for vehicle
Know the number for indicating street locating for vehicle.So-called " source node " refers to the starting vehicle that data packet is sent, and generates data
The vehicle of packet.So-called " destination node " refers to the purpose vehicle for needing for data packet to be finally sent to.So-called " present node ",
Data packet is referred in transmittance process, the vehicle (can be source node) that data packet is currently located.So-called " next-hop node ",
Refer to that data packet carries out one and jumps the vehicle reached later.So-called " neighbor node " is referred to present node in identical
The street and maximum communication distance for being less than present node with the distance between present node (it is logical to be currently located vehicle positioned at data packet
Within the scope of letter) vehicle, wherein the distance between two cars can be calculated according to the corresponding vehicle position information of two cars
Out.So-called " adjacent street node " refers to the vehicle on the street to intersect with street where present node.
In addition, those skilled in the art need it should also be understood that working as certain source node in vehicular ad hoc network to destination node
When sending data packet, source node can issue destination node information inquiring request to network side equipment first, to inquire destination node
Nodal information, destination node information feeds back to source node by network side, and source node receives and stores the node letter of destination node
Breath, and by the Information encapsulation of destination node into the packet header of data packet to be passed.Hereafter, can start to carry out based on vehicle-mounted from group
The data of net are transmitted.
Embodiment one
Fig. 1 is a kind of flow chart for method for routing that the embodiment of the present invention one provides, as shown in Figure 1, the method for routing is suitable
For vehicular ad hoc network, which includes:
Step S1, judge in the neighbor node of present node with the presence or absence of destination node.
In step sl, it is possible, firstly, to according to other nodes in vehicular ad hoc network pre-stored in present node
Vehicle position information, calculating (are in each node that present node has the mark of street locating for identical vehicle with present node
Identical street) the distance between present node is arrived, and by wherein distance less than the node mark of the maximum communication distance of present node
It is denoted as neighbor node；Then, by comparing the vehicle of the vehicle identification mark and destination node of pre-stored each neighbor node
Whether identity is identical.
If compare identical as the vehicle identification mark of destination node there are the vehicle identification of neighbor node mark, sentence
There are destination nodes in the disconnected neighbor node of present node out, and identify identical neighbor node with the vehicle identification of destination node
As destination node executes step S2 at this time.If comparing, there are the vehicles of the vehicle identification of neighbor node mark and destination node
When identity is identical, then judge that there is no destination nodes in the neighbor node of present node, execute step S3 at this time.
It should be noted that how each node obtains the process of other vehicle position informations in vehicular ad hoc network, it will be rear
It is described in continuous content.
Step S2, the data packet of present node is sent to destination node.
Step S3, the distance between neighbor node and destination node are judged whether there is less than current node and destination node
The distance between.
In step s3, firstly, in vehicular ad hoc network according to the pre-stored data each node vehicle position information, count respectively
Calculate the distance of present node, each neighbor node to destination node.Then by the distance of each neighbor node to destination node and currently
The distance of node to destination node is compared, and the distance of at least one neighbor node to destination node is less than and works as prosthomere if it exists
Point to destination node apart from when, then it is assumed that have the node for meeting greedy forwarding condition in neighbor node, execute step S4 at this time.
If it does not exist neighbor node to destination node distance be less than present node to destination node distance, then it is assumed that in neighbor node
Do not meet the node of greedy forwarding condition, executes step S5 at this time.
It should be noted that the greedy forward rule in the present invention is to choose from all nodes being on the waiting list from destination node
Most into close node as next-hop node.
Step S4, the smallest neighbor node of the distance between selection and destination node is as next-hop node.
In step s 4, can by the distance to each neighbor node calculated in above-mentioned steps S3 to destination node into
Row sequence, and the smallest neighbor node of the distance between destination node is therefrom chosen as next-hop node.At this point, will
Data packet is transferred to next-hop node, and re-executes above-mentioned steps S1.
Step S5, the distance between adjacent street node and destination node of present node is judged whether there is to be less than currently
The distance between node and destination node.
In step s 5, it is possible, firstly, to according to other nodes in vehicular ad hoc network pre-stored in present node
Street locating for vehicle identifies the mark of street locating for vehicle corresponding with present node, identifies the adjacent street section of present node
Point；Then, each adjacent street node is calculated, present node arrives the distance between destination node；Then, by each neighbor node to mesh
The distance of node be compared at a distance from present node to destination node, at least one adjacent street node to mesh if it exists
Node distance be less than present node to destination node apart from when, then it is assumed that have in adjacent street node and meet greedy forwarding
The node of condition executes step S6 at this time.The distance of adjacent street node to destination node is arrived less than present node if it does not exist
Destination node apart from when, then it is assumed that currently without suitable next-hop node, data are without transmitting, data transfer chain at this time
It interrupts on road.
Step S6, next-hop street is chosen using dijkstra's algorithm.
Wherein, dijkstra's algorithm is classical shortest path first, for calculate in digraph from a vertex to its
The shortest path on remaining each vertex.In step s 6, digraph is generated according to street actual road conditions, wherein can be by intersections of streets
Point regards the vertex in digraph as, and path is regarded in street as, and the crosspoint on street locating for present node can see source summit as, with
Destination node is apart from nearest road junction vertex as a purpose.Wherein, each adjacent street (is known as adjacent road in digraph
Diameter) weight be equal to number of nodes on street class length and the street (number of nodes on street can be based on street locating for vehicle
Road identify to carry out statistics acquisition) the ratio between (if on the adjacent street number of nodes be 0, correspond to weight be infinity), it is each non-
The weight of adjacent street (being known as non-adjacent path in digraph) is equal to street class length.It can be calculated with dijkstra's algorithm
Out from source summit into all routed paths in purpose vertex, that the smallest routed path of the sum of routine weight value, so as to true
Street locating for next-hop node (adjacent street) is made, that is, next-hop street has been determined.Since the weight of adjacent path had both been examined
Consider street length, it is contemplated that the number of nodes on street, the path traffic density so as to guarantee selection is relatively large,
And transmission range is also relatively short.Therefore it can reduce and cause link down probability due to lacking intermediate forwarding vehicle, while
Propagation delay time can be reduced as far as possible, improve efficiency of transmission.
Step S7, next-hop node is chosen from next-hop street based on greedy algorithm.
In the step s 7, calculate step S6 it is selected go out next-hop street on each adjacent street node to destination node
Distance, and be ranked up, therefrom choose with the smallest adjacent street node of the distance between destination node as next
Hop node.At this point, data packet is transferred to next-hop node, and re-execute above-mentioned steps S1.
The embodiment of the present invention one provides a kind of method for routing, which can effectively reduce in data transfer
Link down rate and improve data transfer efficiency.More importantly, data are being carried out using method for routing provided in this embodiment
When transmitting, data packet transmitting is completed only by VANET network, so as to reduce the occupancy to cellular network resource.
Embodiment two
Fig. 2 is a kind of flow chart of method for routing provided by Embodiment 2 of the present invention, as shown in Fig. 2, the present embodiment provides
Method for routing include the steps that S1 in method for routing shown in Fig. 1~step S7, due to step S1~step S7 above into
Detailed description is gone, details are not described herein.Only step S8~step S11 is described in detail below.
Specifically, unlike above-described embodiment one, in method for routing provided in this embodiment, sentence when in step S5
It is disconnected go out there is no the distance of adjacent street node to destination node less than present node to destination node apart from when, then execute step
Rapid S8.
Step S8, by the data pack buffer of present node.
In step s 8, data packet is not abandoned at once at once, but will be by the way that caching is single accordingly in present node
Member is cached.
Step S9, judge the total time of the data cached packet of present node whether more than the first preset time.
In step s 9, timing is carried out to the duration of the data cached packet of cache unit by corresponding timing unit, when sentencing
Disconnected when total time being not above the first preset time of the data cached packet of present node out, thens follow the steps S10；If judging to work as
The total time of the data cached packet of front nodal point is more than the first preset time, thens follow the steps S11.
Step S10, judge present node with the presence or absence of neighbor node.
It should be noted that during present node caches data packet, with vehicle in vehicular ad hoc network
Movement, the nodal information (at least vehicle position information) of corresponding node can change, then at this time it is possible that closing
Suitable next-hop node.Therefore, in step slo, by judge present node with the presence or absence of neighbor node, can to it is vehicle-mounted from
A preliminary judgement is carried out with the presence or absence of suitable next-hop node in networking.
If judging, present node is suitable next there are when neighbor node, illustrating to be likely to occur in current vehicular ad hoc network
Hop node re-execute the steps S1 at this time；If judging, present node there is no when neighbor node, illustrates current vehicular ad hoc network
In suitable next-hop node is not present, therefore S9 can re-execute the steps after the second preset time.
Step S11, the data packet discarding for caching present node.
Since the data cached packet of present node has already been through a period of time, and next-hop node is not present always, to keep away
Exempt from the data packet entire vehicular ad hoc network is caused to bear, then present node is by the data packet discarding of caching, link down.
It should be noted that above-mentioned first preset time and the second preset time can carry out accordingly according to actual needs
Setting.
Second embodiment of the present invention provides a kind of method for routing, effective improve data transfer efficiency and can reduce to bee
The occupancy of nest Internet resources.In addition, compared with the method for routing that above-described embodiment one provides, due to road provided in this embodiment
Data packet can be cached when present node can not find next-hop node by method, and can be in the first preset time
Next-hop node is constantly found according to the variation of vehicular ad hoc network interior joint, therefore in method for routing provided in this embodiment
Link down probability is lower.
Embodiment three
Fig. 3 is a kind of structural block diagram for routing module that the embodiment of the present invention three provides, as shown in figure 3, the routing module
For executing the method for routing of the offer of above-described embodiment one, which includes: the first judging unit 1, transmission unit 2, the
Two judging units 3, the first selection unit 4, third judging unit 5, the second selection unit 6 and third selection unit 7.
Wherein, the first judging unit 1 is used for after present node receives data packet, judges the neighbor node of present node
In whether there is destination node.Optionally, the first judging unit 1 includes: the first comparing subunit and the first judgment sub-unit.Its
In, the first comparing subunit is used to identify by comparing the vehicle identification mark and the vehicle identification of destination node of each neighbor node
It is whether identical.First comparing subunit be used for when the first comparing subunit compare there are the vehicle identification of neighbor node mark with
When the vehicle identification mark of destination node is identical, then judge that identifying identical neighbor node with the vehicle identification of destination node is
Destination node；And there is no the vehicles of the vehicle identification of neighbor node mark and destination node when the first comparing subunit is compared
When identity is identical, judge that there is no destination nodes in neighbor node.
If transmission unit 2 is judged in the neighbor node of present node for the first judging unit 1 there are when destination node,
The data packet of present node is then sent to destination node.In addition, the transmission unit 2 is also used in the first selection unit 4 or the
When three selection units 7 select next-hop node, the data packet of present node is sent to next-hop node.It needs to illustrate
Be, the transmission unit 2 in the present embodiment can independently of individualism except routing module,
Second judgment unit 3 is used to that purpose to be not present in the neighbor node that the first judging unit 1 judges present node
When node, then the distance between neighbor node and destination node are judged whether there is less than between current node and destination node
Distance.Specifically, in the vehicular ad hoc network according to the pre-stored data of second judgment unit 3 each node vehicle position information, respectively
Calculate present node, each neighbor node to destination node distance, and by the distance of each neighbor node to destination node respectively with
The distance of present node to destination node is compared.
First selection unit 4 be used for second judgment unit 3 judge there are between neighbor node and destination node away from
When from being less than the distance between current node and destination node, then the smallest neighbours of the distance between destination node are chosen
Node is as next-hop node.Specifically, the first selection unit 4 passes through calculated each neighbor node in second judgment unit 3
Distance to destination node is ranked up, and therefrom chooses the smallest neighbor node conduct of the distance between destination node
Next-hop node.
Third judging unit 5 is used to judge that there is no between neighbor node and destination node in second judgment unit 3
When distance is less than the distance between current node and destination node, then judge whether there is the adjacent street node of present node with
The distance between destination node is less than the distance between current node and destination node.Specifically, third judging unit 5 is according to pre-
The vehicle position information of each node in the vehicular ad hoc network first stored calculates separately present node, each adjacent street node to mesh
Node distance, and by the distance of adjacent street node to destination node respectively at a distance from present node to destination node into
Row compares.
Second selection unit 6 is used to judge that there are between adjacent street node and destination node in third judging unit 5
Distance when being less than the distance between current node and destination node, then next-hop street is selected using dijkstra's algorithm.
Aforementioned corresponding contents can be found in for the description of dijkstra's algorithm, details are not described herein again.
Third selection unit 7 is used to select next-hop node from next-hop street based on greedy algorithm.Specifically,
The vehicle position information of each node in the vehicular ad hoc network according to the pre-stored data of three selection unit 7 calculates 6 institute of the second selection unit
Each adjacent street node on the next-hop street selected and is ranked up to the distance of destination node, then therefrom choose with
The smallest adjacent street node of the distance between destination node is as next-hop node.
It should be noted that the first judging unit 1 in the present embodiment is used to execute the step S1 in above-described embodiment one,
Transmission unit 2 is for executing the step S2 in above-described embodiment one, second judgment unit 3 for executing in above-described embodiment one
Step S3, the first selection unit 4 are used to execute the step S4 in above-described embodiment one, and third judging unit 5 is above-mentioned for executing
Step S5 in embodiment one, the second selection unit 6 are used to execute the step S6 in above-described embodiment one, third selection unit 7
For executing the step S7 in above-described embodiment one.To the relationship and specific implementation procedure between each unit in this present embodiment,
It can be found in above-described embodiment one to the corresponding description of step S1~step S7, details are not described herein again.
The embodiment of the present invention three provides a kind of routing module, which can effectively reduce in data transfer
Link down rate and improve data transfer efficiency.More importantly, data are being carried out based on routing module provided in this embodiment
When transmitting, data packet transmitting is completed only by VANET network, so as to reduce the occupancy to cellular network resource.
Example IV
Fig. 4 is a kind of structural block diagram for routing module that the embodiment of the present invention four provides, as shown in figure 4, the routing module
For executing the method for routing of the offer of above-described embodiment two, the routing module is in addition to including the first judgement in above-described embodiment three
Unit 1, transmission unit 2, second judgment unit 3, the first selection unit 4, third judging unit 5, the second selection unit 6 and third
Except selection unit 7, further includes: cache unit 8, the 4th judging unit 9 and the 5th judging unit 10.
Wherein, cache unit 8 be used for third judging unit 5 judge there is no adjacent street node and destination node it
Between distance when being less than the distance between current node and destination node, then by the data pack buffer of present node.And
When the total time that four unit judges go out the data cached packet of cache unit 8 is more than the first preset time, by the data packet discarding of caching.
Whether the 4th judging unit 9 is used to judge the total time of the data cached packet of cache unit 8 more than the first preset time.
Specifically, by the way that a timing unit is arranged in routing module, which starts timing when data packet is buffered, to slow
The data cached packet of memory cell 8 carries out timing, when judging that caching of the data packet in present node is total for the 4th judging unit 9
Between whether more than the first preset time.Wherein, which can be accordingly arranged according to actual needs.
5th judging unit 10 is used to judge time of the data cached packet of present node without the in the 4th judging unit 9
One when being more than preset time, then judges present node with the presence or absence of neighbor node.Wherein, when the 5th judging unit 10 is judged to work as
There are when neighbor node, then the first judging unit 1 re-executes in the neighbor node for judge present node whether there is front nodal point
The step of destination node；When the 5th judging unit 10 judges present node there is no neighbor node, then the 4th judging unit 9
The step of total time for judging the data cached packet of cache unit 8 is re-executed whether more than the first preset time.
It should be noted that the cache unit 8 in the present embodiment is used to execute step S8 and the step in above-described embodiment two
Rapid S11, the 4th judging unit 9 are used to execute the step S9 in above-described embodiment two, and the 5th judging unit 10 is above-mentioned for executing
Step S10 in embodiment.To the relationship and specific implementation procedure between each unit in this present embodiment, reference can be made to above-mentioned implementation
To the corresponding description of step S1~step S11 in example two, details are not described herein again.
The embodiment of the present invention four provides a kind of routing module, effective improve data transfer efficiency and can reduce to bee
The occupancy of nest Internet resources.In addition, compared with the routing module that above-described embodiment three provides, due to road provided in this embodiment
Data packet can be cached when present node can not find next-hop node by module, and can be in the first preset time
Next-hop node is constantly found according to the variation of vehicular ad hoc network interior joint, therefore in routing module pair provided in this embodiment
Answer the link down probability of method for routing lower.
Embodiment five
Fig. 5 is a kind of structural block diagram for car-mounted terminal that the embodiment of the present invention five provides, and Fig. 6 is car-mounted terminal and network side
Schematic diagram when equipment interaction, as shown in Figure 5 and Figure 6, which includes: routing module 14, and wherein the routing module is adopted
With the routing module 14 in above-described embodiment three or example IV, particular content be can be found in above-described embodiment three and example IV
Description, details are not described herein again.
To enable each vehicle in vehicular ad hoc network to get the nodal information of its own and other vehicles, the vehicle automatically
Mounted terminal further include: information reading module 13, wireless communication module 12 and information storage module 11.
Wherein, information reading module 13 is connected with mobile units such as GPS, OBU in corresponding vehicle, for periodically reading
The nodal information of pick-up itself, wherein the nodal information includes: locating for vehicle identification mark, vehicle position information and vehicle
Street mark.
Wireless communication module 12 is used to the nodal information of vehicle itself being uploaded to network side equipment.It should be noted that
Information of vehicles memory module 15 and multimedia broadcast multi-broadcasting business (Multimedia are provided in network side equipment
Broadcast Multicast Service, abbreviation MBMS) module 16.Wherein, information of vehicles memory module 15 is for storing institute
The nodal information that all vehicles report in coverage area, and periodically update, if the nodal information of certain vehicle is being more than to update
It not being updated in cycle time, then it is assumed that the vehicle has moved out the corresponding network coverage of the network side equipment, data failure,
The nodal information of the vehicle is deleted；MBMS module 16 can whole nodes letter in periodic broadcast information of vehicles memory module 15
Breath.At this point, wireless communication module can also receive the nodal information of other vehicles of network side equipment broadcast.
It should be noted that the transmission unit function in above-described embodiment three and example IV can pass through the wireless communication
12 pieces of mould is realized, for carrying out data communication between vehicle, at this time it is not necessary that transmission unit is arranged in routing module 14.
Information storage module 11 is used to store the nodal information and channel radio of the vehicle itself of the acquisition of information reading module 13
The nodal information for other vehicles that letter module 12 receives.Meanwhile the information storage module 11 can with storing data packet and
The nodal information of destination node is parsed in the packet header of data packet.
Routing module 14 according to the nodal information of vehicle each in the vehicular ad hoc network stored in information storage module 11 (including
The nodal information of vehicle and other vehicles) and destination node nodal information as data basis, and use above-mentioned implementation
The method for routing of example one or embodiment two formulates routing policy.
The embodiment of the present invention five provides a kind of car-mounted terminal, which can be automatically in locating vehicular ad hoc network
The nodal information of each vehicle, and corresponding routing policy is executed by routing module, to can effectively reduce data transfer
In link down rate and occupancy to cellular network resource, while can also improve data transfer efficiency.
Embodiment six
The embodiment of the present invention six provides a kind of vehicular ad hoc network route system, which includes:
Car-mounted terminal, wherein the car-mounted terminal can be found in above-described embodiment using the car-mounted terminal in above-described embodiment five, particular content
Description in five.
It should be noted that in practical vehicular ad hoc network route system, it can be by several car-mounted terminals and at least one
A network side equipment is constituted, and can be found in the corresponding contents in above-described embodiment five for the specific structure of the network side equipment, this
Place repeats no more.
The embodiment of the present invention six provides a kind of vehicular ad hoc network route system, the vehicular ad hoc network route system have compared with
Low link down rate and higher data transmission efficiency.
It is understood that the principle that embodiment of above is intended to be merely illustrative of the present and the exemplary implementation that uses
Mode, however the present invention is not limited thereto.For those skilled in the art, essence of the invention is not being departed from
In the case where mind and essence, various changes and modifications can be made therein, these variations and modifications are also considered as protection scope of the present invention.
Claims (11)
1. a kind of method for routing, for providing routing policy in vehicular ad hoc network characterized by comprising
Judge that, with the presence or absence of destination node in the neighbor node of present node, the neighbor node is the place with the present node
In identical street and be less than with the distance between the present node present node maximum communication distance node；
If judging in the neighbor node of the present node there are when the destination node, by the present node
Data packet is sent to the destination node；
If judging to judge whether there is the neighbour there is no when the destination node in the neighbor node of the present node
The distance between node and the destination node are occupied less than the distance between the present node and the destination node；
If judging, there are the distance between the neighbor nodes and destination node to be less than the present node and the purpose section
When the distance between point, then the smallest neighbor node of the distance between the destination node is chosen as next-hop section
Point, and using the next-hop node as present node, it re-executes and whether is deposited in the neighbor node for judging present node
The destination node the step of；
If judging, there is no the distance between the neighbor nodes and destination node to be less than the present node and the purpose
When the distance between node, then the distance between adjacent street node and destination node of the present node are judged whether there is
Less than the distance between the present node and the destination node, the adjacent street node be with locating for the present node
The street that intersects of street on and be less than with the distance between the present node maximum communication distance of the present node
Node；
If judging, there are the distance between the adjacent street node and destination nodes to be less than the present node and the mesh
The distance between node when, then next-hop street is chosen using dijkstra's algorithm；
Next-hop node is chosen from next-hop street based on greedy algorithm, and using the next-hop node as present node,
The step of re-executing in the neighbor node of the judgement present node with the presence or absence of destination node.
2. method for routing according to claim 1, which is characterized in that if judge there is no the adjacent street node with
When the distance between destination node is less than the distance between the present node and the destination node, then by the present node
Data pack buffer.
3. method for routing according to claim 2, which is characterized in that in the step of present node is by data pack buffer
Later, further includes:
Judge that whether the present node caches the total time of the data packet more than the first preset time；
If judge that the present node caches the time of the data packet more than the first preset time, described it will work as prosthomere
The data packet discarding of point cache；
If judge that the present node caches the time no first of the data packet more than preset time, described in judgement
Present node whether there is neighbor node；
If judging the present node, there are in the neighbor node for when neighbor node, re-executing the judgement present node
The step of with the presence or absence of destination node；
If judging, the present node there is no when neighbor node, re-executes the judgement after the second preset time
The present node caches the total time of the data packet the step of whether being more than first preset time.
4. a kind of routing module, for providing routing policy in vehicular ad hoc network characterized by comprising
First judging unit, for after present node receives data packet, judging whether deposit in the neighbor node of present node
In destination node, the neighbor node be with the present node in identical street and between the present node away from
Node from the maximum communication distance for being less than the present node；
Transmission unit, it is described for existing in the neighbor node that first judging unit judges the present node
When destination node, then the data packet of the present node is sent to the destination node；
Second judgment unit, for institute to be not present in the neighbor node that first judging unit judges the present node
When stating destination node, then the distance between the neighbor node and the destination node are judged whether there is less than described and works as prosthomere
The distance between point and the destination node；
First selection unit, for judging that there are between the neighbor node and destination node in the second judgment unit
When distance is less than the distance between the present node and the destination node, then the distance between described destination node is chosen
A smallest neighbor node is as next-hop node；
Third judging unit, for judging that there is no between the neighbor node and destination node in the second judgment unit
Distance be less than the distance between the present node and the destination node when, then judge whether there is the present node
The distance between adjacent street node and destination node are less than the distance between the present node and the destination node, described
Adjacent street node be on the street to intersect with street locating for the present node and between the present node away from
Node from the maximum communication distance for being less than the present node；
Second selection unit, for the third judging unit judge there are the adjacent street node and destination node it
Between distance be less than the distance between the present node and the destination node when, then use dijkstra's algorithm select down
One jumps street；
Third selection unit, for selecting next-hop node from next-hop street based on greedy algorithm；
The transmission unit is also used to select the next-hop section in first selection unit or the third selection unit
When point, the data packet of the present node is sent to the next-hop node.
5. routing module according to claim 4, which is characterized in that further include:
Cache unit, for judging that there is no between the adjacent street node and destination node in the third judging unit
Distance be less than the distance between the present node and the destination node when, then the data packet of the present node is delayed
It deposits.
6. routing module according to claim 5, which is characterized in that further include:
4th judging unit, for judge the cache unit cache the data packet total time it is whether default more than first when
Between；
5th judging unit, for judging that the present node caches the time of the data packet in the 4th judging unit
When being more than preset time without first, then judge the present node with the presence or absence of neighbor node；
First judging unit is also used to that there are neighbor nodes judging the present node in the 5th judging unit
When, then the step of execution in the neighbor node for judging the present node with the presence or absence of destination node；
The cache unit is also used to when the 4th judging unit judges that the present node caches the data packet
Between more than the first preset time when, then by the data packet discarding of caching.
7. a kind of car-mounted terminal characterized by comprising the routing module as described in any in claim 4-6.
8. car-mounted terminal according to claim 7, which is characterized in that further include:
Information reading module, for periodically reading the nodal information of vehicle itself, the nodal information includes: vehicle identification
The mark of street locating for mark, vehicle position information and vehicle；
Wireless communication module for the nodal information of vehicle itself to be uploaded to network side equipment, and receives the network
The nodal information of other vehicles of side apparatus broadcast；
The routing module is according to the nodal information of the vehicle itself, the nodal information of other vehicles and destination node
Nodal information formulates routing policy.
9. car-mounted terminal according to claim 8, which is characterized in that further include:
Information storage module, for store the vehicle itself that the information reading module obtains nodal information and the nothing
The nodal information for other vehicles that line communication module receives, and the mesh is parsed from the packet header of the data packet
Node nodal information.
10. a kind of vehicular ad hoc network route system characterized by comprising the vehicle as described in any in the claims 7-9
Mounted terminal.
11. vehicular ad hoc network route system according to claim 10, which is characterized in that further include: network side equipment, institute
Stating network side equipment includes:
Information of vehicles memory module, the nodal information that all vehicles report in coverage area for storing, and periodically update；
Multimedia broadcast multi-broadcasting business module, for whole nodal informations in periodic broadcast information of vehicles memory module.
Priority Applications (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN201510696275.8A CN105407517B (en) | 2015-10-23 | 2015-10-23 | Method for routing, routing module, car-mounted terminal and vehicular ad hoc network route system |
Applications Claiming Priority (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN201510696275.8A CN105407517B (en) | 2015-10-23 | 2015-10-23 | Method for routing, routing module, car-mounted terminal and vehicular ad hoc network route system |
Publications (2)
| Publication Number | Publication Date |
|---|---|
| CN105407517A CN105407517A (en) | 2016-03-16 |
| CN105407517B true CN105407517B (en) | 2019-06-07 |
Family
ID=55472705
Family Applications (1)
| Application Number | Title | Priority Date | Filing Date |
|---|---|---|---|
| CN201510696275.8A Active CN105407517B (en) | 2015-10-23 | 2015-10-23 | Method for routing, routing module, car-mounted terminal and vehicular ad hoc network route system |
Country Status (1)
| Country | Link |
|---|---|
| CN (1) | CN105407517B (en) |
Families Citing this family (7)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| US20190141602A1 (en) * | 2016-06-29 | 2019-05-09 | Guangdong Oppo Mobile Telecommunications Corp., Ltd. | Communication method, forwarding device, and terminal device |
| CN107657807B (en) * | 2017-09-19 | 2019-12-13 | 北京摩拜科技有限公司 | vehicle accumulation processing method, vehicle, server and vehicle system |
| CN108811022B (en) * | 2018-03-20 | 2021-05-25 | 天津理工大学 | Dynamic high-efficiency routing method for vehicle network application environment |
| CN109600815B (en) * | 2018-12-12 | 2021-03-16 | 东软集团（北京）有限公司 | Method, device, storage equipment and program product for realizing data forwarding |
| CN110661550B (en) * | 2019-09-27 | 2021-08-31 | 青岛联众芯云科技有限公司 | Method, device, storage medium and electronic equipment for forwarding message in HPLC communication link |
| CN111343689A (en) * | 2020-02-25 | 2020-06-26 | 中国航空无线电电子研究所 | Routing method suitable for high-dynamic aviation wireless ad hoc network |
| CN111447555B (en) * | 2020-03-30 | 2021-03-30 | 华南理工大学 | Congestion and location-aware vehicle-mounted internet dynamic routing method |
Citations (5)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN101369982A (en) * | 2008-10-13 | 2009-02-18 | 北京邮电大学 | Method for data packet greedy forwarding in vehicle-mounted Ad hoc network |
| CN102883402A (en) * | 2012-09-11 | 2013-01-16 | 河海大学 | Vehicular Ad hoc network data transmission method based on position and topological characteristic |
| CN103079249A (en) * | 2012-12-16 | 2013-05-01 | 北京泛联至诚科技有限公司 | Internet of Things multicast data transmission method based on traffic density |
| CN103298059A (en) * | 2013-05-13 | 2013-09-11 | 西安电子科技大学 | Connectivity sensing routing method on basis of location prediction in vehicle ad hoc network |
| CN103974373A (en) * | 2014-05-26 | 2014-08-06 | 北京邮电大学 | Vehicle-mounted network routing method and device |
Family Cites Families (1)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| US9674077B2 (en) * | 2013-10-03 | 2017-06-06 | National Chiao Tung University | Vehicular communication system and routing method thereof |
-
2015
- 2015-10-23 CN CN201510696275.8A patent/CN105407517B/en active Active
Patent Citations (5)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN101369982A (en) * | 2008-10-13 | 2009-02-18 | 北京邮电大学 | Method for data packet greedy forwarding in vehicle-mounted Ad hoc network |
| CN102883402A (en) * | 2012-09-11 | 2013-01-16 | 河海大学 | Vehicular Ad hoc network data transmission method based on position and topological characteristic |
| CN103079249A (en) * | 2012-12-16 | 2013-05-01 | 北京泛联至诚科技有限公司 | Internet of Things multicast data transmission method based on traffic density |
| CN103298059A (en) * | 2013-05-13 | 2013-09-11 | 西安电子科技大学 | Connectivity sensing routing method on basis of location prediction in vehicle ad hoc network |
| CN103974373A (en) * | 2014-05-26 | 2014-08-06 | 北京邮电大学 | Vehicle-mounted network routing method and device |
Also Published As
| Publication number | Publication date |
|---|---|
| CN105407517A (en) | 2016-03-16 |
Similar Documents
| Publication | Publication Date | Title |
|---|---|---|
| CN105407517B (en) | Method for routing, routing module, car-mounted terminal and vehicular ad hoc network route system | |
| CN105722176B (en) | There is the connectivity method of the large scale scale heterogeneous network of the car networking of infrastructure in City scenarios | |
| CN105307232B (en) | Routing optimization method based on connection probability for vehicle-mounted self-organizing network | |
| CN104135436B (en) | A kind of vehicle self-organizing network route selection method | |
| Chou et al. | Intersection-based routing protocol for VANETs | |
| CN105101086B (en) | A kind of data transfer path system of selection based on traffic density distribution | |
| CN102769888A (en) | Method for vehicle-mounted Ad Hoc network based on improved AODV (Ad Hoc Ondemand Distance Vector) protocol | |
| Pan et al. | Mobile-gateway routing for vehicular networks | |
| Alsharif et al. | iCARII: Intersection-based connectivity aware routing in vehicular networks | |
| CN109640369A (en) | A kind of vehicle-mounted net reliable communication method based on adaptive power | |
| CN103561446A (en) | Awareness routing method in vehicle-mounted self-organizing network based on road topology | |
| Aparecido | Data dissemination in vehicular networks: Challenges, solutions, and future perspectives | |
| CN105282813B (en) | Method for routing, apparatus and system under a kind of In-vehicle networking environment | |
| CN104835316B (en) | Traffic flow density-based solution to problem of VANET sparse connectivity | |
| Zhao et al. | A vehicle density and load aware routing protocol for VANETs in city scenarios | |
| Hadded et al. | Performance evaluation of a TDMA-based multi-hop communication scheme for reliable delivery of warning messages in vehicular networks | |
| Oubbati et al. | ETAR: Efficient traffic light aware routing protocol for vehicular networks | |
| CN105101262B (en) | Mobility Prediction Method in Mobile Ad based on TDMA agreements in a kind of highly dynamic radio In-vehicle networking | |
| CN107343301B (en) | Efficient and reliable routing method of vehicle-mounted ad hoc network based on message aggregation | |
| Nakamura et al. | A method for improving data delivery efficiency in delay tolerant vanet with scheduled routes of cars | |
| Nasir et al. | Adapting geographical DTN routing for enhanced connectivity in partitioned VANETs on highways | |
| CN108391249A (en) | A kind of traffic perception route method applied to car networking | |
| Llatser et al. | Greedy algorithms for information dissemination within groups of autonomous vehicles | |
| CN106304237A (en) | Terminal vehicle communication method based on wireless protocols | |
| CN103260208B (en) | The implementation method of the hybrid routing protocol of position-based information under vehicle-mounted Ad hoc network |
Legal Events
| Date | Code | Title | Description |
|---|---|---|---|
| C06 | Publication | ||
| PB01 | Publication | ||
| C10 | Entry into substantive examination | ||
| SE01 | Entry into force of request for substantive examination | ||
| GR01 | Patent grant | ||
| GR01 | Patent grant |