TOPOLOGY CONTROL SYSTEM AND CONTROL METHOD FOR DYNAMIC NETWORK

Abstract

A topology control system and a corresponding topology control method for dynamic network is provided. The topology control system for dynamic network includes a sensing module, a data processing module, a data judgment module, a communication module and a central module. The sensing module collects the data of the surrounding nodes, and transmits it to the data processing module for caching, and then selects the cluster head of the current node according to the data, and then transmits it to the data judgment module. After the data judgment module checks the cluster head qualified, the communication module is responsible for wireless transmission of cluster head information to the central module. The central module collects the data of all nodes in the network and transmits the results to the client. It can be used for topology control of the dynamic network.

Claims

1. A dynamic network topology control system, comprising a sensing module (1), a data processing module (2), a data judgment module (3), a communication module (4) and a central module (5), wherein the sensing module (1), the data processing module (2), the data judgment module (3) and the communication module (4) are integrated in a current node, and the sensing module (1), the data processing module (2), the data judgment module (3) and the communication module (4) are respectively wired connected with the data processing module (2), and the communication module (4) is wirelessly connected with the central module (5); the sensing module (1) is configured to sense data and transmit the data sensed by sensors to the data processing module (2); the data processing module (2) is configured to receive the data transmitted by the sensing module (1) for caching, select a cluster head of the current node according to the data in the cache and upload the cluster head to the data judgment module (3), and then wait for the data judgment module (3) to check the rationality of the cluster head and receive the test results; if the received result indicates that the cluster head selection is reasonable, the data processing module (2) sends the cluster head information to the communication module (4), otherwise, the data processing module (2) selects the cluster head again; the data judgment module (3) is configured to analyze the data transmitted by the data processing module (2), judge whether the cluster head selection is reasonable, and feed back the result to the data processing module (2); the communication module (4) is configured to monitor the data sent by the data processing module (2) and send the data to the central module (5) after receiving the data; the central module (5) is configured to summarize the data sent by all nodes in the network and send processing results to a client.

2. The system according to claim 1, wherein the sensor of the sensing module (1) comprises a distance sensor, a speed sensor and a selective sensor, wherein the selective sensor is selected by an user according to demands of a service.

3. The system according to claim 1, wherein an attraction matrix, a similarity matrix and a node belonging matrix of the network are calculated in sequence by the data processing module (2), and the optimal transmission power of the current node is determined according to the node belonging matrix.

4. The system according to claim 1, wherein the data transmitted by the data processing module (2) is analyzed by the data judgment module (3), comprising two aspects: one is to monitor interfaces between the data processing module (2), until the data uploaded by the data processing module is received; the other one is to judge whether the network meets a connectivity requirements, inform the data processing module (2) of a judgment result, and continue monitoring.

5. A topology control method for dynamic network, comprising step 1) initializing a dynamic network waiting for topology control; step 2) finding neighbor nodes of each node and calculating a similarity matrix of the network; step 3) classifying the nodes in the dynamic network, and calculating an attraction matrix of the network according to levels of the nodes and the similarity matrix; step 4) calculating a node belonging matrix of the network according to the attraction matrix of the network, and determining a cluster head of each node, that is, the node corresponding to a column where a first element is “1” in a corresponding row of the belonging matrix is taken as the cluster head to form a topology of the network; step 5) calculating an optimal transmission power of each node, and judging whether the topology of the network meets a connectivity requirement; if the topology of the network meets the connectivity requirement, completing a current stage of network topology control, and execute step 6); otherwise, return to step 4); step 6) monitoring a status of the node and judging whether there is a node moving; if there is a node moving, return to step 2) for a new round of network topology control, otherwise, maintaining the current network topology and continuously monitoring.

6. The method according to claim 5, wherein the step 1) of initializing a dynamic network waiting for topology control is to generate a unique number for each node of the network, and a value is 1−N, wherein N is the total number of nodes in the dynamic network, and an initial value of each element of the similarity matrix, the attraction matrix and the node belonging matrix is 0.

7. The method according to claim 5, wherein the step of calculating the similarity matrix of dynamic network in step 2) is realized as follows: calculating a similarity s.sub.ij of node i and node j by a following formula firstly: $s_{\mathrm{ij}}=\{\begin{array}{c}1\text{/}\left[d_{\mathrm{ij}}^2+{.Math.v_{\mathrm{ij}}.Math.}^2\right],i\ne j\\ 1\text{/}\left[d_{\mathrm{ic}}^4+{.Math.v_{\mathrm{ic}}.Math.}^2\right],i=j\end{array}$ Wherein, d.sub.ij is an Euclidean distance from the i th node to the j th node at a current time, if the i th node to the j th node are not adjacent to each other, the Euclidean distance d.sub.ij can be set as positive infinity; d.sub.ic is an Euclidean distance from the current i th node to a center node or a base station c; v.sub.ij is a velocity vector difference between the current i th node and the j th node; v.sub.ic is a velocity vector difference between the current i th node and the center node or the base station c; then, constructing the similarity matrix with the size of N×N which is composed of the similarities between the nodes as follows: $S=\left[\begin{array}{cccc}{s}_{11}& s_{12}& \mathrm{.Math.}& s_{1N}\\ s_{21}& s_{22}& \mathrm{.Math.}& s_{2N}\\ \mathrm{.Math.}& \mathrm{.Math.}& \mathrm{.Math.}& \mathrm{.Math.}\\ s_{N1}& s_{N2}& \mathrm{.Math.}& s_{\mathrm{NN}}\end{array}\right]$ wherein, N is the total number of the nodes in the dynamic network.

8. The method according to claim 5, wherein the step of classifying the nodes in the dynamic network in step 3) is that classifying the nodes in the dynamic network into different levels according to different application scenarios, the smaller the level number is, the higher the level of the node in the network is, and the minimum is 1, that is, the level 1 represents a center node or a base station in the network.

9. The method according to claim 5, wherein the step of calculating the attraction matrix of the dynamic network in step 3) is realized as follows: calculating an attractiveness a.sub.ij of node j to node i by a following formula firstly:
a.sub.ij=(l.sub.i−l.sub.j).Math.s.sub.ij wherein, l.sub.i is a level of the i th node in the network; l.sub.j is a level of the j th node in the network; s.sub.ij is a similarity between the i th node and the j th node; then, constructing the attractiveness matrix with the size of N×N which is composed of the attractiveness of each node as follows: $A=\left[\begin{array}{cccc}{a}_{11}& a_{12}& \mathrm{.Math.}& a_{1N}\\ a_{21}& a_{22}& \mathrm{.Math.}& a_{2N}\\ \mathrm{.Math.}& \mathrm{.Math.}& \mathrm{.Math.}& \mathrm{.Math.}\\ a_{N1}& a_{N2}& \mathrm{.Math.}& a_{\mathrm{NN}}\end{array}\right]$ wherein, N is the total number of the nodes in the dynamic network.

10. The method according to claim 5, wherein the step of calculating the node belonging matrix of the dynamic network in step 4) is realized as follows: calculating a belonging factor b.sub.ij of the i th node to the j th node by a following formula firstly: $b_{\mathrm{ij}}=\{\begin{array}{c}0,a_{\mathrm{ij}}\ne \max \left(a_{\mathrm{ik}}\right)\mathrm{and}1\le k\le N\\ 1,a_{\mathrm{ij}}=\max \left(a_{\mathrm{ik}}\right)\mathrm{and}1\le k\le N\end{array},$ wherein, i, j and k are node numbers; a.sub.ij is an attractiveness of node j to node i; N is the total number of the nodes in the dynamic network; then, constructing the belonging matrix with the size of N×N which is composed of the belonging factors of each node as follows: $B=\left[\begin{array}{cccc}{b}_{11}& b_{12}& \mathrm{.Math.}& b_{1N}\\ b_{21}& b_{22}& \mathrm{.Math.}& b_{2N}\\ \mathrm{.Math.}& \mathrm{.Math.}& \mathrm{.Math.}& \mathrm{.Math.}\\ b_{N1}& b_{N2}& \mathrm{.Math.}& b_{\mathrm{NN}}\end{array}\right].$

Description

BRIEF DESCRIPTION OF THE DRAWINGS

[0028] In order to more clearly illustrate the technical solution of the embodiment of the present disclosure, the drawings needed to be used in the description of the embodiments will be briefly introduced. It is apparent that the drawings described below are some embodiments of the disclosure. For ordinary skilled person in the art, other drawings can be obtained according to these drawings without paying creative labor.

[0029] FIG. 1 is a schematic diagram of the node topology control system of the present disclosure;

[0030] FIG. 2 is the working principle diagram of the data processing module in the node topology control system of the present disclosure;

[0031] FIG. 3 is the flow chart of the node topology control method of the present disclosure.

DETAILED DESCRIPTION OF THE EMBODIMENTS

[0032] The following will clearly and completely describe the embodiments of the present disclosure in combination with the drawings. It is apparent that the described embodiments are part of the embodiments of the present disclosure, not all of them. Based on the embodiments in the present disclosure, all other embodiments obtained by ordinary skilled person in the art without making creative work are within the scope of the present disclosure.

[0033] The present disclosure mainly aims at the topology control problem of dynamic network, and provides a network topology control method suitable for mobile nodes and a corresponding network topology control system. The network topology control method and network topology control system can adjust the connection relationship and topology structure of the network nodes in real time according to the status of the nodes. While ensuring the network connectivity, the power control of the nodes can save the energy consumption of the network and reduce the interference in the network. The distributed deployment system can improve the robustness and anti-strike capability of the network.

[0034] Referring to FIG. 1, the dynamic network topology control system of the present disclosure includes a sensing module 1, a data processing module 2, a data judgment module 3, a communication module 4 and a central module 5. The sensing module 1, the data processing module 2, the data judgment module 3 and the communication module 4 are integrated in each node. The sensing module 1, the data judgment module 3 and the communication module 4 are wired connected with the data processing module 2 respectively. And the communication module 4 is wireless connected with the central module 5. The sensing module 1 is responsible for sensing data and transmitting the sensed data to the data processing module 2. The data processing module 2 processes the data sent by the sensing module, calculates and selects the cluster head of the current node, and interacts with the data judgment module 3 and the communication module 4. The data judgment module 3 is responsible for judging whether the cluster head selected by the data processing module 2 is reasonable, and feedback the result to the data processing module 2. The communication module 4 receives the cluster head information transmitted by the data processing module 2 and sends this information to the central module 5.

[0035] The sensing module 1 is mainly composed of sensors and a power supply device. The sensors of the module mainly include: a distance sensor, a speed sensor, and other selective sensors. The selective sensor is selected by the user according to the business scenario. The module is mainly responsible for sensing the neighbor node information and service sensitive information, including but not limited to the neighbor node coordinates, moving direction and speed.

[0036] The data processing module 2 is the core module of the node topology control system of the present disclosure, which is respectively wired connected with the sensing module 1, the data judgment module 3 and the communication module 4, and is mainly composed of a computing unit and a power supply device.

[0037] Referring to FIG. 2, the processing flow of the data processing module 2 includes:

[0038] Step 1) the communication interface with the sensing module 1 is monitored until the data transmitted by the sensing module 1 is received.

[0039] Step 2) the data transmitted by the sensing module 1 is cached locally.

[0040] Step 3) the attraction matrix, the similarity matrix and the node belonging matrix of the network are calculated, and the cluster head is established for the current node according to the node belonging matrix.

[0041] Step 4) the calculated cluster head information is sent to the data judgment module 3.

[0042] Step 5) in the waiting state, the communication interface with the data judgment module 3 is continuously monitored until the feedback sent by the data judgment module 3 is received.

[0043] Step 6) after receiving the feedback information from the data judgment module 3, the judgment result is extracted; if the result shows that the cluster head selection is reasonable, execute step 7), otherwise, return to step 3).

[0044] Step 7) the cluster head information is sent to the communication module 4.

[0045] The data judgment module 3 is mainly composed of a data processing unit and a power supply device. The module is wired connected to the data processing module 2, which is mainly responsible for monitoring the communication interfaces between the data processing module 2, receiving the data transmitted by the data processing module 2, and judging whether the cluster head selection is reasonable, including but not limited to the judgment of network connectivity, and then feedback the judgment results to the data processing module 2.

[0046] The communication module 4 is used to establish a connection with the central module and wireless transmission of the information to the central module after receiving the data sent by the data processing module 2. The technology used in the transmission is mainly wireless technology, including but not limited to a series of wireless technologies such as Bluetooth, Wi Fi and so on.

[0047] The central module 5 mainly refers to the center node or base station of the network, which is responsible for collecting the information transmitted by the network nodes and processing the corresponding data according to the business requirements, including but not limited to data fusion, data filtering, etc., and finally transmitting the processing results to the client.

[0048] Referring to FIG. 3, the network topology control method of the present disclosure includes the following steps:

[0049] Step 1, initializing the dynamic network waiting for topology control.

[0050] In the initialization phase of the network, each node will generate a unique number to identify the node, including but not limited to the monotonic incremental numbering method, with the value of 1−N, wherein N is the total number of nodes in the dynamic network. Further, this stage also needs to initialize the attraction matrix, the similarity matrix and the node belonging matrix of the dynamic network to be topology controlled. The size of the above matrix is N*N, N is the total number of nodes in the dynamic network, and the initial value of each element in the matrix is 0.

[0051] Step 2, finding neighbor nodes of each node, and calculating the similarity matrix of the network.

[0052] 2.1) When a node is searching for its neighbor node, it can use broadcast or location method. If it uses broadcast method, it will broadcast its own information to the surrounding nodes with a certain power and wait for the response from the surrounding nodes. After receiving the response from other nodes, it can determine the responding nodes as its neighbor nodes. If the location method is adopted, a distance threshold should be determined first, and the nodes whose distance is less than the threshold should be determined as the neighbor nodes.

[0053] 2.2) Calculating the similarity between each node and all its neighbor nodes respectively. The formula for calculating the similarity s.sub.ij of the node i and the node j is as follows:

[00001]$s_{\mathrm{ij}}=\{\begin{array}{c}1\text{/}\left[d_{\mathrm{ij}}^2+{.Math.v_{\mathrm{ij}}.Math.}^2\right],i\ne j\\ 1\text{/}\left[d_{\mathrm{ic}}^4+{.Math.v_{\mathrm{ic}}.Math.}^2\right],i=j\end{array},$

[0054] Wherein, d.sub.ij is the Euclidean distance from the i th node to the j th node at the current time, if the i th node to the j th node are not adjacent to each other, the Euclidean distance d.sub.ij can be set as positive infinity; d.sub.ic is the Euclidean distance from the current i th node to the center node or base station c; v.sub.ij is the velocity vector difference between the current i th node and the j th node; v.sub.ic is the velocity vector difference between the current i th node and the center node or the base station c.

[0055] In this embodiment, it is assumed that the nodes are distributed on the two-dimensional plane, and similar calculation method can be used for the three-dimensional space. Through the calculation method of this step, it can be inferred that the closer the distance between the two nodes is, the smaller the modulus of velocity vector difference is, the higher the similarity between the two nodes is. At the same time, each node also needs to calculate its similarity with the center node or the base station, which lays the foundation for the selection of cluster head in the future. This step fully considers the dynamic characteristics of the network, and is suitable for the scene where the center node or the base station is in the mobile state.

[0056] 2.3) After all nodes have completed the similarity calculation with their neighbor nodes, the similarity matrix with the size of N×N, which is composed of the similarity values between each node as follows:

[00002]$S=\left[\begin{array}{cccc}{s}_{11}& s_{12}& \mathrm{.Math.}& s_{1N}\\ s_{21}& s_{22}& \mathrm{.Math.}& s_{2N}\\ \mathrm{.Math.}& \mathrm{.Math.}& \mathrm{.Math.}& \mathrm{.Math.}\\ s_{N1}& s_{N2}& \mathrm{.Math.}& s_{\mathrm{NN}}\end{array}\right],$

[0057] Wherein, N is the total number of nodes in the dynamic network.

[0058] Step 3, classifying the nodes in the network, and calculating the attraction matrix of the network according to the node level and the similarity matrix.

[0059] 3.1) Dividing the network into different levels according to different application scenarios;

[0060] In this embodiment, it is assumed that the smaller the level number of a node, the higher the level of the node in the network, and the minimum is 1. The level 1 usually represents the center node or the base station of the network. The basis for dividing the network level includes but is not limited to the communication ability and the computing ability of the node, and different weights can be given to each factor according to a variety of application scenarios. For this embodiment, the smaller the level number of the node is, the stronger the communication ability and the computing ability it usually has, so it can bear heavier loads.

[0061] 3.2) Calculating the attractiveness of each node to all its neighbor nodes respectively. The formula for calculating the attractiveness a.sub.ij of the node j to the node i is as follows:

a.sub.ij=(l.sub.i−l.sub.j).Math.s.sub.ij,

[0062] Wherein, l.sub.i is the level of the i th node in the network; l.sub.j is the level of the j th node in the network; s.sub.ij is the similarity between the i th node and the j th node; the greater the attractiveness, the greater the probability of joining the cluster where the node is located.

[0063] 3.3) After all nodes have completed the attractiveness calculation with their neighbor nodes, the attraction matrix A with the size of N×N, which is composed of the attractiveness values of each node as follows:

[00003]$A=\left[\begin{array}{cccc}{a}_{11}& a_{12}& \mathrm{.Math.}& a_{1N}\\ a_{21}& a_{22}& \mathrm{.Math.}& a_{2N}\\ \mathrm{.Math.}& \mathrm{.Math.}& \mathrm{.Math.}& \mathrm{.Math.}\\ a_{N1}& a_{N2}& \mathrm{.Math.}& a_{\mathrm{NN}}\end{array}\right],$

[0064] Wherein, N is the total number of nodes in the dynamic network.

[0065] Step 4, Calculating the node belonging matrix of the network according to the attraction matrix of the network, and determining the cluster head of each node.

[0066] 4.1) Calculating the belonging factors b.sub.ij of each node to all neighbor nodes, and the formula for calculating the belonging factor b.sub.ij of node j to node i is as follows:

[00004]$b_{\mathrm{ij}}=\{\begin{array}{c}0,a_{\mathrm{ij}}\ne \max \left(a_{\mathrm{ik}}\right)1\le k\le N\\ 1,a_{\mathrm{ij}}=\max \left(a_{\mathrm{ik}}\right)1\le k\le N\end{array},$

[0067] Wherein, i, j and k are node numbers; a.sub.ij is the attraction degree of node j to node i; N is the total number of nodes in the dynamic network.

[0068] 4.2) After all the nodes have completed the calculation of the belonging factors with their neighbor nodes, the belonging matrix B with the size of N×N, which is composed of the belonging factors of each node as follows:

[00005]$B=\left[\begin{array}{cccc}{b}_{11}& b_{12}& \mathrm{.Math.}& b_{1N}\\ b_{21}& b_{22}& \mathrm{.Math.}& b_{2N}\\ \mathrm{.Math.}& \mathrm{.Math.}& \mathrm{.Math.}& \mathrm{.Math.}\\ b_{N1}& b_{N2}& \mathrm{.Math.}& b_{\mathrm{NN}}\end{array}\right];$

[0069] 4.3) After calculating the belonging matrix of the network, it is necessary to further select the cluster head of each node. The specific selection rule adopted in this embodiment is that the cluster head of each node is the node number corresponding to the column of the first “1” element in the corresponding row of the belonging matrix. After each node establishes the cluster head, it will send the connection request to the cluster head and establish the connection. After all nodes establish the cluster head, the topology of the network is established.

[0070] Step 5, calculating the optimal transmission power of each node, and judging whether the network topology meets the connectivity requirements.

[0071] 5.1) Calculating the optimal transmission power of each node. The method for calculating the optimal transmission power of each node in this embodiment is that for an ordinary node, the optimal transmission power of the node is the power required for stable communication with the cluster head; for the cluster head node, the optimal transmission power of the node is the power required for stable communication with the center node or base station and the cluster member with the farthest Euclidean distance at the same time;

[0072] 5.2) Judging the connectivity of the network topology. If all nodes in the network can communicate with the center node or base station in a one hop or multi-hop manner according to the network topology control method provided in the present disclosure, it indicates that the network topology meets the connectivity requirements, and completes the network topology control at the current stage, execute step 6); otherwise, it is necessary to increase the transmission power of the node that does not meet the requirements, and return step 4) until the requirements are met.

[0073] The methods to judge whether the network meets with connectivity include but are not limited to the depth-first search algorithm and the breadth-first search for a graph.

[0074] Step 6, updating the topology of the network.

[0075] The movement of nodes will lead to the change of network state. In this embodiment, the node information is obtained in real time through the sensing module, and the attraction matrix, the similarity matrix and the node belonging matrix of the network are constantly updated, so as to update the topology structure of the network and ensure the long-term effective connectivity and stability of the network, and its realization is as follows:

[0076] Monitoring the status of the node, and judging whether there is a node moving: if there is a node moving, return step 2) for a new round of network topology control; otherwise, maintain the current network topology and monitor continuously.

[0077] The present disclosure realizes the overall goal of load balancing, strong robustness, energy saving and interference reduction, adopts the topology control method realized by the distributed architecture system to meet the topology requirements of the dynamic network, is suitable for high-speed mobile nodes, and plays a vital role in the stable connection and reliable transmission of the dynamic network. The dynamic network topology control system provided by the present disclosure updates the node information and status in real time and adjusts the network topology structure in time through the cooperation of the sensing module, the data processing module, the data judgment module and the communication module. In addition, the optimal power selection strategy can further save energy consumption, reduce internal interference and ensure the long-term stability of network communication.

[0078] The description above is only the specific embodiment of the present disclosure, but the scope of the present disclosure is not limited to this. Any skilled person in the art can easily think of various equivalent modifications or substitutions within the technical scope of the present disclosure, and these modifications or substitutions should be included in the scope of the present disclosure. Therefore, the scope of the present disclosure shall be subject to the scope of the claims.