A sustainable scheme for minimizing energy in visual sensor network using disjoint set cover approach

Abstract EN

Directional sensors in wireless visual sensor networks attractgrowing attention as a promising tool for monitoring the real world; directional sensors consume energy for two main tasks: sensing and communication.

Since a VSN contains a number of configurable visual sensors with changeable spherical sectors of restricted angle known as a field of view that isintended to monitor a number of targets located in a random manner over a given area.

Therefore maximizing the network lifetime through minimizing power consumption while covering the targets remains a challenge.

In this paper, the problem of obtaining a disjoint set cover includes a minimum number of camera sensors is solved.

The problem is known to be NP-complete.

The sustainable design is improving an existing Iterative Target Oriented Algorithm (ITOA) to cover moving targets move randomly over a given area of deployment starting from entry points reaching to exit ones in a realistic simulation.

To evaluate the performance of the modified algorithm, a comparison is provided with three existing algorithms (Iterative centralized Greedy Algorithm (ICGA), Iterative Centralized Forced-directed Algorithm ICFA, and Iterative Target Oriented Algorithm ITOA).

Simulation results revealed that the sustainable scheme can find a disjoint set witha minimum number of sensors covers the maximum number of moving targets in an energy-efficient way and extended network lifetime through minimizing power consumption while covering the targets remains a challenge.

In this paper, the problem of obtaining a disjoint set cover includes a minimum number of camera sensors is solved.

The problem is known to be NP-complete.

The sustainable design is improving an existing Iterative Target Oriented Algorithm (ITOA) to cover moving targets move randomly over a given area of deployment starting from entry points reaching to exit ones in a realistic simulation.

To evaluate the performance of the modified algorithm, a comparison is provided with three existing algorithms (Iterative centralized Greedy Algorithm (ICGA), Iterative Centralized Forced-directed Algorithm ICFA, and Iterative Target Oriented Algorithm ITOA).

Simulation results revealed that the sustainable scheme can find a disjoint set witha minimum number of sensors covers the maximum number of moving targets in an energy-efficient way and extended network lifetime.