An improved algorithm for finding the maximum number of set covers for wireless sensor networks

In this paper we focus on the use of power optimization for maximizing the network lifetime of wireless sensor networks. The goal of this paper is to improve on the algorithm suggested by Cardei et al. for solving the adjustable range set cover problem. We suggest applying the technique of Lagrangian relaxation to the integer linear programming problem formulated by Cardei et al. and using the dual variables obtained from solving the relaxed linear program as the initial values of the Lagrangian multipliers. The results of using the proposed algorithm on small examples are then compared to the results of using the methods suggested by Cardei et al. on the same examples.