Configuration schedule problem for wireless sensor networks

The paper is related to the problem of constructing configuration schedule for wireless sensor networks to maximize the network lifetime until the single node failure. The proposed centralized algorithm for constructing the schedule is based on constructing the set of configurations using Garg–Konemann algorithm and solving LP problem on the set of configurations.