Article ID: | iaor2013261 |
Volume: | 7 |
Issue: | 1 |
Start Page Number: | 157 |
End Page Number: | 172 |
Publication Date: | Jan 2013 |
Journal: | Optimization Letters |
Authors: | Gentili Monica, Raiconi Andrea |
Keywords: | combinatorial optimization, heuristics |
An important problem in the context of wireless sensor networks is the Maximum Network Lifetime Problem (MLP): find a collection of subset of sensors (cover) each covering the whole set of targets and assign them an activation time so that network lifetime is maximized. In this paper we consider a variant of MLP, where we allow each cover to neglect a certain fraction (1 −