A Lagrangean-based heuristics for the target covering problem in wireless sensor network |
| |
Authors: | Fethi Jarray |
| |
Affiliation: | Higher Institute of Computer Sciences of Medenine, Tunisia;Laboratoire CEDRIC, CNAM, 292 rue St-Martin 75141, Paris cedex 03, France |
| |
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. |
| |
Keywords: | |
本文献已被 ScienceDirect 等数据库收录! |
|