Wireless sensor coverage problem has been extensively studied in the last years, with growing attention to energy efficient configurations. In the paper we consider the problem of determining the radius of a given number of sensors, covering a set of targets, with the objective of minimizing the total coverage energy consumption. The problem has a non linear objective function and non convex constraints. To solve it we adopt a penalty function approach which allows us to state the problem in difference of convex functions form. Some numerical results are presented on a set of randomly generated test problems.
Optimizing sensor cover energy via DC programming
ASTORINO, Annabella;Miglionico, Giovanna
2016-01-01
Abstract
Wireless sensor coverage problem has been extensively studied in the last years, with growing attention to energy efficient configurations. In the paper we consider the problem of determining the radius of a given number of sensors, covering a set of targets, with the objective of minimizing the total coverage energy consumption. The problem has a non linear objective function and non convex constraints. To solve it we adopt a penalty function approach which allows us to state the problem in difference of convex functions form. Some numerical results are presented on a set of randomly generated test problems.File in questo prodotto:
Non ci sono file associati a questo prodotto.
I documenti in IRIS sono protetti da copyright e tutti i diritti sono riservati, salvo diversa indicazione.
