| Article ID | Journal | Published Year | Pages | File Type |
|---|---|---|---|---|
| 1705274 | Applied Mathematical Modelling | 2013 | 6 Pages |
Abstract
We study the target coverage problem in wireless sensor networks. The problem consists in maximizing the network lifetime by grouping the sensors in disjoint set covers of the targets. A binary integer programing model is formulated to maximize the network lifetime. Since the problem is NP-complete, we provide an iterative approximation based on Lagrangean relaxation and subgradient optimization.
Related Topics
Physical Sciences and Engineering
Engineering
Computational Mechanics
Authors
Fethi Jarray,