CN104869606A - Message forwarding method and apparatus - Google Patents
Message forwarding method and apparatus Download PDFInfo
- Publication number
- CN104869606A CN104869606A CN201510195273.0A CN201510195273A CN104869606A CN 104869606 A CN104869606 A CN 104869606A CN 201510195273 A CN201510195273 A CN 201510195273A CN 104869606 A CN104869606 A CN 104869606A
- 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.)
- Granted
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 embodiments of the invention disclose a message forwarding method. The method comprises the following steps: obtaining a message which a current node needs to forward and neighbor nodes of the current node; selecting neighbor nodes which have the same service channel as the current node from the neighbor nodes to form a sub neighbor node set; selecting one neighbor node from the sub neighbor node set as a node of a next hop; and forwarding the message to the node of the next hop from the current node. The embodiments of the invention also disclose a message forwarding apparatus. According to the invention, the message forwarding efficiency is improved, the route time is reduced, and the system resources are saved.
Description
Technical field
The present invention relates to the communications field, particularly relate to a kind of message forwarding method and device.
Background technology
Along with the rising of Global Auto recoverable amount, the aggravation of road congestion conditions and the frequent generation of traffic accidents, vehicular ad hoc network (Vehicular Ad-Hoc Networks, VANET, hereinafter referred to as vehicular ad hoc network) as intelligent transportation system (Intelligent Traffic System, be called for short ITS) important foundation cause the great interest of academia and industrial quarters, by the existence of the mode perception surrounding vehicles such as inter-vehicle communication and related status information in vehicular ad hoc network, and prevent potential danger accordingly, therefore, the promptness of communication is the most important thing, direct and vehicle and personnel safety is closely bound up.
Be included in the workshop network within described vehicular ad hoc network, what form each node in the network of described workshop is vehicle, and because vehicle has the characteristic of high-speed mobile, therefore workshop network is a node fast moving, network topology change network frequently.Route refers to that message is forwarded to the process of another node from a node.Message is passed to destination node from start node may experience repeatedly route, in order to ensure the safety of vehicle and personnel, needs to ensure the success rate of route and the time of shortening route of trying one's best.
In the Routing Protocol of current vehicular ad hoc network, studying more is the Routing Protocol of Routing Protocol based on topology and position-based information.
Described representational based on most in the Routing Protocol of topology be drive distance vector routing protocol (Ad Hoc on-demand Distance Vector Protocol as required, be called for short AODV), this agreement specifies, before node sends data, for this node to receive data destination node between set up a paths, so that data arrive destination node by this path, the information in this path is stored in routing table.Due to path may comprise several nodes, under In-vehicle networking environment, as long as there is a node location to change, just likely causes the path of having planned to be ruptured, thus can data transmission fails be caused.If constantly again plan new route for node, then need to upgrade the routing table information comprising described routing information frequently, not only the resource of at substantial, and there is higher routing failure rate.
In the Routing Protocol of described position-based information, most is representational is greedy periphery stateless Routing Protocol (Greedy Perimeter Stateless Routing, be called for short GPSR), route in this agreement is a kind of stateless route, do not need to upgrade routing table information, be more applicable to the fast vehicular ad hoc network environment of network topology change than described AODV agreement.This agreement specifies, each node in the network of workshop regularly circulates a notice of oneself positional information, the positional information of neighbor node is kept in neighboring node list by each node, from the neighbor node of present node, next-hop node is selected according to greedy algorithm and minimum hop count principle, described next-hop node is nearer than present node distance objective node, then message is passed to next-hop node, next-hop node selects Next-Next-Hop node to transmit message, until pass to destination node from its neighbor node.Because message is delivered to next-hop node from a node, next-hop node chooses from the neighbor node of present node, therefore do not need to be constantly node path planning again, also do not need to upgrade routing table information, decrease the time of route, improve the efficiency of message repeating.
But, based under the multichannel In-vehicle networking environment of WAVE agreement, what node needs replaced switches on CCH (control channel) and SCH (service channel), even current time node is switched to SCH from CCH, then subsequent time, each node switches to CCH from SCH, then subsequent time node switches to SCH from CCH again, by that analogy.In WAVE agreement, CCH only has one, and SCH has multiple, and described SCH is used for sending between node, receiving or transferring service class message, and control channel is used for controlling class message to node transmission.Therefore, when node switches to SCH from CCH, different nodes may switch on different SCH.Because the forwarding of service class message can only pass through SCH, and the node being only in identical SCH just can E-Packet.If select next-hop node according to greedy algorithm and minimum hop count principle, the next-hop node of very possible selection is the node being in different SCH with present node, therefore can delay the longer time in routing procedure, reduce the efficiency of service class message repeating.
Summary of the invention
In order to solve the technical problem of message repeating inefficiency in prior art, waste system resource, the invention provides a kind of message forwarding method and device, improve message repeating efficiency, decrease route time, and having saved system resource.
Embodiments provide a kind of message forwarding method, described method comprises:
Obtain the message that present node needs to forward, and the neighbor node of described present node;
From described neighbor node, select the neighbor node identical with the service channel of described present node to form sub-neighbor node collection;
Concentrate selection neighbor node as next-hop node from described sub-neighbor node;
Described message is forwarded to described next-hop node from present node.
Preferably, describedly selection neighbor node is concentrated to comprise as next-hop node from described sub-neighbor node:
Concentrate the neighbor node selecting the link degree of communication between described present node maximum as next-hop node from described sub-neighbor node, the maximum duration correlation that described link degree of communication and two nodes can communicate.
Preferably, described method also comprises:
When described sub-neighbor node integrates as empty set, and when described present node and described neighbor node are by when residing service channel switches to control channel separately, select a neighbor node as next-hop node according to the idle factor of described neighbor node and/or link degree of communication, wherein, described idle factor and the free time of described neighbor node in a upper preset time period are proportionate, and the maximum duration that can communicate between described link degree of communication with two nodes is proportionate;
After described next-hop node and present node all switch to same service channel from described control channel, perform described step message being forwarded to described next-hop node from present node.
Preferably, the computing formula of described idle factor is:
Wherein, described U
idlefor the idle factor of described neighbor node; Described T
idlefor the time of described neighbor node free time in a upper preset time period; Described T
maxfor all neighbor nodes of described present node are in the maximum of a upper preset time period internal idle time; Described T
minfor all neighbor nodes of described present node are in the minimum value of a upper preset time period internal idle time.
Preferably, described preset time period is the time cycle of the neighbor node upgrading described present node.
Preferably, the computing formula of described link degree of communication is:
Wherein, described L
stabfor the link degree of communication of described present node and described neighbor node; Described t is the communication critical value of described present node and described neighbor node, i.e. the described present node maximum duration that can communicate with described neighbor node; Described t
maxfor the maximum communication critical value between described present node and all neighbor nodes; Described t
minfor the minimal communications critical value between described present node and described neighbor node.
Preferably, the described idle factor according to described neighbor node and link degree of communication select a neighbor node specifically to comprise as next-hop node:
Select neighbor node that node quality is the highest as next-hop node according to the idle factor of described neighbor node and link degree of communication, the computing formula of described node quality is:
Q＝αU
idle+βL
stab
Wherein, described Q is the node quality of described neighbor node, and described α and β is coefficient, alpha+beta=1 and α, β >=0.
Preferably, the upper hop node corresponding with described message is not comprised in the neighbor node of described present node.
Preferably, when after the message obtaining the forwarding of present node needs, described method also comprises:
When there is the destination node corresponding with described message in described neighbor node, give described destination node by described message repeating.
Preferably, message expired time is carried in described message; After described acquisition present node needs the message step forwarded, described method also comprises:
If current time exceedes described message expired time, then by described packet loss.
The embodiment of the present invention additionally provides a kind of apparatus for forwarding message, described device comprises: Receive message unit, neighbor node acquiring unit, sub-neighbor node collection determining unit, next-hop node selected cell and the first retransmission unit, described Receive message unit is connected with described neighbor node acquiring unit, described neighbor node acquiring unit is connected with described sub-neighbor node collection determining unit, described sub-neighbor node collection determining unit is connected with described next-hop node selected cell, and described next-hop node selected cell is connected with described first retransmission unit;
Wherein, described Receive message unit, for obtaining the message that present node needs to forward;
Described neighbor node acquiring unit, for obtaining the neighbor node of described present node;
Described sub-neighbor node collection determining unit, forms sub-neighbor node collection for selecting the neighbor node identical with the service channel of described present node from described neighbor node;
Described next-hop node selected cell, for concentrating selection neighbor node as next-hop node from described sub-neighbor node;
Described first retransmission unit, for being forwarded to described next-hop node by described message from present node.
Preferably, described next-hop node selected cell, comprises as next-hop node for concentrating selection neighbor node from described sub-neighbor node:
Described next-hop node selected cell, for concentrating the neighbor node selecting the link degree of communication between described present node maximum as next-hop node from described sub-neighbor node, the maximum duration correlation that described link degree of communication and two nodes can communicate.
Preferably, described next-hop node selected cell, also for:
When described sub-neighbor node integrates as empty set, and when described present node and described neighbor node are by when residing service channel switches to control channel separately, select a neighbor node as next-hop node according to the idle factor of described neighbor node and/or link degree of communication, wherein, described idle factor and the free time of described neighbor node in a upper preset time period are proportionate, and the maximum duration that can communicate between described link degree of communication with two nodes is proportionate;
After described next-hop node and present node all switch to same service channel from described control channel, activate described first retransmission unit.
Preferably, described device also comprises: the second retransmission unit, is connected with described neighbor node acquiring unit, for when there is the destination node corresponding with described message in described neighbor node, gives described destination node by described message repeating.
Preferably, message expired time is carried in described message;
Described device also comprises packet loss unit, is connected with described Receive message unit, during for exceeding described message expired time when current time, by described packet loss.
Relative to prior art, the invention has the advantages that:
The method for routing that in prior art, AODV agreement specifies needs to cook up a paths from start node to destination node in advance, in order to ensure the real-time in path, needs to upgrade routing table frequently.And the message forwarding method that the present embodiment provides does not need advance planning path, only need message to be passed to the neighbor node identical with described present node service channel when present node receives message, therefore do not need to upgrade routing table, not only save system resource, and improve message repeating efficiency.
The method for routing that in prior art, GPSR agreement specifies be in greedy algorithm in conjunction with minimum number principle to select next-hop node, therefore cannot ensure that the service channel of next-hop node is identical with present channel, if different, then need to waste node and switch to control channel from service channel and switch to time of twice switching of service channel from control channel.And the next-hop node that the message forwarding method that the present embodiment provides is selected is the neighbor node identical with present node service channel, therefore message directly can be forwarded to next-hop node from present node, effectively decrease route time, improve message repeating efficiency.
Accompanying drawing explanation
In order to be illustrated more clearly in the embodiment of the present application or technical scheme of the prior art, be briefly described to the accompanying drawing used required in embodiment or description of the prior art below, apparently, the accompanying drawing that the following describes is only some embodiments recorded in the application, for those of ordinary skill in the art, under the prerequisite not paying creative work, other accompanying drawing can also be obtained according to these accompanying drawings.
Fig. 1 is the flow chart of a kind of message forwarding method embodiment one provided by the invention;
Fig. 2 is the flow chart of a kind of message forwarding method embodiment two provided by the invention;
Fig. 3 is the schematic diagram of present node and neighbor node in a kind of message forwarding method embodiment two provided by the invention;
Fig. 4 is the structured flowchart of a kind of apparatus for forwarding message embodiment one provided by the invention;
Fig. 5 is the structured flowchart of a kind of apparatus for forwarding message embodiment two provided by the invention.
Embodiment
The present invention program is understood better in order to make those skilled in the art person, below in conjunction with the accompanying drawing in the embodiment of the present invention, technical scheme in the embodiment of the present invention is clearly and completely described, obviously, described embodiment is only the present invention's part embodiment, instead of whole embodiments.Based on the embodiment in the present invention, those of ordinary skill in the art, not making the every other embodiment obtained under creative work prerequisite, belong to the scope of protection of the invention.
Embodiment of the method one:
See Fig. 1, this figure is the flow chart of a kind of message forwarding method embodiment one provided by the invention.
The message forwarding method that the present embodiment provides comprises the steps:
Step S101: obtain the message that present node needs to forward, and the neighbor node of described present node.
In vehicular ad hoc network, each vehicle with communication equipment is each node.Centered by present node, the node within the communication radius being positioned at described present node communication equipment is called the neighbor node of present node.
Under normal circumstances, each node periodically can send a notification message (such as HELLO message) to neighbor node, accordingly, also the notification message that its neighbor node sends can be received, described notification message comprises the information such as ID, positional information, speed, direction of motion azimuth, working channel of described neighbor node, see table 1, this table is the message format of HELLO message.These information are saved in neighbor node table, upgrade neighbor node table by periodically receiving described notification message.Be not updated when a list item of neighbor node table exceedes the scheduled time, then represent the out-of-date inefficacy of this list item, this neighbor node, not within the scope of a jumping, should be deleted by corresponding neighbor node.
Table 1
It should be noted that described communication information is not message, described communication information is just for setting up or upgrading neighbor node table, and its scope sending or receive is only limitted to communication radius; And message is for transmitting various message, such as traffic accident information, road congestion condition information, weather report information etc., need the start node from producing message to be delivered to destination node usually, wherein may through the forwarding of some nodes.In the present embodiment, obtain the message that present node needs to forward, described present node is described or is the start node of message, or be exactly one of them forward node.
Step S102: select the neighbor node identical with the service channel of described present node to form sub-neighbor node collection from described neighbor node.
Step S103: concentrate selection neighbor node as next-hop node from described sub-neighbor node.
Due to the service channel that all neighbor nodes preserving present node in described neighbor node table are residing in current time period, therefore, the all neighbor nodes identical with the working channel of described present node are picked out and forms sub-neighbor node collection, then concentrate selection neighbor node as next-hop node from described sub-neighbor node.
Step S104: message is forwarded to described next-hop node from present node.
The method for routing that in prior art, AODV agreement specifies needs to cook up a paths from start node to destination node in advance, in order to ensure the real-time in path, needs to upgrade routing table frequently.And the message forwarding method that the present embodiment provides does not need advance planning path, only need message to be passed to the neighbor node identical with described present node service channel when present node receives message, therefore do not need to upgrade routing table, not only save system resource, and improve message repeating efficiency.
The method for routing that in prior art, GPSR agreement specifies be in greedy algorithm in conjunction with minimum number principle to select next-hop node, therefore cannot ensure that the service channel of next-hop node is identical with present channel, if different, then need to waste node and switch to control channel from service channel and switch to time of twice switching of service channel from control channel.And the next-hop node that the message forwarding method that the present embodiment provides is selected is the neighbor node identical with present node service channel, therefore message directly can be forwarded to next-hop node from present node, effectively decrease route time, improve message repeating efficiency.
For example, according in prior art two minimum hop count principle, the next-hop node of node A is Node B, if Node B is different with the service channel of node A, then need to wait node A and Node B all to switch to control channel from respective service channel, and coordinated the service channel that node A and Node B prepare switching next time by control channel, then node A and Node B just can switch to the transmission that same service channel carries out message.If the cycle switched according to channel in WAVE consensus standard is that 50ms calculates, that said process just needs the time wasting 100ms.And if the message forwarding method that provides of the present embodiment is provided, choose with the neighbor node C of described node A service channel as next-hop node, therefore message directly can be forwarded to node C from node A, has saved the time of 100ms.
Embodiment of the method two
See Fig. 2, this figure is the flow chart of a kind of message forwarding method embodiment two provided by the invention.
The message forwarding method that the present embodiment provides comprises the steps:
Step S201: obtain the message that present node needs to forward, carry message expired time in described message.
Step S202: judge whether current time exceedes described message expired time, if not, then performs step S203.
In the present embodiment, if current time exceedes described message expired time, then illustrate that described message lost efficacy, now can not go to process this message, also can directly abandon; If current time does not exceed the described message expired time, then illustrate that this message is effective, should next-hop node be forwarded it to.
Step S203: the neighbor node obtaining described present node.
Be the upper hop node being forwarded to present node in order to the next-hop node preventing following step from electing is actual, cause message repeating to enter endless loop, preferably, the upper hop node of described message in described neighbor node, should be got rid of.Concrete, the information of upper hop node can be carried in message, so that upper hop node excludes when receiving this message by present node automatically from described neighbor node.
For example, the neighbor node of nodes X comprises node A, B, C and D, and message m is forwarded to nodes X by its interior joint A, therefore carries the information that upper hop node is node A in message m.When nodes X forwards described message m, entering endless loop to prevent message from sending to node A, the node A in described neighbor node can be excluded, namely from neighbor node B, C and D, selecting next-hop node.
Step S204: judge whether there is the destination node corresponding with described message in described neighbor node, if so, then performs step S205; If not, then step S206 is performed.
Under normal circumstances, the information of destination node is carried in described message.When described message needs present node to forward, preferentially can judge whether there is the destination node corresponding with described message in the neighbor node of described present node, if existed, then directly forward the packet to described destination node; If there is no, then be transmitted to next-hop node, continued to forward by next-hop node.
Step S205: give described destination node by described message repeating, flow process terminates.
Step S206: select the neighbor node identical with the service channel of described present node to form sub-neighbor node collection from described neighbor node.
Step S207: judge that described sub-neighbor node integrates whether as empty set, if not, then perform step S208; If so, then step S209 is performed.
In the present embodiment, judge that described sub-neighbor node integrates whether as empty set, if not empty set, illustrate to there is the neighbor node identical with the service channel of described present node, so can select next-hop node from these neighbor nodes; If empty set, illustrate to there is not the neighbor node identical with the service channel of described present node, neighbor node that so can only be different from described present node service channel from these, select next-hop node.
Step S208: concentrate the neighbor node selecting the link degree of communication between described present node maximum as next-hop node from described sub-neighbor node, then perform step S210.
In the present embodiment, described link degree of communication and two nodes maximum duration correlation that can communicate.The present embodiment provides a kind of computational methods of link degree of communication, but should be noted that, the method does not form limitation of the invention, and those skilled in the art can according to its general principle designed, designed.
See Fig. 3, this figure is the schematic diagram of present node and neighbor node.In the figure, S
1and S
2represent t respectively
1moment and t
2the position of moment present node S, N
1and N
2represent t respectively
1moment and t
2the position of moment neighbor node N, θ represents that neighbor node departs from the angle of present node, and distance d represents the maximum communication distance of present node, V
nand V
srepresent that neighbor node and present node are at t respectively
1to t
2the average speed of time period.After elapsed time t, can not communicate between present node S and neighbor node N, therefore, title time t is node communication critical value, described time t and link degree of communication correlation, and the time t larger explanation link alive time is longer, more stable, link degree of communication is higher; Otherwise the time t less explanation link alive time is shorter, more unstable, and link degree of communication is lower.
When to the time, t calculates, the cosine law can be adopted to do and estimate, formula is as follows:
d
2＝(V
St)
2+(V
Nt)
2-2V
NtV
Stcosθ (1)
The time t of calculating is:
Described present node and described sub-neighbor node can be calculated respectively by formula (2) and concentrate t value between all neighbor nodes, then get its minimum value and maximum, calculate link degree of communication by formula (3):
Wherein, described L
stabfor the link degree of communication of described present node and described neighbor node; Described t is the communication critical value of described present node and described neighbor node, i.e. the described present node maximum duration that can communicate with described neighbor node; Described t
maxfor the maximum communication critical value between described present node and all neighbor nodes; Described t
minfor the minimal communications critical value between described present node and described neighbor node.
In order to ensure the success rate of message repeating as much as possible, calculating after described present node and described sub-neighbor node concentrate the link degree of communication of all neighbor nodes, select link degree of communication L
stablarger neighbor node, as next-hop node, preferably, selects the neighbor node that maximum link degree of communication is corresponding.
Step S209: when described present node and described neighbor node are by when residing service channel switches to control channel separately, select a neighbor node as next-hop node according to the idle factor of described neighbor node and/or link degree of communication, and perform step S210 after described next-hop node and present node all switch to same service channel from described control channel.
In the present embodiment, if described sub-neighbor node integrates as empty set, then illustrate and do not exist and the neighbor node of described present node on same service channel, can only, after described present node and described neighbor node switch to described control channel from respective service channel, described present node and following next-hop node be made to be switched to same service channel when switching to service channel from described control channel in the mode that control channel is held consultation.
So, how to select described next-hop node in this case? the present invention is not specifically limited, can Stochastic choice, also can select according to certain strategy.The present embodiment provides a kind of selection strategy of next-hop node, namely selects according to the idle factor of described neighbor node and/or link degree of communication.
Described idle factor and the free time of described neighbor node in a upper preset time period are proportionate.Described free time refers to that described neighbor node does not carry out the time of route.When in preset time period, this neighbor node of free time longer expression of described neighbor node is more idle, and the speed E-Packeted is faster; This neighbor node of free time shorter expression is busier, and the speed E-Packeted is slower.The present embodiment provides a kind of computational methods of idle factor, but should be noted that, the method does not form limitation of the invention, and those skilled in the art can according to its general principle designed, designed.
The computing formula of described idle factor is:
Wherein, described U
idlefor the idle factor of described neighbor node; Described T
idlefor the time of described neighbor node free time in a upper preset time period; Described T
maxfor all neighbor nodes of described present node are in the maximum of a upper preset time period internal idle time; Described T
minfor all neighbor nodes of described present node are in the minimum value of a upper preset time period internal idle time.
For the ease of calculating, described preset time period can be set as the update time of described neighbor node, and the free time of each node can be added in described neighbor node table, the described neighbor node table of each renewal, not only can obtain up-to-date neighbor node, but also the free time of each neighbor node in the nearest time cycle can be obtained.
The link degree of communication of described neighbor node can calculate to (3) according to above-mentioned formula (1), does not repeat them here.
Because described idle factor represents the busy extent of described neighbor node, described link degree of communication represents the stability that described neighbor node communicates with described present node, both emphasis are variant, the forward efficiency of what the former stressed is message, the forwarding success rate of what the latter stressed is message, can select according to described idle factor and/or described link degree of communication according to actual demand when selecting next-hop node.If described next-hop node is selected according to described idle factor and described link degree of communication, the present embodiment provides a kind of system of selection, namely select neighbor node that node quality is the highest as next-hop node according to the idle factor of described neighbor node and link degree of communication, the computing formula of described node quality is:
Q＝αU
idle+βL
stab(5)
Wherein, described Q is the node quality of described neighbor node, and described α and β is coefficient, alpha+beta=1 and α, β >=0.
In actual applications, when vehicle is in city, because the speed of a motor vehicle is lower, the link degree of communication of present node and each neighbor node is general all higher, and idle factor is lower, therefore suitably can improve the value of described α, select emphatically those relative free times more neighbor node.And when vehicle is on expressway, because the speed of a motor vehicle is higher, the link degree of communication of present node and each neighbor node is general all lower, and idle factor is higher, therefore suitably can improve the value of described β, select emphatically the neighbor node that those link degrees of communication are higher.
It should be noted that and above-mentionedly select the method for next-hop node not form limitation of the invention according to described idle factor and described link degree of communication, those skilled in the art can designed, designed according to actual needs.
Step S210: message is forwarded to described next-hop node from present node.
Relative to embodiment of the method one, the present embodiment is when described sub-neighbor node integrates not as empty set, the neighbor node selecting the link degree of communication between described present node maximum, as next-hop node, ensure that the reliability of the success rate that message transmits and route to greatest extent.
When described sub-neighbor node integrates as empty set, select a neighbor node as next-hop node according to the idle factor of described neighbor node and/or link degree of communication, improve forward efficiency and/or the success rate of message.
Based on a kind of message forwarding method that above embodiment provides, the embodiment of the present invention additionally provides a kind of apparatus for forwarding message, describes its operation principle in detail below in conjunction with accompanying drawing.
Device embodiment one
See Fig. 4, this figure is the structured flowchart of a kind of apparatus for forwarding message embodiment one provided by the invention.
The apparatus for forwarding message that the present embodiment provides comprises: Receive message unit 301, neighbor node acquiring unit 302, sub-neighbor node collection determining unit 303, next-hop node selected cell 304 and the first retransmission unit 305.
Described Receive message unit 301 is connected with described neighbor node acquiring unit 302, described neighbor node acquiring unit 302 is connected with described sub-neighbor node collection determining unit 303, described sub-neighbor node collection determining unit 303 is connected with described next-hop node selected cell 304, and described next-hop node selected cell 304 is connected with described first retransmission unit 305;
Wherein, described Receive message unit 301, for obtaining the message that present node needs to forward;
Described neighbor node acquiring unit 302, for obtaining the neighbor node of described present node;
Described sub-neighbor node collection determining unit 303, forms sub-neighbor node collection for selecting the neighbor node identical with the service channel of described present node from described neighbor node;
Described next-hop node selected cell 304, for concentrating selection neighbor node as next-hop node from described sub-neighbor node;
Described first retransmission unit 305, for being forwarded to described next-hop node by described message from present node.
The method for routing that in prior art, AODV agreement specifies needs to cook up a paths from start node to destination node in advance, in order to ensure the real-time in path, needs to upgrade routing table frequently.And the message forwarding method that the present embodiment provides does not need advance planning path, only need message to be passed to the neighbor node identical with described present node service channel when present node receives message, therefore do not need to upgrade routing table, not only save system resource, and improve message repeating efficiency.
The method for routing that in prior art, GPSR agreement specifies be in greedy algorithm in conjunction with minimum number principle to select next-hop node, therefore cannot ensure that the service channel of next-hop node is identical with present channel, if different, then need to waste node and switch to control channel from service channel and switch to time of twice switching of service channel from control channel.And the next-hop node that the message forwarding method that the present embodiment provides is selected is the neighbor node identical with present node service channel, therefore message directly can be forwarded to next-hop node from present node, effectively decrease route time, improve message repeating efficiency.
Device embodiment two
See Fig. 5, this figure is the structured flowchart of a kind of apparatus for forwarding message embodiment two provided by the invention.
Based on described device embodiment one, in the apparatus for forwarding message that the present embodiment provides, described next-hop node selected cell 304, comprises as next-hop node for concentrating selection neighbor node from described sub-neighbor node:
Described next-hop node selected cell 304, for concentrating the neighbor node selecting the link degree of communication between described present node maximum as next-hop node from described sub-neighbor node, the maximum duration correlation that described link degree of communication and two nodes can communicate.
Preferably, described next-hop node selected cell 304, also for:
When described sub-neighbor node integrates as empty set, and when described present node and described neighbor node are by when residing service channel switches to control channel separately, select a neighbor node as next-hop node according to the idle factor of described neighbor node and/or link degree of communication, wherein, described idle factor and the free time of described neighbor node in a upper preset time period are proportionate, and the maximum duration that can communicate between described link degree of communication with two nodes is proportionate;
After described next-hop node and present node all switch to same service channel from described control channel, activate described first retransmission unit.
Preferably, described device also comprises: the second retransmission unit 306, is connected with described neighbor node acquiring unit 302, for when there is the destination node corresponding with described message in described neighbor node, gives described destination node by described message repeating.
Preferably, message expired time is carried in described message; Described device also comprises packet loss unit 307, is connected with described Receive message unit 301, during for exceeding described message expired time when current time, by described packet loss.
Relative to device embodiment one, the present embodiment is when described sub-neighbor node integrates not as empty set, the neighbor node selecting the link degree of communication between described present node maximum, as next-hop node, ensure that the reliability of the success rate that message transmits and route to greatest extent.
When described sub-neighbor node integrates as empty set, select a neighbor node as next-hop node according to the idle factor of described neighbor node and/or link degree of communication, improve forward efficiency and/or the success rate of message.
It should be noted that, one of ordinary skill in the art will appreciate that all or part of flow process realized in said method embodiment, that the hardware that can carry out instruction relevant by computer program has come, described program can be stored in a computer read/write memory medium, this program, when performing, can comprise the flow process as above-mentioned each side method embodiment.Wherein, described storage medium can be magnetic disc, CD, read-only store-memory body (Read-Only Memory, ROM) or random store-memory body (Random AccessMemory, RAM) etc.
Each embodiment in this specification all adopts the mode of going forward one by one to describe, between each embodiment identical similar part mutually see, what each embodiment stressed is the difference with other embodiments.Especially, for device embodiment, because it is substantially similar to embodiment of the method, so describe fairly simple, relevant part illustrates see the part of embodiment of the method.Device embodiment described above is only schematic, and the wherein said unit that illustrates as separating component and module can or may not be physically separates.In addition, some or all of unit wherein and module can also be selected according to the actual needs to realize the object of the present embodiment scheme.Those of ordinary skill in the art, when not paying creative work, are namely appreciated that and implement.
The above is only the specific embodiment of the present invention; it should be pointed out that for those skilled in the art, under the premise without departing from the principles of the invention; can also make some improvements and modifications, these improvements and modifications also should be considered as protection scope of the present invention.
Claims (15)
1. a message forwarding method, is characterized in that, described method comprises:
Obtain the message that present node needs to forward, and the neighbor node of described present node;
From described neighbor node, select the neighbor node identical with the service channel of described present node to form sub-neighbor node collection;
Concentrate selection neighbor node as next-hop node from described sub-neighbor node;
Described message is forwarded to described next-hop node from present node.
2. message forwarding method according to claim 1, is characterized in that, describedly concentrates selection neighbor node to comprise as next-hop node from described sub-neighbor node:
Concentrate the neighbor node selecting the link degree of communication between described present node maximum as next-hop node from described sub-neighbor node, the maximum duration correlation that described link degree of communication and two nodes can communicate.
3. message forwarding method according to claim 1, is characterized in that, described method also comprises:
When described sub-neighbor node integrates as empty set, and when described present node and described neighbor node are by when residing service channel switches to control channel separately, select a neighbor node as next-hop node according to the idle factor of described neighbor node and/or link degree of communication, wherein, described idle factor and the free time of described neighbor node in a upper preset time period are proportionate, and the maximum duration that can communicate between described link degree of communication with two nodes is proportionate;
After described next-hop node and present node all switch to same service channel from described control channel, perform described step message being forwarded to described next-hop node from present node.
4. message forwarding method according to claim 3, is characterized in that, the computing formula of described idle factor is:
Wherein, described U
idlefor the idle factor of described neighbor node; Described T
idlefor the time of described neighbor node free time in a upper preset time period; Described T
maxfor all neighbor nodes of described present node are in the maximum of a upper preset time period internal idle time; Described T
minfor all neighbor nodes of described present node are in the minimum value of a upper preset time period internal idle time.
5. message forwarding method according to claim 4, is characterized in that, described preset time period is the time cycle of the neighbor node upgrading described present node.
6. the message forwarding method according to claim 2-5 any one, is characterized in that, the computing formula of described link degree of communication is:
Wherein, described L
stabfor the link degree of communication of described present node and described neighbor node; Described t is the communication critical value of described present node and described neighbor node, i.e. the described present node maximum duration that can communicate with described neighbor node; Described t
maxfor the maximum communication critical value between described present node and all neighbor nodes; Described t
minfor the minimal communications critical value between described present node and described neighbor node.
7. message forwarding method according to claim 6, is characterized in that, the described idle factor according to described neighbor node and link degree of communication select a neighbor node specifically to comprise as next-hop node:
Select neighbor node that node quality is the highest as next-hop node according to the idle factor of described neighbor node and link degree of communication, the computing formula of described node quality is:
Q＝αU
idle+βL
stab
Wherein, described Q is the node quality of described neighbor node, and described α and β is coefficient, alpha+beta=1 and α, β >=0.
8. message forwarding method according to claim 1, is characterized in that, does not comprise the upper hop node corresponding with described message in the neighbor node of described present node.
9. message forwarding method according to claim 1, is characterized in that, when after the message obtaining the forwarding of present node needs, described method also comprises:
When there is the destination node corresponding with described message in described neighbor node, give described destination node by described message repeating.
10. message forwarding method according to claim 1, is characterized in that, carries message expired time in described message; After described acquisition present node needs the message step forwarded, described method also comprises:
If current time exceedes described message expired time, then by described packet loss.
11. 1 kinds of apparatus for forwarding message, it is characterized in that, described device comprises: Receive message unit, neighbor node acquiring unit, sub-neighbor node collection determining unit, next-hop node selected cell and the first retransmission unit, described Receive message unit is connected with described neighbor node acquiring unit, described neighbor node acquiring unit is connected with described sub-neighbor node collection determining unit, described sub-neighbor node collection determining unit is connected with described next-hop node selected cell, and described next-hop node selected cell is connected with described first retransmission unit;
Wherein, described Receive message unit, for obtaining the message that present node needs to forward;
Described neighbor node acquiring unit, for obtaining the neighbor node of described present node;
Described sub-neighbor node collection determining unit, forms sub-neighbor node collection for selecting the neighbor node identical with the service channel of described present node from described neighbor node;
Described next-hop node selected cell, for concentrating selection neighbor node as next-hop node from described sub-neighbor node;
Described first retransmission unit, for being forwarded to described next-hop node by described message from present node.
12. apparatus for forwarding message according to claim 11, is characterized in that, described next-hop node selected cell, comprise as next-hop node for concentrating selection neighbor node from described sub-neighbor node:
Described next-hop node selected cell, for concentrating the neighbor node selecting the link degree of communication between described present node maximum as next-hop node from described sub-neighbor node, the maximum duration correlation that described link degree of communication and two nodes can communicate.
13. apparatus for forwarding message according to claim 11, is characterized in that, described next-hop node selected cell, also for:
When described sub-neighbor node integrates as empty set, and when described present node and described neighbor node are by when residing service channel switches to control channel separately, select a neighbor node as next-hop node according to the idle factor of described neighbor node and/or link degree of communication, wherein, described idle factor and the free time of described neighbor node in a upper preset time period are proportionate, and the maximum duration that can communicate between described link degree of communication with two nodes is proportionate;
After described next-hop node and present node all switch to same service channel from described control channel, activate described first retransmission unit.
14. apparatus for forwarding message according to claim 11, it is characterized in that, described device also comprises: the second retransmission unit, be connected with described neighbor node acquiring unit, for when there is the destination node corresponding with described message in described neighbor node, give described destination node by described message repeating.
15. apparatus for forwarding message according to claim 11, is characterized in that, carry message expired time in described message;
Described device also comprises packet loss unit, is connected with described Receive message unit, during for exceeding described message expired time when current time, by described 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 true CN104869606A (en) | 2015-08-26 |
| CN104869606B 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) |
Cited By (1)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN106332211A (en) * | 2016-08-18 | 2017-01-11 | 北京邮电大学 | Routing selection method and device |
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网络基于干扰和连通度的路由协议", 《通信电子技术》 * |
Cited By (2)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN106332211A (en) * | 2016-08-18 | 2017-01-11 | 北京邮电大学 | Routing selection method and device |
| CN106332211B (en) * | 2016-08-18 | 2019-08-13 | 北京邮电大学 | A kind of method and device of selection routing |
Also Published As
| Publication number | Publication date |
|---|---|
| CN104869606B (en) | 2019-08-20 |
Similar Documents
| Publication | Publication Date | Title |
|---|---|---|
| Durresi et al. | Emergency broadcast protocol for inter-vehicle communications | |
| Ullah et al. | Advances in position based routing towards ITS enabled FoG-oriented VANET–A survey | |
| CN107277890B (en) | Wireless communication device and wireless communication method | |
| Qin et al. | Vehicloud: Cloud computing facilitating routing in vehicular networks | |
| US9832706B2 (en) | Information dissemination in a multi-technology communication network | |
| CN104135436B (en) | A kind of vehicle self-organizing network route selection method | |
| Qureshi et al. | Weighted link quality and forward progress coupled with modified RTS/CTS for beaconless packet forwarding protocol (B-PFP) in VANETs | |
| Khan et al. | A Traffic Aware Segment-based Routing protocol for VANETs in urban scenarios | |
| CN107277778B (en) | Wireless communication device and wireless communication method | |
| CN105407517B (en) | Method for routing, routing module, car-mounted terminal and vehicular ad hoc network route system | |
| CN106211260B (en) | Position information self-adaptive opportunistic routing method in Internet of vehicles | |
| JP2006221286A (en) | Communication device | |
| EP3334214A1 (en) | Method, apparatus and computer program for routing a data packet | |
| Alsharif et al. | iCARII: Intersection-based connectivity aware routing in vehicular networks | |
| Leal et al. | Information-centric opportunistic data dissemination in vehicular ad hoc networks | |
| CN108629455A (en) | A kind of real-time route planing method based on vehicle self-organizing net | |
| CN104735743B (en) | The routing optimization method of embedded radio self-organizing network | |
| CN103561446A (en) | Awareness routing method in vehicle-mounted self-organizing network based on road topology | |
| Ajmal et al. | Classification of VANET MAC, Routing and Approaches A Detailed Survey. | |
| CN103596238A (en) | A route calculating method and apparatus for a V2V communication network | |
| Jiao et al. | Predictive big data collection in vehicular networks: A software defined networking based approach | |
| CN110351686A (en) | Method, on board unit and the car networking data transmission system implemented in car networking data transmission system | |
| CN107343301B (en) | Efficient and reliable routing method of vehicle-mounted ad hoc network based on message aggregation | |
| Shafiq et al. | QoS in Vehicular Ad Hoc Networks–A Survey | |
| Gurumoorthi et al. | Performance analysis of Geocast based location aided routing using Cache agent in VANET |
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 |