Coverage is a fundamental problem in heterogeneous wireless sensor networks (HWSNs). Lifetime of the HWSNs is another important problem in this area. The K-Cover problem can solve both the coverage ...

The greedy algorithm can only be obtained Approximate solve in a certain range near the optimal solution. In this paper, based on 0-1 knapsack problem is given a mathematical model, and analysis of ...