Intra-cluster Nodes Scheduling Algorithm Satisfying Expected Coverage Degree of Application in Distributed Clustering WSNs

To satisfying expected coverage degree of application, we derived the smallest active node number K through node active-sleep theory. We also achieved intra-cluster active nodes scheduling algorithm. In data gathering protocol, this algorithm can make vast intra-member nodes obtain sleep, reduce data delay, lighten cluster head burden. The simulated experiment shows that the result of the algorithm in saving energy is very apparent.