Topology Optimization Of Wireless Sensor Networks Based On Rigid Graph

Wireless Sensor Networks have attracted more and more attention and is becoming a hot area of research, which are commonly found in medical care, intelligent household, military counter-terrorism and other aspects. Based on the minimum rigid graph, the wireless sensor network topology optimization control problem is studied by designing reasonable control strategy, in order to guarantee network connectivity, prolong the life cycles, and improve the stability of the network structure. The details are as follows:Firstly, considering the large-scale networks in which the cluster head nodes transmit a message directly to the base station or the gathering node with low efficiency of data aggregation, a topology optimal algorithm based on the rigidity graph clustering algorithm, is put forward. The algorithm introduces the dormancy mechanism to reduce the energy consumption of network node. Simulation experiments show that the optimized clustering network can achieve balanced energy consumption, and the cluster nodes are 2-connected, which keeps good connectivity and robustness at the same time for the network.Secondly, considering the clustering algorithm in which energy consumption of cluster head nodes is higher, a three-layer architecture with sensor sleep-scheduling is presented for network clustering. The hierarchical clustering structure is based on the node residual energy and buffer capacity so that a new algorithm based on minimally rigid graph is applied for network topology optimization. It is shown that the optimized clustering network can achieve balanced energy consumption, and the cluster nodes are 2-connected, which keeps good connectivity and robustness at the same time for the network.Finally, based on the minimum rigid graph, a topology optimization algorithm is presented, which considers the weights of communication links in graph and generated the algebraic properties of rigid graph. The new algorithm ensures the communication link is shorter in order to prolong the network life cycle, and keep the graph structure more stable. It is shown that the new algorithm of communication link is shorter, at the same time generate rigid figure matrix trace is bigger, so that the new algorithm has good algebraic rigidity properties of a network. As a result,the algorithm has good network connectivity and structure stability.