An event-aware clustering algorithm of mobile wireless sensor network nodes

In wireless sensor networks, clustering algorithm is widely used to extend network life and reduce data redundancy. However, the existing algorithms were usually for static nodes and did not consider the event-aware issue, and the evaluation of a new algorithm mostly focused on network life. For these reasons, we propose an Event-Aware clustering algorithm based on the minimum ID algorithm, further choosing the cluster head from the tradeoff between the ID and the energy. The algorithm can rebuild the clusters according to random events for improving network efficiency and warning in time. We also offer a simulation model and test the efficiency of the algorithm, and analyze the trace and dynamic clustering situation of nodes. We find that the Event-Aware clustering algorithm is better than classical algorithms, such as the minimum ID algorithm or the LEACH, in energy consumption equalization and network life and can be efficient in the network with a large number of mobile nodes.