CN102347991B - Method for constructing vehicular network - Google Patents
Method for constructing vehicular network Download PDFInfo
- Publication number
- CN102347991B CN102347991B CN 201110375013 CN201110375013A CN102347991B CN 102347991 B CN102347991 B CN 102347991B CN 201110375013 CN201110375013 CN 201110375013 CN 201110375013 A CN201110375013 A CN 201110375013A CN 102347991 B CN102347991 B CN 102347991B
- Authority
- CN
- China
- Prior art keywords
- bunch
- node
- nodes
- oneself
- new
- 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
Images
Abstract
The invention provides a method for constructing a vehicular network, wherein the vehicular network is provided with three types of nodes, consisting of cluster head nodes, intra-cluster nodes and isolated nodes. The intra-cluster nodes includes cluster association nodes and normal intra-cluster nodes, wherein the cluster association node is used for connecting two cluster head nodes for achieving route transfer function; the normal intra-cluster node is used for collecting, processing and monitoring data, and does not has the route transfer function; vehicles driving in same road and same direction are marked as the cluster head node and the intra-cluster nodes in one cluster, the topological structure of the cluster head node and the intra-cluster nodes is star-shaped, and the cluster head node can reach each intra-cluster node by one jump; the topological structure of the cluster head node and the cluster association node is linear, and the route of the vehicular network is achieved by the linear structure. According to the invention, after the vehicular network is established, the vehicles in the vehicular network can communicate with one another for obtaining corresponding information, such as road traffic information and the like, so as to avoid the jamming of the road.
Description
Technical field
The present invention relates to a kind of construction method of network, in particular a kind of construction method of In-vehicle networking.
Background technology
Vehicular ad hoc network becomes the focus of research because its practicality has been subjected to extensive concern.Along with continuous maturation and the development of vehicle-mounted net, it has become the inexorable trend of future development.
Realize the key issue that In-vehicle networking at first needs to solve is exactly how to make up the In-vehicle networking architecture, makes the route power consumption still less, postpones shorter.
Present existing mobile ad hoc network construction method is applied to and also has some problems in the In-vehicle networking, and main cause is as follows:
1) communication cost of existing construction method strengthens, and along with number of nodes growths that be directly proportional, so vehicle-mounted net is paralysed;
2) the control information overhead data packet of existing construction method is bigger, because In-vehicle networking mobile node speed is very fast, so data packet number may cause the lot of data packet loss when big, thus therefore communication disruption.
Therefore it is low to need to propose a kind of expense, the In-vehicle networking construction method of good stability.
Summary of the invention
Goal of the invention: technical problem to be solved by this invention is at the deficiencies in the prior art, and a kind of construction method of In-vehicle networking is provided.
Technical scheme: the invention discloses a kind of construction method of In-vehicle networking, three types node is set in described In-vehicle networking: bunch first node, bunch interior nodes and isolated node, all nodes have the ID of uniqueness;
Described isolated node is not for both being labeled as the node that bunch first node is not labeled as bunch interior nodes yet;
Described bunch of interior nodes comprises bunch associated nodes and common bunch of interior nodes, and described bunch of associated nodes connects two bunches of first nodes, realizes route forwarding function; Bunch associated nodes receives only bunch data that first node is transmitted, and does not receive the information that common bunch of interior nodes sends; Common bunch of interior nodes is used for data acquisition, data processing and data monitoring, do not carry out routing forwarding;
The topological structure of described bunch of first node and bunch associated nodes is linear structure, and the route of described In-vehicle networking realizes by described linear structure;
Described In-vehicle networking comprises an above subnet, and a subnet is formed by a plurality of bunches; The linear structure that corresponding a plurality of bunches of subnet, bunch first node and bunch associated nodes constitute;
Described bunch of first node is used for realizing routing forwarding, and the data that common bunch of interior nodes sends at first send to this bunch bunch first node, bunch first node again with the data routing forwarding to destination node;
Bunch first node and bunch interior nodes in the marking of cars of same road and same direction running is one bunch, its topological structure is star-like, bunch first node is that a jumping can reach with bunch interior nodes;
Bunch first node, bunch interior nodes and isolated node periodic broadcasting message, the message load is the number of node types and neighbours' bunch first node or bunch associated nodes; Node calculates other node and the relative position of oneself according to the broadcast that receives, and namely judges whether at same road and same direction running.
By above-mentioned In-vehicle networking construction method, can reduce the communication overhead in the In-vehicle networking building process effectively, because be that vehicle at same road and same direction running is configured to bunch and linear structure, so the architecture of In-vehicle networking is more stable.
In the method for the invention, when node enters vehicle-mounted net, its initial condition is set to isolated node, if described isolated node does not receive that the broadcast of any bunch of first node or bunch associated nodes and its ID value are all littler than the ID value of all neighbours' isolated nodes in setting-up time, then described isolated node is set up bunch according to following steps:
Step 301: beginning;
Step 302: isolated node will oneself be designated the start node of bunch first node and linear structure;
Step 303: with bunch first node after the isolated node of same road and same direction running is received bunch first node broadcasts message, will oneself be designated a bunch interior nodes;
Step 304: it (is that automobile node travel direction is 0 degree that bunch first node is selected with own relative angle maximum according to this bunch bunch interior nodes broadcast, about respectively be negative positive 180 degree) and distance bunch interior nodes farthest as a bunch associated nodes, and to described bunch of interior nodes transmission foundation bunch associated nodes message, simultaneously described bunch of interior nodes is labeled as the descendant node of oneself;
Wherein, relative angle is benchmark with the travel direction, and travel direction represents 0 degree, about respectively be negative positive 180 degree.
Step 305: after a bunch interior nodes is received and set up bunch associated nodes message, a bunch associated nodes will oneself be designated, and be the forerunner's node of oneself with bunch first vertex ticks, select simultaneously with own same road and same direction running and relative angle is maximum and distance isolated node farthest as new bunch first node, and to this isolated node transmission foundation bunch first node messages, simultaneously it is labeled as the descendant node of oneself;
Wherein, relative angle is benchmark with the travel direction, and travel direction represents 0 degree, about respectively be negative positive 180 degree.
Step 306: isolated node will oneself be designated a bunch first node after receiving and setting up bunch first node messages, bunch associated nodes is designated the forerunner's node of oneself;
Step 307: a bunch first node has judged whether neighbours' isolated node, if carry out step 303, otherwise carry out step 308;
Step 308: finish.
By the above-mentioned bunch of construction method with linear structure, realized minimizing of bunch first node, also realized minimizing of node in the linear structure, thereby reduced vehicle-mounted Netcom letter cost, also improved the stability of In-vehicle networking, reduce vehicle-mounted networking by cost, guaranteed correctness and the continuity of route.
In the method for the invention, if bunch interior nodes is not received the broadcast of bunch first node and other neighbor nodes in setting-up time, it then judges and breaks away from place bunch, and adds other bunches again or set up bunch oneself being labeled as isolated node.
In the said process, bunch interior nodes breaks away from time to add other bunches behind the place bunch or set up bunch can guarantee communication continuity and stability.
In the method for the invention, if bunch associated nodes is not received the broadcast of forerunner's node in the linear structure of place or other neighbor nodes in setting-up time, it then judges and breaks away from place bunch, adds other bunches again or sets up bunch oneself being labeled as isolated node;
Still can receive the broadcast of forerunner's node if bunch associated nodes is not received the broadcast of descendant node in the linear structure of place in setting-up time, then it will be labeled as a bunch interior nodes itself;
If a bunch first node H1 does not receive that in setting-up time the broadcast of descendant node A1 in the linear structure of place or descendant node A1 have changed a bunch interior nodes into, then it selects new bunch associated nodes to form new linear structure, and step is as follows:
Step 401: beginning
Step 402: bunch first node H1 be chosen in the descendant node H2 communication range of descendant node A1 and with own relative angle maximum and apart from farthest bunch interior nodes A3 as new bunch associated nodes, and to a bunch new bunch of associated nodes message of interior nodes A3 transmission, the message load is the ID value of descendant node A1 and the ID value of descendant node H2, simultaneously bunch interior nodes A3 is labeled as the descendant node of oneself;
Step 403: after a bunch interior nodes A3 receives new bunch of associated nodes message, a bunch associated nodes will oneself be designated, and bunch first node H1 is labeled as oneself forerunner's node, the descendant node with descendant node H2 is designated oneself is transmitted to descendant node H2 with new bunch of associated nodes message simultaneously;
Step 404: after descendant node H2 receives new bunch of associated nodes message, with the forerunner node of bunch interior nodes A3 as oneself;
Step 405: finish.
By said process, even losing efficacy, bunch associated nodes still can guarantee the stability of In-vehicle networking linear structure topological structure, communication continuity, the correctness of route and high efficiency.
In the method for the invention, if but bunch interior nodes is received the broadcast of bunch first node still can not receive the broadcast of neighbor node that bunch interior nodes judges that a bunch first node breaks away from place bunch so in setting-up time;
Break away from the broadcast that place bunch and its can receive forerunner's node and descendant node in bunch first node H place linear structure simultaneously if bunch interior nodes X detects bunch first node H, then bunch interior nodes X carries out following steps:
Step 501: beginning;
Step 502: bunch interior nodes X broadcasts new bunch of first node messages in a jumping scope, and the message load is the ID value of bunch first node H and the ID value of oneself;
Step 503: behind setting-up time, bunch interior nodes X judges whether to receive new bunch of first node messages of other bunches interior nodes broadcasting in this bunch, if carry out step 504, otherwise carry out step 505;
Step 504: bunch interior nodes X judges that bunch interior nodes ID value in the new bunch of first node messages of receiving is whether all less than oneself ID value, if carry out step 505, otherwise carry out step 510;
Step 505: bunch interior nodes X then is labeled as oneself a bunch first node;
Step 506: judge whether bunch first node H is the start node of linear structure, if carry out step 507, otherwise carry out step 508;
Step 507: bunch interior nodes X will oneself be designated the start node of bunch chain;
Step 508: behind setting-up time, forerunner's node of bunch first node H or descendant node are checked the source node ID value of the new bunch of first node messages of receiving, bunch interior nodes that the ID value is minimum is as new descendant node or forerunner's node;
Step 509: behind setting-up time, check the source node ID value of the new bunch of first message of receiving with bunch first node H same bunch bunch interior nodes, bunch interior nodes that the ID value is minimum is as new bunch first node;
Step 510: finish.
By said process, though the stability that bunch first node failure still can be guaranteed bunch, thus guaranteed the stability of In-vehicle networking linear structure topological structure, improved communication continuity, the correctness of route and high efficiency.
In the method for the invention, if the descendant node of bunch first node H4 is a bunch associated nodes A2, the descendant node of bunch associated nodes A2 is a bunch first node H3, and bunch first node H4 and bunch first node H3 can direct communications, and a bunch first node H3 then carries out following operation and realizes bunch merging:
Step 601: beginning;
Step 602: bunch first node H3 sends new bunch of interior nodes message to bunch associated nodes A2, send new bunch of associated nodes message to a bunch first node H4, the load of new bunch of associated nodes message is the ID value of bunch associated nodes A2 and the ID value of oneself, simultaneously bunch first node H4 is labeled as the forerunner's node of oneself;
Step 603: after a bunch associated nodes A2 receives new bunch of interior nodes message, will oneself be designated a bunch interior nodes;
Step 604: after a bunch first node H4 receives new bunch of associated nodes message, bunch first node H3 is labeled as the descendant node of oneself, and will oneself be designated a bunch associated nodes, send new bunch of first node messages to its forerunner's node simultaneously;
Step 605: after forerunner's node is received new bunch of first node messages, will oneself be designated a bunch first node, send new bunch of associated nodes message to its forerunner's node simultaneously;
Step 606: after forerunner's node is received new bunch of associated nodes message, will oneself be designated a bunch associated nodes, send new bunch of first node messages to its forerunner's node simultaneously;
Step 607: forerunner's node judges whether the start node into linear structure, if carry out step 608, otherwise carry out step 605;
Step 608: finish.
Said process can be guaranteed minimizing of bunch first number of nodes, thereby has reduced communication overhead and routing cost.In bunch merging process, corresponding linear structure topological structure does not change, and has therefore increased the stability of linear structure, has improved communication continuity, the correctness of route and high efficiency.
In the method for the invention, under the initial condition, if bunch first node H6 and bunch first node H5 belong to different linear structures, and the descendant node A5 of bunch first node H6 is the end node of place linear structure, and the start node of bunch first node H5 place linear structure, and there is not isolated node between two linear structures;
If some isolated nodes between two linear structures, occurred, then carry out following operation to merge two linear structures, step is as follows:
Step 701: beginning;
Step 702: descendant node A5 select with own same road and same direction running and relative angle is maximum and distance isolated node farthest as new bunch first node, and to isolated node transmission foundation bunch first node messages, simultaneously it is labeled as the descendant node of oneself;
Step 703: isolated node will oneself be designated a bunch first node after receiving and setting up bunch first node messages, will send forerunner's node that bunch associated nodes of setting up bunch first node messages is designated oneself; With new bunch first node after the isolated node of same road and same direction running is received its broadcast, will oneself be designated a bunch interior nodes;
Step 704: a bunch interior nodes will oneself be designated a bunch associated nodes after receiving and setting up bunch associated nodes message, and will to send bunch first vertex ticks of setting up bunch associated nodes be the forerunner's node of oneself;
Step 705: bunch associated nodes judges whether to receive bunch broadcast of first node H5, if carry out step 707, otherwise carry out step 706;
Step 706: bunch associated nodes select with own same road and same direction running and relative angle is maximum and distance isolated node farthest as new bunch first node, and to isolated node transmission foundation bunch first node messages, simultaneously it is labeled as the descendant node of oneself, carry out step 703;
Step 707: bunch associated nodes after a bunch first node H5 receives the broadcast of bunch associated nodes, is labeled as bunch associated nodes the forerunner's node of oneself with the descendant node that bunch first node H5 is labeled as oneself;
Step 708: finish.
Said process can be guaranteed minimizing of number of nodes in the linear structure, thereby has reduced communication overhead and routing cost.In the linear structure merging process, linear structure topological structure does not originally change, and has therefore increased the stability of linear structure, has improved communication continuity, the correctness of route and high efficiency.
Beneficial effect: the invention provides a kind of construction method of In-vehicle networking, after In-vehicle networking makes up, thereby the vehicle in the In-vehicle networking can communicate the corresponding information of obtaining, thereby avoids road congested such as obtaining traffic information.
Description of drawings
Below in conjunction with the drawings and specific embodiments the present invention is done further to specify, above-mentioned and/or otherwise advantage of the present invention will become apparent.
Fig. 1 is In-vehicle networking topological structure schematic diagram of the present invention.
Fig. 2 is the schematic flow sheet that isolated node of the present invention is set up bunch.
Fig. 3 is the schematic flow sheet of new bunch of associated nodes of selection of the present invention.
Fig. 4 is the schematic flow sheet of new bunch of first node of selection of the present invention.
Fig. 5 is of the present invention bunch and merges schematic flow sheet.
Fig. 6 is that linear structure of the present invention merges schematic flow sheet.
Embodiment:
The invention provides a kind of construction method of In-vehicle networking, described In-vehicle networking adopts the linear topology structure, has shortened the address configuration delay, has reduced the address configuration power consumption, simultaneously, realizes route by linear structure, has reduced the route power consumption, has shortened the route delay.
As shown in Figure 1, three types node is set in described In-vehicle networking: bunch first node 1, bunch interior nodes and isolated node 3, all nodes have the ID of uniqueness.3 at described isolated joint is both not to be labeled as the node that bunch first node 1 is not labeled as bunch interior nodes yet.Described bunch of interior nodes comprises bunch associated nodes 6 and common bunch of interior nodes 2, and described bunch of associated nodes connects two bunches of first nodes, realizes route forwarding function.Bunch associated nodes 6 receives only bunch data that first node 1 is transmitted, and does not receive the information that common bunch of interior nodes sends; Common bunch of interior nodes 2 is used for data acquisition, data processing and data monitoring, do not carry out routing forwarding.The topological structure of described bunch of first node 1 and bunch associated nodes 6 is linear structure 7, and the route of described In-vehicle networking realizes by described linear structure 7; Described In-vehicle networking comprises that 5, one subnets 5 of an above subnet form by a plurality of bunches 4; Subnet 5 comprises the linear structure 7 that a plurality of bunches 4, bunch first node 1 and bunch associated nodes 6 constitute.Described bunch of first node 1 is used for realizing routing forwarding, and the data that common bunch of interior nodes sends at first send to this bunch bunch first node 1, bunch first node 1 again with the data routing forwarding to destination node; Bunch first node 1 and bunch interior nodes in the marking of cars of same road and same direction running is one bunch, its topological structure is star-like, bunch first node 1 is that a jumping can reach with bunch interior nodes; Bunch first node 1, bunch interior nodes and isolated node 3 periodic broadcasting message, the message load is the number of node types and neighbours' bunch first node or bunch associated nodes; Node calculates other node and the relative position of oneself according to the broadcast that receives, and namely judges whether at same road and same direction running.
As shown in Figure 2, when node enters vehicle-mounted net, its initial condition is set to isolated node, if described isolated node does not receive that the broadcast of any bunch of first node or bunch associated nodes and its ID value are all littler than the ID value of all neighbours' isolated nodes in setting-up time, then described isolated node is set up bunch according to following steps:
Step 301: beginning;
Step 302: isolated node will oneself be designated the start node of bunch first node and linear structure;
Step 303: with bunch first node after the isolated node of same road and same direction running is received bunch first node broadcasts message, will oneself be designated a bunch interior nodes;
Step 304: bunch first node selects with own relative angle maximum and distance bunch interior nodes farthest as a bunch associated nodes according to this bunch bunch interior nodes broadcast, and to described bunch of interior nodes transmission foundation bunch associated nodes message, simultaneously described bunch of interior nodes is labeled as the descendant node of oneself;
Step 305: after a bunch interior nodes is received and set up bunch associated nodes message, a bunch associated nodes will oneself be designated, and be the forerunner's node of oneself with bunch first vertex ticks, select simultaneously with own same road and same direction running and relative angle is maximum and distance isolated node farthest as new bunch first node, and to this isolated node transmission foundation bunch first node messages, simultaneously it is labeled as the descendant node of oneself;
Step 306: isolated node will oneself be designated a bunch first node after receiving and setting up bunch first node messages, bunch associated nodes is designated the forerunner's node of oneself;
Step 307: a bunch first node has judged whether neighbours' isolated node, if carry out step 303, otherwise carry out step 308;
Step 308: finish.
Fig. 3 is the schematic flow sheet of new bunch of associated nodes of selection of the present invention.If bunch associated nodes is not received the broadcast of forerunner's node in the linear structure of place or other neighbor nodes in setting-up time, it then judges and breaks away from place bunch, adds other bunches again or sets up bunch oneself being labeled as isolated node;
Still can receive the broadcast of forerunner's node if bunch associated nodes is not received the broadcast of descendant node in the linear structure of place in setting-up time, then it will be labeled as a bunch interior nodes itself;
If a bunch first node H1 does not receive that in setting-up time the broadcast of descendant node A1 in the linear structure of place or descendant node A1 have changed a bunch interior nodes into, then it selects new bunch associated nodes to form new linear structure, and step is as follows:
Step 401: beginning
Step 402: bunch first node H1 be chosen in the descendant node H2 communication range of descendant node A1 and with own relative angle maximum and apart from farthest bunch interior nodes A3 as new bunch associated nodes, and to a bunch new bunch of associated nodes message of interior nodes A3 transmission, the message load is the ID value of descendant node A1 and the ID value of descendant node H2, simultaneously bunch interior nodes A3 is labeled as the descendant node of oneself;
Step 403: after a bunch interior nodes A3 receives new bunch of associated nodes message, a bunch associated nodes will oneself be designated, and bunch first node H1 is labeled as oneself forerunner's node, the descendant node with descendant node H2 is designated oneself is transmitted to descendant node H2 with new bunch of associated nodes message simultaneously;
Step 404: after descendant node H2 receives new bunch of associated nodes message, with the forerunner node of bunch interior nodes A3 as oneself;
Step 405: finish.
Fig. 4 is the schematic flow sheet of new bunch of first node of selection of the present invention.If but bunch interior nodes do not receive the broadcast of bunch first node still can receive the broadcast of neighbor node in setting-up time, bunch interior nodes judges that a bunch first node breaks away from place bunch so;
Break away from the broadcast that place bunch and its can receive forerunner's node and descendant node in bunch first node H place linear structure simultaneously if bunch interior nodes X detects bunch first node H, then bunch interior nodes X carries out following steps:
Step 501: beginning;
Step 502: bunch interior nodes X broadcasts new bunch of first node messages in a jumping scope, and the message load is the ID value of bunch first node H and the ID value of oneself;
Step 503: behind setting-up time, bunch interior nodes X judges whether to receive new bunch of first node messages of other bunches interior nodes broadcasting in this bunch, if carry out step 504, otherwise carry out step 505;
Step 504: bunch interior nodes X judges that bunch interior nodes ID value in the new bunch of first node messages of receiving is whether all less than oneself ID value, if carry out step 505, otherwise carry out step 510;
Step 505: bunch interior nodes X then is labeled as oneself a bunch first node;
Step 506: judge whether bunch first node H is the start node of linear structure, if carry out step 507, otherwise carry out step 508;
Step 507: bunch interior nodes X will oneself be designated the start node of bunch chain;
Step 508: behind setting-up time, forerunner's node of bunch first node H or descendant node are checked the source node ID value of the new bunch of first node messages of receiving, bunch interior nodes that the ID value is minimum is as new descendant node or forerunner's node;
Step 509: behind setting-up time, check the source node ID value of the new bunch of first message of receiving with bunch first node H same bunch bunch interior nodes, bunch interior nodes that the ID value is minimum is as new bunch first node;
Step 510: finish.
Fig. 5 is of the present invention bunch and merges schematic flow sheet.If the descendant node of bunch first node H4 is a bunch associated nodes A2, the descendant node of bunch associated nodes A2 is a bunch first node H3, and bunch first node H4 and bunch first node H3 can direct communications, and a bunch first node H3 then carries out following operation and realizes bunch merging:
Step 601: beginning;
Step 602: bunch first node H3 sends new bunch of interior nodes message to bunch associated nodes A2, send new bunch of associated nodes message to a bunch first node H4, the load of new bunch of associated nodes message is the ID value of bunch associated nodes A2 and the ID value of oneself, simultaneously bunch first node H4 is labeled as the forerunner's node of oneself;
Step 603: after a bunch associated nodes A2 receives new bunch of interior nodes message, will oneself be designated a bunch interior nodes;
Step 604: after a bunch first node H4 receives new bunch of associated nodes message, bunch first node H3 is labeled as the descendant node of oneself, and will oneself be designated a bunch associated nodes, send new bunch of first node messages to its forerunner's node simultaneously;
Step 605: after forerunner's node is received new bunch of first node messages, will oneself be designated a bunch first node, send new bunch of associated nodes message to its forerunner's node simultaneously;
Step 606: after forerunner's node is received new bunch of associated nodes message, will oneself be designated a bunch associated nodes, send new bunch of first node messages to its forerunner's node simultaneously;
Step 607: forerunner's node judges whether the start node into linear structure, if carry out step 608, otherwise carry out step 605;
Step 608: finish.
Fig. 6 is that linear structure of the present invention merges schematic flow sheet.Under the initial condition, if bunch first node H6 and bunch first node H5 belong to different linear structures, and the descendant node A5 of bunch first node H6 is the end node of place linear structure, and the start node of bunch first node H5 place linear structure, and does not have isolated node between two linear structures;
If some isolated nodes between two linear structures, occurred, then carry out following operation to merge two linear structures, step is as follows:
Step 701: beginning;
Step 702: descendant node A5 select with own same road and same direction running and relative angle is maximum and distance isolated node farthest as new bunch first node, and to isolated node transmission foundation bunch first node messages, simultaneously it is labeled as the descendant node of oneself;
Step 703: isolated node will oneself be designated a bunch first node after receiving and setting up bunch first node messages, will send forerunner's node that bunch associated nodes of setting up bunch first node messages is designated oneself; With new bunch first node after the isolated node of same road and same direction running is received its broadcast, will oneself be designated a bunch interior nodes;
Step 704: a bunch interior nodes will oneself be designated a bunch associated nodes after receiving and setting up bunch associated nodes message, and will to send bunch first vertex ticks of setting up bunch associated nodes be the forerunner's node of oneself;
Step 705: bunch associated nodes judges whether to receive bunch broadcast of first node H5, if carry out step 707, otherwise carry out step 706;
Step 706: bunch associated nodes select with own same road and same direction running and relative angle is maximum and distance isolated node farthest as new bunch first node, and to isolated node transmission foundation bunch first node messages, simultaneously it is labeled as the descendant node of oneself, carry out step 703;
Step 707: bunch associated nodes after a bunch first node H5 receives the broadcast of bunch associated nodes, is labeled as bunch associated nodes the forerunner's node of oneself with the descendant node that bunch first node H5 is labeled as oneself;
Step 708: finish.
In sum, the invention provides a kind of construction method of In-vehicle networking, after this technique construction In-vehicle networking, thereby the vehicle in the In-vehicle networking can communicate the corresponding information of obtaining, thereby avoid road congested such as obtaining traffic information, therefore, present technique has very high promotional value.
The invention provides a kind of thinking of construction method of In-vehicle networking; method and the approach of this technical scheme of specific implementation are a lot; the above only is preferred implementation of the present invention; should be understood that; for those skilled in the art; under the prerequisite that does not break away from the principle 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.In the present embodiment not clear and definite each component part all available prior art realized.
Claims (5)
1. the construction method of an In-vehicle networking is characterized in that, three types node is set in described In-vehicle networking: bunch first node, bunch interior nodes and isolated node, and all nodes have the ID of uniqueness;
Described isolated node is not for both being labeled as the node that bunch first node is not labeled as bunch interior nodes yet;
Described bunch of interior nodes comprises bunch associated nodes and common bunch of interior nodes, and described bunch of associated nodes connects two bunches of first nodes, realizes route forwarding function; Bunch associated nodes receives only bunch data that first node is transmitted, and does not receive the information that common bunch of interior nodes sends; Common bunch of interior nodes is used for data acquisition, data processing and data monitoring, do not carry out routing forwarding;
The topological structure of described bunch of first node and bunch associated nodes is linear structure, and the route of described In-vehicle networking realizes by described linear structure;
Described In-vehicle networking comprises an above subnet, and a subnet is formed by a plurality of bunches; The linear structure that corresponding a plurality of bunches of subnet, bunch first node and bunch associated nodes constitute;
Described bunch of first node is used for realizing routing forwarding, and the data that common bunch of interior nodes sends at first send to this bunch bunch first node, bunch first node again with the data routing forwarding to destination node;
Bunch first node and bunch interior nodes in the marking of cars of same road and same direction running is one bunch, its topological structure is star-like, bunch first node is that a jumping can reach with bunch interior nodes;
Bunch first node, bunch interior nodes and isolated node periodic broadcasting message, the message load is the number of node types and neighbours' bunch first node or bunch associated nodes; Node calculates other node and the relative position of oneself according to the broadcast that receives, and namely judges whether at same road and same direction running;
If bunch interior nodes is not received the broadcast of bunch first node and other neighbor nodes in setting-up time, it then judges and breaks away from place bunch, and adds other bunches again or set up bunch oneself being labeled as isolated node;
When node enters vehicle-mounted net, its initial condition is set to isolated node, if described isolated node does not receive that the broadcast of any bunch of first node or bunch associated nodes and its ID value are all littler than the ID value of all neighbours' isolated nodes in setting-up time, then described isolated node is set up bunch according to following steps:
Step 301: beginning;
Step 302: isolated node will oneself be designated the start node of bunch first node and linear structure;
Step 303: with bunch first node after the isolated node of same road and same direction running is received bunch first node broadcasts message, will oneself be designated a bunch interior nodes;
Step 304: bunch first node selects with own relative angle maximum and distance bunch interior nodes farthest as a bunch associated nodes according to this bunch bunch interior nodes broadcast, and to described and own relative angle maximum and distance bunch interior nodes transmission foundation bunch associated nodes message farthest, be labeled as the descendant node of oneself simultaneously with described and own relative angle maximum and apart from bunch interior nodes farthest;
Step 305: after a maximum and distance bunch interior nodes is farthest received and set up bunch associated nodes message with bunch first node relative angle in the step 304, a bunch associated nodes will oneself be designated, and be the forerunner's node of oneself with bunch first vertex ticks, select simultaneously with own same road and same direction running and relative angle is maximum and distance isolated node farthest as new bunch first node, and to own at same road and same direction running and relative angle is maximum and distance isolated node farthest sends and sets up bunch first node messages, simultaneously it is labeled as the descendant node of oneself;
Step 306: with bunch associated nodes in the step 305 same road and same direction running and relative angle is maximum and distance isolated node farthest receive set up bunch first node messages after, to oneself be designated a bunch first node, bunch associated nodes is designated the forerunner's node of oneself;
Step 307: bunch first node in the step 306 has judged whether neighbours' isolated node, if carry out step 303, otherwise carry out step 308;
Step 308: finish.
2. the construction method of a kind of In-vehicle networking according to claim 1, it is characterized in that, if bunch associated nodes is not received the broadcast of forerunner's node in the linear structure of place or other neighbor nodes in setting-up time, it then judges and breaks away from place bunch, adds other bunches again or sets up bunch oneself being labeled as isolated node;
Still can receive the broadcast of forerunner's node if bunch associated nodes is not received the broadcast of descendant node in the linear structure of place in setting-up time, then it will be labeled as a bunch interior nodes itself;
If a bunch first node H1 does not receive that in setting-up time the broadcast of descendant node A1 in the linear structure of place or descendant node A1 have changed a bunch interior nodes into, then it selects new bunch associated nodes to form new linear structure, and step is as follows:
Step 401: beginning
Step 402: bunch first node H1 be chosen in the descendant node H2 communication range of descendant node A1 and with own relative angle maximum and apart from farthest bunch interior nodes A3 as new bunch associated nodes, and to a bunch new bunch of associated nodes message of interior nodes A3 transmission, the message load is the ID value of descendant node A1 and the ID value of descendant node H2, simultaneously bunch interior nodes A3 is labeled as the descendant node of oneself;
Step 403: after a bunch interior nodes A3 receives new bunch of associated nodes message, a bunch associated nodes will oneself be designated, and bunch first node H1 is labeled as oneself forerunner's node, the descendant node with descendant node H2 is designated oneself is transmitted to descendant node H2 with new bunch of associated nodes message simultaneously;
Step 404: after descendant node H2 receives new bunch of associated nodes message, with the forerunner node of bunch interior nodes A3 as oneself;
Step 405: finish.
3. the construction method of a kind of In-vehicle networking according to claim 1, it is characterized in that, if but bunch interior nodes do not receive the broadcast of bunch first node still can receive the broadcast of neighbor node in setting-up time, bunch interior nodes judges that a bunch first node breaks away from place bunch so;
Break away from the broadcast that place bunch and its can receive forerunner's node and descendant node in bunch first node H place linear structure simultaneously if bunch interior nodes X detects bunch first node H, then bunch interior nodes X carries out following steps:
Step 501: beginning;
Step 502: bunch interior nodes X broadcasts new bunch of first node messages in a jumping scope, and the message load is the ID value of bunch first node H and the ID value of oneself;
Step 503: behind setting-up time, bunch interior nodes X judges whether to receive new bunch of first node messages of other bunches interior nodes broadcasting in this bunch, if carry out step 504, otherwise carry out step 505;
Step 504: bunch interior nodes X judges that bunch interior nodes ID value in the new bunch of first node messages of receiving is whether all less than oneself ID value, if carry out step 505, otherwise carry out step 510;
Step 505: bunch interior nodes X then is labeled as oneself a bunch first node;
Step 506: judge whether bunch first node H is the start node of linear structure, if carry out step 507, otherwise carry out step 508;
Step 507: bunch interior nodes X will oneself be designated the start node of bunch chain;
Step 508: behind setting-up time, forerunner's node of bunch first node H or descendant node are checked the source node ID value of the new bunch of first node messages of receiving, bunch interior nodes that the ID value is minimum is as new descendant node or forerunner's node;
Step 509: behind setting-up time, check the source node ID value of the new bunch of first message of receiving with bunch first node H same bunch bunch interior nodes, bunch interior nodes that the ID value is minimum is as new bunch first node;
Step 510: finish.
4. the construction method of a kind of In-vehicle networking according to claim 1, it is characterized in that, if the descendant node of bunch first node H4 is a bunch associated nodes A2, the descendant node of bunch associated nodes A2 is a bunch first node H3, bunch first node H4 and bunch first node H3 can direct communications, and a bunch first node H3 then carries out following operation and realizes bunch merging:
Step 601: beginning;
Step 602: bunch first node H3 sends new bunch of interior nodes message to bunch associated nodes A2, send new bunch of associated nodes message to a bunch first node H4, the load of new bunch of associated nodes message is the ID value of bunch associated nodes A2 and the ID value of oneself, simultaneously bunch first node H4 is labeled as the forerunner's node of oneself;
Step 603: after a bunch associated nodes A2 receives new bunch of interior nodes message, will oneself be designated a bunch interior nodes;
Step 604: after a bunch first node H4 receives new bunch of associated nodes message, bunch first node H3 is labeled as the descendant node of oneself, and will oneself be designated a bunch associated nodes, the forerunner's node to bunch first node H4 sends new bunch of first node messages simultaneously;
Step 605: forerunner's node of receiving new bunch of first node messages will oneself be designated a bunch first node, and the forerunner's node to oneself sends new bunch of associated nodes message simultaneously;
Step 606: after forerunner's node of bunch first node of new bunch of associated nodes message of transmission is received new bunch of associated nodes message in the step 605, will oneself be designated a bunch associated nodes, the forerunner's node to oneself sends new bunch of first node messages simultaneously;
Step 607: forerunner's node of bunch associated nodes of new bunch of first node messages of transmission judges whether the start node into linear structure in the step 606, if carry out step 608, otherwise carry out step 605;
Step 608: finish.
5. the construction method of a kind of In-vehicle networking according to claim 1, it is characterized in that, under the initial condition, if bunch first node H6 and bunch first node H5 belong to different linear structures, and the descendant node A5 of bunch first node H6 is the end node of place linear structure, and be bunch start node of first node H5 place linear structure, and do not have isolated node between two linear structures;
If some isolated nodes between two linear structures, occurred, then carry out following operation to merge two linear structures, step is as follows:
Step 701: beginning;
Step 702: descendant node A5 select with own same road and same direction running and relative angle is maximum and distance isolated node farthest as new bunch first node, and to isolated node transmission foundation bunch first node messages, simultaneously it is labeled as the descendant node of oneself;
Step 703: isolated node will oneself be designated a bunch first node after receiving and setting up bunch first node messages, is the forerunner's node of oneself with sending the node identification of setting up bunch first node messages; With new bunch first node after the isolated node of same road and same direction running is received its broadcast, will oneself be designated a bunch interior nodes;
Step 704: a bunch interior nodes will oneself be designated a bunch associated nodes after receiving and setting up bunch associated nodes message, and will to send bunch first vertex ticks of setting up bunch associated nodes message be the forerunner's node of oneself;
Step 705: bunch associated nodes judges whether to receive bunch broadcast of first node H5, if carry out step 707, otherwise carry out step 706;
Step 706: bunch associated nodes select with own same road and same direction running and relative angle is maximum and distance isolated node farthest as new bunch first node, and to isolated node transmission foundation bunch first node messages, simultaneously it is labeled as the descendant node of oneself, carry out step 703;
Step 707: bunch associated nodes after a bunch first node H5 receives the broadcast of bunch associated nodes, is labeled as bunch associated nodes the forerunner's node of oneself with the descendant node that bunch first node H5 is labeled as oneself;
Step 708: finish.
Priority Applications (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN 201110375013 CN102347991B (en) | 2011-11-23 | 2011-11-23 | Method for constructing vehicular network |
Applications Claiming Priority (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN 201110375013 CN102347991B (en) | 2011-11-23 | 2011-11-23 | Method for constructing vehicular network |
Publications (2)
| Publication Number | Publication Date |
|---|---|
| CN102347991A CN102347991A (en) | 2012-02-08 |
| CN102347991B true CN102347991B (en) | 2013-09-04 |
Family
ID=45546271
Family Applications (1)
| Application Number | Title | Priority Date | Filing Date |
|---|---|---|---|
| CN 201110375013 Expired - Fee Related CN102347991B (en) | 2011-11-23 | 2011-11-23 | Method for constructing vehicular network |
Country Status (1)
| Country | Link |
|---|---|
| CN (1) | CN102347991B (en) |
Families Citing this family (10)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN102883403B (en) * | 2012-10-09 | 2014-09-10 | 常熟理工学院 | Construction method for mobile ad hoc network |
| CN103916928A (en) * | 2014-04-11 | 2014-07-09 | 安徽理工大学 | Wireless sensor network uneven clustering topology monitoring method and device |
| CN104023371B (en) * | 2014-06-11 | 2017-11-03 | 中国联合网络通信集团有限公司 | The multi-path route method and system of a kind of vehicular ad hoc network |
| CN105873171B (en) * | 2016-05-27 | 2017-05-03 | 合肥工业大学 | Re-optimizing method and system for unmanned-aerial-vehicle formation communication topology based on minimum arborescence |
| CN107086962A (en) * | 2017-04-01 | 2017-08-22 | 天津理工大学 | It is a kind of towards vehicle networking by multi-hop reaction equation clustering method |
| CN107966391B (en) * | 2017-11-23 | 2020-10-16 | 常熟理工学院 | Method and device for verifying trapping efficiency of diesel particle trap under vehicle-mounted vibration condition |
| CN108737991B (en) * | 2018-05-17 | 2019-03-26 | 长安大学 | Adaptive sub-clustering and cluster type retransmission method based on traffic flow theory |
| CN109246596B (en) * | 2018-08-13 | 2020-06-16 | 常熟理工学院 | High-efficiency vehicle-mounted network routing method |
| CN109005567B (en) * | 2018-09-14 | 2020-04-17 | 常熟理工学院 | Mobile network implementation method based on cluster |
| CN112929594B (en) * | 2019-12-06 | 2023-08-08 | 中兴通讯股份有限公司 | Ad hoc network cascading method, audio acquisition equipment, conference system and storage medium |
Citations (3)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN101013926A (en) * | 2007-02-05 | 2007-08-08 | 华中科技大学 | Method and system for network communication of wireless sensor |
| CN101808382A (en) * | 2010-01-20 | 2010-08-18 | 西安电子科技大学 | Data communication method of wireless sensor network |
| CN102158983A (en) * | 2011-05-04 | 2011-08-17 | 常熟理工学院 | Method for constructing 6LoWPAN wireless sensor network |
Family Cites Families (1)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| KR101001559B1 (en) * | 2008-10-09 | 2010-12-17 | 아주대학교산학협력단 | Hybrid clustering based data aggregation method for multi-target tracking in the wireless sensor network |
-
2011
- 2011-11-23 CN CN 201110375013 patent/CN102347991B/en not_active Expired - Fee Related
Patent Citations (3)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN101013926A (en) * | 2007-02-05 | 2007-08-08 | 华中科技大学 | Method and system for network communication of wireless sensor |
| CN101808382A (en) * | 2010-01-20 | 2010-08-18 | 西安电子科技大学 | Data communication method of wireless sensor network |
| CN102158983A (en) * | 2011-05-04 | 2011-08-17 | 常熟理工学院 | Method for constructing 6LoWPAN wireless sensor network |
Also Published As
| Publication number | Publication date |
|---|---|
| CN102347991A (en) | 2012-02-08 |
Similar Documents
| Publication | Publication Date | Title |
|---|---|---|
| CN102347991B (en) | Method for constructing vehicular network | |
| CN102883263B (en) | A kind of VANET sub-clustering maintaining method based on Adjacent vehicles distance | |
| CN102695220B (en) | IPv6-based mobile ad hoc network mobile handover realizing method | |
| CN102883403B (en) | Construction method for mobile ad hoc network | |
| CN102769888B (en) | Method for vehicle-mounted Ad Hoc network based on improved AODV (Ad Hoc Ondemand Distance Vector) protocol | |
| CN102546369B (en) | A kind of Border Gateway Protocol route renewing method and system | |
| CN104754688A (en) | Routing method for entangled state based wireless Mesh quantum communication network | |
| CN102395126B (en) | Mobile Ad hoc network address configuration realization method based on tree structure | |
| CN102202356A (en) | Implementation method for mobile handover of vehicle network | |
| CN103167484B (en) | Method for accessing a car connected network to an IPv6 network | |
| CN103475752B (en) | What the vehicle-mounted net address of a kind of next generation configured realizes method | |
| CN102917372A (en) | Internet of vehicles hierarchical model design method orienting to multi-scene data exchange | |
| CN105407517B (en) | Method for routing, routing module, car-mounted terminal and vehicular ad hoc network route system | |
| CN104270461A (en) | Car network implementation method | |
| CN104468867A (en) | Dynamic distribution method for IP address in wireless local area network | |
| CN103079287B (en) | Based on the perception of express highway intelligent vehicle and the method for controlling street lamps of wireless multihop ad hoc networks | |
| CN102572015A (en) | Implementation method for dynamic IPv6 address configuration of mobile ad hoc network | |
| CN103546990B (en) | The method that the networking of a kind of car accesses internet | |
| CN103312811A (en) | Method for connecting vehicle-mounted network into IPv6 internet | |
| CN104869563A (en) | Communication realization method of next-generation city internet of vehicle | |
| CN103036785B (en) | Routing method of city vehicle-mounted net | |
| CN102292942B (en) | Method, system and router for route processing | |
| CN105119828A (en) | Fast wireless network routing achievement method | |
| CN102970393B (en) | Address configuration method based on IPv6 (Internet protocol version 6) for in-vehicle network | |
| CN103023775A (en) | Router in OSPF (open shortest path first) network and processing method thereof |
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: 20130904 Termination date: 20181123 |
|
| CF01 | Termination of patent right due to non-payment of annual fee |