CN107333313B

CN107333313B - Reliable intelligent Internet of vehicles routing implementation method

Info

Publication number: CN107333313B
Application number: CN201710750799.XA
Authority: CN
Inventors: 王晓喃
Original assignee: Changshu Institute of Technology
Current assignee: Changshu Institute of Technology
Priority date: 2017-08-28
Filing date: 2017-08-28
Publication date: 2020-03-24
Anticipated expiration: 2037-08-28
Also published as: CN107333313A

Abstract

The invention provides a reliable intelligent Internet of vehicles routing implementation method, wherein the Internet of vehicles comprises an access router, a base station and vehicle nodes; the vehicle nodes comprise predictable vehicle nodes and random vehicle nodes, the driving routes of the predictable vehicle nodes are preset, and the driving routes of the random vehicle nodes are not preset. The vehicle node can rapidly acquire the service data in a unicast mode through the intelligent Internet of vehicles routing implementation method provided by the invention, the delay and cost for acquiring the service data are reduced, the service quality is improved, and the method can be applied to the fields of road condition monitoring, vehicle management, multimedia data acquisition and the like, and has wide application prospect.

Description

Reliable intelligent Internet of vehicles routing implementation method

Technical Field

The invention relates to a route implementation method, in particular to a reliable intelligent Internet of vehicles route implementation method.

Background

The on-board network is a service model that is built on board the vehicle and provides local services. In recent years, much research effort has been devoted to on-board networks to enable vehicle drivers to quickly obtain network services. With the development of network technology, the car-mounted network will become a mode for providing services in the future.

At present, the implementation mode of the vehicle-mounted network is realized through broadcasting, so that both delay and cost are large, and the network service performance is reduced. Therefore, how to reduce the delay and cost of providing services by the car-mounted network becomes a hot issue of research in recent years.

Disclosure of Invention

The purpose of the invention is as follows: the invention aims to solve the technical problem of providing a reliable intelligent Internet of vehicles routing implementation method aiming at the defects of the prior art. The invention realizes the data transmission of the Internet of vehicles in a unicast mode, thereby reducing the delay and the cost of providing data service by the Internet of vehicles and effectively improving the network service performance.

The technical scheme is as follows: the invention discloses a reliable intelligent Internet of vehicles routing implementation method, wherein the Internet of vehicles comprises an access router, a base station and vehicle nodes; the vehicle nodes comprise predictable vehicle nodes and random vehicle nodes, and the driving routes of the predictable vehicle nodes are preset, such as buses, and the driving routes of the random vehicle nodes are not preset; the access router is connected with the Internet, and the base station is connected with the access router; base stations are arranged at intersections of all roads, the road between two base stations is called a road section, and one base station can be arranged on more than one road section; if a vehicle node running on a road section can communicate with a base station on the road section through single-hop forwarding or multi-hop forwarding, the relationship between the vehicle node and the base station is expressed as a communication relationship; if a vehicle node running on a road section cannot communicate with a base station on the road section through single-hop forwarding or multi-hop forwarding, the relationship between the vehicle node and the base station is represented as a non-connected relationship; the access router is connected with the base stations and vehicle nodes which are communicated with the base stations form a domain;

the vehicle nodes communicate through the global address and the local address; the global address is composed of a routing prefix, a base station ID, a node ID and a local identifier; the routing prefix uniquely identifies one domain, the base station ID uniquely identifies one base station, the node ID uniquely identifies one vehicle node, the local identification is used for identifying whether one address is a global address or a local address, the local identification of the global address is 1, and the local identification of the local address is 0; the base station ID and the node ID of the global address of the access router are 0, and the node ID of the global address of the base station ID is 0; the local address is composed of a geographic coordinate, a base station ID, a node ID and a local identifier; the geographic coordinates are those of the vehicle nodes or the base station; the base station ID uniquely identifies a base station; the node ID uniquely identifies a vehicle node; the local identification of the local address is 0;

the method comprises the following steps that when a vehicle node registers to an official party, a license plate number is obtained, and a home address is allocated to the vehicle node; if the routing prefix of the home address of one vehicle node is the same as that of one access router, the access router is called as the home router of the vehicle node; if the routing prefix and the base station ID of the home address of one vehicle node are the same as the routing prefix and the base station ID of the global address of one base station, the base station is called as the home base station of the vehicle node;

the node ID of the vehicle node is the license plate number of the vehicle node; if an access router is connected with a base station through an interface y of the access router, the ID of the base station is y;

the base station stores a vehicle list, the list name of the vehicle list is the local address of the base station, and a vehicle list item comprises a local address field and a time stamp; the base station stores a switching table at the same time, the table name of the switching table is the global address of the base station, and a switching table item comprises a home address field, a care-of address field, a switching identifier and a time stamp;

the method comprises the steps that a vehicle node regularly broadcasts a beacon message after being started, the load of the beacon message is a timestamp and a home address, a source address is a local address of the vehicle node, in the local address of the vehicle node, a geographic coordinate and a node ID are a current geographic coordinate and a license plate number of the vehicle node, and a base station ID is 0;

after the vehicle node V1 located in the road section RS1 is started, beacon messages are broadcasted periodically, the load of the beacon messages is a time stamp and a home address, and a base station located in the road section RS1 establishes vehicle list items and switching list items through the following processes:

step 101: starting;

step 102: if the base station receives the beacon message of the vehicle node V1, executing step 103, otherwise executing step 104;

step 103: the base station checks the received beacon message, if the beacon message with the same source address and timestamp is received, step 106 is executed, otherwise step 108 is executed;

step 104: if the beacon message of vehicle node V1 is received, then step 106 is performed, otherwise step 105 is performed;

step 105: if the vehicle node that received the beacon message of the vehicle node V1 is located on the road segment RS1, perform step 107, otherwise perform step 106;

step 106: the vehicle node or the base station which receives the beacon message of the vehicle node V1 discards the beacon message, and executes step 111;

step 107: the vehicle node which receives the beacon message of the vehicle node V1 forwards the received beacon message, and step 102 is executed;

step 108: the base station receiving the beacon message of the vehicle node V1 checks the vehicle table, if there is a vehicle table entry whose node ID of the local address is equal to the node ID of the home address in the beacon message load, then step 109 is executed, otherwise step 110 is executed;

step 109: the base station receiving the beacon message of the vehicle node V1 selects a vehicle entry whose node ID of the local address is equal to the node ID of the home address in the beacon message load, sets the local address of the vehicle entry as the source address of the beacon message, and sets the timestamp as the timestamp in the beacon message; if there is a switching entry whose node ID of the home address is equal to that of the beacon message load, the base station sets the timestamp of the switching entry as the timestamp of the beacon message, and executes step 111;

step 110: the base station receiving the beacon message of the vehicle node V1 constructs a local address, the geographic coordinate and the node ID of the local address are equal to the geographic coordinate and the node ID of the source address of the beacon message, and the base station ID is equal to the base station ID of the base station; then the base station creates a vehicle list item, the local address of the vehicle list item is equal to the constructed local address, and the timestamp is equal to the timestamp in the beacon message; the base station creates a global address, the network prefix and the base station ID of the global address are equal to the network prefix and the fighting ID of the global address of the base station, the node ID is equal to the node ID of the source address of the beacon message, then a switching table entry is created, the home address of the switching table entry is the home address in the beacon message, the care-of address is the created global address, the switching identification is 0, and the timestamp is the timestamp in the beacon message;

step 111: finishing;

the base station establishes or updates vehicle list items and switching list items of other vehicle nodes through the process; if the base station does not receive the beacon message of the vehicle node V1 within a predetermined time (e.g., 1s), the vehicle table entry and the switch table entry of the vehicle node V1 are deleted.

The above process can correctly establish the vehicle list item and the switching list item so as to quickly judge the connectivity of the vehicle and quickly execute the mobile switching for the vehicle node.

In the method, a base station regularly broadcasts a beacon message after being started, the load of the beacon message is a timestamp, a source address is a local address of the base station, in the local address, a geographical coordinate and a base station ID are a current geographical coordinate and a base station ID of the base station, and a node ID is 0; the vehicle node stores a base station table, and one base station table comprises a local address field and a time stamp;

if the base station BS1 belongs to the road segments RS1 and RS2, which periodically broadcast beacon messages, the vehicle node establishes a base station entry for the base station BS1 according to the following algorithm:

step 201: starting;

step 202: if the base station receives the beacon message of the base station BS1, execute step 203, otherwise execute step 204;

step 203: the base station which received the beacon message of the base station BS1 discards the beacon message, and performs step 209;

step 204: if the vehicle node located on the road segment RS1 or the road segment RS2 receives the beacon message, step 205 is performed, otherwise step 208 is performed;

step 205: judging whether the vehicle node has received a beacon message with the same source address and timestamp, if so, executing step 208, otherwise, executing step 206;

step 206: if a base station table entry with a local address equal to the source address of the beacon message exists in the base station table of the vehicle node receiving the beacon message, setting the timestamp of the base station table entry as the timestamp in the beacon message; otherwise, the vehicle node creates a base station table, the local address of the base station table is equal to the source address of the beacon message, and the timestamp is equal to the timestamp in the beacon message;

step 207: the vehicle node receiving the beacon message forwards the beacon message, and step 202 is executed;

step 208: the vehicle node receiving the beacon message discards the beacon message;

step 209: finishing;

if the vehicle node does not receive the beacon message of the base station BS1 within a predetermined time (e.g., 1s), the base station entry of the base station BS1 is deleted.

The above process can correctly establish the base station table so as to quickly judge the connectivity of the base station and realize correct communication.

In the method, a base station sends beacon messages to a connected access router periodically, wherein the source address of the beacon messages is the global address of the base station, the destination address is the global address of the access router, and the load is a switching table and a vehicle table; after the base station sends the beacon message, the switching identifiers of all the table entries in the switching table are set to be 1; after receiving the beacon message of the base station, the access router stores a switching table and a vehicle table;

the access router maintains an address mapping table, and an address mapping table item comprises a home address and a care-of address domain;

if the access router of the domain D1 is AR1, after the access router AR1 receives the beacon messages with all the base stations in the domain D1, the following mobility management operations are performed:

step 301: starting;

step 302: the access router AR1 checks all switching tables, selects the switching table entry with the switching identifier of 0, and deletes one switching table entry if the home addresses in any two switching table entries are the same; the access router AR1 groups these switching table entries, and the routing prefix of the home address of the switching table entry of each group is the same; the access router AR1 then performs the following for each group: if the routing prefix of the home address of the switching table entry of the group is equal to the routing prefix of the access router AR1, executing step 303, otherwise executing step 304;

step 303: the access router AR1 will perform the following for each handover table entry in the set: looking up the address mapping table, selecting the address mapping table whose home address is equal to the home address in the switching table, updating the care-of address of the address mapping table to the care-of address of the switching table, and executing step 306;

step 304: the access router AR1 constructs a global address, the routing prefix of the global address is equal to the routing prefix of the home address of the switching list item, and the base station ID and the node ID are 0; the access router AR1 sends a mobile management message, the source address of the mobile management message is its own global address, the destination address is the constructed global address, and the load is all the switching table entries in the group;

step 305: after receiving the mobile management message, the destination access router executes the following operations for each switching table entry in the mobile management message: looking up the address mapping table, selecting the address mapping table whose home address is equal to the home address in the switching table item, and updating the care-of address of the address mapping table to the care-of address of the switching table item;

step 306: the access router deletes all the stored switching tables;

step 307: finishing;

the above process can realize mobile switching rapidly so as to ensure the correctness and continuity of communication.

In the method, the beacon message can be predicted to be regularly broadcast by the vehicle node, and the load of the beacon message is the geographic coordinate, the timestamp and the home address of the base station through which the driving route passes; after receiving the beacon message, the other vehicles store the geographic coordinates of the base station through which the driving route of the predictable vehicle node passes;

under the condition that the vehicle node V1 and the vehicle node V2 are located in the domain D1, the access router of the domain D1 is AR1, and the geographic coordinates of the vehicle node V2 are H1, the vehicle node V1 realizes communication with the vehicle node V2 by:

step 401: starting;

step 402: the vehicle node V1 constructs a request message, the source address of the request message is the global address of the vehicle node V1, in the global address of the vehicle node V1, the network prefix and the base station ID are 0, the vehicle ID is the license plate number of the vehicle node V1, the destination address of the request message is the home address H2, and step 404 is executed;

step 403: if the vehicle node receives the request message, executing step 404, otherwise executing step 409; the vehicle nodes are vehicle nodes on the request message routing path, namely vehicle nodes on the routing paths of vehicles V1 to V2;

step 404: if the base station table of the vehicle node constructing or receiving the request message is empty, executing step 405, otherwise executing step 408;

step 405: the vehicle node constructing or receiving the request message checks whether the neighbor vehicle node has a predictable vehicle node and the driving route of the predictable vehicle node passes through any base station in the domain D1, if so, step 406 is executed, otherwise, step 407 is executed;

step 406: the vehicle node which constructs or receives the request message forwards the request message to the predictable vehicle node, and step 403 is executed;

step 407: the vehicle node which constructs or receives the request message saves the request message and continues to run, and step 403 is executed;

step 408: the vehicle node which constructs or receives the request message checks the base station table, selects the base station table item with the geographical coordinate of the local address closest to the vehicle node, then forwards the request message to the neighbor vehicle node or the base station with the geographical coordinate closest to the local address of the base station table item, and executes step 403;

step 409: the base station receiving the request message forwards the request message to the access router AR1, the access router AR1 checks all vehicle tables, selects the vehicle table item of which the node ID of the local address is equal to the node ID of the source address of the request message, and updates the source address of the request message to the local address of the vehicle table item; the access router AR1 checks all vehicle lists, selects the vehicle list item with the node ID of the local address equal to the node ID of the destination address of the request message, and updates the destination address of the request message to the local address of the vehicle list item; then the access router AR1 forwards the request message to the destination base station, i.e. the base station whose ID is the same as the base station ID of the destination address of the request message;

step 410: after receiving the request message, the target base station forwards the request message to a neighbor vehicle node closest to the geographic coordinate in the destination address of the request message;

step 411: if the vehicle node V2 receives the request message, go to step 413, otherwise go to step 412;

step 412: the vehicle node receiving the request message forwards the request message to the neighbor vehicle node closest to the geographic coordinate in the destination address of the request message, and step 411 is executed;

step 413: the vehicle node V2 sends a response message, the source address of the response message is the destination address of the received request message, the destination address of the response message is the source address of the received request message, and the load is response data;

step 414: if the vehicle node receives the response message, executing step 415, otherwise executing step 421, the vehicle node being a vehicle node on the routing path from the vehicle node V2 to the vehicle node V1;

step 415: if the vehicle node V1 receives the response message, then step 425 is performed, otherwise step 416 is performed;

step 416: if the base station table of the vehicle node receiving the response message is empty, executing step 417, otherwise executing step 420;

step 417: the vehicle node receiving the response message checks whether the neighbor vehicle node has a predictable vehicle node and the driving route of the predictable vehicle node passes through any base station in the domain D1, if so, step 418 is executed, otherwise, step 419 is executed;

step 418: the vehicle node receiving the response message forwards the response message to the predictable vehicle node, and step 414 is executed;

step 419: the vehicle node receiving the response message saves the response message and continues to run, and step 414 is executed;

step 420: the vehicle node receiving the response message checks the base station table, selects the base station table entry with the geographic coordinate of the local address closest to the vehicle node, then forwards the request message to the neighbor vehicle node or the base station closest to the geographic coordinate of the local address of the base station table entry, and executes step 414;

step 421: the base station receiving the response message forwards the response message to the access router AR1, and the access router AR1 forwards the response message to the destination base station, namely, the base station with the same base station ID as the base station ID of the destination address of the response message;

step 422: after receiving the response message, the target base station forwards the response message to the neighbor vehicle node closest to the geographic coordinate in the destination address of the response message;

step 423: if the vehicle node V1 receives the response message, go to step 425, otherwise go to step 424;

step 424: the vehicle node receiving the response message forwards the response message to the neighbor vehicle node closest to the geographic coordinate in the destination address of the response message, and executes step 423;

step 425: the vehicle node V1 saves the response data of the response message;

step 426: and (6) ending.

The above process can realize data communication rapidly, thereby effectively reducing communication delay and improving service quality.

In the method of the invention, under the condition that a vehicle node V1 is located in a domain D1, an access router in the domain D1 is AR1, a vehicle node V3 is located in a domain D3, an access router in the domain D3 is AR3, and a home address of the vehicle node V3 is H3, the vehicle node V1 realizes communication with a vehicle node V3 through the following processes:

step 501: starting;

step 502: the vehicle node V1 sends a communication request message, the destination address of the request message is a home address H3, the source address is a global address of the vehicle node V1, in the global address of the vehicle node V1, the network prefix and the base station ID are 0, the vehicle ID is the license plate number of the vehicle node V1, and step 504 is executed;

step 503: if the vehicle node receives the request message, step 504 is executed, otherwise step 509 is executed; the vehicle node is a vehicle node on the request message routing path, namely the vehicle node on the routing path from the vehicle node V1 to the vehicle node V3;

step 504: if the base station table of the vehicle node constructing or receiving the request message is empty, executing step 505, otherwise executing step 508;

step 505: the vehicle node constructing or receiving the request message checks whether the neighbor vehicle node has a predictable vehicle node and the driving route of the predictable vehicle node passes through any base station in the domain D1, if so, the step 506 is executed, otherwise, the step 507 is executed;

step 506: the vehicle node which constructs or receives the request message forwards the request message to the predictable vehicle node, and step 503 is executed;

step 507: the vehicle node which constructs or receives the request message stores the request message and continues to run, and step 503 is executed;

step 508: the vehicle node which constructs or receives the request message checks the base station table, selects the base station table item with the geographical coordinate of the local address closest to the vehicle node, then forwards the request message to the neighbor vehicle node or the base station with the geographical coordinate closest to the local address of the base station table item, and executes step 503;

step 509: the base station receiving the request message sets the routing prefix and the base station ID of the source address of the request message as the routing prefix and the base station ID of the base station, then forwards the request message to the access router AR1, and the access router AR1 forwards the request message to the Internet; finally, the request message reaches a target access router, and the network prefix of the target access router is the same as that of the destination address of the communication request message;

step 510: the access router receiving the request message checks all vehicle tables, if the vehicle table item with the node ID of the local address field value equal to the node ID of the destination address of the request message exists, executing step 512, otherwise executing step 511;

step 511: the access router receiving the request message checks the address mapping table, selects an address mapping table entry with a home address equal to the destination address of the request message, updates the destination address of the request message to a care-of address field value of the address mapping table entry, forwards the request message through the internet, finally, the request message reaches the destination access router, the network prefix of the destination access router is the same as that of the destination address of the request message, and executes step 510;

step 512: the access router receiving the request message selects the vehicle list item of which the node ID of the local address is equal to the node ID of the destination address of the request message, and updates the destination address of the request message into the local address of the vehicle list item; then the access router AR1 forwards the request message to the destination base station, i.e. the base station whose ID is the same as the base station ID of the destination address of the request message; after receiving the request message, the target base station ID forwards the request message to a neighbor vehicle node closest to the geographic coordinate in the target address of the request message;

step 513: if the vehicle node V3 receives the request message, go to step 515, otherwise go to step 514;

step 514: the vehicle node receiving the request message forwards the request message to the neighbor vehicle node closest to the geographic coordinate in the destination address of the request message, and step 513 is executed;

step 515: the vehicle node V3 sends a response message, the source address of the response message is the destination address of the received request message, the destination address of the response message is the source address of the received request message, and the load is response data;

step 516: if the vehicle node receives the response message, executing step 517, otherwise executing step 523, wherein the vehicle node is a vehicle node on a routing path from the vehicle node V3 to the vehicle node V1;

517: if the vehicle node V1 receives the response message, go to step 526, otherwise go to step 518;

step 518: if the base station table of the vehicle node receiving the response message is empty, executing step 519, otherwise executing step 522;

step 519: the vehicle node receiving the response message checks whether the neighbor vehicle node has a predictable vehicle node, and the driving route of the predictable vehicle node passes through any base station in the domain D1, if so, step 520 is executed, otherwise, step 521 is executed;

step 520: the vehicle node receiving the response message forwards the response message to the predictable vehicle node, and step 516 is executed;

step 521: the vehicle node receiving the response message saves the response message and continues to run, and step 516 is executed;

step 522: the vehicle node receiving the response message checks the base station table, selects the base station table entry with the geographic coordinate of the local address closest to the vehicle node, then forwards the request message to the neighbor vehicle node or the base station with the geographic coordinate closest to the local address of the base station table entry, and executes step 516;

step 523: the base station receiving the response message creates a global address, the base station receiving the response message constructs a global address, the routing prefix and the base station ID of the global address are equal to the routing prefix and the base station ID of the base station, the node ID is equal to the node ID of the source address of the response message, then the source address of the response message is set as the constructed global address, and the response message is forwarded to the access router AR 3; the access router AR3 forwards the response message to the Internet, and finally the response message reaches the access router AR1 through the Internet; the access router AR1 forwards the response message to the destination base station, i.e. the base station whose base station ID is the same as the base station ID of the destination address of the response message; after receiving the response message, the target base station checks the vehicle list, selects the vehicle list item of which the node ID of the local address domain value is equal to the node ID of the destination address of the response message, updates the destination address of the response message into the local address of the vehicle list item, and then forwards the response message to the neighbor vehicle node closest to the geographic coordinate in the destination address of the response message;

step 524: if the vehicle node V1 receives the response message, go to step 526, otherwise go to step 525;

step 525: the vehicle node receiving the response message forwards the response message to the neighbor vehicle node closest to the geographic coordinate in the destination address of the response message, and executes step 524;

step 526: the vehicle node V1 saves the response data of the response message;

step 527: and (6) ending.

Has the advantages that: the invention provides a reliable method for realizing the routing of the intelligent Internet of vehicles, and the vehicle nodes can quickly acquire service data in a unicast mode through the method for realizing the routing of the intelligent Internet of vehicles, thereby shortening the delay and the cost for acquiring the service data, improving the service quality.

Drawings

The foregoing and/or other advantages of the invention will become further apparent from the following detailed description of the invention when taken in conjunction with the accompanying drawings.

FIG. 1 is a schematic diagram of a vehicle table establishment process according to the present invention.

Fig. 2 is a schematic diagram of a base station table establishment procedure according to the present invention.

Fig. 3 is a schematic diagram of a mobility management process according to the present invention.

Fig. 4 is a schematic diagram of intra-domain data communication flow according to the present invention.

Fig. 5 is a schematic diagram of an inter-domain data communication flow according to the present invention.

The specific implementation mode is as follows:

the invention provides a reliable method for realizing the routing of the intelligent Internet of vehicles, and the vehicle nodes can quickly acquire service data in a unicast mode through the method for realizing the routing of the intelligent Internet of vehicles, thereby shortening the delay and the cost for acquiring the service data, improving the service quality.

FIG. 1 is a schematic diagram of a vehicle table establishment process according to the present invention. After the vehicle node V1 located in the road section RS1 is started, beacon messages are broadcasted periodically, the load of the beacon messages is a time stamp and a home address, and a base station located in the road section RS1 establishes vehicle list items and switching list items through the following processes:

step 101: starting;

step 111: finishing;

the base station establishes or updates vehicle list items and switching list items of other vehicle nodes through the process; if the base station does not receive the beacon message of the vehicle node V1 within the predetermined time, the vehicle table entry and the switch table entry of the vehicle node V1 are deleted.

Fig. 2 is a schematic diagram of a base station table establishment procedure according to the present invention. If the base station BS1 belongs to the road segments RS1 and RS2, which periodically broadcast beacon messages, the vehicle node establishes a base station entry for the base station BS1 according to the following algorithm:

step 201: starting;

step 209: finishing;

if the vehicle node does not receive the beacon message of the base station BS1 within the predetermined time, the base station entry of the base station BS1 is deleted.

Fig. 3 is a schematic diagram of a mobility management process according to the present invention. If the access router of the domain D1 is AR1, after the access router AR1 receives the beacon messages with all the base stations in the domain D1, the following mobility management operations are performed:

step 301: starting;

step 306: the access router deletes all the stored switching tables;

step 307: and (6) ending.

Fig. 4 is a schematic diagram of intra-domain data communication flow according to the present invention. Under the condition that the vehicle node V1 and the vehicle node V2 are located in the domain D1, the access router of the domain D1 is AR1, and the geographic coordinates of the vehicle node V2 are H1, the vehicle node V1 realizes communication with the vehicle node V2 by:

step 401: starting;

step 405: the vehicle node checks whether the neighbor vehicle node has a predictable vehicle node and the driving route of the predictable vehicle node passes through any base station in the domain D1, if so, step 406 is executed, otherwise, step 407 is executed;

step 406: the vehicle node forwards the constructed or received request message to the predictable vehicle node, and step 403 is executed;

step 407: the vehicle node saves the request message and continues to travel, executing step 403;

step 408: the vehicle node checks the base station table, selects the base station table entry with the geographical coordinate of the local address closest to the vehicle node, then forwards the request message to the neighbor vehicle node or the base station with the geographical coordinate of the local address closest to the base station table entry, and executes step 403;

step 412: after receiving the request message, the vehicle node forwards the request message to a neighboring vehicle node closest to the geographic coordinate in the destination address of the request message, and executes step 411;

step 414: if the vehicle node constructs or receives a response message, then step 415 is performed, otherwise step 421 is performed;

step 416: if the base station table of the vehicle node constructing or receiving the response message is empty, executing step 417, otherwise executing step 420;

step 417: the vehicle node checks whether the neighbor vehicle node has a predictable vehicle node and the driving route of the predictable vehicle node passes through any base station in the domain D1, if so, step 418 is executed, otherwise, step 419 is executed;

step 418: the vehicle node forwards the constructed or received response message to the predictable vehicle node, and step 414 is executed;

step 419: the vehicle node saves the response message and continues to travel, executing step 414;

step 420: the vehicle node checks the base station table, selects the base station table entry with the geographical coordinate of the local address closest to the vehicle node, then forwards the request message to the neighbor vehicle node or the base station with the geographical coordinate of the local address closest to the base station table entry, and executes step 414;

step 424: after receiving the response message, the vehicle node forwards the response message to the neighboring vehicle node closest to the geographic coordinate in the destination address of the response message, and executes step 423;

step 425: the vehicle node V1 saves the response data of the response message;

step 426: and (6) ending.

Fig. 5 is a schematic diagram of an inter-domain data communication flow according to the present invention. Under the condition that the vehicle node V1 is located in a domain D1, an access router in the domain D1 is AR1, the vehicle node V3 is located in a domain D3, an access router in the domain D3 is AR3, and a home address of the vehicle node V3 is H3, the vehicle node V1 realizes communication with the vehicle node V3 through the following processes:

step 501: starting;

step 503: if the vehicle node receives the request message, step 504 is executed, otherwise step 509 is executed; the vehicle nodes are vehicle nodes on the request message routing path, namely vehicle nodes on the routing paths of vehicles V1 to V3;

step 505: the vehicle node checks whether the neighbor vehicle node has a predictable vehicle node and the driving route of the predictable vehicle node passes through any base station in the domain D1, if so, the step 506 is executed, otherwise, the step 507 is executed;

step 506: the vehicle node forwards the constructed or received request message to the predictable vehicle node, and step 503 is executed;

step 507: the vehicle node saves the request message and continues to travel, executing step 503;

step 508: the vehicle node checks the base station table, selects the base station table entry with the geographical coordinate of the local address closest to the vehicle node, then forwards the request message to the neighbor vehicle node or the base station with the geographical coordinate of the local address closest to the base station table entry, and executes step 503;

step 512: the access router selects the vehicle list item of which the node ID of the local address is equal to the node ID of the destination address of the request message, and updates the destination address of the request message into the local address of the vehicle list item; then the access router AR1 forwards the request message to the destination base station, i.e. the base station whose ID is the same as the base station ID of the destination address of the request message; after receiving the request message, the target base station ID forwards the request message to a neighbor vehicle node closest to the geographic coordinate in the target address of the request message;

step 514: after receiving the request message, the vehicle node forwards the request message to a neighboring vehicle node closest to the geographic coordinate in the destination address of the request message, and then step 513 is executed;

step 516: if the vehicle node constructs or receives a response message, then step 517 is performed, otherwise step 523 is performed;

step 518: if the base station table of the vehicle node constructing or receiving the response message is empty, executing step 519, otherwise executing step 522;

step 519: the vehicle node checks whether the neighbor vehicle node has a predictable vehicle node, and the driving route of the predictable vehicle node passes through any base station in the domain D1, if so, step 520 is executed, otherwise, step 521 is executed;

step 520: the vehicle node forwards the constructed or received response message to the predictable vehicle node, and step 516 is executed;

step 521: the vehicle node saves the response message and continues to run, go to step 516;

step 522: the vehicle node checks the base station table, selects the base station table entry with the geographical coordinate of the local address closest to the vehicle node, then forwards the request message to the neighbor vehicle node or the base station with the geographical coordinate of the local address closest to the base station table entry, and executes step 516;

step 525: after receiving the response message, the vehicle node forwards the response message to the neighboring vehicle node closest to the geographic coordinate in the destination address of the response message, and then executes step 524;

step 526: the vehicle node V1 saves the response data of the response message;

step 527: and (6) ending.

Example 1

Based on the simulation parameters in table 1, the present embodiment simulates a reliable intelligent internet of vehicles routing implementation method, and the performance analysis is as follows: when the speed of the vehicle node is reduced, the network performance is enhanced, and the packet loss rate is reduced, so that the data communication delay is reduced. The average delay for the vehicle node to acquire service data is 85 ms.

TABLE 1 simulation parameters

The invention provides a reliable intelligent car networking route implementation method, and a number of methods and ways for implementing the technical scheme, and the above description is only a preferred embodiment of the invention, and it should be noted that, for those skilled in the art, a number of improvements and embellishments can be made without departing from the principle of the invention, and these improvements and embellishments should also be regarded as the protection scope of the invention. The components not specified in this embodiment can be implemented by the prior art.

Claims

1. A reliable intelligent Internet of vehicles routing implementation method is characterized in that the Internet of vehicles comprises an access router, a base station and vehicle nodes; the vehicle nodes comprise predictable vehicle nodes and random vehicle nodes, the driving routes of the predictable vehicle nodes are preset, and the driving routes of the random vehicle nodes are not preset; the access router is connected with the Internet, and the base station is connected with the access router; base stations are arranged at intersections of all roads, the road between two base stations is called a road section, and one base station can belong to more than one road section; if a vehicle node running on a road section can communicate with a base station on the road section through single-hop forwarding or multi-hop forwarding, the relationship between the vehicle node and the base station is expressed as a communication relationship; if a vehicle node running on a road section cannot communicate with a base station on the road section through single-hop forwarding or multi-hop forwarding, the relationship between the vehicle node and the base station is represented as a non-connected relationship; an access router, base stations connected with the access router and vehicle nodes in communication relation with the base stations form a domain;

acquiring a license plate number when a vehicle node is registered, and simultaneously allocating a home address; if the routing prefix of the home address of one vehicle node is the same as that of one access router, the access router is called as the home router of the vehicle node; if the routing prefix and the base station ID of the home address of one vehicle node are the same as the routing prefix and the base station ID of the global address of one base station, the base station is called as the home base station of the vehicle node;

step 101: starting;

step 104: if the vehicle node that received the beacon message of vehicle node V1 has received a beacon message with the same source address and timestamp, then step 106 is performed, otherwise step 105 is performed;

step 110: the base station receiving the beacon message of the vehicle node V1 constructs a local address, the geographic coordinate and the node ID of the local address are equal to the geographic coordinate and the node ID of the source address of the beacon message, and the base station ID is equal to the base station ID of the base station; then the base station creates a vehicle list item, the local address of the vehicle list item is equal to the constructed local address, and the timestamp is equal to the timestamp in the beacon message; the base station creates a global address, the network prefix and the base station ID of the global address are equal to the network prefix and the base station ID of the global address of the base station, the node ID is equal to the node ID of the source address of the beacon message, then a switching table entry is created, the home address of the switching table entry is the home address in the beacon message, the care-of address is the created global address, the switching identifier is 0, and the timestamp is the timestamp in the beacon message;

step 111: finishing;

the base station establishes or updates vehicle list items and switching list items of other vehicle nodes through the process; if the base station does not receive the beacon message of the vehicle node V1 within the preset time, deleting the vehicle table entry and the switching table entry of the vehicle node V1;

the method comprises the steps that a base station regularly broadcasts beacon information after being started, the load of the beacon information is a timestamp, a source address is a local address of the base station, in the local address, a geographical coordinate and a base station ID are the current geographical coordinate and the base station ID of the base station, and a node ID is 0; the vehicle node stores a base station table, and one base station table comprises a local address field and a time stamp;

step 201: starting;

step 209: finishing;

if the vehicle node does not receive the beacon message of the base station BS1 within the preset time, deleting the base station table entry of the base station BS 1;

a base station sends a beacon message to a connected access router periodically, wherein the source address of the beacon message is the global address of the base station, the destination address is the global address of the access router, and the load is a switching table and a vehicle table; after the base station sends the beacon message, the switching identifiers of all the table entries in the switching table are set to be 1; after receiving the beacon message of the base station, the access router stores a switching table and a vehicle table;

the access router maintains an address mapping table, and one address mapping table item comprises a home address domain and a care-of address domain;

if the access router of the domain D1 is AR1, after the access router AR1 receives the beacon messages of all the base stations in the domain D1, the following mobility management operations are performed:

step 301: starting;

step 303: the access router AR1 will perform the following for each handover table entry in the set: looking up the address mapping table, selecting an address mapping table entry whose home address is equal to the home address in the switching table entry, updating the care-of address of the address mapping table entry to the care-of address of the switching table entry, and executing step 306;

step 305: after receiving the mobile management message, the destination access router executes the following operations for each switching table entry in the mobile management message: looking up the address mapping table, selecting an address mapping table item, wherein the home address of the address mapping table item is equal to the home address in the switching table item, and updating the care-of address of the address mapping table item to the care-of address of the switching table item;

step 306: the access router deletes all the stored switching tables;

step 307: finishing;

the method comprises the steps that beacon messages are predicted to be broadcast by vehicle nodes regularly, and the load of the beacon messages is the geographic coordinates, the time stamps and the home addresses of base stations through which a driving route passes; after receiving the beacon message, the other vehicles store the geographic coordinates of the base station through which the driving route of the predictable vehicle node passes;

step 401: starting;

step 403: if the vehicle node receives the request message, executing step 404, otherwise executing step 409; the vehicle node is a vehicle node on the request message routing path, namely the vehicle node on the routing path from the vehicle node V1 to the vehicle node V2;

step 425: the vehicle node V1 saves the response data of the response message;

step 426: finishing;

under the condition that the vehicle node V1 is located in a domain D1, an access router in the domain D1 is AR1, the vehicle node V3 is located in a domain D3, an access router in the domain D3 is AR3, and a home address of the vehicle node V3 is H3, the vehicle node V1 realizes communication with the vehicle node V3 through the following processes:

step 501: starting;

step 502: the vehicle node V1 sends a request message, the destination address of the request message is the home address H3, the source address is the global address of the vehicle node V1, in the global address of the vehicle node V1, the network prefix and the base station ID are 0, the vehicle ID is the license plate number of the vehicle node V1, and step 504 is executed;

step 509: the base station receiving the request message sets the routing prefix and the base station ID of the source address of the request message as the routing prefix and the base station ID of the base station, then forwards the request message to the access router AR1, and the access router AR1 forwards the request message to the Internet; finally, the request message reaches a target access router, and the network prefix of the target access router is the same as that of the request message destination address;

step 523: the base station receiving the response message constructs a global address, the routing prefix and the base station ID of the global address are equal to the routing prefix and the base station ID of the base station, the node ID is equal to the node ID of the response message source address, then the source address of the response message is set as the constructed global address, and the response message is forwarded to the access router AR 3; the access router AR3 forwards the response message to the Internet, and finally the response message reaches the access router AR1 through the Internet; the access router AR1 forwards the response message to the destination base station, i.e. the base station whose base station ID is the same as the base station ID of the destination address of the response message; after receiving the response message, the target base station checks the vehicle list, selects the vehicle list item of which the node ID of the local address domain value is equal to the node ID of the destination address of the response message, updates the destination address of the response message into the local address of the vehicle list item, and then forwards the response message to the neighbor vehicle node closest to the geographic coordinate in the destination address of the response message;

step 526: the vehicle node V1 saves the response data of the response message;

step 527: and (6) ending.