Barrier coverage construction without barrier-breach using virtual lines

In wireless sensor networks (WSNs), barrier coverage is used to detect objects crossing a protected area or to monitor an area of interest. It is a critical application within WSNs. Due to cost considerations, sensor nodes are often randomly deployed along the boundary of the monitoring area, constructing multiple barriers to maximize network lifetime. These barriers operate based on a sleep-wakeup schedule. However, a new security issue, known as the barrier-breach problem, can arise during this schedule. In this paper, we propose a novel barrier coverage construction algorithm (BCC_VL) that addresses the barrier-breach problem using Virtual Lines (VLs), a concept that has not been explored before. By employing VLs, our algorithm can construct a barrier coverage without any breaches. We conducted simulations to validate the proposed method, and the results were compared and verified against the MaxFlow model. In the MaxFlow_RM method, our approach demonstrated superior performance in identifying barrier coverage.

Authors

Institutions

Publication Details

Journal
Discrete Mathematics Algorithms and Applications
Published
2024-11-13
DOI
https://doi.org/10.1142/s1793830924501246
Primary Topic
Smart Grid Security and Resilience
Type
article
Field-Weighted Citation Impact
0.00
Controls
|||
ALL TIME
JAN
FEB
MAR
APR
MAY
JUN
JUL
AUG
SEP
OCT
article

Barrier coverage construction without barrier-breach using virtual lines

Joong-Lyul Lee, Ke Su, Yisheng Zhou
Discrete Mathematics Algorithms and Applications
Smart Grid Security and Resilience
article

Barrier coverage construction without barrier-breach using virtual lines

Joong-Lyul Lee, Ke Su, Yisheng Zhou
article en

Abstract

In wireless sensor networks (WSNs), barrier coverage is used to detect objects crossing a protected area or to monitor an area of interest. It is a critical application within WSNs. Due to cost considerations, sensor nodes are often randomly deployed along the boundary of the monitoring area, constructing multiple barriers to maximize network lifetime. These barriers operate based on a sleep-wakeup schedule. However, a new security issue, known as the barrier-breach problem, can arise during this schedule. In this paper, we propose a novel barrier coverage construction algorithm (BCC_VL) that addresses the barrier-breach problem using Virtual Lines (VLs), a concept that has not been explored before. By employing VLs, our algorithm can construct a barrier coverage without any breaches. We conducted simulations to validate the proposed method, and the results were compared and verified against the MaxFlow model. In the MaxFlow_RM method, our approach demonstrated superior performance in identifying barrier coverage.

Discrete Mathematics Algorithms and ApplicationsVol. 17(08)
The University of Texas at Dallas (US), University of North Carolina at Pembroke (US)
Sustainable cities and communities
Openalex Percentile: Top 76%
Smart Grid Security and Resilience
AI Navigator

Ask Laika to Summarize, Analyze, and Connect papers live on the map.

Summarize Papers & Methodologies

Extract key findings, datasets, and comparative methods across publications.

Benchmark Rankings & Visual Analytics

Rank top research institutions, authors, funders, topics, and journals by Field-Weighted Citation Impact (FWCI) and paper volume with instant charts.

Connect Distant Disciplines

Bridge topological clusters on the map to find hidden collaborative intersections.