A coverage-guaranteed nodes scheduling algorithm in clusters for wireless sensor networks

In order to balance the nodes´ energy consumption, prolong the lifetime of Wireless Sensor Networks (WSNs), this paper combined cluster and node scheduling, proposed a coverage-guaranteed nodes scheduling algorithm in clusters for WSNs (CGNSC). In this algorithm, clusters are set up at first, then every node in every cluster judges whether itself is a redundant node according to follow conditions: the first one, it has more than 3 neighbor nodes whose distance to itself are less than nodes´ monitor radius R; the other one, it can be circle covered by the neighbor nodes satisfying the first condition. If any node satisfies the two conditions above, it is a redundant one which must turn into sleep state immediately. Simulations in Matlab 7.1 indicate that, this algorithm can decrease the energy consumption of WSNs, and the schedule efficiency has an affinity with node density and node monitor radius.