CN104869606B - A kind of message forwarding method and device - Google Patents
A kind of message forwarding method and device Download PDFInfo
- Publication number
- CN104869606B CN104869606B CN201510195273.0A CN201510195273A CN104869606B CN 104869606 B CN104869606 B CN 104869606B CN 201510195273 A CN201510195273 A CN 201510195273A CN 104869606 B CN104869606 B CN 104869606B
- Authority
- CN
- China
- Prior art keywords
- node
- message
- neighbor node
- neighbor
- hop
- 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
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/12—Communication route or path selection, e.g. power-based or shortest path routing based on transmission quality or channel quality
-
- 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
-
- 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
Landscapes
- Engineering & Computer Science (AREA)
- Computer Networks & Wireless Communication (AREA)
- Signal Processing (AREA)
- Mobile Radio Communication Systems (AREA)
Abstract
The embodiment of the invention discloses a kind of message forwarding methods, which comprises obtains the neighbor node of message and the present node that present node needs to forward；Neighbor node identical with the service channel of the present node is selected to form sub- neighbor node collection from the neighbor node；Select a neighbor node as next-hop node from the sub- neighbor node concentration；The message is forwarded to the next-hop node from present node.The embodiment of the invention also discloses a kind of apparatus for forwarding message.The present invention improves message forward efficiency, reduces route time, and saved system resource.
Description
Technical field
The present invention relates to the communications field more particularly to a kind of message forwarding methods and device.
Background technique
With the frequent hair of the rising of global auto recoverable amount, the aggravation of road congestion conditions and traffic accidents
Raw, vehicular ad hoc network (Vehicular Ad-Hoc Networks, VANET, hereinafter referred to as vehicular ad hoc network) is as intelligence
The important foundation of traffic system (Intelligent Traffic System, abbreviation ITS) causes academia and industry
Great interest, perceives presence and the related status information of surrounding vehicles in vehicular ad hoc network by modes such as inter-vehicle communications, and according to
This prevention is potential dangerous, and therefore, the timeliness of communication is the most important thing, and the safety of direct and vehicle and personnel are closely bound up.
Including in workshop network within the vehicular ad hoc network form each node in the workshop network be
Vehicle, due to vehicle have high-speed mobile characteristic, workshop network be a node fast move, network topology change frequency
Numerous network.Routing refers to the process of that message is forwarded to another node from a node.Message is transferred to mesh from start node
Mark node may undergo multiple routing, in order to guarantee the safety of vehicle and personnel, need to guarantee the success rate and as far as possible of routing
Shorten the time of routing.
In the Routing Protocol of current vehicular ad hoc network, studying more is Routing Protocol based on topology and based on position
The Routing Protocol of confidence breath.
Most representational in the Routing Protocol based on topology is on-demand driving distance vector routing protocol (Ad
Hoc on-demand Distance Vector Protocol, abbreviation AODV), the agreement regulation, node send data it
Before, a paths are established between the destination node for receiving data for the node, so that data reach target section by the path
The information of point, the path is stored in routing table.Due to that may include several nodes on path, in In-vehicle networking environment
Under, as long as there is a node location to change, it is possible to cause the path planned to be broken, to will lead to data
Transmission failure.If constantly planning new route again for node, need frequently to update the road comprising the routing information
By table information, a large amount of resource is not only expended, but also there are higher routing failure rates.
Most representational in the Routing Protocol based on location information is greedy periphery stateless route agreement
(Greedy Perimeter Stateless Routing, abbreviation GPSR), the routing in the agreement is a kind of stateless route,
It does not need to update routing table information, is more suitable the fast vehicular ad hoc network environment of network topology change than the AODV agreement.It should
Agreement regulation, each node in workshop network are periodically notified to the location information of oneself, and each node is by the position of neighbor node
Information preservation is selected from the neighbor node of present node with minimum hop count principle according to greedy algorithm in neighboring node list
Next-hop node, the next-hop node are more closer than present node distance objective node, and message is then passed to next-hop section
Point, next-hop node selects Next-Next-Hop node to transmit message from its neighbor node, until passing to destination node.Due to report
Text is that next-hop node is transmitted to from a node, and next-hop node is chosen from the neighbor node of present node, therefore
It does not need constantly to be node planning path again, does not need to update routing table information yet, reduce the time of routing, improve
The efficiency of message forwarding.
However, node needs alternately in CCH (control letter under the multichannel In-vehicle networking environment based on WAVE agreement
Road) and SCH (service channel) on switch over, even current time node is switched on SCH from CCH, then subsequent time, each to save
Point switches on CCH from SCH, then subsequent time node switches on SCH from CCH again, and so on.In WAVE agreement, CCH
Only one, and SCH has multiple, the SCH is for sending between node, receiving or transmitting service class message, and control channel
For transmitting control class message to node.Therefore when node switches to SCH from CCH, different nodes may be switched to not
On same SCH.Since the forwarding of service class message can only be by SCH, and the node for being only in identical SCH could forward report
Text.If selecting next-hop node according to greedy algorithm and minimum hop count principle, it is more likely that the next-hop node of selection be with
Present node is in the node of different SCH, therefore can delay longer time in routing procedure, reduces service class message and turns
The efficiency of hair.
Summary of the invention
The technical issues of in order to solve low message forward efficiency in the prior art, waste system resource, the present invention provides
A kind of message forwarding method and device, improve message forward efficiency, reduce route time, and saved system money
Source.
The embodiment of the invention provides a kind of message forwarding methods, which comprises
Obtain the neighbor node of message and the present node that present node needs to forward；
Neighbor node identical with the service channel of the present node is selected to form sub- neighbours from the neighbor node
Node collection；
Select a neighbor node as next-hop node from the sub- neighbor node concentration；
The message is forwarded to the next-hop node from present node.
Preferably, described to select a neighbor node as next-hop node from the sub- neighbor node concentration and include:
The maximum neighbor node of link degree of communication between selection and the present node is concentrated from the sub- neighbor node
As next-hop node, maximum duration correlation that the link degree of communication can be communicated with two nodes.
Preferably, the method also includes:
When the sub- neighbor node integrates as empty set, and when the present node and the neighbor node are by respectively locating service
When channel switches to control channel, neighbours' section is selected according to the idle factor of the neighbor node and/or link degree of communication
Point is used as next-hop node, wherein the idle factor and free time of the neighbor node in a upper preset period of time
Time is positively correlated, and the maximum duration that can be communicated between the link degree of communication and two nodes is positively correlated；
After the next-hop node and present node switch to the same service channel from the control channel, execute
Described the step of message is forwarded to the next-hop node from present node.
Preferably, the calculation formula of the idle factor are as follows:
Wherein, the UidleFor the idle factor of the neighbor node；The TidleFor institute in a upper preset period of time
State the time of neighbor node free time；The TmaxFor the present node all neighbor nodes in a upper preset period of time
The maximum value of internal idle time；The TminFor the present node all neighbor nodes in a upper preset period of time
The minimum value of free time.
Preferably, the preset period of time is to update the time cycle of the neighbor node of the present node.
Preferably, the calculation formula of the link degree of communication are as follows:
Wherein, the LstabFor the link degree of communication of the present node and the neighbor node；The t is described current
The communication critical value of node and the neighbor node, i.e., when the longest that the described present node can be communicated with the neighbor node
Between；The tmaxMaximum communication critical value between the present node and all neighbor nodes；The tminIt is described current
Minimal communications critical value between node and the neighbor node.
Preferably, the idle factor and link degree of communication according to the neighbor node select a neighbor node as
Next-hop node specifically includes:
According to the idle factor of the neighbor node and link degree of communication select the highest neighbor node of node quality as
Next-hop node, the calculation formula of the node quality are as follows:
Q=α Uidle+βLstab
Wherein, the Q is the node quality of the neighbor node, and the α and β are coefficient, alpha+beta=1 and α, β >=0.
Preferably, upper hop node corresponding with the message is not included in the neighbor node of the present node.
Preferably, after obtaining the message that present node needs to forward, the method also includes:
When there is destination node corresponding with the message in the neighbor node, the message is transmitted to the mesh
Mark node.
Preferably, message expired time is carried in the message；In the message that the acquisition present node needs to forward
After step, the method also includes:
If current time is more than the message expired time, by the packet loss.
The embodiment of the invention also provides a kind of apparatus for forwarding message, described device includes: Receive message unit, Lin Jujie
Point acquiring unit, sub- neighbor node collection determination unit, next-hop node selecting unit and the first retransmission unit, the Receive message
Unit is connected with the neighbor node acquiring unit, the neighbor node acquiring unit and the sub- neighbor node collection determination unit
Connection, the sub- neighbor node collection determination unit are connected with the next-hop node selecting unit, the next-hop node selection
Unit is connected with first retransmission unit；
Wherein, the Receive message unit, the message for needing to forward for obtaining present node；
The neighbor node acquiring unit, for obtaining the neighbor node of the present node；
The sub- neighbor node collection determination unit, for selecting the service with the present node from the neighbor node
The identical neighbor node of channel forms sub- neighbor node collection；
The next-hop node selecting unit, for selecting a neighbor node as under from the sub- neighbor node concentration
One hop node；
First retransmission unit, for the message to be forwarded to the next-hop node from present node.
Preferably, the next-hop node selecting unit selects neighbours' section for concentrating from the sub- neighbor node
It puts as next-hop node and includes:
The next-hop node selecting unit, for being concentrated between selection and the present node from the sub- neighbor node
The maximum neighbor node of link degree of communication as next-hop node, the link degree of communication can communicate most with two nodes
Long-time correlation.
Preferably, the next-hop node selecting unit, is also used to:
When the sub- neighbor node integrates as empty set, and when the present node and the neighbor node are by respectively locating service
When channel switches to control channel, neighbours' section is selected according to the idle factor of the neighbor node and/or link degree of communication
Point is used as next-hop node, wherein the idle factor and free time of the neighbor node in a upper preset period of time
Time is positively correlated, and the maximum duration that can be communicated between the link degree of communication and two nodes is positively correlated；
After the next-hop node and present node switch to the same service channel from the control channel, activation
First retransmission unit.
Preferably, described device further include: the second retransmission unit is connect, for working as with the neighbor node acquiring unit
When there is destination node corresponding with the message in the neighbor node, the message is transmitted to the destination node.
Preferably, message expired time is carried in the message；
Described device further includes packet loss unit, is connect with the Receive message unit, for being more than when current time
When the message expired time, by the packet loss.
Compared with the existing technology, the present invention has the advantages that
The needs of method for routing as defined in AODV agreement cook up one from start node to destination node in advance in the prior art
Paths need frequently to update routing table to guarantee the real-time in path.And message forwarding method provided in this embodiment
Advance planning path is not needed, it is only necessary to pass to message and the present node service when present node receives message
The identical neighbor node of channel, therefore do not need to update routing table, system resource is not only saved, but also improve message
Forward efficiency.
Method for routing as defined in GPSR agreement is to select in greedy algorithm in conjunction with minimum item number principle in the prior art
Next-hop node, therefore the service channel that not can guarantee next-hop node is identical as present channel, if it is different, then needing to waste
Node switches to control channel from service channel and switches to the time of service channel switched twice from control channel.And this
The next-hop node for the message forwarding method selection that embodiment provides is neighbor node identical with present node service channel, because
This message directly can be forwarded to next-hop node from present node, be effectively reduced route time, improve message forwarding
Efficiency.
Detailed description of the invention
In order to illustrate the technical solutions in the embodiments of the present application or in the prior art more clearly, to embodiment or will show below
There is attached drawing needed in technical description to be briefly described, it should be apparent that, the accompanying drawings in the following description is only this
The some embodiments recorded in application, for those of ordinary skill in the art, without creative efforts,
It can also be obtained according to these attached drawings other attached drawings.
Fig. 1 is a kind of flow chart of message forwarding method embodiment one provided by the invention；
Fig. 2 is a kind of flow chart of message forwarding method embodiment two provided by the invention；
Fig. 3 is the signal of present node and neighbor node in a kind of message forwarding method embodiment two provided by the invention
Figure；
Fig. 4 is a kind of structural block diagram of apparatus for forwarding message embodiment one provided by the invention；
Fig. 5 is a kind of structural block diagram of apparatus for forwarding message embodiment two provided by the invention.
Specific embodiment
In order to enable those skilled in the art to better understand the solution of the present invention, below in conjunction in the embodiment of the present invention
Attached drawing, technical scheme in the embodiment of the invention is clearly and completely described, it is clear that described embodiment is only this
Invention a part of the embodiment, instead of all the embodiments.Based on the embodiments of the present invention, those of ordinary skill in the art exist
Every other embodiment obtained under the premise of creative work is not made, shall fall within the protection scope of the present invention.
Embodiment of the method one:
Referring to Fig. 1, which is a kind of flow chart of message forwarding method embodiment one provided by the invention.
Message forwarding method provided in this embodiment includes the following steps:
Step S101: the neighbor node of message and the present node that present node needs to forward is obtained.
In vehicular ad hoc network, each vehicle with communication equipment is each node.Centered on present node, position
Node within the communication radius of the present node communication equipment is known as the neighbor node of present node.
Under normal conditions, each node periodically can send a notification message (such as HELLO message) to neighbor node,
Correspondingly, can also receive the notification message of its neighbor node transmission, include in the notification message neighbor node ID,
The information such as location information, speed, direction of motion azimuth, working channel, referring to table 1, which is the message lattice of HELLO message
Formula.These information preservations update neighbor node table by periodically receiving the notification message into neighbor node table.When
One list item of neighbor node table is more than not to be updated the predetermined time, then it represents that the failure when list item has been subjected to, it is corresponding adjacent
It occupies node not jump in range one, it should delete the neighbor node.
Table 1
It should be noted that it is message that the communication information, which is not, the communication information is only intended to establish or update neighbour
Node table is occupied, the range sent or received is only limitted to communication radius；And message is for transmitting various message, such as traffic accident
Information, road congestion condition information, weather casting information etc., it usually needs be transmitted to target section from the start node for generating message
Point, wherein the forwarding of some nodes may be passed through.In the present embodiment, the message that present node needs to forward is obtained, illustrates institute
It states present node or is the start node of message or is exactly one of forward node.
Step S102: neighbor node group identical with the service channel of the present node is selected from the neighbor node
At sub- neighbor node collection.
Step S103: select a neighbor node as next-hop node from the sub- neighbor node concentration.
Since all neighbor nodes for preserving present node in the neighbor node table are locating in current time period
Service channel it is adjacent that all neighbor nodes identical with the working channel of the present node are therefore picked out into composition
Node collection is occupied, then selects a neighbor node as next-hop node from the sub- neighbor node concentration.
Step S104: message is forwarded to the next-hop node from present node.
The needs of method for routing as defined in AODV agreement cook up one from start node to destination node in advance in the prior art
Paths need frequently to update routing table to guarantee the real-time in path.And message forwarding method provided in this embodiment
Advance planning path is not needed, it is only necessary to pass to message and the present node service when present node receives message
The identical neighbor node of channel, therefore do not need to update routing table, system resource is not only saved, but also improve message
Forward efficiency.
Method for routing as defined in GPSR agreement is to select in greedy algorithm in conjunction with minimum item number principle in the prior art
Next-hop node, therefore the service channel that not can guarantee next-hop node is identical as present channel, if it is different, then needing to waste
Node switches to control channel from service channel and switches to the time of service channel switched twice from control channel.And this
The next-hop node for the message forwarding method selection that embodiment provides is neighbor node identical with present node service channel, because
This message directly can be forwarded to next-hop node from present node, be effectively reduced route time, improve message forwarding
Efficiency.
For example, according in the prior art two minimum hop count principle, the next-hop node of node A is node B, if section
The service channel of point B and node A is different, then needs that nodes A and node B is waited all to switch to control letter from respective service channel
Road, and node A and node the B service channel for preparing switching next time being coordinated by control channel, then node A and section
Point B can just switch to the transmitting that the same service channel carries out message.If switched according to channel in WAVE consensus standard
Period is 50ms to calculate, that above process just needs to waste the time of 100ms.And if using message provided in this embodiment
Retransmission method is chosen with the neighbor node C of the node A service channel as next-hop node, thus message can directly from
Node A is forwarded to node C, has saved the time of 100ms.
Embodiment of the method two
Referring to fig. 2, which is a kind of flow chart of message forwarding method embodiment two provided by the invention.
Message forwarding method provided in this embodiment includes the following steps:
Step S201: the message that present node needs to forward is obtained, carries message expired time in the message.
Step S202: judge whether current time is more than the message expired time, if not, thening follow the steps S203.
In the present embodiment, if current time is more than the message expired time, illustrate the message failure, at this time
It can not go to handle the message, can also directly abandon；If current time is not above the message expired time, say
The bright message is effectively, should to forward it to next-hop node.
Step S203: the neighbor node of the present node is obtained.
The next-hop node that following step is elected in order to prevent is really the upper hop node for being forwarded to present node, is led
Message forwarding is caused to enter endless loop, it is preferred that the upper hop node of the message should be excluded in the neighbor node.Specifically
, the information of upper hop node can be carried in messages, so as to present node when receiving the message automatically by upper one
Hop node is excluded from the neighbor node.
For example, the neighbor node of nodes X includes node A, B, C and D, and message m is forwarded to nodes X by interior joint A,
Therefore the information that upper hop node is node A is carried in message m.When nodes X forwards the message m, message in order to prevent
It is sent to node A and enters endless loop, the node A in the neighbor node can be excluded, i.e., from neighbor node B, C and D
Middle selection next-hop node.
Step S204: judging with the presence or absence of destination node corresponding with the message in the neighbor node, if it is,
Execute step S205；If not, thening follow the steps S206.
Under normal conditions, the information of destination node is carried in the message.When the message needs present node to carry out
When forwarding, it can preferentially judge to whether there is destination node corresponding with the message in the neighbor node of the present node,
If it is present directly forwarding the message to the destination node；If it does not, next-hop node is relayed to, by next
Hop node continues to forward.
Step S205: the message is transmitted to the destination node, process terminates.
Step S206: neighbor node group identical with the service channel of the present node is selected from the neighbor node
At sub- neighbor node collection.
Step S207: judge that the sub- neighbor node integrates whether as empty set, if not, thening follow the steps S208；If so,
Then follow the steps S209.
In the present embodiment, judge that whether the sub- neighbor node integrates as empty set, if not empty set, illustrate exist and institute
The identical neighbor node of service channel of present node is stated, then next-hop node can be selected from these neighbor nodes；Such as
Fruit is empty set, illustrates that there is no neighbor nodes identical with the service channel of the present node, then can only be from these and institute
It states in the different neighbor node of present node service channel and selects next-hop node.
Step S208: concentrate the link degree of communication between selection and the present node maximum from the sub- neighbor node
Then neighbor node executes step S210 as next-hop node.
In the present embodiment, the maximum duration correlation that the link degree of communication can be communicated with two nodes.
The present embodiment provides a kind of calculation methods of link degree of communication, it should be noted that, this method is not constituted to of the invention
It limits, those skilled in the art can be according to its basic principle designed, designed.
Referring to Fig. 3, which is the schematic diagram of present node and neighbor node.In the figure, S1And S2Respectively represent t1Moment
And t2The position of moment present node S, N1And N2Respectively represent t1Moment and t2The position of moment neighbor node N, θ indicate neighbours' section
Point deviates the angle of present node, and distance d indicates the maximum communication distance of present node, VNAnd VSRespectively indicate neighbor node and
Present node is in t1To t2The average speed of period.It, cannot between present node S and neighbor node N after time t
Communication, therefore, time t are referred to as node communication critical value, the time t and link degree of communication correlation, and the time, t was bigger
Illustrate that the link alive time is longer, more stable, link degree of communication is higher；Conversely, time t is smaller to illustrate that the link alive time gets over
Short, more unstable, link degree of communication is lower.
When calculating time t, it can estimate that formula is as follows using the cosine law:
d2=(VSt)2+(VNt)2-2VNtVStcosθ (1)
Calculate time t are as follows:
The present node can be calculated separately by formula (2) and the sub- neighbor node concentrate all neighbor nodes it
Between t value, then take its minimum value and maximum value, pass through formula (3) calculate link degree of communication:
Wherein, the LstabFor the link degree of communication of the present node and the neighbor node；The t is described current
The communication critical value of node and the neighbor node, i.e., when the longest that the described present node can be communicated with the neighbor node
Between；The tmaxMaximum communication critical value between the present node and all neighbor nodes；The tminIt is described current
Minimal communications critical value between node and the neighbor node.
In order to guarantee the success rate of message forwarding as far as possible, the present node and the sub- neighbor node are being calculated
After the link degree of communication for concentrating all neighbor nodes, link degree of communication L is selectedstabBiggish neighbor node is as next-hop section
Point, it is preferred that the corresponding neighbor node of selection maximum link degree of communication.
Step S209: when the present node and the neighbor node switch to control channel by respective locating service channel
When, select a neighbor node as next-hop node according to the idle factor of the neighbor node and/or link degree of communication, and
Step S210 is executed after the next-hop node and present node switch to the same service channel from the control channel.
In the present embodiment, if the sub- neighbor node integrates as empty set, illustrate that there is no exist with the present node
Neighbor node on the same service channel can only be cut in the present node and the neighbor node from respective service channel
After shifting to the control channel, make the present node and following next-hop node in the mode that control channel is held consultation
It is switched it to when switching to service channel from the control channel to the same service channel.
So, the next-hop node how is selected in this case? the present invention is not specifically limited, can select at random
It selects, can also be selected according to certain strategy.The present embodiment provides a kind of selection strategies of next-hop node, i.e., according to institute
The idle factor and/or link degree of communication for stating neighbor node are selected.
The idle factor is positively correlated with free time of the neighbor node in a upper preset period of time.Institute
Stating free time refers to time of the neighbor node without routing.In preset period of time, the sky of the neighbor node
Longer expression neighbor node is more idle between idle, and the speed to E-Packet is faster；Free time shorter expression neighbor node
Busier, the speed to E-Packet is slower.The present embodiment provides a kind of calculation methods of idle factor, it should be noted that,
This method does not constitute a limitation of the invention simultaneously, and those skilled in the art can be according to its basic principle designed, designed.
The calculation formula of the idle factor are as follows:
Wherein, the UidleFor the idle factor of the neighbor node；The TidleFor institute in a upper preset period of time
State the time of neighbor node free time；The TmaxFor the present node all neighbor nodes in a upper preset period of time
The maximum value of internal idle time；The TminFor the present node all neighbor nodes in a upper preset period of time
The minimum value of free time.
For ease of calculation, the preset period of time can be set as the renewal time of the neighbor node, and can
The free time of each node to be added in the neighbor node table, the neighbor node table is updated every time, can not only be obtained
Newest neighbor node, but also the free time of each neighbor node in a nearest time cycle can be obtained.
The link degree of communication of the neighbor node can be calculated according to above-mentioned formula (1) to (3), no longer superfluous herein
It states.
Since the idle factor represents the busy extent of the neighbor node, the link degree of communication represents described
The stability that neighbor node is communicated with the present node, the two emphasis is variant, and what the former stressed is the forwarding effect of message
Rate, what the latter stressed is the forwarding success rate of message, can be according to actual demand according to the sky when selecting next-hop node
The not busy factor and/or the link degree of communication are selected.If the next-hop node is according to the idle factor and the chain
The selection of road degree of communication, the present embodiment provides a kind of selection methods, i.e., are connected according to the idle factor of the neighbor node and link
Logical degree selects the highest neighbor node of node quality as next-hop node, the calculation formula of the node quality are as follows:
Q=α Uidle+βLstab (5)
Wherein, the Q is the node quality of the neighbor node, and the α and β are coefficient, alpha+beta=1 and α, β >=0.
In practical applications, when vehicle is in city, since speed is lower, present node and each neighbor node
Link degree of communication is generally all higher, and idle factor is lower, therefore can properly increase the value of the α, selects those phases emphatically
The neighbor node more to free time.And when vehicle is on expressway, since speed is higher, present node and each neighbour
The link degree of communication for occupying node is generally lower, and idle factor is higher, therefore can properly increase the value of the β, chooses emphatically
Select those higher neighbor nodes of link degree of communication.
It should be noted that the above-mentioned method according to the idle factor and link degree of communication selection next-hop node
And do not constitute a limitation of the invention, those skilled in the art can designed, designed according to actual needs.
Step S210: message is forwarded to the next-hop node from present node.
Relative to embodiment of the method one, the present embodiment when the sub- neighbor node integrates not as empty set, work as with described by selection
The maximum neighbor node of link degree of communication between front nodal point ensure that message transmitting as next-hop node to greatest extent
The reliability of success rate and routing.
When the sub- neighbor node integrates as empty set, according to the idle factor of the neighbor node and/or link degree of communication
It selects a neighbor node as next-hop node, improves the forward efficiency and/or success rate of message.
Based on a kind of message forwarding method that above embodiments provide, the embodiment of the invention also provides a kind of forwardings of message
Its working principle is described in detail with reference to the accompanying drawing in device.
Installation practice one
Referring to fig. 4, which is a kind of structural block diagram of apparatus for forwarding message embodiment one provided by the invention.
Apparatus for forwarding message provided in this embodiment includes: Receive message unit 301, neighbor node acquiring unit 302, son
Neighbor node collection determination unit 303, next-hop node selecting unit 304 and the first retransmission unit 305.
The Receive message unit 301 and the neighbor node acquiring unit 302 connection, the neighbor node acquiring unit
302 and the sub- neighbor node collection determination unit 303 connect, the sub- neighbor node collection determination unit 303 and the next-hop
Node selecting unit 304 connects, the next-hop node selecting unit 304 and first retransmission unit 305 connection；
Wherein, the Receive message unit 301, the message for needing to forward for obtaining present node；
The neighbor node acquiring unit 302, for obtaining the neighbor node of the present node；
The sub- neighbor node collection determination unit 303, for being selected from the neighbor node and the present node
The identical neighbor node of service channel forms sub- neighbor node collection；
The next-hop node selecting unit 304 selects a neighbor node to make for concentrating from the sub- neighbor node
For next-hop node；
First retransmission unit 305, for the message to be forwarded to the next-hop node from present node.
The needs of method for routing as defined in AODV agreement cook up one from start node to destination node in advance in the prior art
Paths need frequently to update routing table to guarantee the real-time in path.And message forwarding method provided in this embodiment
Advance planning path is not needed, it is only necessary to pass to message and the present node service when present node receives message
The identical neighbor node of channel, therefore do not need to update routing table, system resource is not only saved, but also improve message
Forward efficiency.
Method for routing as defined in GPSR agreement is to select in greedy algorithm in conjunction with minimum item number principle in the prior art
Next-hop node, therefore the service channel that not can guarantee next-hop node is identical as present channel, if it is different, then needing to waste
Node switches to control channel from service channel and switches to the time of service channel switched twice from control channel.And this
The next-hop node for the message forwarding method selection that embodiment provides is neighbor node identical with present node service channel, because
This message directly can be forwarded to next-hop node from present node, be effectively reduced route time, improve message forwarding
Efficiency.
Installation practice two
Referring to Fig. 5, which is a kind of structural block diagram of apparatus for forwarding message embodiment two provided by the invention.
Based on described device embodiment one, in apparatus for forwarding message provided in this embodiment, the next-hop node selection
Unit 304 includes: for selecting a neighbor node as next-hop node from the sub- neighbor node concentration
The next-hop node selecting unit 304, for concentrating selection and the present node from the sub- neighbor node
Between the maximum neighbor node of link degree of communication as next-hop node, the link degree of communication can be communicated with two nodes
Maximum duration correlation.
Preferably, the next-hop node selecting unit 304, is also used to:
When the sub- neighbor node integrates as empty set, and when the present node and the neighbor node are by respectively locating service
When channel switches to control channel, neighbours' section is selected according to the idle factor of the neighbor node and/or link degree of communication
Point is used as next-hop node, wherein the idle factor and free time of the neighbor node in a upper preset period of time
Time is positively correlated, and the maximum duration that can be communicated between the link degree of communication and two nodes is positively correlated；
After the next-hop node and present node switch to the same service channel from the control channel, activation
First retransmission unit.
Preferably, described device further include: the second retransmission unit 306 is connect with the neighbor node acquiring unit 302,
For when there is destination node corresponding with the message in the neighbor node, the message to be transmitted to the target section
Point.
Preferably, message expired time is carried in the message；Described device further includes packet loss unit 307, with
The Receive message unit 301 connects, and is used for when current time is more than the message expired time, by the packet loss.
Relative to Installation practice one, the present embodiment when the sub- neighbor node integrates not as empty set, work as with described by selection
The maximum neighbor node of link degree of communication between front nodal point ensure that message transmitting as next-hop node to greatest extent
The reliability of success rate and routing.
When the sub- neighbor node integrates as empty set, according to the idle factor of the neighbor node and/or link degree of communication
It selects a neighbor node as next-hop node, improves the forward efficiency and/or success rate of message.
It should be noted that those of ordinary skill in the art will appreciate that realizing the whole in above method embodiment or portion
Split flow is relevant hardware can be instructed to complete by computer program, and the program can be stored in a computer
In read/write memory medium, the program is when being executed, it may include such as the process of above-mentioned each method embodiment.Wherein, the storage
Medium can be magnetic disk, CD, read-only memory (Read-Only Memory, ROM) or random access memory (Random
Access Memory, RAM) etc..
All the embodiments in this specification are described in a progressive manner, same and similar portion between each embodiment
Dividing may refer to each other, and each embodiment focuses on the differences from other embodiments.Especially for device reality
For applying example, since it is substantially similar to the method embodiment, so describing fairly simple, related place is referring to embodiment of the method
Part explanation.The apparatus embodiments described above are merely exemplary, wherein described be used as separate part description
Unit and module may or may not be physically separated.Furthermore it is also possible to select it according to the actual needs
In some or all of unit and module achieve the purpose of the solution of this embodiment.Those of ordinary skill in the art are not paying
In the case where creative work, it can understand and implement.
The above is only a specific embodiment of the invention, it is noted that for the ordinary skill people of the art
For member, various improvements and modifications may be made without departing from the principle of the present invention, these improvements and modifications are also answered
It is considered as protection scope of the present invention.
Claims (12)
1. a kind of message forwarding method, which is characterized in that the described method includes:
Obtain the neighbor node of message and the present node that present node needs to forward；
Neighbor node identical with the service channel of the present node is selected to form sub- neighbor node from the neighbor node
Collection；
Select a neighbor node as next-hop node from the sub- neighbor node concentration；
The message is forwarded to the next-hop node from present node；
The method also includes:
When the sub- neighbor node integrates as empty set, and the service channel locating for respective when the present node and the neighbor node
When switching to control channel, select a neighbor node as under according to the idle factor of the neighbor node and link degree of communication
One hop node, alternatively, selecting a neighbor node as next-hop node according to the idle factor of the neighbor node, wherein
The idle factor is positively correlated with free time of the neighbor node in a upper preset period of time, and the link connects
Logical degree is positively correlated with the maximum duration that can be communicated between two nodes；The idle factor represents the numerous of the neighbor node
Busy degree；
After the next-hop node and present node switch to the same service channel from the control channel, described in execution
The step of message is forwarded to the next-hop node from present node；
The calculation formula of the idle factor are as follows:
Wherein, the UidleFor the idle factor of the neighbor node；The TidleFor the neighbour in a upper preset period of time
Occupy the time of node free time；The TmaxIt is empty in a upper preset period of time for all neighbor nodes of the present node
Maximum value between idle；The TminIt is idle in a upper preset period of time for all neighbor nodes of the present node
The minimum value of time.
2. message forwarding method according to claim 1, which is characterized in that described to concentrate selection from the sub- neighbor node
One neighbor node includes: as next-hop node
Concentrated from the sub- neighbor node select the maximum neighbor node of link degree of communication between the present node as
Next-hop node, the maximum duration correlation that the link degree of communication can be communicated with two nodes.
3. message forwarding method according to claim 1, which is characterized in that the preset period of time is to work as described in update
The time cycle of the neighbor node of front nodal point.
4. message forwarding method according to claim 1 to 3, which is characterized in that the meter of the link degree of communication
Calculate formula are as follows:
Wherein, the LstabFor the link degree of communication of the present node and the neighbor node；The t is the present node
The maximum duration that can be communicated with the communication critical value of the neighbor node, i.e., the described present node with the neighbor node；Institute
State tmaxMaximum communication critical value between the present node and all neighbor nodes；The tminFor the present node with
Minimal communications critical value between the neighbor node.
5. message forwarding method according to claim 4, which is characterized in that it is described according to the neighbor node it is idle because
Son and link degree of communication select a neighbor node to specifically include as next-hop node:
Select the highest neighbor node of node quality as next according to the idle factor of the neighbor node and link degree of communication
Hop node, the calculation formula of the node quality are as follows:
Q=α Uidle+βLstab
Wherein, the Q is the node quality of the neighbor node, and the α and β are coefficient, alpha+beta=1 and α, β >=0.
6. message forwarding method according to claim 1, which is characterized in that do not wrapped in the neighbor node of the present node
Containing upper hop node corresponding with the message.
7. message forwarding method according to claim 1, which is characterized in that when the message that acquisition present node needs to forward
Afterwards, the method also includes:
When there is destination node corresponding with the message in the neighbor node, the message is transmitted to the target section
Point.
8. message forwarding method according to claim 1, which is characterized in that carried in the message message it is expired when
Between；After the message step that the acquisition present node needs to forward, the method also includes:
If current time is more than the message expired time, by the packet loss.
9. a kind of apparatus for forwarding message, which is characterized in that described device include: Receive message unit, neighbor node acquiring unit,
Sub- neighbor node collection determination unit, next-hop node selecting unit and the first retransmission unit, the Receive message unit and described
The connection of neighbor node acquiring unit, the neighbor node acquiring unit is connected with the sub- neighbor node collection determination unit, described
Sub- neighbor node collection determination unit is connected with the next-hop node selecting unit, the next-hop node selecting unit and described
The connection of first retransmission unit；
Wherein, the Receive message unit, the message for needing to forward for obtaining present node；
The neighbor node acquiring unit, for obtaining the neighbor node of the present node；
The sub- neighbor node collection determination unit, for selecting the service channel with the present node from the neighbor node
Identical neighbor node forms sub- neighbor node collection；
The next-hop node selecting unit, for selecting a neighbor node as next-hop from the sub- neighbor node concentration
Node；
First retransmission unit, for the message to be forwarded to the next-hop node from present node；
The next-hop node selecting unit, is also used to:
When the sub- neighbor node integrates as empty set, and the service channel locating for respective when the present node and the neighbor node
When switching to control channel, select a neighbor node as under according to the idle factor of the neighbor node and link degree of communication
One hop node, alternatively, selecting a neighbor node as next-hop node according to the idle factor of the neighbor node, wherein
The idle factor is positively correlated with free time of the neighbor node in a upper preset period of time, and the link connects
Logical degree is positively correlated with the maximum duration that can be communicated between two nodes；The idle factor represents the numerous of the neighbor node
Busy degree；
After the next-hop node and present node switch to the same service channel from the control channel, described in activation
First retransmission unit；
The calculation formula of the idle factor are as follows:
Wherein, the UidleFor the idle factor of the neighbor node；The TidleFor the neighbour in a upper preset period of time
Occupy the time of node free time；The TmaxIt is empty in a upper preset period of time for all neighbor nodes of the present node
Maximum value between idle；The TminIt is idle in a upper preset period of time for all neighbor nodes of the present node
The minimum value of time.
10. apparatus for forwarding message according to claim 9, which is characterized in that the next-hop node selecting unit is used for
Selecting a neighbor node as next-hop node from the sub- neighbor node concentration includes:
The next-hop node selecting unit, for concentrating the chain between selection and the present node from the sub- neighbor node
Degree of communication maximum neighbor node in road is as next-hop node, when the longest that the link degree of communication can be communicated with two nodes
Between correlation.
11. apparatus for forwarding message according to claim 9, which is characterized in that described device further include: the second forwarding is single
Member is connect with the neighbor node acquiring unit, there is target section corresponding with the message in the neighbor node for working as
When point, the message is transmitted to the destination node.
12. apparatus for forwarding message according to claim 9, which is characterized in that carried in the message message it is expired when
Between；
Described device further includes packet loss unit, is connect with the Receive message unit, for being more than described when current time
When message expired time, by the packet loss.
Priority Applications (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN201510195273.0A CN104869606B (en) | 2015-04-22 | 2015-04-22 | A kind of message forwarding method and device |
Applications Claiming Priority (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN201510195273.0A CN104869606B (en) | 2015-04-22 | 2015-04-22 | A kind of message forwarding method and device |
Publications (2)
| Publication Number | Publication Date |
|---|---|
| CN104869606A CN104869606A (en) | 2015-08-26 |
| CN104869606B true CN104869606B (en) | 2019-08-20 |
Family
ID=53915025
Family Applications (1)
| Application Number | Title | Priority Date | Filing Date |
|---|---|---|---|
| CN201510195273.0A Active CN104869606B (en) | 2015-04-22 | 2015-04-22 | A kind of message forwarding method and device |
Country Status (1)
| Country | Link |
|---|---|
| CN (1) | CN104869606B (en) |
Families Citing this family (1)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN106332211B (en) * | 2016-08-18 | 2019-08-13 | 北京邮电大学 | A kind of method and device of selection routing |
Citations (2)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN102781060A (en) * | 2011-05-12 | 2012-11-14 | 中国移动通信集团广东有限公司 | Method for realizing routing in wireless network, forwarding node and wireless network |
| CN104093185A (en) * | 2014-06-06 | 2014-10-08 | 华南理工大学 | Multi-channel multi-path routing protocol for vehicle team ad-hoc networks |
-
2015
- 2015-04-22 CN CN201510195273.0A patent/CN104869606B/en active Active
Patent Citations (2)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN102781060A (en) * | 2011-05-12 | 2012-11-14 | 中国移动通信集团广东有限公司 | Method for realizing routing in wireless network, forwarding node and wireless network |
| CN104093185A (en) * | 2014-06-06 | 2014-10-08 | 华南理工大学 | Multi-channel multi-path routing protocol for vehicle team ad-hoc networks |
Non-Patent Citations (1)
| Title |
|---|
| 移动AD hoc网络基于干扰和连通度的路由协议;章越，戴志龙;《通信电子技术》;20130829;第1.2节 |
Also Published As
| Publication number | Publication date |
|---|---|
| CN104869606A (en) | 2015-08-26 |
Similar Documents
| Publication | Publication Date | Title |
|---|---|---|
| Ji et al. | SDGR: An SDN-based geographic routing protocol for VANET | |
| US10631228B2 (en) | Information dissemination in a multi-technology communication network | |
| US20090161578A1 (en) | Data routing method and device thereof | |
| EP1655902B1 (en) | Mobile terminal, control device and mobile communication method | |
| US7620010B2 (en) | Wireless communications apparatus, and routing control and packet transmission technique in wireless network | |
| CN104135436B (en) | A kind of vehicle self-organizing network route selection method | |
| CN101897153B (en) | Communication terminal and communication method | |
| CN106211260B (en) | Position information self-adaptive opportunistic routing method in Internet of vehicles | |
| CN105407517B (en) | Method for routing, routing module, car-mounted terminal and vehicular ad hoc network route system | |
| Alsharif et al. | iCARII: Intersection-based connectivity aware routing in vehicular networks | |
| EP3264697B1 (en) | Mobile wireless communication unit, integrated circuit and method for routing content | |
| CN106454756B (en) | Method, device and system for broadcasting message in vehicle-mounted self-organizing network | |
| Sankaranarayanan | Early detection congestion and control routing in MANET | |
| CN103561446A (en) | Awareness routing method in vehicle-mounted self-organizing network based on road topology | |
| CN106034322A (en) | Routing switching method based on chain quality in mobile ad hoc network | |
| Nebbou et al. | Greedy curvemetric-based routing protocol for VANETs | |
| CN104053208B (en) | Method for routing based on channel distribution, device in wireless self-networking | |
| CN107645711A (en) | A kind of method and device of network route | |
| CN104869606B (en) | A kind of message forwarding method and device | |
| CN109803342A (en) | A kind of unmanned plane method for self-organizing network routing towards balancing energy highly-reliable transmission | |
| Sun et al. | Tvdr: A novel traffic volume aware data routing protocol for vehicular networks | |
| KR20210143021A (en) | System for uav assisted relay ad-hoc network system and method based on reinforcement learning | |
| WO2015048995A1 (en) | Integration of cellular and ieee 802.11 networks in vanets | |
| Ksouri et al. | Hybrid routing for safety data with intermittent V2I connectivity | |
| Chen et al. | A delay‐bounded routing protocol for vehicular ad hoc networks with traffic lights |
Legal Events
| Date | Code | Title | Description |
|---|---|---|---|
| C06 | Publication | ||
| PB01 | Publication | ||
| EXSB | Decision made by sipo to initiate substantive examination | ||
| SE01 | Entry into force of request for substantive examination | ||
| GR01 | Patent grant | ||
| GR01 | Patent grant |