Deployment strategies of wireless sensor network mobile nodes based on graph theory
Aiming at the problem of decline in monitoring performance, caused by failure nodes, of wireless sensor network. We propose an effective wireless sensor network deployment program based on the foundation of completing setting the fixed nodes, focusing on considering the case on condition that the fixed node uneven distribution and discuss the significance of nodes in cut vertex of wireless sensor network topology. By employing the k-means clustering algorithm, the initial number and location of the mobile nodes in this configuration program can be determined and selected effectively. Furthermore, we analyze the stability and lifetime of the network topology. Experimental results show that the proposed program can improve the stability of sensor network by introducing the least number of mobile nodes.