CN101610505A - Realization System of Next Generation All-IP Mobile Wireless Sensor Network Routing - Google Patents

Abstract

The present invention provides a next-generation all-IP mobile wireless sensor network routing implementation system, including three types of nodes: gateway nodes, cluster head nodes and intra-cluster nodes, gateway nodes and cluster head nodes are full-function nodes, and their topological structure is Tree structure, this tree structure is built into the routing system of the wireless sensor network, the nodes in the cluster are some functional nodes, mainly used for data collection and data processing, the gateway node is a fixed node, connecting the wireless network and the IPv6 network. The wireless sensor network is composed of multiple clusters, each cluster includes a cluster head node and multiple nodes in the cluster, the nodes in the cluster are within one hop of the cluster head node, the topology is star, and the cluster is the next generation of all-IP wireless The mobile unit of the sensor network, but the relationship between the cluster head node and the nodes in the cluster does not change. The nodes in the cluster directly send the collected data to the cluster head node, and the cluster head node realizes the routing of the data through the tree structure where it is located.

Description

Realization System of Next Generation All-IP Mobile Wireless Sensor Network Routing

technical field

The present invention relates to a network routing implementation system, in particular to a next-generation all-IP mobile wireless sensor network (hereinafter referred to as wireless sensor network) routing implementation system, that is, a mobile network that realizes all-IP communication and interconnection with an IPv6 network. Implementation system of wireless sensor network routing.

Background technique

With the continuous maturity and development of the next-generation Internet (IPv6 Internet), the realization of all-IP communication interconnection between wireless sensor networks and the next-generation Internet has become an inevitable trend of future development. The all-IP interconnection method has the following advantages:

(1) IPv6 is the protocol standard of the next-generation Internet, and the use of IPv6 protocol in wireless sensor networks to realize all-IP communication with the next-generation Internet will help promote the standardization of wireless sensor network communication protocols;

(2) Many technical features of IPv6 (such as automatic address configuration, mobility support, security, etc.) provide good support for self-organizing management of large-scale wireless sensor networks;

(3) The networking mode of the Internet can be fully used for reference by wireless sensor networks, making it a reasonable expansion of wireless sensor networks.

However, the key technologies to realize the all-IP communication and interconnection of wireless sensor networks and the next generation Internet are not yet mature, mainly in the following aspects:

(1) Address automatic configuration: Address automatic configuration is an important technical feature of IPv6, which can configure corresponding IPv6 addresses for each interface without human intervention. This is very consistent with the design goal of wireless sensor network self-organization and self-configuration. However, there are still some problems in the existing IPv6 address automatic configuration methods in wireless sensor networks, for example, stateful address configuration will bring a large amount of control message overhead, and the stateless address configuration of generating IPv6 addresses based on MAC addresses will affect the communication between sensor nodes. Routing addressing does not bring any convenience, so a new IPv6 address automatic configuration mechanism needs to be established for the next generation all-IP wireless sensor network;

(2) Routing scheme: the wireless sensor network is different from the IPv6 network. In the IPv6 network, there is a data link layer connection between the router and the ordinary node, which can be reached by one hop, while the wireless sensor node has the dual identity of the router and the ordinary node. There is no data link layer connection between nodes, so a new routing method needs to be established in wireless sensor networks to realize communication between IPv6 nodes and sensor nodes.

(3) Mobile solution: For mobile wireless sensor networks, since its IPv6 address will change with the location, this will interrupt the ongoing communication, so it is necessary to introduce a new communication mechanism to ensure communication. continuity and stability.

Contents of the invention

Purpose of the invention: The technical problem to be solved by the present invention is to provide a next-generation all-IP mobile wireless sensor network routing implementation system for the deficiencies of the prior art.

Technical solution: The present invention discloses a next-generation all-IP mobile wireless sensor network routing implementation system. In the system, the wireless sensor network is a wireless sensor network that realizes all-IP communication and interconnection with the IPv6 network. It serves as the next-generation Internet The terminal network exists, and each sensor node in the wireless sensor network has a globally unique IPv6 address. The IPv6 network nodes realize the full IP communication interconnection with each other through the IPv6 Internet and the IPv6 addresses of the wireless sensor nodes. The sensor nodes can move freely, and the external network nodes communicate with the sensor nodes through the Internet and the IPv6 addresses of the sensor nodes, and ensure the correctness of the communication. sex and continuity.

From the perspective of function, the system includes two types of nodes: nodes with routing and forwarding functions (called full-function nodes) and nodes without routing and forwarding functions (called partial function nodes);

In terms of system structure, the system sets three types of nodes: gateway node, cluster head node and intra-cluster node; gateway node and cluster head node are full-function nodes, and their topology is a tree structure. This tree structure is constructed into a wireless The routing system of the sensor network; the nodes in the cluster are some functional nodes, mainly used for data collection and data processing; the gateway node is used to connect the wireless sensor network and the IPv6 network;

The wireless sensor network is composed of multiple clusters, each cluster includes a cluster head node and multiple cluster nodes, the nodes in the cluster are within one hop of the cluster head node, and the topology is star-shaped;

The gateway node of the system is a fixed node;

The mobile unit of the system is the cluster, that is, the cluster can move freely as a unit, and the relationship between the cluster head node and the nodes in the cluster is stable, that is, the corresponding relationship does not change.

In the system of the present invention, the wireless sensor network realizes full IP communication interconnection with the IPv6 network through n (n≥1) gateway nodes; when n≥2, the gateway nodes perform multicast communication through the IPv6 network.

In the system of the present invention, the entire wireless sensor network is divided into n (n ≥ 1) tree structures by n (n ≥ 1) gateway nodes, each tree structure has and only has one gateway node and the gateway node is The root node of the tree structure, each gateway node has an ID, which uniquely identifies the gateway node and the tree structure with the gateway node as the root node.

In the system of the present invention, the cluster head node realizes the automatic configuration of the IPv6 address by adding the tree structure where the gateway node with the closest distance (distance measurement unit is the number of hops) is located, and records the parent node of the tree structure at the same time. After obtaining the IPv6 address, the cluster head node and some functional nodes within one hop range, that is, the nodes in the cluster, construct a cluster together. The nodes in the cluster directly send the data to the cluster head node, and the cluster head node realizes the routing of the data through the tree structure where it is located.

In the system of the present invention, the IPv6 address of the gateway node, the cluster head node and the node in the cluster is composed of two parts, the first part is a global routing prefix, and the global routing prefixes of the IPv6 addresses of all sensor nodes in a sensor network are all the same; The second part is the sensor node ID, which is divided into three parts: gateway node ID, cluster head ID and intra-cluster node ID. The gateway node ID uniquely identifies the tree structure with the gateway node as the root node. A tree structure The gateway node IDs of all cluster head nodes and nodes in the cluster IPv6 address are the same in the structure; the cluster head ID uniquely identifies a cluster, and the cluster head IDs of all cluster nodes in a cluster are the same; the cluster head ID uniquely identifies A cluster node. The cluster node ID of gateway node and cluster head node IPv6 address is 0. The gateway node ID, the cluster head ID and the node ID in the cluster are composed of the original ID numbers of the sensor nodes. In a wireless sensor network, the original ID numbers of the sensor nodes are unique.

In the system of the present invention, the link layer is used for routing, and the address of the link layer is set as the sensor node ID of the sensor node IPv6 address. The nodes in the tree structure (including the gateway node and the cluster head node) save a temporary routing table, and the routing table item includes three fields, the destination node field, the next hop field and the lifetime field. The destination node field records the sensor node ID of the destination node, the next hop field records the sensor node ID of the next hop to the destination node, and the survival time field records the survival time of this temporary routing entry. This time is automatically decayed according to the machine clock. When When the survival time is 0, the cluster head node deletes this entry from the routing table, and the setting value of the survival time is determined according to the storage space of the sensor nodes and the number of sensor nodes. Because of the large number of sensor nodes and limited resources, and the frequent movement of clusters will lead to frequent changes in routing, the system adopts the strategy of on-demand routing, and the survival time of routing entries is only used for one routing operation.

In the system of the present invention, the gateway node keeps two record tables, and one record table is used to record the information of the cluster head node obtaining the home address in the tree structure, including the address of the gateway node in the tree structure where the home address and the care-of address are located and the distance parameter value from the home address to the gateway node; another record table is used to record the information of the cluster head node that obtains the care-of address in this tree structure, including the home address of the cluster head node and the care-of address obtained in this tree structure And the parameter value of the distance from the care-of address to the gateway node.

In the system of the present invention, when the cluster head node obtains the home address or due to other reasons (for example, the position of the parent node moves or fails, or the movement of its own position, etc.) and returns to the tree structure that originally obtained the home address, it will Register the home address with the gateway node in the tree structure. If the cluster-head node returns to the tree structure where the home address is obtained due to its own movement, the gateway node also needs to perform a logout operation to the gateway node in the tree structure where the cluster-head node finally obtains the care-of address. If the cluster head node obtains a new care-of address, it will register the care-of address with the gateway node in the current tree structure.

In the system of the present invention, the gateway node establishes the routing path to the node in the destination cluster through the routing query message. After the cluster head node within the coverage of the routing query message receives the message, the cluster head node checks the source Address to determine whether the route query message is sent by the parent node of the cluster head node, if not, discard the message, otherwise the cluster head node continues to judge whether the distance between itself and the gateway node of the current tree structure is equal to the destination cluster head node If the distance between the current address and the gateway node is greater than, the message will be discarded; if it is less than, the message will continue to be broadcast; if it is equal, the cluster head node will continue to judge whether the gateway ID and cluster head ID of its home address are consistent with the destination node in the cluster The gateway ID of the address is the same as the cluster head ID. If they are not the same, the message will be discarded. If they are the same, the cluster head node will broadcast the cluster node ID of the cluster node in the cluster. If the cluster node detects its own cluster node The ID is the same as the cluster node ID of the node in the cluster, which means that this member is a node in the cluster, and then the node in the cluster returns a routing response message to the gateway node G by unicast. The return path of the routing response message returned by the nodes in the cluster is as follows: the node in the cluster first sends the routing response message to the cluster head node of its cluster, and after receiving the message, the cluster head node sends the message to the cluster head node. The parent node F of the tree and the parent node F of the cluster head node first check whether the routing table entry of the node in the cluster already exists in the temporary routing table, that is, the destination node ID is the sensor node ID of the node in the cluster, and the next hop node is the cluster head The sensor node ID of the node, if it exists, reset the survival time, if it does not exist, create a temporary routing table entry, the destination node ID is the sensor node ID of the node in the cluster, and the next hop node ID is the sensor of the cluster head node Node ID, and set the survival time, then continue to send this message to the parent node F' of the parent node F of the cluster head node, after the parent node F' of the parent node F of the cluster head node receives this message, repeat the above operation (below One hop node ID is the sensor node ID of F), and finally the routing response message reaches the gateway node. So far, the routing path from the gateway node to the node in the destination cluster is established. In the present invention, the cluster tree is composed of cluster head nodes, and the cluster is composed of cluster heads and cluster internal nodes.

In the system of the present invention, the cluster head node regularly inquires about the working state of the parent node, if the cluster head node does not receive the response message from the parent node within the specified time, it will consider that the parent node is in an abnormal working state (such as power consumption or less than a certain threshold, or the movement between each other leads to inability to communicate, etc.), the cluster head node will set its care-of address to 0, and re-join a tree structure to obtain an IPv6 address. If the newly obtained IPv6 address is a home address, That is, the global routing prefix and gateway ID of the original home address are the same as the global routing prefix and gateway node ID of the newly obtained IPv6 address, then the cluster head node performs the home address registration operation, otherwise the cluster head node uses the newly obtained IPv6 address as The care-of address and register the care-of address.

Beneficial effects: the present invention provides a next-generation all-IP mobile wireless sensor network routing implementation system. In the system, the wireless sensor network is a wireless sensor network that realizes all-IP communication and interconnection with the IPv6 network. It serves as the next-generation Internet The terminal network exists, and each sensor node in the wireless sensor network has a globally unique IPv6 address. The IPv6 network nodes realize all-IP communication interconnection with each other through the IPv6 Internet and the IPv6 address of the wireless sensor node. The sensor nodes can move freely, and the external network nodes Communicate with the sensor node through the Internet and the IPv6 address of the sensor node, and ensure the correctness and continuity of communication.

Description of drawings

The advantages of the above and/or other aspects of the present invention will become clearer as the present invention will be further described in detail in conjunction with the accompanying drawings and specific embodiments.

FIG. 1 is a schematic diagram of the next-generation all-IP mobile sensor node network topology according to the present invention.

Fig. 2 is a schematic diagram of the IPv6 address of the next-generation all-IP mobile sensor node according to the present invention.

FIG. 3 is a schematic flow chart of forming a tree structure between a gateway node and a cluster head node according to the present invention.

FIG. 4 is a schematic flow diagram of a node in a cluster obtaining an IPv6 address according to the present invention.

FIG. 5 is a schematic diagram of the cluster head node registration process according to the present invention.

Fig. 6 is a schematic diagram of the format of the routing table entry according to the present invention.

Fig. 7a and Fig. 7b are schematic diagrams of the routing flow of the next-generation all-IP mobile sensor node according to the present invention.

FIG. 8 is a schematic diagram of a flow detection process of a next-generation all-IP mobile sensor network according to the present invention.

Detailed ways:

The invention provides a next-generation all-IP mobile wireless sensor network routing implementation system. In the system, the wireless sensor network is a wireless sensor network that realizes all-IP communication and interconnection with the IPv6 network, and it exists as a terminal network of the next-generation Internet. , each sensor node in the wireless sensor network has a globally unique IPv6 address. IPv6 network nodes realize all-IP communication interconnection with each other through the IPv6 Internet and the IPv6 address of the wireless sensor node. The IPv6 address of the sensor node communicates with the sensor node and ensures the correctness and continuity of communication.

What Fig. 1 shows is the schematic diagram of next-generation all-IP mobile sensor node network topology, from the functional point of view, the present invention comprises two types of nodes: the node with routing and forwarding function (called full-featured node) and the node without routing and forwarding function nodes (called partial function nodes). From the division of system structure, the present invention sets three types of nodes: gateway node 1, cluster head node 2 and intra-cluster node node 3, wherein, gateway node 1 and cluster head node 2 are full-featured nodes, and their topological structure is a tree This tree structure is constructed as a wireless sensor network routing system. The node 2 in the cluster is a partial functional node, mainly used for data collection and data processing, and the gateway node 1 is a fixed node, connecting the wireless network and the IPv6 network. The wireless sensor network is composed of multiple clusters, each cluster includes a cluster head node 1 and multiple cluster nodes 2, the nodes in the cluster are within one hop of the cluster head node, the topology is a star, and the cluster is the next generation of full The mobile unit of the IP wireless sensor network, that is, the cluster can move freely as a unit, but the relationship between the cluster head node in the cluster and the nodes in the cluster does not change. The nodes in the cluster directly send the collected data to the cluster head node, and the cluster head node realizes the routing of the data through the tree structure where it is located.

Figure 2 is a schematic diagram of the IPv6 address of the next-generation all-IP mobile sensor node. The IPv6 address of the gateway node, the cluster head node, and the nodes in the cluster consists of two parts. The first part is an 80-bit global routing prefix, a next-generation The global routing prefix of the IPv6 address of all sensor nodes in the all-IP wireless sensor network is the same; the second part is the 48-bit sensor node ID, which is divided into a 16-bit gateway node ID, a 16-bit cluster head ID and a 16-bit The cluster node ID has three components, where the gateway node ID uniquely identifies the tree structure with the gateway node as the root node, and the gateway node IDs of all cluster head nodes (including cluster nodes) in a tree structure are the same ; The cluster head ID uniquely identifies a cluster, and the cluster head IDs of all nodes in a cluster are the same; the ID of a node in a cluster uniquely identifies a node in a cluster. The node ID in the cluster of the sensor node ID in the IPv6 address of the gateway node and the cluster head node is 0. The gateway node ID, the cluster head ID and the node ID in the cluster are composed of the original ID numbers of the sensor nodes. In a wireless sensor network, the original ID numbers of the sensor nodes are unique.

What Fig. 3 shows is the schematic diagram of the process of forming a tree structure between the gateway node and the cluster head node. The distance parameter value of the node is 0. In addition, because the cluster has mobility, the cluster head node also needs to record the home address and the care-of address. In the initial state, the values of the home address and the care-of address are 0. The process of the cluster head node joining the tree structure and obtaining the IPv6 address is described as follows:

Step 301: The cluster head node H broadcasts the message of joining the tree structure, and sets a clock at the same time;

Step 302: After receiving the message, the neighbor cluster-head nodes within the coverage of the message broadcast return a response message to the cluster-head node H. The content of the message is the distance value of the neighbor cluster-head node to the gateway node in the tree structure and the current IPv6 address value;

Step 303: After the clock expires, the cluster head node H selects the cluster head node with the smallest distance parameter value in the response message as the parent node F and records the current sensor node ID of the parent node F and the tree structure where the cluster head node H arrives. The distance value of the gateway node, that is, the distance value of the parent node F plus 1, and at the same time extract the global routing prefix and gateway ID from the IPv6 address of the parent node F and combine it with its original ID to form an IPv6 address;

Step 304: Cluster head node H judges whether the acquired IPv6 address is a home address (that is, judges whether the original home address is 0 or the original home address is not 0 but the gateway ID of the newly acquired IPv6 address is the same as the gateway ID of the original home address ID is the same), if it is the hometown address, go to step 306;

Step 305: The cluster-head node H registers the newly acquired IPv6 address with the gateway node in the tree structure, and proceeds to step 307;

Step 306: the cluster head node H registers the home address of the newly acquired IPv6 address with the gateway node in the tree structure;

Step 307: The cluster head node H successfully joins the tree structure and obtains an IPv6 address, and the process ends.

Figure 4 is a schematic diagram of the process of obtaining an IPv6 address by a node in a cluster. The process of obtaining the identity of a node in a cluster and an IPv6 address by a sensor node with some functions is described as follows:

Step 401: After the cluster-head node H obtains the IPv6 home address, it will periodically broadcast its own home address to show its existence;

Step 402: After receiving the message, the sensor nodes within the coverage of the message broadcast judge whether they are full-function nodes. If they are full-function nodes (i.e. full-function sensor nodes), proceed to step 404; if they are not full-function nodes, they are partial-function nodes. node (i.e. part of the functional sensor node), proceed to step 403;

(I added some descriptions to the above paragraph, please see if it fits!)

Step 403: If some functional nodes have been identified as nodes in the cluster, then go to step 404, otherwise go to step 405;

Step 404: abandon this message, go to step 407;

Step 405: Some functional nodes mark themselves as intra-cluster nodes and record the home IPv6 address of the cluster head node H, and extract the global routing prefix, gateway ID and cluster head ID of the home address of the cluster head node H corresponding to their own original ID Combining to obtain the IPv6 address of the sensor node;

Step 406: So far, some functional nodes have obtained IPv6 addresses and joined the cluster;

Step 407: the process ends.

Figure 5 is a schematic diagram of the registration process of the cluster head node. The gateway node keeps two record tables. One record table is used to record the information of the cluster head node that obtains the home address in this tree structure. Each record includes home address, forwarding The address of the gateway node in the tree structure where the address is located and the distance parameter value from the home address to the gateway node; another record table is used to record the information of the cluster head node that obtains the care-of address in this tree structure, and each record includes the hometown of the cluster head node The address, the care-of address obtained in this tree structure, and the parameter value of the distance from the care-of address to the gateway node. When the cluster head node acquires a new IPv6 address, the process of registering the new address with the gateway node in the tree structure is as follows:

Step 501: the cluster head node H obtains a new IPv6 address;

Step 502: the cluster head node H judges whether the newly acquired IPv6 address is a home address, if it is not a home address, go to step 503, otherwise go to step 511;

Step 503: The cluster head node H sends a care-of address registration message to the gateway node G' in the tree structure, the message includes the home address of the cluster head node H, the newly obtained care-of address and its distance from the gateway node G';

Step 504: After the gateway node G' receives the care-of address registration message, check whether there is a record of the cluster head node H in the cluster head node record table recorded in the tree structure to obtain the care-of address, if it exists, go to step 506, otherwise go to Step 505;

Step 505: The gateway node G' adds a record, the record information includes the home address of the cluster head node H, the newly obtained care-of address and its distance from the gateway node, and at the same time obtains the tree structure of the home address from the cluster head node H The gateway node G forwards the registration message and goes to step 507;

Step 506: The gateway node G' updates the relevant record of the cluster head node H with the distance value in the message, and turns to step 518;

Step 507: The gateway node G of the tree structure in which the cluster head node H obtains the home address checks the record corresponding to the cluster head node H in the cluster head node record table for obtaining the home address in the tree structure, and determines the tree structure in which the care-of address is located Whether the gateway node IPv6 address domain is 0, if it is 0, go to step 510, otherwise go to step 508;

Step 508: The cluster-head node H acquires the gateway node G of the tree structure of the home address to send a logout message to the gateway node G" in the tree structure where the care-of address is located in the record, and this message includes the home address of the cluster-head node H;

Step 509: After the gateway node G" in the tree structure where the care-of address field is located in the record receives the logout message, it deletes the record of the cluster head node H from the cluster head node record table recorded in the tree structure to obtain the care-of address;

Step 510: The cluster-head node H obtains the gateway node G of the tree structure of the home address, uses the cluster head node H to obtain the gateway node G' of the tree structure of the current care-of address, and updates the gateway node of the tree structure where the care-of address is located in the record. The value of the node address domain, and the value of the home address away from the gateway node is set to 0 at the same time, go to step 518;

Step 511: The cluster head node H sends a home address registration message to the gateway node G in the tree structure, and the message includes the newly acquired home address of the cluster head node H and its distance from the gateway node;

Step 512: After the gateway node G receives the registration message, check whether there is a record of the cluster head node H in the cluster head node record table recorded in the tree structure to obtain the home address, if it exists, go to step 513, otherwise go to step 514;

Step 513: The gateway node G updates the record of the cluster head node H with the distance value in the message, and goes to step 515;

Step 514: the gateway node G adds a record and records the home address of the cluster head node H and its distance parameter value, the gateway node address field of the tree structure where the care-of address is located is set to 0, and then go to step 518;

Step 515: the gateway node G detects whether the gateway node IPv6 address field in the tree structure where the care-of address is located in this record is 0, if not 0, go to step 516, otherwise go to step 518;

Step 516: the gateway node G sends a logout message to the gateway node G' in the tree structure where the care-of address is located in the record, the message includes the home address of the cluster head node H, and this address field is set to 0;

Step 517: After receiving the logout message, the gateway node G' in the tree structure where the care-of address is located in the record deletes the record of the cluster head node H from the cluster head node record table recorded in the tree structure to obtain the care-of address;

Step 518: The registration process ends.

Figure 6 is a schematic diagram of the format of the routing table entry. The present invention uses the link layer for routing, and the link layer address is set as the sensor node ID of the sensor node IPv6 address. The nodes in the tree structure (including the gateway node and the cluster head node) save a temporary routing table. The routing table item includes three domains, the destination node domain, the next hop domain and the lifetime domain. Among them, the destination node domain records the destination node The sensor node ID of the next hop field records the sensor node ID of the next hop to the destination node, and the survival time field records the survival time of this temporary routing entry. This time is automatically decayed according to the machine clock. When the survival time is 0, The cluster head node deletes this entry from the routing table, and the set value of the survival time is determined according to the storage space of the sensor nodes and the number of sensor nodes. Because the number of sensor nodes is huge and the resources are limited, and the frequent movement of clusters will lead to frequent changes in routing, the present invention adopts an on-demand routing strategy, and the survival time of routing table items is only used for one routing operation.

Fig. 7a and Fig. 7b are schematic diagrams of the routing flow of next-generation all-IP mobile sensor nodes. The flow of IPv6 network nodes to obtain data collected by node X in the cluster is described as follows:

Step 701: IPv6 network node N sends a service request data packet to obtain data collected by node X in the cluster, and the destination address of this message is Addr;

Step 702: The data packet is routed in the IPv6 network, and finally arrives at the gateway node connected to the wireless sensor network where the node X in the cluster is located. It judges whether the node X in the cluster is in the tree structure by checking the gateway ID of Addr, if not , then multicast, and finally the request packet will reach the gateway node G in the tree structure where the node X in the cluster is located;

Step 703: The gateway node G checks the record corresponding to the cluster head node H of the cluster where the node X in the cluster is located in the record table of the cluster head node whose home address is obtained in the tree, and determines the gateway node G in the tree structure where the care-of address is located in the record 'Whether it is 0, if it is 0, go to step 704, otherwise go to step 705;

Step 704: The gateway node G uses the distance parameter between the IPv6 address of the node X in the cluster and the home address of the cluster head node H where the node X is located to construct a routing query message to query the routing path to the node X in the cluster, and in the tree Structurally broadcast this message, go to step 707;

Step 705: the gateway node G encapsulates the service request packet with the tunnel header (the source address is the IPv6 address of the gateway node G, and the destination address is the IPv6 address of the gateway node G') and forwards it to the gateway node G';

Step 706: After the gateway node G' receives the service request message, it uses the IPv6 address of the node X in the cluster and the distance parameter between the care-of address of the cluster head node H and the gateway node to construct a routing query message to query the route to the node X in the cluster. routing path, and broadcast this message on the tree structure;

Step 707: After the neighboring cluster-head nodes within the broadcasting coverage of the routing query message receive the message, the neighboring cluster-head nodes judge whether the routing query message is sent by their parent node by checking the source address of the routing query message, and if so, Go to step 708, otherwise go to step 711;

Step 708: The neighboring cluster head node judges whether its distance from the gateway node is equal to the distance parameter value in the message, if so, proceed to step 709, otherwise proceed to step 710;

Step 709: The neighbor cluster head node judges whether the gateway ID and cluster head ID of its home address are the same as the gateway ID and cluster head ID of node X in the cluster, if they are the same, go to step 713, otherwise go to step 711;

Step 710: The neighbor cluster head node judges whether the distance parameter value between it and the gateway node is greater than the distance parameter value in the message, if greater, proceed to step 711, otherwise proceed to step 712;

Step 711: The message is discarded, and the processing ends.

Step 712: The neighbor cluster head node updates the source address field in the query message with its own current address, then continues to broadcast the routing query message in the tree structure, and turns to step 707;

Step 713: If the cluster head node H of the cluster where the node X in the cluster is located obtains the home address and records it in the gateway node G of the tree structure where the home address is obtained, record it in the record corresponding to the cluster head node H in the cluster head node record table for obtaining the home address in this tree If the gateway node G' in the tree structure where the care-of address is located is not 0, then the node X in the cluster returns a routing response message to the gateway node G' by unicast, otherwise it returns a routing response message to the gateway node G by unicast. Same as below

Step 714: The node X in the cluster first sends the routing response message to the cluster head node H of its cluster, and after receiving the message, the cluster head node H sends the message to the parent node of the cluster tree where it is located;

Step 715: The parent node checks whether there is already a routing entry of the node X in the cluster in the temporary routing table, that is, the routing entry whose destination node ID is the sensor node ID of the node X in the cluster, if it exists, go to step 716, otherwise go to step 717;

Step 716: the parent node resets the time-to-live of the node X routing table entry in the cluster, and goes to step 718;

Step 717: the parent node creates a temporary routing entry, the destination node ID is the sensor node ID of node X in the cluster, and the next hop node is the sensor node ID of the cluster head node that sends the routing response message;

Step 718: Whether the parent node is a gateway node G or a gateway node G', if yes, go to step 720, otherwise go to step 719;

Step 719: the parent node continues to send the routing response message to its parent node, and go to step 715;

Step 720: The gateway node G or gateway node G' reaches the node X in the cluster to establish the route, and the gateway node G or gateway G' sends the service request message to the target node X in the cluster according to the route, and the target node X in the cluster will The service response data packet is returned to the gateway node G or the gateway node G' according to the original path, and the service response data packet is sent to the IPv6 network by the gateway node G or the gateway node G', and finally reaches the IPv6 network node N;

Step 721: the process ends.

Figure 8 is a schematic diagram of the next-generation all-IP mobile sensor network mobile detection process. The process of detecting whether the cluster head node H detects itself or the position of the parent node is as follows:

Step 801: The cluster head node H periodically sends query messages to the parent node to check the working status of the parent node;

Step 802: If the cluster head node H does not receive the response message from the parent node within the specified time, then go to step 803, otherwise go to step 807;

Step 803: The cluster head node H thinks that the parent node is not working normally, sets the care-of address to 0, and re-joins a tree structure to obtain an IPv6 address;

Step 804: If the newly acquired IPv6 address of the cluster head node H is the home address, then proceed to step 805, otherwise proceed to step 806;

Step 805: The cluster head node H registers the home address with the gateway node in the tree structure, and goes to step 807;

Step 806: The cluster head node H registers the care-of address with the gateway node in the tree structure,

Step 807: the process ends.

In summary, the present invention has realized the network movement of all-IP wireless sensor network, and this technology can be applied to fields such as national defense, medical treatment and agriculture, for example, for a farm (a next-generation all-IP mobile wireless sensor network), Many kinds of herd animals are kept on the farm, and their movement is based on the group (a cluster). In order to check the living status of these livestock, some sensor nodes with partial functions (intra-cluster nodes) are installed on them to collect relevant parameters, and full-function sensor nodes (i.e., cluster heads) are installed on the leading livestock in the herd, so that , when the herd of livestock is moving, external breeding (research) personnel can still access the sensor nodes through the Internet to obtain the current living state parameters of these livestock.

The present invention provides an idea and method for implementing a next-generation all-IP mobile wireless sensor network routing system. There are many methods and approaches for implementing this technical solution. The above is only a preferred embodiment of the present invention. It should be pointed out that For those skilled in the art, without departing from the principle of the present invention, some improvements and modifications can also be made, and these improvements and modifications should also be regarded as the protection scope of the present invention. All components that are not specified in this embodiment can be realized by existing technologies.

Claims (10)

1. A system for realizing routing of a next-generation all-IP mobile wireless sensor network, characterized in that the next-generation all-IP mobile wireless sensor network is a wireless sensor network that realizes all-IP communication and interconnection with an IPv6 network, and is a next-generation The terminal network of the Internet; each sensor node in the wireless sensor network has a unique IPv6 address, and the IPv6 network node realizes all-IP communication interconnection through the IPv6 Internet and the IPv6 address of the wireless sensor node; The system sets three types of nodes: a gateway node, a cluster head node, and a node in a cluster; the gateway node and the cluster head node are full-featured nodes, that is, nodes with routing and forwarding functions, and the topology structure of the gateway node and the cluster head node is a tree structure, the routing system of the wireless sensor network is a tree structure; the nodes in the cluster are some functional nodes, that is, nodes without routing and forwarding functions, and are used for data collection and data processing; wherein, the gateway node is used for connecting wireless Sensor network and IPv6 network, and the gateway node is a fixed node; The wireless sensor network is composed of a plurality of clusters, each cluster includes a cluster head node and a plurality of intra-cluster nodes, the intra-cluster nodes are within the range of one hop of the cluster head node, and the topology is star-shaped; The cluster is a movable unit, and when the cluster is moving, the relationship between the cluster head node in the cluster and the nodes in the cluster is stable. 2. The next-generation all-IP mobile wireless sensor network routing implementation system according to claim 1, wherein the wireless sensor network realizes all-IP communication interconnection with the IPv6 network through n gateway nodes, and n≥1 ; When n≥2, multicast communication is carried out between gateway nodes through IPv6 network. 3. The next-generation all-IP mobile wireless sensor network routing implementation system according to claim 2, wherein the wireless sensor network is divided into n tree structures by n gateway nodes, and each tree structure There is one and only one gateway node, and the gateway node is the root node of the tree structure, and each gateway node has an ID, which uniquely identifies the gateway node and the tree structure with the gateway node as the root node. 4. The realization system of the next-generation all-IP mobile wireless sensor network routing according to claim 3, wherein the cluster-head node realizes the automatic IPv6 address by adding the tree structure where the gateway node closest to the cluster-head node is located. Configuration, and record the parent node in the tree structure at the same time, the distance is measured in hops; after obtaining the IPv6 address, the cluster head node and its intra-cluster nodes within one hop range jointly form a cluster; the intra-cluster nodes directly The data is sent to the cluster head node, and the cluster head node realizes the routing of the data through the tree structure where it is located. 5. The system for realizing the routing of the next-generation all-IP mobile wireless sensor network according to claim 4, wherein the IPv6 address of the gateway node, the cluster head node and the nodes in the cluster is composed of two parts, the first part It is the global routing prefix, and the global routing prefix of the IPv6 addresses of all sensor nodes in a sensor network is the same; the second part is the sensor node ID, and the sensor node ID is divided into three components: gateway node ID, cluster head ID and intra-cluster node ID The gateway node ID uniquely identifies the tree structure with the gateway node as the root node, and the gateway node IDs of all cluster-head nodes and intra-cluster nodes IPv6 addresses in a tree structure are the same; the cluster-head ID uniquely identifies a cluster, the cluster head IDs of all cluster nodes in a cluster are the same; the cluster node ID uniquely identifies a cluster node; the cluster node ID of the gateway node and the cluster head node IPv6 address is 0; the gateway The node ID, the cluster head ID and the node ID in the cluster are composed of the original ID number of the sensor node. In a wireless sensor network, the original ID number of the sensor node is unique. 6. The system for realizing the routing of the next-generation all-IP mobile wireless sensor network according to claim 4, wherein the system uses the link layer for routing, and the link layer address is set to the sensor node of the sensor node IPv6 address ID; the gateway node and the cluster head node in the tree structure keep a temporary routing table, and the routing table item includes three domains: the destination node domain, the next hop domain and the time-to-live domain; the destination node domain records the sensor of the destination node Node ID; the next hop field records the sensor node ID of the next hop to the destination node; the survival time field records the survival time of this temporary routing entry, and this time is automatically decayed according to the machine clock. When the survival time is 0, the cluster head The node deletes this entry from the routing table, and the set value of the survival time is determined according to the storage space of the sensor node and the number of sensor nodes; the survival time of the routing entry is only used for one routing operation. 7. The next-generation all-IP mobile wireless sensor network routing implementation system according to claim 6, wherein the gateway node stores two record tables, and one record table is used to record the information acquired in the tree structure. The cluster head node information of the home address, including the home address, the address of the gateway node in the tree structure where the care-of address is located, and the parameter value of the distance from the home address to the gateway node; another record table is used to record the cluster that obtains the care-of address in this tree structure The head node information includes the home address of the cluster head node, the care-of address obtained in this tree structure, and the distance parameter value from the care-of address to the gateway node. 8. The next-generation all-IP mobile wireless sensor network routing implementation system according to claim 7, characterized in that, when the cluster head node obtains the home address or returns to the tree structure that originally obtained the home address, the cluster The head node registers the home address with the gateway node in the tree structure; if the cluster head node returns to the tree structure where the home address is obtained due to its own movement, the gateway node finally obtains the care-of address from the tree structure where the cluster head node is located. The gateway node performs a logout operation; if the cluster head node obtains the care-of address, it registers the care-of address with the gateway node in the current tree structure. 9. The system for realizing the routing of the next-generation all-IP mobile wireless sensor network according to claim 6 or 7, wherein the gateway node establishes a routing path to the node in the destination cluster through a routing query message, and in the routing query After the cluster head nodes within the coverage of the message receive the message, the cluster head node judges whether the routing query message is sent by the parent node of the cluster head node by checking the source address of the routing query message, if not, discard the message, otherwise The cluster head node continues to judge the distance between itself and the gateway node of the current tree structure and the distance value of the current address of the target cluster head node from the gateway node; if the distance between the cluster head node and the gateway node of the current tree structure is If the value is greater than the distance between the destination cluster head node and the gateway node, the message will be discarded. If it is smaller, the message will continue to be broadcast. If it is equal, the cluster head node will continue to judge whether the gateway ID and cluster head ID of its home address are consistent with the destination cluster head ID. The gateway ID of the node address is the same as the cluster head ID. If they are not the same, the message will be discarded. If they are the same, the cluster head node will broadcast the cluster node ID of the destination cluster node in the cluster. If the cluster node detects its own cluster The ID of the internal node is the same as that of the node in the destination cluster, that is, the node in the cluster is the node in the destination cluster, then the node in the cluster returns a routing response message to the gateway node by unicast; the routing response returned by the node in the destination cluster The return path of the message is: the node in the destination cluster first sends the routing response message to the cluster head node of its cluster, and after receiving the message, the cluster head node sends the message to the parent node F of the cluster tree where the cluster head node is located. The parent node F of the cluster head node first checks whether there is already a routing entry for the destination node in the temporary routing table, that is, the destination node ID is the sensor node ID of the destination node in the cluster, and the next hop node is the cluster where the destination node is located. The sensor node ID of the cluster head node, if it exists, reset the survival time, if it does not exist, create a temporary routing table entry, the destination node ID is the sensor node ID of the node in the destination cluster, and the next hop node ID is the destination The sensor node ID of the cluster head node of the cluster where the node in the cluster is located, and set the survival time, and then continue to send this message to the parent node F' of the parent node F of the cluster head node, and the parent node F of the parent node F of the cluster head node 'After receiving this message, repeat the above operations, that is, the destination node ID is the sensor node ID of the destination node in the cluster, and the next hop node ID is the sensor node ID of the parent node F of the cluster head node; the final routing response message reaches the gateway node . 10. The next-generation all-IP mobile wireless sensor network routing implementation system according to claim 9, characterized in that, the cluster-head node regularly queries the working status of the parent node, if the cluster-head node does not receive the parent node within a specified time node’s response message, then it is determined that the parent node is in an abnormal working state, the cluster head node sets its care-of address to 0, and re-joins a tree structure to obtain an IPv6 address. If the newly obtained IPv6 address is the home address, that is, the original The global routing prefix and gateway ID of the home address are the same as the global routing prefix and gateway node ID of the newly acquired IPv6 address, then the cluster head node performs the home address registration operation, otherwise the cluster head node uses the newly acquired IPv6 address as the care-of address and Carry out the care-of address registration operation.

Images