Maximally pair-wise disjoint set covers for directional sensors in visual sensor networks

Farzana, Shahla; Papry, Khaleda Akther; Rahman, Ashikur; Rab, Raqeebir

doi:10.1109/wd.2016.7461479

Cited by 6 publications

(4 citation statements)

References 7 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…For example, as depicted in Figure 4 a, a directional sensor with FoV, 2θ = π/4 can select 8 separated pans/orientations. These sectors can be joined to create an omnidirectional sensor's complete circular view [9,14]. A sensor Si located at position L is monitoring a target t at location L1 when the following conditions are satisfied: 2)…”

Section: Directional Sensing Modelmentioning

confidence: 99%

“…The resultant distance vector (|LL1|) is within FoV (-θ, θ) of the directional sensor (Vij) [9,14]. A simple way to determine if a target t is covered by sensor Si in pan Pj if (|LL1|) ≤ Rs and (LL1) .…”

Section: Directional Sensing Modelmentioning

confidence: 99%

“…Then the target t is coverable. Run the test for the whole targets, we can simply build a coverage matrix A_ij^t as that every element of the matrix, at ij, describes if the sensor si in pan pj can monitor target t [9].…”

Section: Directional Sensing Modelmentioning

confidence: 99%

“…Their work is for stationary target only. Farzana et al [9] work tackled the issue of obtaining the highest possible pair-wise disjoint cover sets in the VSN domain for directional sensors, their work dealt with static targets. This paper is addressing the problem of obtaining a pairwise disjoint set cover with a minimum number of sensors for a random deployment of directional sensors to cover moving targets starts from random entry points reaching random exit ones.…”

Section: Introductionmentioning

confidence: 99%

See 3 more Smart Citations

A Sustainable Scheme for Minimizing Energy in Visual Sensor Network using Disjoint Set Cover Approach

Hashim¹,

Jawad²,

Wheedd³

2020

ETJ

View full text Add to dashboard Cite

Directional sensors in wireless visual sensor networks attract growing 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 is intended 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 with a minimum number of sensors covers the maximum number of moving targets in an energy-efficient way and extended network lifetime.

show abstract

Section: Directional Sensing Modelmentioning

confidence: 99%

Section: Directional Sensing Modelmentioning

confidence: 99%

Section: Directional Sensing Modelmentioning

confidence: 99%

Section: Introductionmentioning

confidence: 99%

See 2 more Smart Citations