CN103200642B - A kind of optimization method of mobile radio network Route Selection - Google Patents
A kind of optimization method of mobile radio network Route Selection Download PDFInfo
- Publication number
- CN103200642B CN103200642B CN201310128022.1A CN201310128022A CN103200642B CN 103200642 B CN103200642 B CN 103200642B CN 201310128022 A CN201310128022 A CN 201310128022A CN 103200642 B CN103200642 B CN 103200642B
- Authority
- CN
- China
- Prior art keywords
- node
- rsu
- neighbor
- nearest
- sending
- Prior art date
- Legal status (The legal status is an assumption and is not a legal conclusion. Google has not performed a legal analysis and makes no representation as to the accuracy of the status listed.)
- Expired - Fee Related
Links
Abstract
The invention discloses a kind of optimization method of mobile radio network Route Selection, belong to mobile radio network field.Its concrete technical scheme is: dynamically define the regional area in network in real time according to neighbours' number of network node, neighbours' number is greater than to the node defining value, be divided into the regional area that density is large, for the node of regional area, then according to the network topology of the regional area of current sending node, carry out route based on signal source shortest path, for the node outside regional area, adopt the Routing Protocol based on geographical position to carry out route; If routing failure, then sending node stores message to be sent, and after timet, re-starts Route Selection.The present invention can be applicable to the dynamic mobile radio network of height as vehicular ad hoc network etc.The present invention fully combines based on the route in geographical position and the route of topology Network Based, and a point occasion is called, and adds text delivery success rate, decreases time delay, improves the overall performance of network.
Description
Technical field
The present invention relates to mobile radio network, particularly relate in high dynamic mobile radio network, the optimization method of Route Selection.
Background technology
Along with the development of mobile radio network, various mobile radio network is widely used in people's life, and as vehicular ad hoc network, vehicular ad hoc network, as a kind of high dynamic mobile radio network, possesses the distinguishing feature of the following aspects:
(1) node density skewness, diverse location region, in Different periods, the density distribution of node is different, such as very large at urban center, peak period on and off duty node density, and very little in the Area Node density such as highway, suburb;
(2) network topology change is frequent, and the change in location speed of each node depends on the node density in region residing for it, and as node high-speed mobile, change in location is very fast;
(3) each its position information of node energy Real-time Obtaining, as by node (as vehicle) the GPS device that is equipped with;
(4) due to the existence of communication barrier thing (as high-rise building etc.), although can cause node in communication range to each other, the situation that can not communicate;
For the highly dynamic radio mobile network of These characteristics, generally be difficult to set up more stable communication end to end, so how can carry out the vital task that Route Selection becomes such wireless network (as vehicular ad hoc network) fast and accurately, it directly determines the important performance indexes such as hop count, data delivery rate, time delay from source node to destination node.Current, the Routing Protocol for the dynamic mobile radio network of height mainly contains the Routing Protocol based on topology and the Routing Protocol based on geographical position.
Based in the Routing Protocol of topology, when the distance of two nodes is less than communicating wireless signals scope, neighbor node each other, all route learnings rely on switching and routing item between neighbor node completely, node by link-state protocol to neighbor node advertise link state.Method for routing based on topology is mainly divided into two large classes: reactiver outing and Proactive routing.Reactiver outing basic thought is broadcast and the renewal of regularly carrying out routing table on one's own initiative, in reactiver outing, can real-time update routing table, information Forwarding Delay is little, delivery success rate is high, but frequent updating routing table can take a large amount of Internet resources, and utilance is low, be easy to cause network congestion when node density is very large especially.Proactive routing is that an active node just creates route when there being communication requirement, do not safeguard route after sign off, until receive demand next time, routing cost total under Proactive routing pattern is less, but real-time is bad and cause time delay comparatively large, the shortcoming that success rate is low.
Based in the Routing Protocol of topology, need the link information knowing the whole network, current MOPR (MOvement Predictionbased Routing, motion prediction algorithm) algorithm uses more one, it improves routing algorithm by information such as the position of node, speed and directions.This algorithm predicts the following position that may occur of node by the position that node is present, thus estimates the life span of a link.Source point can be estimated the transmission time of message according to life span thus select a link the most stable.
As can be seen here, there are following two based on the Routing Protocol of topology and do not allow the defect that overcomes:
(1) although processing procedure Fast Convergent, the path found out also is the shorter path of source point to point of destination, but when being applied to high dynamic mobile radio network, because its network topology change is very frequent, when particularly node density is not very large, node motion speed is very fast, often when message is not also forwarded to point of destination from source point, link nodes moves, and link frequently ruptures, can not find node when E-Packeting, causing packet loss;
(2) when network topology structure is comparatively large or node density is very large, want to know that the topology of whole network is unpractical in real time, also will cause sizable offered load, and cause network congestion to have a strong impact on network performance.
Based in the Routing Protocol in geographical position, only need the positional information knowing this node, neighbor node and destination node just can carry out routing forwarding, greatly reduce routing cost.Route based on geographical position is delivered tactful thought and is nearly all followed greedy algorithm, namely the neighbor node that always chosen distance point of destination is nearer each time, because location-based route only knows local positional information, and do not know the positional information of the whole network, so be easy to be absorbed in local optimum, namely in all nodes in the communication range of sending node, sending node distance destination node is nearest, and be absorbed in endless loop, in general location-based route has the correcting strategy being directed to local optimum.
Current use is exactly GPSR (Greedy Perimeter Stateless Routing, greedy periphery stateless route) algorithm more widely, and the core concept of GPSR algorithm is greedy routing and correcting strategy.So-called greedy routing be exactly forever towards from destination node more close to next node deliver message, as shown in Figure 1, node for the purpose of D, when node S has message will send to node D, the node that node S can select distance node D nearest in all neighbor nodes of oneself, as next-hop node, is now Node B; Correction strategy, node just refer to when will send data to destination node, when node can not find the node nearer than this nodal distance destination node in its neighbor node, then adopt correcting strategy---the right-hand rule, as shown in Figure 2, when node F receives a message from neighbor node E, according to the right-hand rule message repeating to first of node F counterclockwise oppositely on neighbor node H.
Due in urban environment, there is many barrier obstruction, GPSR routing performance is made not to be fine, to this GPCR (Greedy Perimeter Coordinator Routing, greedy periphery coordinates route) introduce coordinator node, so-called coordinator node refers to the node being positioned at crossroad place, and each node judges this node whether as coordinator node according to the position coordinates of the neighbor node of oneself.In GPCR agreement, if have coordinator node in down hop, then preferentially give coordinator node message repeating, otherwise carry out route according to greedy routing thought, namely the node that chosen distance destination node is nearest in local neighbor node, as the next-hop node sending message, adopts the right-hand rule to repair when being absorbed in local optimum.
Although relative to the method for routing based on topology, location-based route does not need to safeguard too many routing iinformation, is relatively applicable to highly dynamic mobile radio network, still there is following defect:
(1) when network node is than comparatively dense, the bustling district in such as vehicle peak period on and off duty or center, city, now node motion speed is slower, topologies change is slow, but E-Packet at every turn and still find next-hop node by greedy routing, cause much meaningless delivery, increase offered load and time delay;
(2) right-hand rule in correcting strategy, selected next-hop node probably towards the direction forwarding away from destination node, can increase time delay, and very likely exhausts forwarding time and cause packet loss.
Summary of the invention
Goal of the invention of the present invention is: for above-mentioned Problems existing, and providing a kind of increases text delivery success rate, reduces time delay, reduces the jumping figure of source point to point of destination, improves the routing optimization method of the overall performance of network.
The optimization method of a kind of mobile radio network Route Selection of the present invention, comprises the following steps:
Step 1: the network topology building regional area:
Each node periodically judges whether the neighbours' number in the neighbor table of this node is more than or equal to definite value Q, if so, the neighbor table of then this node of inundation;
Each receiving node is according to the syntople of described neighbor table at the current sending node of local maintenance, if neighbours' number of receiving node is more than or equal to definite value Q, then and the neighbor table of the current sending node of described receiving node inundation;
Step 2: the Route Selection of sending node:
Step 201: judge whether neighbours' number of sending node is more than or equal to definite value Q, if so, then according to the network topology of the regional area of sending node, carries out route based on signal source shortest path, if routing failure, then performs step 202;
Step 202: according to the neighbor node of sending node, sending node and the geographical location information of message destination node, the Routing Protocol based on geographical position carries out route, if routing failure, then performs step 203;
Step 203: sending node stores message to be sent, and after timet, return step 201.
The present invention is in same mobile radio network topology, different Routing Protocols is called according to the difference of node density, at the regional area (namely whether neighbours' number of sending node is more than or equal to definite value Q) that node density is large, because density is large, therefore node motion speed is slow, change in topology is slow, now link can not frequently rupture, route is carried out based on signal source shortest path, as conventional Di Jiesitela dijkstra's algorithm, play the advantage that it finds out shortest path fast, avoid the delivery that message is meaningless; Topology beyond regional area, the Routing Protocol based on geographical position carries out route, as GPSR, GPCR etc., utilizes the little advantage that can adapt to topological frequent variations of its routing cost.Realization of the present invention, improves text delivery success rate, reduces time delay, reduces the jumping figure of source point to point of destination, improves the overall performance of network.
In order to ensure in the present invention further, the accuracy of the network topology of constructed regional area, in step 1, each node is every cycle T 1, burin-in process is carried out to the network topology of the regional area of this node: getting the time that this section point receives the neighbor table message of neighbor node is t1, the current time of burin-in process is t2, if the difference of described t2, t1 is greater than cycle T 1, is then deleted from the network topology of the regional area of this node by the syntople of described neighbor node.
In the present invention, in order to promote the real-time of each its neighbor table of node maintenance and accuracy, the attended operation of the neighbor table of each node is:
The periodic broadcast node positional information of each node, comprises the timestamp that information produces in described positional information; Each receiving node, according to received positional information, upgrades neighbor table, comprises the timestamp that neighbours upgrade in described neighbor table; Each node is every cycle T 2, start burin-in process to the neighbor table of this node: getting the time that this section point receives the positional information of neighbor node is t3, the time of current startup burin-in process is t4, if the difference of described t3, t4 is greater than cycle T 2, then described neighbor node is deleted from the neighbor table of this node.
Further, in order to the next-hop node overcome selected by the right-hand rule in the correcting strategy of existing greedy routing agreement probably can towards the direction forwarding away from destination node, increase time delay, cause the defect causing packet loss because exhausting forwarding time, the correcting strategy of the present invention to greedy routing agreement improves, that is: current sending node is when selecting next-hop node, the node that chosen distance destination node is nearest in local neighbor node as next-hop node (if there is coordinator node in neighbor node, then prioritizing selection coordinator node is next-hop node), and when in all nodes in the communication range of sending node, sending node distance destination node is nearest, the neighbor node nearest from destination node direction is then selected to be next-hop node.
In sum, owing to have employed technique scheme, the invention has the beneficial effects as follows:
(1) the present invention is on the basis of original conventional routing protocols, propose to improve, combine based on the route in geographical position and the route of topology Network Based, point occasion is called, and makes full use of their advantage, utilizes minimum software and expense, add text delivery success rate, decrease time delay, decrease the jumping figure from source point to point of destination, improve the overall performance of network.
(2) correcting strategy of the greedy routing improved effectively reduces message towards delivering the possibility causing packet loss away from destination node.
(3) route selection method wide coverage of the present invention, can be applicable to the mobile radio network of all size fast and accurately.
Accompanying drawing explanation
Examples of the present invention will be described by way of reference to the accompanying drawings, wherein:
Fig. 1 is existing greedy routing schematic diagram, and in figure, dotted line represents node communication scope;
Fig. 2 is the right-hand rule schematic diagram in existing greedy routing;
Fig. 3 is in the specific embodiment of the invention, and regional area divides schematic diagram;
Fig. 4 is in the specific embodiment of the invention, the neighbor table inundation flow chart of node;
Fig. 5 is in the specific embodiment of the invention, the neighbor table broadcast flow chart of node;
Fig. 6 is in the specific embodiment of the invention, and node receives the process chart of neighbor table;
Fig. 7 is in the specific embodiment of the invention, the aging flow chart of network topology of localized region;
Fig. 8 is in the specific embodiment of the invention, and the neighbor table of node upgrades flow chart;
Fig. 9 is in the specific embodiment of the invention, the aging flow chart of neighbor table of node;
Figure 10 is in the specific embodiment of the invention, the correcting strategy schematic diagram of greedy routing.
Embodiment
All features disclosed in this specification, or the step in disclosed all methods or process, except mutually exclusive feature and/or step, all can combine by any way.
Arbitrary feature disclosed in this specification (comprising any accessory claim, summary and accompanying drawing), unless specifically stated otherwise, all can be replaced by other equivalences or the alternative features with similar object.That is, unless specifically stated otherwise, each feature is an example in a series of equivalence or similar characteristics.
The present invention is in order to realize combining based on the route in geographical position and the route of topology Network Based, first the density situation for node is needed to carry out the division of regional area, because in regional area (region that node density is large), the present invention adopts and carries out route based on signal source shortest path, so also need the network topology structure knowing this regional area.In whole network topology, density size judge mainly with neighbours' number of node as standard.When nodes neighbors number is more than or equal to definite value Q1 (according to the given Q1 of real network situation, usually 6 ~ 16 can be set as), then think that this node is in the large regional area of density, otherwise think that this node is positioned at outside the large regional area of density, for vehicular ad hoc network, Fig. 3 gives the schematic diagram that marks off regional area, relates to two regional areas in figure altogether, regional area I, regional area II.See Fig. 4,5,6, the Establishing process of the network topology of regional area is as follows:
(1) each node periodically judges in its neighbor table, whether neighbours' number is more than or equal to certain value Q1, node checks operating to start judgement from message of neighbours' number by periodically producing, in the present invention, node can produce multiple different operating from message, as for check neighbours' number from message, for aging neighbor table from message, for aging regional area network topology from message etc.;
(2) if neighbours' number of certain node (as node A) is more than or equal to certain value Q1, so by the neighbor table of broadcast inundation node A, in this broadcast, timestamp is comprised;
(3) time that the receiving node (as Node B) receiving message (above-mentioned broadcast) produces according to message, namely the timestamp comprised in above-mentioned broadcast, first judge whether to have received this message, if not, then upgrade network topology structure, the i.e. positional information of more new node A, and the syntople neighbor table of node A being transferred to node A stores; Otherwise delete the message received;
(1.4) if Node B neighbours number is more than or equal to certain value Q1, so neighbor table of Node B inundation node A again, namely broadcasts the message received.
Because the high dynamic of network self, so these regional areas that the present invention sets up also are dynamic, along with the motion Local network topology of node produces, the local topology established along with the motion of node also can be aging, to guarantee accuracy of the present invention further, see Fig. 7, concrete aging flow process is:
First, node with cycle T 1 (the value practical situations of T1, is generally 1s ~ 1.5s) produce aging topology from message, should to be used for the network topology of aging regional area from message, often cross the T1 time produce an aging topology from message;
Get t2 and represent current time, t1 represents that node A receives the time of the neighbor table message of Node B, as t2-t1 >=T1, is deleted by the syntople of Node B from the local topology of node A.
Be no matter with based on geographical position route or select route based on topology, whether the maintenance of neighbor table directly affects the success rate of text delivery in real time, the renewal of traditional neighbor table and the aging number according to received message, when the message number that node receives reaches certain value M (given according to real network), aging neighbor table.But for the dynamic mobile radio network of height, because node density distribution is very uneven, be difficult to a given specific value and meet global network, when M value is larger, in the region that node density is sparse, it is very slow that message number reaches M required time, some nodes move out range for wireless communication, but message number does not reach M value, neighbor table does not also have aging, and this node is also present in neighbor table; When M value is less, in the region that node density is large, message number can reach M soon, and neighbor table is aging too fast.The maintenance causing neighbor table is real-time not, and the present invention improves existing neighbor table real-time servicing method, mainly comprises the renewal of neighbor table and aging, to guarantee real-time and the accuracy of neighbor table.
See Fig. 8, the more new technological process of neighbor table is as follows:
(1), after node location changes, broadcast position information, comprises the timestamp that information produces in this information;
(2) node receiving this information preserves the positional information of above-mentioned node immediately, and upgrades neighbor table, wherein comprises the timestamp that neighbours upgrade in neighbor table.
See Fig. 9, the Real time aging flow process of neighbor table is as follows:
(3) to produce neighbor table with cycle T 2 (the value practical situations of T2, is generally 1s ~ 1.5s) aging from message for node, for starting the operation of aging neighbor table;
(4) get t3 and represent current time, t4 represents that node A receives the last position of Node B and changes and the time of broadcasting packet, as t3-t4 >=T2, Node B is deleted from the neighbor table of node A.
In the present invention, if current sending node is in regional area, then sending node carries out route based on signal source shortest path, so-called signal source shortest path, namely for calculating the shortest path that a node can reach to other all nodes.Calculate according to increasing lengths, source point, to the path of other node, first obtains a path the shortest, and the secondary short shortest path in path is obtained in the shortest path of each reference, as conventional dijkstra's algorithm.In the present invention, in the regional area that density is large, when node carries out Route Selection based on signal source shortest path, there are two kinds of possibilities: a kind of is while the network topology of regional area establishes, the shortest path of each point to other nodes is calculated real-time dynamicly according to signal source shortest path algorithm, and stored in the routing table, directly search during route; Another be node when route, call the shortest path that signal source shortest path algorithm directly searches out point of destination.
And in non local region, i.e. low density region, route is carried out based on geographical position, namely can be existing based on geographic routing agreement, also can be the greedy routing agreement that the present invention improves, the improvement of the present invention to existing greedy routing agreement is the improvement of correcting strategy, when this node is absorbed in local optimum pattern, the neighbor node nearest from destination node direction is always selected to be next-hop node, namely selected neighbor node is: sending node and this neighbor node place straight line, minimum with the angle of sending node and destination node place straight line.See Figure 10, node A is sending node, node for the purpose of node D, and Node B, C, M are the neighbor node of node A, θ
1, θ
2, θ
3be respectively the straight line at Node B, C, M and node A place, with the angle of node A and node D place straight line.If according to the existing right-hand rule, then Node B can be selected to be next-hop node, but Node B direction is away from destination node D, in the repeating process probably below because exhausting forwarding time packet loss; Based on correcting strategy of the present invention be then select node M be next-hop node because angle theta
3be wherein minimum, namely in all neighbor nodes (Node B, C, M) of node A, node M is nearest from destination node direction.Thus overcome the defect of the right-hand rule towards the direction forwarding message away from destination node, effectively reduce because exhaust the probability that forwarding time causes packet loss.The correcting strategy that the present invention improves is applied in existing GPSR or GPCR agreement, GPSR+, GPCR+ agreement that can be improved.Based on the scheme implementation of GPSR+, GPCR+, depend on the real-time geographical locations information of this node (current sending node), neighbor node and destination node, each node can be equipped with GPS or other local services, thus node can obtain the positional information of oneself quickly and easily, the positional information of neighbor node periodically exchanges geographical location information by contiguous node and obtains, and the positional information of destination node is obtained by the content in packet.
In general due to the stop of barrier in city and the restriction of range for wireless communication, the regional area that each density is large is not too large, but do not get rid of the appearance having special circumstances, when the scope of regional area is larger, namely interstitial content is more, because unit shortest path first needs positional information and the syntople of knowing all nodes of regional area, at this moment can adopt OSPF (OpenShortest Path First ospf) subregion agreement that regional area large for scope is noticed topology information by subregion, be unlikely to cause network congestion in these large-scale regional areas.The regional area node number calling OSPF subregion agreement is determined according to network condition, can be set to 200 in the present invention, when the network node of certain regional area is more than 200, calls OSPF subregion agreement and carries out subregion to this regional area.
Embodiment 1
For vehicular ad hoc network, the concrete steps realizing Route Selection of the present invention are as follows:
S101: node receives unicast message;
S102: if the destination node of message is not this node, so need route;
S103: judge this node whether in regional area, namely whether neighbours' number of this node is more than or equal to definite value Q1 (in the present embodiment, Q1 is taken as 8), if so, then performs S103-1; Otherwise, perform S103-2;
S103-1: adopt dijkstra's algorithm to carry out route, if routing failure, illustration purpose node, not in this regional area, so performs step S103-2;
S103-2: adopt GPCR+ algorithm to carry out route, if routing failure (namely node is within the forwarding time of received message, fails text delivery success), so performs step S103-3.
S103-3: store this message, after timing a period of time T (time, T was given according to real network, usually can be set to 0.2s-1s, was set to 0.5s in the present embodiment 1), performs step S103 again.If after failure 5 times, or routing failure, so delete this message.
Embodiment 2
When source point and point of destination are apart from too far away, affect by the stop etc. of barrier in radio propagation distance and urban environment, message dropping phenomenon can be more serious.Routing algorithm of the present invention can be introduced roadside unit RSU and assist, improve source point and point of destination too far away time defect.RSU only has and E-Packets in both cases, and be that GPCR+ routing forwarding is absorbed in local optimum, source node and destination node apart from time too far away respectively, RSU does not participate in the Route Selection of regional area.The RSU that the present invention introduces exists two kinds: common RSU and center RSU.
Common RSU: be made up of wireless module and wired module, wireless module communicates with common vehicle, wireline side communicates with center RSU.Its distribution is determined by the coverage of radio communication.Common RSU plays the part of the role of message repeating, the message that its reception vehicle and center RSU send, and forwards.
Center RSU: only have wired module, only communicate with common RSU, record the positional information of all common RSU, center RSU receives only the message that common RSU sends, and the common RSU that then chosen distance destination node is nearest forwards as down hop.
Wireless interaction flow process between common vehicle and common RSU is:
(1) common vehicle wirelessly sends data to common RSU;
(2) common RSU is wirelessly to common vehicle return data.
Wired interaction flow of common RSU and center RSU is:
(1) common RSU sends data by wired mode to center RSU;
(2) center RSU by wired mode to common RSU return data.
In the present invention, RSU only has the forwarding participating in message in the following two cases, and the flow process of common RSU, center RSU, vehicle process message is as follows:
(1) when using GPCR+ algorithm, message repeating is absorbed in local optimum, when starting reparation pattern, if have RSU in the neighbours of this node, then message is mail to from the nearest RSU of this node (select from the RSU that this node is nearest be next-hop node), improve message and send success rate; Otherwise repair according to the correcting strategy of GPCR+ of the present invention;
(2) when the distance between this node and destination node exceedes certain limit, if there is RSU in the neighbor node of this node, then message is mail to from the nearest RSU of this node, utilize RSU to carry out message repeating, reduce the probability of message dropping.
The vehicular ad hoc network Message processing concrete steps that the present invention is based on RSU auxiliary are as follows:
S201: node receives unicast message;
S202: if the destination node of message is not this node, so need route;
S203: judge whether the distance of this node and destination node is greater than definite value d,
If not, then judge this node more whether in regional area, if so, then perform step S204; Otherwise perform step S205;
S204: adopt dijkstra's algorithm to carry out route, if routing failure, illustration purpose node, not in this regional area, so performs step S205;
S205: carry out route based on GPCR+ Routing Protocol of the present invention, common RSU, center RSU, specific as follows:
S205-1: judge whether the neighbor node of sending node has RSU, if having, then performs step S205-2; Otherwise perform step S205-3;
S205-2: sent to by message from the nearest RSU of this node, if described RSU is common RSU, then sends to center RSU by message; Message sends to from the nearest RSU of this node by Zai You center RSU, then performs step S205-3;
S205-3: adopt GPCR agreement to carry out route, if be absorbed in local optimum, then judge whether the neighbor node of current sending node exists RSU, if so, then perform step S205-4; Otherwise, perform step S205-5;
S205-4: sent to by message from the nearest RSU of this node, if described RSU is common RSU, then sends to center RSU by message; Message sends to from the nearest RSU of this node by Zai You center RSU, then continues to perform step S205-3;
S205-5: the reparation pattern adopting GPCR+, namely selects the neighbor node nearest from destination node direction to be next-hop node;
S206: if routing failure, so store this message, and after timing a period of time, again perform step S205.If routing failure number of times exceedes predetermined threshold value N (in the present embodiment, N gets 5), as when accumulative repeated execution of steps 205 is more than 5 times, so delete this message.
The present invention is not limited to aforesaid embodiment.The present invention expands to any new feature of disclosing in this manual or any combination newly, and the step of the arbitrary new method disclosed or process or any combination newly.
Claims (10)
1. an optimization method for mobile radio network Route Selection, is characterized in that, comprises the following steps:
Step 1: the network topology building regional area:
Each node periodically judges whether the neighbours' number in the neighbor table of this node is more than or equal to definite value Q1, if so, the neighbor table of then this node of inundation;
Each receiving node is according to the syntople of described neighbor table at the current sending node of local maintenance, if neighbours' number of receiving node is more than or equal to definite value Q1, then and the neighbor table of the current sending node of described receiving node inundation;
Step 2: the Route Selection of sending node:
Step 201: judge whether neighbours' number of sending node is more than or equal to definite value Q1, if so, then according to the network topology of the regional area of sending node, carries out route based on signal source shortest path, if routing failure, then performs step 202;
Step 202: according to the neighbor node of sending node, sending node and the geographical location information of message destination node, the Routing Protocol based on geographical position carries out route, if routing failure, then performs step 203;
Step 203: sending node stores message to be sent, and after timet, perform step 201.
2. optimization method as claimed in claim 1, in described step 1, each node is every cycle T 1, burin-in process is carried out to the network topology of the regional area of this node: getting the time that this section point receives the neighbor table message of neighbor node is t1, the current time of burin-in process is t2, if the difference of described t2, t1 is greater than cycle T 1, then the syntople of described neighbor node is deleted from the network topology of the regional area of this node.
3. optimization method as claimed in claim 1, the attended operation of the neighbor table of each node is:
The periodic broadcast node positional information of each node, comprises the timestamp that information produces in described positional information;
Each receiving node, according to received positional information, upgrades neighbor table, comprises the timestamp that neighbours upgrade in described neighbor table;
Each node is every cycle T 2, start burin-in process to the neighbor table of this node: getting the time that this section point receives the positional information of neighbor node is t3, the time of current startup burin-in process is t4, if the difference of described t3, t4 is greater than cycle T 2, then described neighbor node is deleted from the neighbor table of this node.
4. the optimization method as described in claim 1,2 or 3, in step 202, the Routing Protocol based on geographical position carries out route and is: the sending node node that chosen distance destination node is nearest in local neighbor node is as next-hop node; When in all nodes in the communication range of sending node, sending node distance destination node is nearest, then select the neighbor node nearest from destination node direction to be next-hop node.
5. the optimization method as described in claim 1,2 or 3, in step 202, the Routing Protocol based on geographical position carries out route and is:
If there is coordinator node in the neighbor node of sending node, then described coordinator node is selected to be next-hop node;
Otherwise the sending node node that chosen distance destination node is nearest in local neighbor node is as next-hop node; When in all nodes in the communication range of sending node, sending node distance destination node is nearest, then select the neighbor node nearest from destination node direction to be next-hop node.
6. the optimization method of Route Selection as claimed in claim 5, described mobile radio network is the vehicular ad hoc network with roadside unit RSU,
In all nodes in the communication range of sending node, when sending node distance destination node is nearest, first judge whether have RSU in the neighbor node of this node,
If not, then the neighbor node that chosen distance destination node direction is nearest is next-hop node;
If so, then selecting from the RSU that this node is nearest is next-hop node, if described RSU is common RSU, then selects center RSU to be next-hop node; The common RSU nearest by center RSU chosen distance destination node is next-hop node, continues to perform step 202.
7. the optimization method of Route Selection as claimed in claim 1, before the described step 201 of execution, first judges whether sending node and destination node be apart from being greater than preset value d, if not, then and execution step 201; If so, directly step 202 is performed;
In described step 202, the Routing Protocol based on geographical position carries out route and comprises the following steps:
Step 202-1: judge whether the neighbor node of sending node has RSU, if having, then performs step 202-2; Otherwise perform step 202-3;
Step 202-2: selecting from the RSU that this node is nearest is next-hop node, if described RSU is common RSU, then selects center RSU to be next-hop node; The common RSU nearest by center RSU chosen distance destination node is next-hop node, performs step 202-3;
Step 202-3: adopt GPCR agreement to carry out route, if be absorbed in local optimum, then judge whether the neighbor node of current sending node exists RSU, if so, then perform step 202-4; Otherwise, perform step 202-5;
Step 202-4: selecting from the RSU that this node is nearest is next-hop node, if described RSU is common RSU, then selects center RSU to be next-hop node; The common RSU nearest by center RSU chosen distance destination node is next-hop node, continues to perform step 202-3;
Step 202-5: select the neighbor node nearest from destination node direction to be next-hop node;
In described step 203, after timet, step 202-1 is performed.
8. the optimization method as described in claim 1,6 or 7, in described step 203, setting routing failure frequency threshold value N, if routing failure number of times exceedes threshold value N, then deletes message to be sent.
9. the optimization method as described in claim 1,2,3 or 7, in step 201, obtains the signal source shortest path of sending node in the network topology of described regional area according to Di Jiesitela dijkstra's algorithm.
10. optimization method as claimed in claim 9, in step 1, when the node of described regional area exceedes set point Q2, then localized region carries out subregion, subregion advertise network topology information.
Priority Applications (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN201310128022.1A CN103200642B (en) | 2013-04-12 | 2013-04-12 | A kind of optimization method of mobile radio network Route Selection |
Applications Claiming Priority (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN201310128022.1A CN103200642B (en) | 2013-04-12 | 2013-04-12 | A kind of optimization method of mobile radio network Route Selection |
Publications (2)
| Publication Number | Publication Date |
|---|---|
| CN103200642A CN103200642A (en) | 2013-07-10 |
| CN103200642B true CN103200642B (en) | 2015-08-19 |
Family
ID=48722961
Family Applications (1)
| Application Number | Title | Priority Date | Filing Date |
|---|---|---|---|
| CN201310128022.1A Expired - Fee Related CN103200642B (en) | 2013-04-12 | 2013-04-12 | A kind of optimization method of mobile radio network Route Selection |
Country Status (1)
| Country | Link |
|---|---|
| CN (1) | CN103200642B (en) |
Families Citing this family (12)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN103458517B (en) * | 2013-09-09 | 2015-12-23 | 电子科技大学 | A kind of vehicular ad hoc network list interface multichannel changing method |
| CN103501525B (en) * | 2013-09-23 | 2017-03-15 | 北京矿冶研究总院 | Networking method and communication system of emergency communication network for mining area |
| CN103781148B (en) * | 2014-02-25 | 2016-12-21 | 重庆邮电大学 | Stable cluster method for routing based on link-aware in vehicular ad hoc network |
| CN103929715B (en) * | 2014-04-23 | 2017-12-19 | 北京智谷睿拓技术服务有限公司 | Broadcast scheduling method and car-mounted terminal |
| CN105554120A (en) * | 2015-12-18 | 2016-05-04 | 宇龙计算机通信科技(深圳)有限公司 | Data transmission method and data transmission device for vehicle communication, road side units |
| CN109936603B (en) * | 2017-12-18 | 2022-07-01 | 本无链科技(深圳)有限公司 | Non-direct connection network communication method based on HTTP |
| CN108449776B (en) * | 2018-02-27 | 2023-09-05 | 深圳市亚特联科技有限公司 | Network path planning method, node equipment and computer storage medium |
| CN108988496B (en) * | 2018-08-01 | 2021-04-23 | 南方电网科学研究院有限责任公司 | Intelligent substation secondary system fault diagnosis method, device and equipment |
| CN109784526B (en) * | 2018-12-05 | 2023-02-28 | 阿波罗智能技术(北京)有限公司 | Method, device and equipment for planning traffic path and readable storage medium |
| CN109660465B (en) * | 2019-02-14 | 2022-06-10 | 华南理工大学 | Road side unit assisted Internet of vehicles load balancing routing method |
| CN110167097B (en) * | 2019-04-22 | 2024-02-20 | 北京邮电大学 | Mobile robot relay routing method based on weighted metric forwarding and path planning |
| CN113923151B (en) * | 2021-11-03 | 2023-03-24 | 苏州阿尔山数字科技有限公司 | Routing addressing method based on LEI coding |
Citations (3)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN101383768A (en) * | 2008-10-21 | 2009-03-11 | 上海第二工业大学 | Vehicle network data routing method based on digital map and mobile prediction |
| CN101720059A (en) * | 2009-11-05 | 2010-06-02 | 浙江大学城市学院 | Method for realizing vehicle-mounted mobile self-organized network routing |
| US7812718B1 (en) * | 2005-11-21 | 2010-10-12 | The Hong Kong University Of Science And Technology | Distributed position estimation for wireless sensor networks |
-
2013
- 2013-04-12 CN CN201310128022.1A patent/CN103200642B/en not_active Expired - Fee Related
Patent Citations (3)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| US7812718B1 (en) * | 2005-11-21 | 2010-10-12 | The Hong Kong University Of Science And Technology | Distributed position estimation for wireless sensor networks |
| CN101383768A (en) * | 2008-10-21 | 2009-03-11 | 上海第二工业大学 | Vehicle network data routing method based on digital map and mobile prediction |
| CN101720059A (en) * | 2009-11-05 | 2010-06-02 | 浙江大学城市学院 | Method for realizing vehicle-mounted mobile self-organized network routing |
Non-Patent Citations (3)
| Title |
|---|
| LOUVRE: Landmark Overlays for Urban Vehicular Routing Environments;Kevin C. Lee ET AL.;《IEEE 68th Vehicular Technology Conference, 2008. VTC 2008-Fall.》;20080924;第1-5页 * |
| 基于位置信息的VANET路由协议的研究;刘秋焕;《中国优秀硕士学位论文全文数据库 信息科技辑》;20130115(第1期);I136-618 * |
| 车载Ad hoc网络中基于车辆流密度的GPSR协议的改进研究;王志刚;《中国优秀硕士学位论文全文数据库 信息科技辑》;20120915(第9期);I136-218 * |
Also Published As
| Publication number | Publication date |
|---|---|
| CN103200642A (en) | 2013-07-10 |
Similar Documents
| Publication | Publication Date | Title |
|---|---|---|
| CN103200642B (en) | A kind of optimization method of mobile radio network Route Selection | |
| Shah et al. | Predictive location-based QoS routing in mobile ad hoc networks | |
| US10631228B2 (en) | Information dissemination in a multi-technology communication network | |
| Chen et al. | A connectivity-aware intersection-based routing in VANETs | |
| Nzouonta et al. | VANET routing on city roads using real-time vehicular traffic information | |
| Tsiachris et al. | Junction-based geographic routing algorithm for vehicular ad hoc networks | |
| Qin et al. | Vehicloud: Cloud computing facilitating routing in vehicular networks | |
| CN101547491B (en) | Routing method for mobile ad hoc network system | |
| Dhankhar et al. | VANETs: a survey on routing protocols and issues | |
| Lee et al. | A hybrid traffic geographic routing with cooperative traffic information collection scheme in VANET | |
| CN104202724B (en) | A kind of AANET joint route algorithms based on geographical location information | |
| CN104185239A (en) | Intersection routing method in vehicle self-organized network on the basis of path segment length | |
| De Rango et al. | A modified location-aided routing protocol for the reduction of control overhead in ad-hoc wireless networks | |
| Ramamoorthy et al. | An enhanced bio-inspired routing algorithm for vehicular ad hoc networks | |
| Sharma et al. | A contemporary proportional exploration of numerous routing protocol in VANET | |
| CN110943926B (en) | MPR backup method based on link lifetime | |
| KR101288101B1 (en) | Method and mobile node for routing in mobile wireless network system | |
| Latiff et al. | Power reduction quadrant-based directional routing protocol (Q-DIR) in mobile ad hoc network | |
| Garrosi | Enhanced intersection-based perimeter geo-routing in urban vehicular ad-hoc networks | |
| Shih et al. | Core location-aided cluster-based routing protocol for mobile ad hoc networks | |
| Yang et al. | Improving Route Stability in Mobile Ad hoc Networks Based on Link Lifetime. | |
| Barati et al. | A review of coverage and routing for wireless sensor networks | |
| Sun et al. | Zone-based greedy perimeter stateless routing for VANET | |
| CN102316550B (en) | Wireless terminal dynamic access method | |
| Vinayakray-Jani et al. | Routing protocols for mobile and vehicular Ad-Hoc networks: A comparative analysis |
Legal Events
| Date | Code | Title | Description |
|---|---|---|---|
| C06 | Publication | ||
| PB01 | Publication | ||
| C10 | Entry into substantive examination | ||
| SE01 | Entry into force of request for substantive examination | ||
| C14 | Grant of patent or utility model | ||
| GR01 | Patent grant | ||
| CF01 | Termination of patent right due to non-payment of annual fee |
Granted publication date: 20150819 Termination date: 20190412 |
|
| CF01 | Termination of patent right due to non-payment of annual fee |