阅读说明：本技术 一种基于簇的全ip无线传感器网构建方法 (Cluster-based all-IP wireless sensor network construction method ) 是由 王宝亮 马彩光 于 2020-05-29 设计创作，主要内容包括：本发明涉及一种基于簇的全IP无线传感器网构建方法,将传感器节点划分为四类：与IPv6网络连接的接入节点、固定簇首节点、移动簇首节点及簇成员节点,全IP无线传感网被划分为两个层次,由接入节点和固定簇首节点组成的接入节点动态树以及由簇首节点和簇成员节点组成的簇。(The invention relates to a cluster-based all-IP wireless sensor network construction method, which divides sensor nodes into four types: the all-IP wireless sensor network is divided into two layers, namely an access node dynamic tree consisting of the access node and the fixed cluster head node and a cluster consisting of the cluster head node and the cluster member node.)

1. A cluster-based all-IP wireless sensor network construction method divides sensor nodes into four types: the all-IP wireless sensor network is divided into two layers, namely an access node dynamic tree consisting of the access node and the fixed cluster head node and a cluster consisting of the cluster head node and the cluster member node. The construction method comprises the following steps:

(1) selection of cluster head node

In the initial stage, all nodes are ordinary nodes, the number of neighbor nodes is calculated by receiving beacon messages broadcast by other nodes, and the election process of the cluster head node is as follows: (1) the node F broadcasts beacon messages in a one-hop range, then monitors beacon messages of adjacent nodes, and compares the number of the owned adjacent nodes; (2) if the number of neighbor nodes of the node F is the maximum, marking the node F as a Cluster Head node, broadcasting a Cluster _ Head message, and otherwise marking the node F as a Cluster member node; if a plurality of nodes have the same maximum number of neighbor nodes, selecting the node with the minimum MAC address as a cluster head node; converting other nodes in the one-hop range of the cluster head node into cluster member nodes;

(2) construction of fixed clusters

Broadcasting beacon information through each node, calculating the node with the largest number of neighbor nodes, and marking the node as a fixed cluster head node; if two or more than two nodes have the same maximum number of neighbor nodes, selecting the node with the minimum MAC address as a fixed cluster head node; converting other nodes in the one-hop range of the fixed cluster head node into cluster member nodes, and establishing a corresponding fixed cluster;

(3) construction of Mobile clusters

Broadcasting beacon information through each node, calculating the node with the largest number of neighbor nodes, and marking the node as a mobile cluster head node; if two or more than two nodes have the same maximum number of neighbor nodes, selecting the node with the minimum MAC address as a mobile cluster head node; converting other nodes in the one-hop range of the mobile cluster head node into cluster member nodes, and establishing a corresponding mobile cluster;

(4) construction of dynamic tree of access node

After the fixed cluster head node is selected, the fixed cluster head node receives beacon messages sent by the node or other neighbor fixed cluster head nodes; initially, the depth values of all fixed cluster head nodes are-1; the access node dynamic tree is constructed from the access node, so the depth value of the access node is 1; the fixed cluster head node which is not added into the access node dynamic tree selects an access node or a fixed cluster head node with the minimum depth value and non-negative as a father node of the fixed cluster head node, adds the fixed cluster head node into the access node dynamic tree, and increases the depth value of the fixed cluster head node in the access node dynamic tree by 1 on the basis of the depth value of the father node; if one fixed cluster head node receives beacon messages of a plurality of non-negative fixed cluster head nodes with the same depth value, selecting the fixed cluster head node with the highest priority as a father node and adding the father node into the access node dynamic tree;

the mobile cluster head node does not add the access node dynamic tree; the nodes in the access node dynamic tree which are directly communicated with the mobile cluster head node are called as the associated nodes of the mobile cluster, and only one associated node exists in one mobile cluster at the same time; if the mobile clusterhead node is capable of communicating directly with nodes in the multiple access node dynamic trees, then the node with the smallest depth value and not negative is selected as its associated node.

2. The method of claim 1, wherein if a fixed cluster head node receives beacon messages of a plurality of fixed cluster head nodes with same depth values and non-negative values, a single hybrid metric parameter routing algorithm is used to calculate the priority.

3. The method of claim 1, wherein the access node dynamic tree is constructed by: (1) the fixed cluster head node F monitors beacon messages of adjacent nodes to obtain depth values; (2) comparing the depth values of adjacent nodes, if a node with non-negative and minimum depth value exists, adding the node as a father node into the access node dynamic tree, and increasing the depth value of the node in the access node dynamic tree by 1 on the basis of the depth value of the node, otherwise, if a plurality of nodes with the same minimum depth value exist, calculating the priority of the node according to a dynamic tree single-hybrid measurement parameter algorithm, and selecting the node with the highest priority as the father node access node dynamic tree; (3) and repeating the process until all the fixed cluster head nodes are added into the access node dynamic tree.

Technical Field

The invention relates to a cluster-based all-IP wireless sensor network construction method.

Background

With the rapid development and large-scale application of wireless sensor networks and the continuous popularization and improvement of IPv6 networks, it has become a necessary trend to implement all-IP communication between wireless sensor networks and IPv6 networks. The 6LoWPAN provides feasibility for introducing an IPv6 protocol into a low-power-consumption wireless personal area network, and is an ideal scheme for realizing full IP communication between a wireless sensor network and an IPv6 network. The all-IP wireless sensor network based on the IPv6 configures a globally unique IPv6 address for each sensor node, and can realize all-IP communication with the IPv6 network.

Nowadays, the IPv6 network is expected to be widely popularized, and it has become a necessary trend to realize all-IP communication between the wireless sensor network and the IPv6 network. Before the wireless sensor network and the IPv6 network realize all-IP communication, address configuration and routing path establishment are required. Due to the limitation of energy and hardware conditions of the sensor nodes, the energy and resources of the nodes are required to be efficiently utilized in the process of address configuration and route establishment, and an efficient network construction algorithm is a guarantee for realizing the effective operation of the wireless sensor network.

Disclosure of Invention

The invention aims to provide a cluster-based all-IP wireless sensor network construction method, which adopts the following technical scheme:

a cluster-based all-IP wireless sensor network construction method divides sensor nodes into four types: the all-IP wireless sensor network is divided into two layers, namely an access node dynamic tree consisting of the access node and the fixed cluster head node and a cluster consisting of the cluster head node and the cluster member node. The construction method comprises the following steps:

(1) selection of cluster head node

In the initial stage, all nodes are ordinary nodes, the number of neighbor nodes is calculated by receiving beacon messages broadcast by other nodes, and the election process of the cluster head node is as follows: (1) the node F broadcasts beacon messages in a one-hop range, then monitors beacon messages of adjacent nodes, and compares the number of the owned adjacent nodes; (2) if the number of neighbor nodes of the node F is the maximum, marking the node F as a Cluster Head node, broadcasting a Cluster _ Head message, and otherwise marking the node F as a Cluster member node; if a plurality of nodes have the same maximum number of neighbor nodes, selecting the node with the minimum MAC address as a cluster head node; converting other nodes in the one-hop range of the cluster head node into cluster member nodes;

(2) construction of fixed clusters

Broadcasting beacon information through each node, calculating the node with the largest number of neighbor nodes, and marking the node as a fixed cluster head node; if two or more than two nodes have the same maximum number of neighbor nodes, selecting the node with the minimum MAC address as a fixed cluster head node; converting other nodes in the one-hop range of the fixed cluster head node into cluster member nodes, and establishing a corresponding fixed cluster;

(3) construction of Mobile clusters

Broadcasting beacon information through each node, calculating the node with the largest number of neighbor nodes, and marking the node as a mobile cluster head node; if two or more than two nodes have the same maximum number of neighbor nodes, selecting the node with the minimum MAC address as a mobile cluster head node; converting other nodes in the one-hop range of the mobile cluster head node into cluster member nodes, and establishing a corresponding mobile cluster;

(4) construction of dynamic tree of access node

After the fixed cluster head node is selected, the fixed cluster head node receives beacon messages sent by the node or other neighbor fixed cluster head nodes; initially, the depth values of all fixed cluster head nodes are-1; the access node dynamic tree is constructed from the access node, so the depth value of the access node is 1; the fixed cluster head node which is not added into the access node dynamic tree selects an access node or a fixed cluster head node with the minimum depth value and non-negative as a father node of the fixed cluster head node, adds the fixed cluster head node into the access node dynamic tree, and increases the depth value of the fixed cluster head node in the access node dynamic tree by 1 on the basis of the depth value of the father node; if one fixed cluster head node receives beacon messages of a plurality of non-negative fixed cluster head nodes with the same depth value, selecting the fixed cluster head node with the highest priority as a father node and adding the father node into the access node dynamic tree;

the mobile cluster head node does not add the access node dynamic tree; the nodes in the access node dynamic tree which are directly communicated with the mobile cluster head node are called as the associated nodes of the mobile cluster, and only one associated node exists in one mobile cluster at the same time; if the mobile clusterhead node is capable of communicating directly with nodes in the multiple access node dynamic trees, then the node with the smallest depth value and not negative is selected as its associated node.

If one fixed cluster head node receives beacon messages of a plurality of fixed cluster head nodes with the same depth value and without negative values, a single-mixed metric parameter routing algorithm can be adopted to calculate the priority.

The access node dynamic tree construction process may be as follows: (1) the fixed cluster head node F monitors beacon messages of adjacent nodes to obtain depth values; (2) comparing the depth values of adjacent nodes, if a node with non-negative and minimum depth value exists, adding the node as a father node into the access node dynamic tree, and increasing the depth value of the node in the access node dynamic tree by 1 on the basis of the depth value of the node, otherwise, if a plurality of nodes with the same minimum depth value exist, calculating the priority of the node according to a dynamic tree single-hybrid measurement parameter algorithm, and selecting the node with the highest priority as the father node access node dynamic tree; (3) and repeating the process until all the fixed cluster head nodes are added into the access node dynamic tree.

The invention provides a cluster-based all-IP wireless sensor network construction method, which divides sensor nodes into four types, namely an access node, a fixed cluster head node, a mobile cluster head node and a cluster member node, so that an all-IP wireless sensor network can be fully fused with an IPv6 network system structure. The full IP wireless sensor network is divided into two layers, an access node dynamic tree consisting of access nodes and fixed cluster head nodes and a cluster consisting of the cluster head nodes and cluster member nodes.

Drawings

FIG. 1 is a hierarchical architecture of an all-IP wireless sensor network

FIG. 2 construction of fixed clusters

FIG. 3 construction of moving clusters

Detailed Description

The method is suitable for the construction of the all-IP wireless sensor network, the IPv6 network is popularized in a large area at present, and the realization of all-IP communication between the wireless sensor network and the IPv6 network becomes a necessary trend. Before the wireless sensor network and the IPv6 network realize all-IP communication, address configuration and routing path establishment are required. The limitation of energy and hardware conditions of the sensor nodes requires that node energy and resources are efficiently utilized in the process of address configuration and route establishment, the energy and resources of the sensor nodes can be efficiently utilized by the topological structure of the efficient wireless sensor network, the efficiency of functions of data acquisition, data transmission and the like of the sensor nodes is effectively improved, and convenience is brought to address configuration and route establishment.

In order to fully integrate an all-IP wireless sensor network with an IPv6 network architecture, sensor nodes are divided into four classes: the system comprises an access node, a fixed cluster head node, a mobile cluster head node and a cluster member node which are connected with an IPv6 network. The full IP wireless sensor network is divided into two layers, namely an access node dynamic tree consisting of access nodes and fixed cluster head nodes and a cluster consisting of the cluster head nodes and cluster member nodes. The hierarchy of the all-IP wireless sensor network is shown in fig. 1. The following is the all-IP wireless sensor network construction process.

Construction of 1 Cluster

1.1 selection of Cluster head node

In the initial stage, all nodes are ordinary nodes, the number of neighbor nodes is calculated by receiving beacon messages broadcast by other nodes, and the election process of the cluster head node is as follows: (1) the node F broadcasts beacon messages in a one-hop range, then monitors beacon messages of adjacent nodes, and compares the number of the owned adjacent nodes; (2) if the number of the neighbor nodes of the node F is the maximum, the node F is marked as a Cluster Head node, a Cluster _ Head message is broadcasted, otherwise, the node F is marked as a Cluster member node. And if a plurality of nodes have the same maximum number of neighbor nodes, selecting the node with the minimum MAC address as a cluster head node. And converting other nodes in the one-hop range of the cluster head node into cluster member nodes.

1.2 construction of fixed clusters

As shown in fig. 2, each node broadcasts beacon messages, and the node with the largest number of neighbor nodes is calculated and marked as a fixed cluster head node; and if two or more than two nodes have the same maximum number of neighbor nodes, selecting the node with the minimum MAC address as the fixed cluster head node. And converting other nodes in the one-hop range of the fixed cluster head node into cluster member nodes, and establishing a corresponding fixed cluster.

1.3 construction of moving clusters

The selection process of the mobile cluster head node is similar to that of the fixed cluster head node, and the node with the largest number of neighbor nodes is selected as the cluster head node. As shown in fig. 3, each node broadcasts beacon messages, and the node with the largest number of neighboring nodes is calculated and marked as a mobile cluster head node; and if two or more than two nodes have the same maximum number of neighbor nodes, selecting the node with the minimum MAC address as the mobile cluster head node. And converting other nodes in the one-hop range of the mobile cluster head node into cluster member nodes, and establishing a corresponding mobile cluster.

2 construction of dynamic tree of access nodes

After the fixed cluster head node is selected, the fixed cluster head node can receive beacon messages sent by the node or other neighbor fixed cluster head nodes. Initially, the depth values of all fixed clusterhead nodes are-1. The access node dynamic tree is constructed starting from the access node, so the depth value of the access node is 1. And selecting the access node or the non-negative fixed cluster head node with the minimum depth value as a father node of the fixed cluster head node which is not added into the dynamic tree of the access node, adding the fixed cluster head node into the dynamic tree of the access node, and increasing the depth value of the fixed cluster head node in the dynamic tree of the access node by 1 on the basis of the depth value of the father node. If a fixed cluster head node receives beacon messages of a plurality of non-negative fixed cluster head nodes with the same depth value, the priority of the fixed cluster head nodes is calculated by adopting a Single mixed metric parameter routing algorithm (Single Mixed metric routing algorithm), and the fixed cluster head node with the highest priority is selected as a father node and added into an access node dynamic tree.

And the mobile cluster head node does not add the dynamic tree of the access node. The nodes in the access node dynamic tree which are directly communicated with the mobile cluster head node are called as the associated nodes of the mobile cluster, and only one associated node exists in one mobile cluster at the same time. If the mobile clusterhead node is capable of communicating directly with nodes in the multiple access node dynamic trees, it will select the node with the smallest depth value and that is not negative as its associated node.

The access node dynamic tree construction process is as follows: (1) the fixed cluster head node F monitors beacon messages of adjacent nodes to obtain depth values; (2) and comparing the depth values of the adjacent nodes, if a node with non-negative and minimum depth value exists, adding the node as a father node into the access node dynamic tree, increasing the depth value of the node in the access node dynamic tree by 1 on the basis of the depth value of the node, otherwise, if a plurality of nodes with the same minimum depth value exist, calculating the priority of the node according to a dynamic tree single-mixed measurement parameter algorithm, and selecting the node with the highest priority as the father node access node dynamic tree. (3) And repeating the process until all the fixed cluster head nodes are added into the access node dynamic tree.

The fixed cluster head nodes with the same depth value are mutually independent, and the fixed cluster head nodes which are not added into the access node dynamic tree can be selectively added into different branches, so that the access node dynamic tree can be constructed in parallel.