CN110087277A

CN110087277A - A kind of efficient Vehicular intelligent network implementation approach

Info

Publication number: CN110087277A
Application number: CN201910294442.4A
Authority: CN
Inventors: 王晓喃; 程宏斌; 孙霞
Original assignee: Changshu Institute of Technology
Current assignee: Changshu Institute of Technology
Priority date: 2019-04-12
Filing date: 2019-04-12
Publication date: 2019-08-02
Anticipated expiration: 2039-04-12
Also published as: CN110087277B

Abstract

The present invention provides a kind of efficient Vehicular intelligent network implementation approach, the network includes access node and vehicle node；The region of the network coverage is made of road and crossing；Road between two crossings is known as section, section by the two crossings coordinate unique identification；There is a section title in each section；Vehicle node obtains the section title in each section by electronic map and defines the coordinate at two crossings in the section；The vehicle node through the invention provided by Vehicular intelligent network implementation approach can quick obtaining data, shorten the delay and cost of data acquisition, improve the success rate of data acquisition, present invention can apply to the transmission of important information, such as the fields such as road conditions monitoring, vehicle management, it is with a wide range of applications.

Description

A kind of efficient Vehicular intelligent network implementation approach

Technical field

The present invention relates to a kind of network implementation approach more particularly to a kind of efficient Vehicular intelligent network implementations sides Method.

Background technique

For Vehicular intelligent network as a kind of Novel Communication network, the multi-hop wireless that can be realized between node and node is logical Letter.With the continuous development of network technology and various new opplications continue to bring out, and there is an urgent need to realize that Vehicular intelligent network is logical Believe to meet the application demand of user's sharp increase.

Vehicular intelligent network is data-centered, and traditional network is centered on address, therefore is unfavorable for obtaining for data It takes.For example, in an ip network, data are provided by destination node that purpose IP address determines, if the destination node fails, that Data can not be just provided.And the network based on data is data-centered, any node can provide data, so as to shorten The delay and cost of data acquisition.

But how to realize and also need further to study and inquire into Vehicular intelligent network.

Summary of the invention

Goal of the invention: a kind of efficient the technical problem to be solved by the present invention is in view of the deficiencies of the prior art, provide Vehicular intelligent network implementation approach.

Technical solution: the invention discloses a kind of efficient Vehicular intelligent network implementation approach, the network includes access Node and vehicle node；The region of the network coverage is made of road and crossing, such as crossroad etc.；Positioned at two crossings Between road be known as section, section by the two crossings coordinate unique identification；There is a section title in each section；Vehicle Node obtains the section title in each section by electronic map and defines the coordinate at two crossings in the section；Electronic map Coordinate comprising section title and two crossings for defining the section, each vehicle node are pre-configured with electronic map；

A kind of data are by a kind of data name unique identification；Positioned at a section data by identify the section section name Claim and identify the data name unique identification of the data；Each vehicle node or access node are identified by hardware ID, such as MAC Address, hardware ID have network uniqueness；Vehicle node or access node are communicated by message, and message is by type of message Unique identification, as shown in the table:

Each vehicle node safeguards a neighbor table, and a neighbor entry includes hardware ID, coordinate and life cycle；Each Neighbours' message includes type of message, hardware ID and coordinate；Vehicle node V1 is periodically executed following operation:

Step 101: starting；

Step 102: vehicle node V1 sends neighbours' message, and the value of message types of neighbours' message is 1, and hardware ID is vehicle The hardware ID of node V1, coordinate are the coordinate of vehicle node V1；

Step 103: after neighbours' vehicle node receives neighbours' message, checking neighbor table；If there is a neighbor table , the hardware ID of the neighbor entry is equal to the hardware ID of neighbours' message, then the coordinate thresholding of the neighbor entry is updated to this Life cycle is set maximum value by the coordinate of neighbours' message；Otherwise, which creates a neighbor entry, should The hardware ID of neighbor entry is equal to the hardware ID of neighbours' message, and coordinate thresholding is equal to the coordinate of neighbours' message, by Life Cycle Phase is set as maximum value；

Step 104: terminating.

Vehicle node obtains the hardware ID and coordinate of each access node by electronic map；

Each vehicle node saves an access node table, and an access node list item includes hardware ID and coordinate, for Each access node, vehicle node create an access node table, and the hardware ID and coordinate of the access node table respectively equal to should The hardware ID and coordinate of access node.

Vehicle node establishes neighbor table by the above process to obtain the real-time coordinates of neighbours' vehicle node, in this way can be with Optimal neighbours' vehicle node is selected as next-hop node it is established to the routed path of purpose access node, the above process Ensure the validity of each neighbor entry by life cycle, so that it is guaranteed that the validity of neighbours' vehicle node messages and every The validity and high efficiency of the routed path of a foundation.

In the method for the invention, each access node saves a section table, a section list item include section title, First crossing coordinate and the second crossing coordinate；One access node by electronic map obtain each section section title and Define the coordinate of two interfaces in the section；Access node creates a section list item for each section, the section list item Section title is equal to the section title in the section, and the first crossing coordinate is coordinate and the crossing for defining a crossing in the section Coordinate and the distance between the coordinate of the access node be less than between the coordinate at another crossing and the coordinate of the access node Distance；Second crossing coordinate is the seat for defining the coordinate at a crossing in the section and the coordinate at the crossing and the access node The distance between mark is greater than the distance between the coordinate of the first crossing coordinate and the access node；

One access node saves a meter for vehicle, and a vehicle list item includes hardware ID, coordinate, section title and life Period；Registration message includes type of message, source hardware ID, purpose hardware ID, source coordinate, purpose coordinate and section title；Section RS1 is defined by coordinate (x1, y1) and coordinate (x2, y2), and vehicle node V1 is located on the RS1 of section, if in all access sections In point, coordinate (x1, y1) and coordinate (x2, y2) and the coordinate distance of access node AP1 are nearest, then vehicle node V1 is periodically to connecing Ingress AP1 executes registration operation:

Step 201: starting；

Step 202: vehicle node V1 selects a neighbor entry, the coordinate of the neighbor entry and the seat of access node AP1 Subject distance is nearest, and vehicle node V1 sends a registration message, and the value of message types of the registration message is 2, and source hardware ID is vehicle The hardware ID of node V1, purpose hardware ID are equal to the hardware ID of the neighbor entry, and source coordinate is equal to the coordinate of vehicle node V1, Purpose coordinate is equal to the coordinate of access node AP1, and section title is equal to the section title of section RS1；

Step 203: if access node AP1 receives registration message, then follow the steps 208, it is no to then follow the steps 204；

Step 204: the vehicle node for receiving registration message judges whether the hardware ID of oneself is equal to the registration message Purpose hardware ID thens follow the steps 205 if be equal to, no to then follow the steps 208；

Step 205: the vehicle node for receiving registration message judges the coordinate and the registration message purpose coordinate of oneself Whether distance is less than or equal to transmission radius R1, if so, 206 are thened follow the steps, it is no to then follow the steps 207；

Step 206: the vehicle node for receiving registration message selects an access node list item, the access node list item Coordinate is equal to the purpose coordinate of the registration message, and the purpose hardware ID of the registration message is updated in the access node list item Hardware ID forwards the registration message, executes step 203；

Step 207: receive registration message vehicle node select a neighbor entry, the coordinate of the neighbor entry with should The purpose coordinate distance of registration message is nearest, and the purpose hardware ID of the registration message is updated to the hardware ID of the neighbor entry, The registration message is forwarded, step 203 is executed；

Step 208: access node AP1 checks meter for vehicle after receiving registration message；It, should if there is a vehicle list item The hardware ID of vehicle list item is equal to the source hardware ID of the registration message, then access node AP1 updates the coordinate of the vehicle list item For the source coordinate of the registration message, the section title of the vehicle list item is updated to the section title of the registration message, by life Period is set as maximum value；Otherwise, access node AP1 creates a vehicle list item, and the hardware ID of the vehicle list item is equal to the note The source hardware ID of volume message, coordinate are equal to the source coordinate of the registration message, and section title is equal to the section title of the registration message, Maximum value is set by life cycle；

Step 209: terminating；

If coordinate (x1, y1) is nearest apart from access node AP1 and coordinate (x2, y2) is nearest apart from access node AP2, or Person's coordinate (x1, y1) is nearest apart from access node AP2 and coordinate (x2, y2) is apart from the nearest vehicle node V1 of access node AP1, then Vehicle node V1 executes above-mentioned registration operation to access node AP1 and access node AP2 simultaneously.

Vehicle node executes registration operation to apart from nearest access node by the above process to establish vehicle list item；This Sample, access node can obtain the real-time coordinates of vehicle node in real time, so that the real-time coordinates by these vehicle nodes are established Reach the optimal routed path in purpose vehicle node or purpose section；Vehicle list item ensures each vehicle by life cycle The validity of node real-time coordinates ensures that having for the optimal routed path for reaching purpose vehicle node or purpose section Effect property and high efficiency.

In the method for the invention, the routed path that an access node reaches a section RS1 includes two parts: from The access node reaches the routed path for defining a crossing S1 of section RS1, the coordinate of crossing S1 and the seat of the access node The distance between mark is less than the distance between the coordinate of the coordinate and the access node that define another crossing S2 in the section；With And the routed path of crossing S2 is reached from crossing S1；Routed path is by hardware ID set expression, and the hardware ID set is by the routing The hardware ID for all vehicle nodes that path is included is constituted；

Section RS1 is defined by crossing S1 and crossing S2, and the coordinate of crossing S1 is (x1, y1), the coordinate of crossing S2 be (x2, Y2), in all access nodes, coordinate (x1, y1) is nearest apart from access node AP1, and coordinate (x1, y1) and access node The distance between coordinate of AP1 is less than the distance between the coordinate of coordinate (x2, y2) and access node AP1；

Access node AP1 executes operations described below and establishes the routed path that oneself reaches section RS1:

Step 301: starting；

Step 302: the initial value that hardware ID set a variable hs1, variable hs1 is arranged in access node AP1 is sky；Access Node AP1 selects a vehicle list item E1, and the coordinate of vehicle list item E1 is equal to (x1, y1)；If the coordinate of vehicle list item E1 with The distance between coordinate of access node AP1 is less than or equal to transmission radius R1, thens follow the steps 306；It is no to then follow the steps 303；

Step 303: access node AP1 selects a vehicle list item E2, and the coordinate of vehicle list item E2 is with access node AP1's The distance between coordinate is less than transmission radius R1, and the distance between coordinate of the coordinate of vehicle list item E2 and vehicle list item E1 is most Closely, the hardware ID of vehicle list item E2 is added in variable hs1 and as the last one element；

Step 304: access node AP1 selects a vehicle list item E3, and the hardware ID of vehicle list item E3 is equal to variable hs1's The last one element；If the distance between coordinate of the coordinate of vehicle list item E3 and vehicle list item E1 is less than or equal to transmission Radius R1, thens follow the steps 306, no to then follow the steps 305；

Step 305: access node AP1 selects a vehicle list item E4, and the coordinate of vehicle list item E4 is with vehicle list item E3's The distance between coordinate is less than or equal to transmission radius R1, and between the coordinate of vehicle list item E4 and the coordinate of vehicle list item E1 Distance it is minimum, the hardware ID of vehicle list item E4 is added in variable hs1 and as the last one element, executes step 304；

Step 306: the hardware ID of vehicle list item E1 is added in variable hs1 and as the last one by access node AP1 Element；Access node AP1 selects a vehicle list item E5, and the coordinate of vehicle list item E5 is equal to (x2, y2)；If vehicle list item E1 Coordinate and the distance between the coordinate of vehicle list item E5 be less than or equal to transmission radius R1, then follow the steps 310, otherwise hold Row step 307；

Step 307: access node AP1 selects a vehicle list item E6, and the coordinate of vehicle list item E6 is with vehicle list item E1's The distance between coordinate is less than or equal to transmission radius R1 and between the coordinate of vehicle list item E6 and the coordinate of vehicle list item E5 Distance it is minimum, the hardware ID of vehicle list item E6 is added in variable hs1 and as the last one element；

Step 308: access node AP1 selects a vehicle list item E7, and the hardware ID of vehicle list item E7 is equal to variable hs1's The last one element；If the distance between coordinate of the coordinate of vehicle list item E7 and vehicle list item E5 is less than or equal to transmission Radius R1, thens follow the steps 310, no to then follow the steps 309；

Step 309: access node AP1 selects a vehicle list item E8, and the coordinate of vehicle list item E8 is with vehicle list item E7's The distance between coordinate is less than or equal to transmission radius R1, and between the coordinate of vehicle list item E8 and the coordinate of vehicle list item E5 Distance it is minimum, the hardware ID of vehicle list item E8 is added in variable hs1 and as the last one element, executes step 308；

Step 310: the hardware ID of vehicle list item E5 is added in variable hs1 and as the last one by access node AP1 Element；

Step 311: terminating.

Access node AP1 establishes the routed path for oneself reaching section RS1 by aforesaid operations, since the above process passes through The real-time coordinates of vehicle node in vehicle list item establish routed path, therefore considerably reduce routed path length, due to Life cycle in vehicle list item ensures the validity of vehicle node real-time coordinates, therefore also ensures the effective of routed path Property, while also improving data communication feature.

In the method for the invention, an access node reaches the routed path of a vehicle node positioned at section RS1 Include two parts: reaching the routed path for defining a crossing S1 of section RS1, the coordinate of crossing S1 from the access node The distance between coordinate of the access node is less than the coordinate and the access node for defining another crossing S2 in the section The distance between coordinate；And the routed path of the vehicle node is reached from crossing S1；Routed path by hardware ID set expression, The hardware ID for all vehicle nodes that the hardware ID set is included by the routed path is constituted；

Section RS1 is defined by crossing S1 and crossing S2, and the coordinate of crossing S1 is (x1, y1), the coordinate of crossing S2 be (x2, Y2), in all access nodes, coordinate (x1, y1) is nearest apart from access node AP1, and coordinate (x1, y1) and access node The distance between coordinate of AP1 is less than the distance between the coordinate of coordinate (x2, y2) and access node AP1；Vehicle node V1 In on the RS1 of section；Access node AP1 executes operations described below and establishes the routed path that oneself reaches vehicle node V1:

Step 401: starting；

Step 402: the initial value that hardware ID set a variable hs2, variable hs2 is arranged in access node AP1 is sky；Access Node AP1 selects a vehicle list item T1, and the coordinate of vehicle list item T1 is equal to (x1, y1)；If the coordinate of vehicle list item T1 with The distance between coordinate of access node AP1 is less than or equal to transmission radius R1, thens follow the steps 406；It is no to then follow the steps 403；

Step 403: access node AP1 selects a vehicle list item T2, and the coordinate of vehicle list item T2 is with access node AP1's The distance between coordinate is less than transmission radius R1, and the distance between coordinate of the coordinate of vehicle list item T2 and vehicle list item T1 is most Closely, the hardware ID of vehicle list item T2 is added in variable hs2 and as the last one element；

Step 404: access node AP1 selects a vehicle list item T3, and the hardware ID of vehicle list item T3 is equal to variable hs2's The last one element；If the distance between coordinate of the coordinate of vehicle list item T3 and vehicle list item T1 is less than or equal to transmission Radius R1, thens follow the steps 406, no to then follow the steps 405；

Step 405: access node AP1 selects a vehicle list item T4, and the coordinate of vehicle list item T4 is with vehicle list item T3's The distance between coordinate is less than or equal to transmission radius R1, and between the coordinate of vehicle list item T4 and the coordinate of vehicle list item T1 Distance it is minimum, the hardware ID of vehicle list item T4 is added in variable hs2 and as the last one element, executes step 404；

Step 406: the hardware ID of vehicle list item T1 is added in variable hs2 and as the last one by access node AP1 Element；Access node AP1 selects a vehicle list item T5, and the hardware ID of vehicle list item T5 is equal to the hardware ID of vehicle node V1； If the distance between coordinate of the coordinate of vehicle list item T1 and vehicle list item T5 is less than or equal to transmission radius R1, execute Step 410, no to then follow the steps 407；

Step 407: access node AP1 selects a vehicle list item T6, and the coordinate of vehicle list item T6 is with vehicle list item T1's The distance between coordinate is less than or equal to transmission radius R1 and between the coordinate of vehicle list item T6 and the coordinate of vehicle list item T5 Distance it is minimum, the hardware ID of vehicle list item T6 is added in variable hs1 and as the last one element；

Step 408: access node AP1 selects a vehicle list item T7, and the hardware ID of vehicle list item T7 is equal to variable hs2's The last one element；If the distance between coordinate of the coordinate of vehicle list item T7 and vehicle list item T5 is less than or equal to transmission Radius R1, thens follow the steps 410, no to then follow the steps 409；

Step 409: access node AP1 selects a vehicle list item T8, and the coordinate of vehicle list item T8 is with vehicle list item T7's The distance between coordinate is less than or equal to transmission radius R1, and between the coordinate of vehicle list item T8 and the coordinate of vehicle list item T5 Distance it is minimum, the hardware ID of vehicle list item T8 is added in variable hs2 and as the last one element, executes step 408；

Step 410: the hardware ID of vehicle list item T5 is added in variable hs2 and as the last one by access node AP1 Element；

Step 411: terminating.

Access node establishes the routed path for oneself reaching vehicle node V1 by aforesaid operations, since the above process passes through The real-time coordinates of vehicle node in vehicle list item establish routed path, therefore considerably reduce routed path length, due to Life cycle in vehicle list item ensures the validity of vehicle node real-time coordinates, therefore also ensures the effective of routed path Property, while also improving data communication feature.

In the method for the invention, access node saves a tables of data, a data table items include data name, Section title, data value and life cycle；

One creation message includes type of message, section title, hardware ID set, data name and source hardware ID；

One confirmation message includes type of message, section title, data name, purpose hardware ID, purpose coordinate and load；

Section RS1 is defined by crossing S1 and crossing S2, and the coordinate of crossing S1 is (x1, y1), the coordinate of crossing S2 be (x2, Y2), in all access nodes, coordinate (x1, y1) is nearest apart from access node AP1, and coordinate (x1, y1) and access node The distance between coordinate of AP1 is less than the distance between the coordinate of coordinate (x2, y2) and access node AP1；Positioned at section RS1's Data DA1 is identified by data name NA1 and section title RA1；It is entitled that access node AP1 executes operations described below creation section The data table items of RA1 and data name NA1:

Step 501: starting；

Step 502: access node AP1 executes step 301~311 and obtains hardware ID lumped parameter hs1, and parameter hs1 is indicated Access node AP1 reaches the routed path of section RS1, sends a creation message, and the value of message types of the creation message is 3, The entitled RA1 in section, hardware ID set are equal to parameter hs1, data name NA1, and source hardware ID is equal to the hard of access node AP1 Part ID；

Step 503: vehicle node receives the creation message；If the vehicle node is located at section RS1, then follow the steps 506, it is no to then follow the steps 504；

Step 504: receiving the vehicle node of creation message, to judge whether oneself hardware ID is equal to the creation message hard First element in part ID set thens follow the steps 505 if be equal to, no to then follow the steps 511；

Step 505: the vehicle node for receiving creation message deletes first from the hardware ID set of the creation message Element forwards the creation message, executes step 503；

Step 506: the vehicle node for receiving creation message judges whether oneself can provide the data name of the creation message Claim the data identified with section title, if it can, 507 are thened follow the steps, it is no to then follow the steps 508；

Step 507: the vehicle node for receiving creation message selects an access node list item, the access node list item Hardware ID is equal to the source hardware ID of the creation message, selects a neighbor entry, the coordinate of the neighbor entry and the access node The distance between coordinate of list item recently, sends a confirmation message, and the value of message types of the confirmation message is 4, section title It is respectively equal to the section title and data name of the creation message with data name, purpose hardware ID is equal to the hard of the neighbor entry Part ID, purpose coordinate are equal to the coordinate of the access node list item, and the section name data title loaded as the creation message is marked The data of knowledge execute step 511；

Step 508: receiving the vehicle node of creation message, to judge whether oneself hardware ID is equal to the creation message hard First element in part ID set thens follow the steps 509 if be equal to, no to then follow the steps 511；

Step 509: the vehicle node for receiving creation message deletes first from the hardware ID set of the creation message Element thens follow the steps 511 if the hardware ID collection of the creation message is combined into sky, no to then follow the steps 510；

Step 510: the vehicle node for receiving creation message forwards the creation message, executes step 503；

Step 511: if access node AP1 receives confirmation message, then follow the steps 516, it is no to then follow the steps 512；

Step 512: the vehicle node for receiving confirmation message judges whether the hardware ID of oneself is equal to the confirmation message Purpose hardware ID thens follow the steps 513 if be equal to, no to then follow the steps 516；

Step 513: the vehicle node for receiving confirmation message judges the coordinate and the confirmation message purpose coordinate of oneself Whether distance is less than or equal to transmission radius R1, if so, 514 are thened follow the steps, it is no to then follow the steps 515；

Step 514: the vehicle node for receiving confirmation message selects an access node list item, the access node list item Coordinate is equal to the purpose coordinate of the confirmation message, and the purpose hardware ID of the confirmation message is updated in the access node list item Hardware ID forwards the confirmation message, executes step 511；

Step 515: receive confirmation message vehicle node select a neighbor entry, the coordinate of the neighbor entry with should The purpose coordinate distance of confirmation message is nearest, and the purpose hardware ID of the confirmation message is updated to the hardware ID of the neighbor entry, The confirmation message is forwarded, step 511 is executed；

Step 516: access node AP1 checks tables of data after receiving the confirmation message, if there is a data table items, The data name and section title of the data table items are respectively equal to the data name and section title of the confirmation message, then by the number The data in confirmation message load are updated to according to the data value of list item, set maximum value for life cycle；Otherwise, access section Point AP1 creates a data table items, and the data name and section title of the data table items are respectively equal to the data of the confirmation message Title and section title, data value are equal to the data in confirmation message load, and life cycle is set as maximum value；

Step 517: terminating.

Access node obtains the data DA1 on the RS1 of section by the above process, and access node is real-time by vehicle node Coordinate, which calculates, oneself to be reached the routed path of section RS1 and executes the above process, without establishing routing, without broadcast operation, Therefore the delay and cost for obtaining data are reduced, the delay and cost of data communication are also reduced.

In the method for the invention, request message includes type of message, source hardware ID, purpose hardware ID, purpose coordinate, road Name section and data name；Response message includes type of message, hardware ID set, section title, data name and load；Data DA1 is made of data name NA1 and section title RA1；Vehicle node V1 is located on the RS1 of section, in all access nodes, with Recently, vehicle node V1 obtains data DA1 by following processes to access node AP1 distance:

Step 601: starting；

Step 602: vehicle node V1 selects a neighbor entry, the coordinate of the neighbor entry and the seat of access node AP1 Subject distance is nearest, sends a request message, and the value of message types of the request message is 5, and source hardware ID is equal to vehicle node V1 Hardware ID, purpose hardware ID be equal to the neighbor entry hardware ID, purpose coordinate be equal to access node AP1 coordinate, section Title is equal to RA1, and data name is equal to NA1；

Step 603: if access node AP1 receives the request message, then follow the steps 608, it is no to then follow the steps 604；

Step 604: the purpose that the vehicle node for receiving request message checks whether hardware ID is equal to the request message is hard Part ID thens follow the steps 605 if be equal to, no to then follow the steps 608；

Step 605: the vehicle node for receiving request message judges the coordinate and the request message purpose coordinate of oneself Whether distance is less than or equal to transmission radius R1, if so, 606 are thened follow the steps, it is no to then follow the steps 607；

Step 606: the vehicle node for receiving request message selects an access node list item, the access node list item Coordinate is equal to the purpose coordinate of the request message, and the purpose hardware ID of the request message is updated in the access node list item Hardware ID forwards the request message, executes step 603；

Step 607: receive request message vehicle node select a neighbor entry, the coordinate of the neighbor entry with should The purpose coordinate distance of request message is nearest, and the purpose hardware ID of the request message is updated to the hardware ID of the neighbor entry, The request message is forwarded, step 603 is executed；

Step 608: access node AP1 checks tables of data after receiving request message, should if there is a data table items The section title and data name of data table items are respectively equal to the section title and data name of the request message, then follow the steps 610, it is no to then follow the steps 609；

Step 609: access node AP1 executes step 501~517 one data table items of creation, the section of the data table items Title and data name are respectively equal to the section title and data name of the request message received；

Step 610: access node AP1 selects a vehicle list item, and the hardware ID of the vehicle list item is asked equal to what is received The source hardware ID of message is sought, step 401~411 is executed and obtains hardware ID lumped parameter hs2, parameter hs2 indicates access node AP1 Reach the routed path for the vehicle node that the request message source hardware ID is identified；Access node AP1 selects a data table items, The section title and data name of the data table items are respectively equal to the section title and data name of the request message, send one Response message, the value of message types of the response message are 6, and hardware ID set is equal to parameter hs2, section title and data name point Not Deng Yu the request message section title and data name, load the data value for the data table items；

Step 611: vehicle node receives response message；If it is hard that the hardware ID of the vehicle node is equal to the response message First element of part ID set, thens follow the steps 612, no to then follow the steps 614；

Step 612: the vehicle node for receiving response message deletes first member from the response message hardware ID set Element thens follow the steps 614 if the hardware ID set of the response message is equal to sky, no to then follow the steps 613；

Step 613: the vehicle node for receiving response message forwards the response message, executes step 611；

Step 614: after vehicle node V1 receives response message, saving the data in response message load；

Step 615: terminating.

Vehicle node obtains the data DA1 on the RS1 of section from access node by the above process, and access node passes through vehicle The real-time coordinates of node calculate the routed path for oneself reaching the vehicle node, and transmit data to this by the routed path Vehicle node considerably reduces vehicle node and obtains data since above-mentioned data communication process is without establishing routing Delay and cost.

The utility model has the advantages that the present invention provides a kind of efficient Vehicular intelligent network implementation approach, the vehicle node passes through Vehicular intelligent network implementation approach provided by the present invention can quick obtaining data, shorten the delay and cost of data acquisition, mention The success rate of high data acquisition, present invention can apply to the necks such as transmission of important information, such as road conditions monitoring, vehicle management Domain is with a wide range of applications.

Detailed description of the invention

The present invention is done with reference to the accompanying drawings and detailed description and is further illustrated, of the invention is above-mentioned And/or otherwise advantage will become apparent.

Fig. 1 is maintenance of neighbor table flow diagram of the present invention.

Fig. 2 is register flow path schematic diagram of the present invention.

Fig. 3 is that calculating of the present invention routes flow diagram.

Fig. 4 is the flow diagram of the present invention that Makes Path.

Fig. 5 is tables of data visioning procedure schematic diagram of the present invention.

Fig. 6 is data acquisition flow diagram of the present invention.

Specific embodiment:

The present invention provides a kind of efficient Vehicular intelligent network implementation approach, the vehicle node is mentioned through the invention The Vehicular intelligent network implementation approach of confession can quick obtaining data, shorten the delay and cost of data acquisition, improve data acquisition Success rate have wide present invention can apply to fields such as the transmission of important information, such as road conditions monitoring, vehicle management General application prospect.

Fig. 1 is maintenance of neighbor table flow diagram of the present invention.The network includes access node and vehicle node； The region of the network coverage is made of road and crossing, such as crossroad etc.；Road between two crossings is known as Section, section by the two crossings coordinate unique identification；There is a section title in each section；Vehicle node is by electronically Figure obtains the section title in each section and the coordinate at two crossings for defining the section；Electronic map include section title with And the coordinate at two crossings in the section is defined, each vehicle node is pre-configured with electronic map；

Step 101: starting；

Step 104: terminating.

Fig. 2 is register flow path schematic diagram of the present invention.Each access node saves a section table, a section table Item includes section title, the first crossing coordinate and the second crossing coordinate；One access node obtains each road by electronic map Section section title and define the section two interfaces coordinate；Access node creates a section table for each section , the section title of the section list item is equal to the section title in the section, and the first crossing coordinate is a road for defining the section Mouthful coordinate and the coordinate and the distance between the coordinate of the access node at the crossing connect less than the coordinate at another crossing with this The distance between coordinate of ingress；Second crossing coordinate is the coordinate for defining a crossing in the section and the coordinate at the crossing The distance between coordinate of the access node is greater than the distance between the coordinate of the first crossing coordinate and the access node；

Step 201: starting；

Step 209: terminating；

Fig. 3 is that calculating of the present invention routes flow diagram.One access node reaches the routing of a section RS1 Path includes two parts: the routed path for defining a crossing S1 of section RS1, the seat of crossing S1 are reached from the access node The distance between mark and the coordinate of the access node are less than the coordinate and the access node for defining another crossing S2 in the section The distance between coordinate；And the routed path of crossing S2 is reached from crossing S1；Routed path, should by hardware ID set expression The hardware ID for all vehicle nodes that hardware ID set is included by the routed path is constituted；

Step 301: starting；

Step 311: terminating.

Fig. 4 is the flow diagram of the present invention that Makes Path.One access node reaches one positioned at section RS1 The routed path of vehicle node includes two parts: the routing for defining a crossing S1 of section RS1 is reached from the access node Path, the distance between coordinate and the coordinate of the access node of crossing S1 are less than another crossing S2's for defining the section The distance between the coordinate of coordinate and the access node；And the routed path of the vehicle node is reached from crossing S1；Route road The hardware ID for all vehicle nodes that diameter is included by the routed path by hardware ID set expression, the hardware ID set is constituted；

Step 401: starting；

Step 411: terminating.

Fig. 5 is tables of data visioning procedure schematic diagram of the present invention.One access node one tables of data of preservation, one Data table items include data name, section title, data value and life cycle；

Step 501: starting；

Step 517: terminating.

Fig. 6 is data acquisition flow diagram of the present invention.Request message includes type of message, source hardware ID, mesh Hardware ID, purpose coordinate, section title and data name；Response message includes type of message, hardware ID set, section name Title, data name and load；Data DA1 is made of data name NA1 and section title RA1；Vehicle node V1 is located at section RS1 On, in all access nodes, recently with access node AP1 distance, vehicle node V1 obtains data DA1 by following processes:

Step 601: starting；

Step 615: terminating.

Embodiment 1

Based on the simulation parameter of table 1, the present embodiment simulates the efficient Vehicular intelligent network implementations of one of present invention Method, performance evaluation are as follows: when vehicle node quantity increases, data acquisition success rate is reduced, when vehicle node quantity is reduced When, data acquisition success rate improves, and data acquisition success rate is 98.45%.

1 simulation parameter of table

The present invention provides a kind of thinkings of efficient Vehicular intelligent network implementation approach, implement the technical solution There are many method and approach, the above is only a preferred embodiment of the present invention, it is noted that for the common of the art For technical staff, various improvements and modifications may be made without departing from the principle of the present invention, these are improved and profit Decorations also should be regarded as protection scope of the present invention.The available prior art of each component part being not known in the present embodiment is subject to reality It is existing.

Claims

1. a kind of efficient Vehicular intelligent network implementation approach, which is characterized in that the network includes access node and vehicle section Point；The region of the network coverage is made of road and crossing；Road between two crossings is known as section, and section is by this The coordinate unique identification at two crossings；There is a section title in each section；Vehicle node obtains each road by electronic map Section section title and define the section two crossings coordinate；

A kind of data are by a kind of data name unique identification；Positioned at a section data by identify the section section title and Identify the data name unique identification of the data；Each vehicle node or access node are identified by hardware ID, and hardware ID has Network uniqueness；Vehicle node or access node are communicated by message, and message is by type of message unique identification, such as following table It is shown:

Value of message types Message name 1 Neighbours' message 2 Registration message 3 Create message 4 Confirmation message 5 Request message 6 Response message

Each vehicle node safeguards a neighbor table, and a neighbor entry includes hardware ID, coordinate and life cycle；Each neighbours Message includes type of message, hardware ID and coordinate；Vehicle node V1 is periodically executed following operation:

Step 101: starting；

Step 102: vehicle node V1 sends neighbours' message, and the value of message types of neighbours' message is 1, and hardware ID is vehicle node The hardware ID of V1, coordinate are the coordinate of vehicle node V1；

Step 103: after neighbours' vehicle node receives neighbours' message, checking neighbor table；It, should if there is a neighbor entry The hardware ID of neighbor entry is equal to the hardware ID of neighbours' message, then the coordinate thresholding of the neighbor entry is updated to the neighbours and disappeared Life cycle is set maximum value by the coordinate of breath；Otherwise, which creates a neighbor entry, the neighbor table The hardware ID of item is equal to the hardware ID of neighbours' message, and coordinate thresholding is equal to the coordinate of neighbours' message, life cycle is arranged For maximum value；

Step 104: terminating.

Each vehicle node saves an access node table, and an access node list item includes hardware ID and coordinate, for each Access node, vehicle node create an access node table, and the hardware ID and coordinate of the access node table are respectively equal to the access The hardware ID and coordinate of node.

2. a kind of efficient Vehicular intelligent network implementation approach according to claim 1, which is characterized in that each access section Point saves a section table, and a section list item includes section title, the first crossing coordinate and the second crossing coordinate；One access Node obtains the section title in each section by electronic map and defines the coordinate of two interfaces in the section；Access node A section list item is created for each section, the section title of the section list item is equal to the section title in the section, the first via Mouth coordinate is the distance between the coordinate for defining the coordinate at a crossing in the section and the coordinate at the crossing and the access node Less than the coordinate at another crossing and the distance between the coordinate of the access node；Second crossing coordinate is define the section one The coordinate at a crossing and the distance between the coordinate at the crossing and the coordinate of the access node are greater than the first crossing coordinate and connect with this The distance between coordinate of ingress；

One access node saves a meter for vehicle, and a vehicle list item includes hardware ID, coordinate, section title and Life Cycle Phase；Registration message includes type of message, source hardware ID, purpose hardware ID, source coordinate, purpose coordinate and section title；Section RS1 It is defined by coordinate (x1, y1) and coordinate (x2, y2), vehicle node V1 is located on the RS1 of section, if in all access nodes In, coordinate (x1, y1) and coordinate (x2, y2) and the coordinate distance of access node AP1 are nearest, then vehicle node V1 is periodically to access Node AP1 executes registration operation:

Step 201: starting；

Step 202: vehicle node V1 selects a neighbor entry, the coordinate of the coordinate of the neighbor entry and access node AP1 away from From nearest, vehicle node V1 sends a registration message, and the value of message types of the registration message is 2, and source hardware ID is vehicle section The hardware ID of point V1, purpose hardware ID are equal to the hardware ID of the neighbor entry, and source coordinate is equal to the coordinate of vehicle node V1, purpose Coordinate is equal to the coordinate of access node AP1, and section title is equal to the section title of section RS1；

Step 204: the vehicle node for receiving registration message judges whether the hardware ID of oneself is equal to the purpose of the registration message Hardware ID thens follow the steps 205 if be equal to, no to then follow the steps 208；

Step 205: the vehicle node for receiving registration message judges the coordinate of oneself at a distance from the registration message purpose coordinate Whether transmission radius R1 is less than or equal to, if so, 206 are thened follow the steps, it is no to then follow the steps 207；

Step 206: the vehicle node for receiving registration message selects an access node list item, the coordinate of the access node list item Equal to the purpose coordinate of the registration message, the purpose hardware ID of the registration message is updated to the hardware in the access node list item ID forwards the registration message, executes step 203；

Step 207: the vehicle node for receiving registration message selects a neighbor entry, the coordinate of the neighbor entry and the registration The purpose coordinate distance of message is nearest, and the purpose hardware ID of the registration message is updated to the hardware ID of the neighbor entry, forwarding The registration message executes step 203；

Step 208: access node AP1 checks meter for vehicle after receiving registration message；If there is a vehicle list item, the vehicle The hardware ID of list item is equal to the source hardware ID of the registration message, then the coordinate of the vehicle list item is updated to this by access node AP1 The section title of the vehicle list item is updated to the section title of the registration message, by life cycle by the source coordinate of registration message It is set as maximum value；Otherwise, access node AP1 creates a vehicle list item, and the hardware ID of the vehicle list item is equal to the registration and disappears The source hardware ID of breath, coordinate are equal to the source coordinate of the registration message, and section title is equal to the section title of the registration message, will give birth to The life period is set as maximum value；

Step 209: terminating；

If coordinate (x1, y1) is nearest apart from access node AP1 and coordinate (x2, y2) is nearest apart from access node AP2, or sits (x1, y1) is marked apart from access node AP2 recently and coordinate (x2, y2) is apart from the nearest vehicle node V1 of access node AP1, then vehicle Node V1 executes above-mentioned registration operation to access node AP1 and access node AP2 simultaneously.

3. a kind of efficient Vehicular intelligent network implementation approach according to claim 1, which is characterized in that an access section The routed path that point reaches a section RS1 includes two parts: a crossing for defining section RS1 is reached from the access node The routed path of S1, the distance between coordinate and the coordinate of the access node of crossing S1 are less than another road for defining the section The coordinate of mouth S2 and the distance between the coordinate of the access node；And the routed path of crossing S2 is reached from crossing S1；Routing The hardware ID structure for all vehicle nodes that path is included by the routed path by hardware ID set expression, the hardware ID set At；

Section RS1 is defined by crossing S1 and crossing S2, and the coordinate of crossing S1 is (x1, y1), and the coordinate of crossing S2 is (x2, y2), In all access nodes, coordinate (x1, y1) is nearest apart from access node AP1, and coordinate (x1, y1) and access node AP1 The distance between coordinate be less than the distance between the coordinate of coordinate (x2, y2) and access node AP1；

Step 301: starting；

Step 302: the initial value that hardware ID set a variable hs1, variable hs1 is arranged in access node AP1 is sky；Access node AP1 selects a vehicle list item E1, and the coordinate of vehicle list item E1 is equal to (x1, y1)；If coordinate and the access of vehicle list item E1 The distance between coordinate of node AP1 is less than or equal to transmission radius R1, thens follow the steps 306；It is no to then follow the steps 303；

Step 303: access node AP1 selects a vehicle list item E2, the coordinate of vehicle list item E2 and the coordinate of access node AP1 The distance between be less than transmission radius R1, and the distance between coordinate of the coordinate of vehicle list item E2 and vehicle list item E1 is recently, The hardware ID of vehicle list item E2 is added in variable hs1 and as the last one element；

Step 304: access node AP1 selects a vehicle list item E3, and the hardware ID of vehicle list item E3 is last equal to variable hs1 One element；If the distance between coordinate of the coordinate of vehicle list item E3 and vehicle list item E1 is less than or equal to transmission radius R1, thens follow the steps 306, no to then follow the steps 305；

Step 305: access node AP1 selects a vehicle list item E4, the coordinate of vehicle list item E4 and the coordinate of vehicle list item E3 The distance between be less than or equal to transmission radius R1, and between the coordinate of vehicle list item E4 and the coordinate of vehicle list item E1 away from From minimum, the hardware ID of vehicle list item E4 is added in variable hs1 and as the last one element, execution step 304；

Step 306: the hardware ID of vehicle list item E1 is added in variable hs1 and as the last one element by access node AP1； Access node AP1 selects a vehicle list item E5, and the coordinate of vehicle list item E5 is equal to (x2, y2)；If the seat of vehicle list item E1 The distance between mark and the coordinate of vehicle list item E5 are less than or equal to transmission radius R1, then follow the steps 310, otherwise execute step Rapid 307；

Step 307: access node AP1 selects a vehicle list item E6, the coordinate of vehicle list item E6 and the coordinate of vehicle list item E1 The distance between be less than or equal to transmission radius R1 and between the coordinate of vehicle list item E6 and the coordinate of vehicle list item E5 away from From minimum, the hardware ID of vehicle list item E6 is added in variable hs1 and as the last one element；

Step 308: access node AP1 selects a vehicle list item E7, and the hardware ID of vehicle list item E7 is last equal to variable hs1 One element；If the distance between coordinate of the coordinate of vehicle list item E7 and vehicle list item E5 is less than or equal to transmission radius R1, thens follow the steps 310, no to then follow the steps 309；

Step 309: access node AP1 selects a vehicle list item E8, the coordinate of vehicle list item E8 and the coordinate of vehicle list item E7 The distance between be less than or equal to transmission radius R1, and between the coordinate of vehicle list item E8 and the coordinate of vehicle list item E5 away from From minimum, the hardware ID of vehicle list item E8 is added in variable hs1 and as the last one element, execution step 308；

Step 310: the hardware ID of vehicle list item E5 is added in variable hs1 and as the last one element by access node AP1；

Step 311: terminating.

4. a kind of efficient Vehicular intelligent network implementation approach according to claim 3, which is characterized in that an access section The routed path that point reaches a vehicle node positioned at section RS1 includes two parts: reaching from the access node and defines road The routed path of a crossing S1 of section RS1, it is fixed that the distance between coordinate and the coordinate of the access node of crossing S1 are less than The coordinate of another crossing S2 in the adopted section and the distance between the coordinate of the access node；And the vehicle is reached from crossing S1 The routed path of node；The institute that routed path is included by the routed path by hardware ID set expression, the hardware ID set There is the hardware ID of vehicle node to constitute；

Section RS1 is defined by crossing S1 and crossing S2, and the coordinate of crossing S1 is (x1, y1), and the coordinate of crossing S2 is (x2, y2), In all access nodes, coordinate (x1, y1) is nearest apart from access node AP1, and coordinate (x1, y1) and access node AP1 The distance between coordinate be less than the distance between the coordinate of coordinate (x2, y2) and access node AP1；Vehicle node V1 is located at road On section RS1；Access node AP1 executes operations described below and establishes the routed path that oneself reaches vehicle node V1:

Step 401: starting；

Step 402: the initial value that hardware ID set a variable hs2, variable hs2 is arranged in access node AP1 is sky；Access node AP1 selects a vehicle list item T1, and the coordinate of vehicle list item T1 is equal to (x1, y1)；If coordinate and the access of vehicle list item T1 The distance between coordinate of node AP1 is less than or equal to transmission radius R1, thens follow the steps 406；It is no to then follow the steps 403；

Step 403: access node AP1 selects a vehicle list item T2, the coordinate of vehicle list item T2 and the coordinate of access node AP1 The distance between be less than transmission radius R1, and the distance between coordinate of the coordinate of vehicle list item T2 and vehicle list item T1 is recently, The hardware ID of vehicle list item T2 is added in variable hs2 and as the last one element；

Step 404: access node AP1 selects a vehicle list item T3, and the hardware ID of vehicle list item T3 is last equal to variable hs2 One element；If the distance between coordinate of the coordinate of vehicle list item T3 and vehicle list item T1 is less than or equal to transmission radius R1, thens follow the steps 406, no to then follow the steps 405；

Step 405: access node AP1 selects a vehicle list item T4, the coordinate of vehicle list item T4 and the coordinate of vehicle list item T3 The distance between be less than or equal to transmission radius R1, and between the coordinate of vehicle list item T4 and the coordinate of vehicle list item T1 away from From minimum, the hardware ID of vehicle list item T4 is added in variable hs2 and as the last one element, execution step 404；

Step 406: the hardware ID of vehicle list item T1 is added in variable hs2 and as the last one element by access node AP1； Access node AP1 selects a vehicle list item T5, and the hardware ID of vehicle list item T5 is equal to the hardware ID of vehicle node V1；If vehicle The distance between coordinate and the coordinate of vehicle list item T5 of list item T1 are less than or equal to transmission radius R1, then follow the steps 410, it is no to then follow the steps 407；

Step 407: access node AP1 selects a vehicle list item T6, the coordinate of vehicle list item T6 and the coordinate of vehicle list item T1 The distance between be less than or equal to transmission radius R1 and between the coordinate of vehicle list item T6 and the coordinate of vehicle list item T5 away from From minimum, the hardware ID of vehicle list item T6 is added in variable hs1 and as the last one element；

Step 408: access node AP1 selects a vehicle list item T7, and the hardware ID of vehicle list item T7 is last equal to variable hs2 One element；If the distance between coordinate of the coordinate of vehicle list item T7 and vehicle list item T5 is less than or equal to transmission radius R1, thens follow the steps 410, no to then follow the steps 409；

Step 409: access node AP1 selects a vehicle list item T8, the coordinate of vehicle list item T8 and the coordinate of vehicle list item T7 The distance between be less than or equal to transmission radius R1, and between the coordinate of vehicle list item T8 and the coordinate of vehicle list item T5 away from From minimum, the hardware ID of vehicle list item T8 is added in variable hs2 and as the last one element, execution step 408；

Step 410: the hardware ID of vehicle list item T5 is added in variable hs2 and as the last one element by access node AP1；

Step 411: terminating.

5. a kind of efficient Vehicular intelligent network implementation approach according to claim 4, which is characterized in that an access section Point saves a tables of data, and a data table items include data name, section title, data value and life cycle；

Section RS1 is defined by crossing S1 and crossing S2, and the coordinate of crossing S1 is (x1, y1), and the coordinate of crossing S2 is (x2, y2), In all access nodes, coordinate (x1, y1) is nearest apart from access node AP1, and coordinate (x1, y1) and access node AP1 The distance between coordinate be less than the distance between the coordinate of coordinate (x2, y2) and access node AP1；Positioned at the number of section RS1 It is identified according to DA1 by data name NA1 and section title RA1；Access node AP1 executes operations described below and creates the entitled RA1 in section With the data table items of data name NA1:

Step 501: starting；

Step 502: access node AP1 executes step 301~311 and obtains hardware ID lumped parameter hs1, and parameter hs1 indicates access Node AP1 reaches the routed path of section RS1, sends a creation message, and the value of message types of the creation message is 3, section Entitled RA1, hardware ID set are equal to parameter hs1, data name NA1, and source hardware ID is equal to the hardware of access node AP1 ID；

Step 503: vehicle node receives the creation message；If the vehicle node is located at section RS1,506 are thened follow the steps, It is no to then follow the steps 504；

Step 504: the vehicle node for receiving creation message judges whether the hardware ID of oneself is equal to the creation message hardware ID First element in set thens follow the steps 505 if be equal to, no to then follow the steps 511；

Step 505: the vehicle node for receiving creation message deletes first element from the hardware ID set of the creation message, The creation message is forwarded, step 503 is executed；

Step 506: receive creation message vehicle node judge oneself whether to provide the creation message data name and The data that section title is identified, if it can, 507 are thened follow the steps, it is no to then follow the steps 508；

Step 507: the vehicle node for receiving creation message selects an access node list item, the hardware of the access node list item ID is equal to the source hardware ID of the creation message, selects a neighbor entry, the coordinate of the neighbor entry and the access node list item The distance between coordinate recently, send a confirmation message, the value of message types of the confirmation message is 4, section title sum number It is respectively equal to the section title and data name of the creation message according to title, purpose hardware ID is equal to the hardware of the neighbor entry ID, purpose coordinate are equal to the coordinate of the access node list item, and the section name data title loaded as the creation message is identified Data, execute step 511；

Step 508: the vehicle node for receiving creation message judges whether the hardware ID of oneself is equal to the creation message hardware ID First element in set thens follow the steps 509 if be equal to, no to then follow the steps 511；

Step 509: the vehicle node for receiving creation message deletes first element from the hardware ID set of the creation message, If the hardware ID collection of the creation message is combined into sky, 511 are thened follow the steps, it is no to then follow the steps 510；

Step 512: the vehicle node for receiving confirmation message judges whether the hardware ID of oneself is equal to the purpose of the confirmation message Hardware ID thens follow the steps 513 if be equal to, no to then follow the steps 516；

Step 513: the vehicle node for receiving confirmation message judges the coordinate of oneself at a distance from the confirmation message purpose coordinate Whether transmission radius R1 is less than or equal to, if so, 514 are thened follow the steps, it is no to then follow the steps 515；

Step 514: the vehicle node for receiving confirmation message selects an access node list item, the coordinate of the access node list item Equal to the purpose coordinate of the confirmation message, the purpose hardware ID of the confirmation message is updated to the hardware in the access node list item ID forwards the confirmation message, executes step 511；

Step 515: the vehicle node for receiving confirmation message selects a neighbor entry, the coordinate of the neighbor entry and the confirmation The purpose coordinate distance of message is nearest, and the purpose hardware ID of the confirmation message is updated to the hardware ID of the neighbor entry, forwarding The confirmation message executes step 511；

Step 516: access node AP1 checks tables of data after receiving the confirmation message, if there is a data table items, the number It is respectively equal to the data name and section title of the confirmation message according to the data name and section title of list item, then by the tables of data The data value of item is updated to the data in confirmation message load, sets maximum value for life cycle；Otherwise, access node AP1 creates a data table items, and the data name and section title of the data table items are respectively equal to the data name of the confirmation message Claim and section title, data value are equal to the data in confirmation message load, life cycle is set as maximum value；

Step 517: terminating.

6. a kind of efficient Vehicular intelligent network implementation approach according to claim 5, which is characterized in that request message packet Containing type of message, source hardware ID, purpose hardware ID, purpose coordinate, section title and data name；Response message includes message class Type, hardware ID set, section title, data name and load；Data DA1 is made of data name NA1 and section title RA1； Vehicle node V1 is located on the RS1 of section, and in all access nodes, recently with access node AP1 distance, vehicle node V1 passes through Following processes obtain data DA1:

Step 601: starting；

Step 602: vehicle node V1 selects a neighbor entry, the coordinate of the coordinate of the neighbor entry and access node AP1 away from From nearest, a request message is sent, the value of message types of the request message is 5, and source hardware ID is hard equal to vehicle node V1's Part ID, purpose hardware ID are equal to the hardware ID of the neighbor entry, and purpose coordinate is equal to the coordinate of access node AP1, section title Equal to RA1, data name is equal to NA1；

Step 604: the vehicle node for receiving request message checks whether hardware ID is equal to the purpose hardware ID of the request message, If be equal to, 605 are thened follow the steps, it is no to then follow the steps 608；

Step 605: the vehicle node for receiving request message judges the coordinate of oneself at a distance from the request message purpose coordinate Whether transmission radius R1 is less than or equal to, if so, 606 are thened follow the steps, it is no to then follow the steps 607；

Step 606: the vehicle node for receiving request message selects an access node list item, the coordinate of the access node list item Equal to the purpose coordinate of the request message, the purpose hardware ID of the request message is updated to the hardware in the access node list item ID forwards the request message, executes step 603；

Step 607: the vehicle node for receiving request message selects a neighbor entry, the coordinate of the neighbor entry and the request The purpose coordinate distance of message is nearest, and the purpose hardware ID of the request message is updated to the hardware ID of the neighbor entry, forwarding The request message executes step 603；

Step 608: access node AP1 checks tables of data after receiving request message, if there is a data table items, the data The section title and data name of list item are respectively equal to the section title and data name of the request message, then follow the steps 610, It is no to then follow the steps 609；

Step 609: access node AP1 executes step 501~517 one data table items of creation, the section title of the data table items It is respectively equal to the section title and data name of the request message received with data name；

Step 610: access node AP1 selects a vehicle list item, and the hardware ID of the vehicle list item is equal to the request received and disappears The source hardware ID of breath executes step 401~411 and obtains hardware ID lumped parameter hs2, and parameter hs2 indicates that access node AP1 is reached The routed path for the vehicle node that the request message source hardware ID is identified；Access node AP1 selects a data table items, the number It is respectively equal to the section title and data name of the request message according to the section title and data name of list item, sends a response Message, the value of message types of the response message are 6, and hardware ID set is equal to parameter hs2, and section title and data name are respectively etc. In the section title and data name of the request message, the data value for the data table items is loaded；

Step 611: vehicle node receives response message；If the hardware ID of the vehicle node is equal to the response message hardware ID First element of set, thens follow the steps 612, no to then follow the steps 614；

Step 612: the vehicle node for receiving response message deletes first element from the response message hardware ID set, such as The hardware ID set of the fruit response message is equal to sky, thens follow the steps 614, no to then follow the steps 613；

Step 615: terminating.