Distributed node scheduling method for wireless sensor networks

For m-covered and connected sensor networks, a new distributed node scheduling algorithm is designed, which can allocate all the nodes in the sensor network into k (k ≤ m) different groups without requiring location information. Theoretical analysis and simulation results show that the newly proposed algorithm has better node scheduling performance and can prolong the lifetime of the sensor networks more effectively than the traditional random-based node scheduling scheme.