ArticleSensors (Basel, Switzerland)2018
Achieving Crossed Strong Barrier Coverage in Wireless Sensor Network.
Article in Sensors (Basel, Switzerland), 2018. The graph could read no effect estimate from its abstract, so it casts no vote on the map. Cited by 8 papers.
What it found
Each row is one number read from the abstract, on the scale the paper reported it, with its interval. Left of the dashed line favours the treatment, right favours the comparator. Under each row is the sentence it came from. New to these charts? A ten-minute tutorial.
The abstract states no effect estimate the extractor could read, or names no intervention and outcome on the map, so this paper lights no cell and moves no belief. It is still indexed, cited and linked below.
The trial behind it
Trials whose registry record cites this paper, or whose number appears in the abstract. A trial that started after this paper was published is citing it as background, not reporting it.
Neither the registry nor the abstract names a trial number. If this is a trial report, that itself is worth knowing.
Who cites it
8 citing papers in PubMed.
- Energy-Efficient Algorithms for Path Coverage in Sensor Networks.Sensors (Basel, Switzerland) · 2023Article
- JSQE: Joint Surveillance Quality and Energy Conservation for Barrier Coverage in WSNs.Sensors (Basel, Switzerland) · 2022Article
- Deployment Optimization Method of Multistatic Radar for Constructing Circular Barrier Coverage.Sensors (Basel, Switzerland) · 2021Article
- Approximate Optimal Deployment of Barrier Coverage on Heterogeneous Bistatic Radar Sensors.Sensors (Basel, Switzerland) · 2019Article
- Flying Small Target Detection for Anti-UAV Based on a Gaussian Mixture Model in a Compressive Sensing Domain.Sensors (Basel, Switzerland) · 2019Article
- A 3D Coverage Algorithm Based on Complex Surfaces for UAVs in Wireless Multimedia Sensor Networks.Sensors (Basel, Switzerland) · 2019Article
- Minimum Cost Deployment of Bistatic Radar Sensor for Perimeter Barrier Coverage.Sensors (Basel, Switzerland) · 2019Article
- Dynamic Barrier Coverage in a Wireless Sensor Network for Smart Grids.Sensors (Basel, Switzerland) · 2018Article
Corrections and comments
PubMed lists nothing against this paper. Absence here is not a guarantee, only a check that was made.
Authors and funding
3 authors.
Funding
No grant is acknowledged in the PubMed record.
Abstract
Barrier coverage has been widely used to detect intrusions in wireless sensor networks (WSNs). It can fulfill the monitoring task while extending the lifetime of the network. Though barrier coverage in WSNs has been intensively studied in recent years, previous research failed to consider the problem of intrusion in transversal directions. If an intruder knows the deployment configuration of sensor nodes, then there is a high probability that it may traverse the whole target region from particular directions, without being detected. In this paper, we introduce the concept of crossed barrier coverage that can overcome this defect. We prove that the problem of finding the maximum number of crossed barriers is NP-hard and integer linear programming (ILP) is used to formulate the optimization problem. The branch-and-bound algorithm is adopted to determine the maximum number of crossed barriers. In addition, we also propose a multi-round shortest path algorithm (MSPA) to solve the optimization problem, which works heuristically to guarantee efficiency while maintaining near-optimal solutions. Several conventional algorithms for finding the maximum number of disjoint strong barriers are also modified to solve the crossed barrier problem and for the purpose of comparison. Extensive simulation studies demonstrate the effectiveness of MSPA.
Indexed as
Identifiers
What OpenQuestion holds
Registered trials
Read under generation 80e0d062 · epoch 390. Bibliography from PubMed, PubMed Central and OpenAlex; grants from NIH RePORTER; trial links from ClinicalTrials.gov; estimates, votes and beliefs from the OpenQuestion graph.