Achieving energy-efficient Wireless Sensor Network (WSN) that monitors all targets at
all times is an essential challenge facing many large-scale surveillance applications.Singleobjective
set cover problem (SCP) is a well-known NP-hard optimization problem used to
set a minimum set of active sensors that efficiently cover all the targeted area. Realizing
that designing energy-efficient WSN and providing reliable coverage are in conflict with
each other, a multi-objective optimization tool is a strong choice for providing a set of
approximate Pareto optimal solutions (i.e., Pareto Front) that come up with tradeoff
between these two objectives. Thus, in the context of WSNs design problem, our main
contribution is to turn the definition of single-objective (SCP) into a multi-objective
problem by adopting an additional conflicting objective to be optimized. To the best of our
knowledge, improving coverage reliability of WSNs has not been explored while
simultaneously solving SCP problem. This paper addresses the problem of improving
coverage reliability of WSNsusing a realistic sensing model to handle coverage uncertainty.
To this end, this paper formulates the so-called multi-objective SCP with the goal of
selecting the minimum number of sensors so that the selected set reliably covers all the
targets.To cope with two optimization objectives rather than one objective, this
paperinvestigates the use of a multi-objective evolutionary algorithm, the so-called nondominated
sorting genetic algorithm for tackling the formulated problem. Moreover, it
adopts a heuristic crossover operator designed specifically to improve the performance of
the algorithm.The effectiveness of the algorithm is verified in terms of sensors cost and
coverage reliability under extensive simulations
Densely deployment of sensors is generally employed in wireless sensor networks (WSNs) to ensure energy-efficient covering of a target area. Many sensors scheduling techniques have been recently proposed for designing such energy-efficient WSNs. Sensors scheduling has been modeled, in the literature, as a generalization of minimum set covering problem (MSCP) problem. MSCP is a well-known NP-hard optimization problem used to model a large range of problems arising from scheduling, manufacturing, service planning, information retrieval, etc. In this paper, the MSCP is modeled to design an energy-efficient wireless sensor networks (WSNs) that can reliably cover a target area. Unlike other attempts in the literature, which consider only a si
... Show More
(19)
(14)
(22)
(14)
Establishing complete and reliable coverage for a long time-span is a crucial issue in densely surveillance wireless sensor networks (WSNs). Many scheduling algorithms have been proposed to model the problem as a maximum disjoint set covers (DSC) problem. The goal of DSC based algorithms is to schedule sensors into several disjoint subsets. One subset is assigned to be active, whereas, all remaining subsets are set to sleep. An extension to the maximum disjoint set covers problem has also been addressed in literature to allow for more advance sensors to adjust their sensing range. The problem, then, is extended to finding maximum number of overlapped set covers. Unlike all related works which concern with the disc sensing model, the cont
... Show More
(10)
(8)
(56)
(42)
(5)
(5)
(5)
(5)
(30)
(23)
(8)
(4)