A family system based evolutionary algorithm for obstacle-evasion minimal exposure path problem in Internet of Things

NTM Binh, NH Ngoc, HTT Binh, NK Van, S Yu - Expert Systems with …, 2022 - Elsevier
Barrier coverage in wireless sensor networks (WSNs) is a well-known model for military
security applications in IoTs, in which sensors are deployed to detect every movement over …

[HTML][HTML] Single-exponential FPT algorithms for enumerating secluded F-free subgraphs and deleting to scattered graph classes

BMP Jansen, JJH de Kroon, M Włodarczyk - Journal of Computer and …, 2025 - Elsevier
The celebrated notion of important separators bounds the number of small (S, T)-separators
in a graph which are 'farthest from S'in a technical sense. In this paper, we introduce a …

An efficient exact method with polynomial time-complexity to achieve k-strong barrier coverage in heterogeneous wireless multimedia sensor networks

NTM Binh, HTT Binh, HVD Luong, NT Long… - Journal of Network and …, 2024 - Elsevier
Abstract Barrier coverage in Wireless Sensor Networks (WSNs) plays a pivotal role in
surveillance and security applications. It serves as a fundamental mechanism for identifying …

Isolation concepts applied to temporal clique enumeration

H Molter, R Niedermeier, M Renken - Network Science, 2021 - cambridge.org
Isolation is a concept originally conceived in the context of clique enumeration in static
networks, mostly used to model communities that do not have much contact to the outside …

Enumerating isolated cliques in temporal networks

H Molter, R Niedermeier, M Renken - … and Their Applications VIII: Volume 2 …, 2020 - Springer
Isolation is a concept from the world of clique enumeration that is mostly used to model
communities that do not have much contact to the outside world. Herein, a clique is …

Parameterized algorithms and data reduction for the short secluded st‐path problem

R Van Bevern, T Fluschnik, OY Tsidulko - Networks, 2020 - Wiley Online Library
Given a graph G=(V, E), two vertices s, t∈ V, and two integers k, ℓ, the Short Secluded Path
problem is to find a simple s‐t‐path with at most k vertices and ℓ neighbors. We study the …

Multiagent minimum risk path intrusion strategy with computational geometry

J Sun, Z Yan, S Li - Wireless Communications and Mobile …, 2021 - Wiley Online Library
In wireless sensor networks (WSNs), inefficient coverage does affect the quality of service
(QoS), which the minimum exposure path (MEP) is traditionally used to handle. But …

Minimal Exposure Escape Path Problem

AA Neto, VCS Campos… - IEEE Transactions on …, 2023 - ieeexplore.ieee.org
This article introduces the minimal exposure escape path (MEEP) problem, in which a
mobile robot must determine a path from a start position to a safe region that less exposes it …

Minimal exposure paths in time-varying fields: A semi-lagrangian approach

AA Neto, VC da Silva Campos… - IEEE Robotics and …, 2022 - ieeexplore.ieee.org
In the context of Wireless Sensor Networks (WSNs), the Minimal Exposure Path (MEP)
represents an important metric to evaluate the quality of network services. Most of the current …

Parameterized complexity of secluded connectivity problems

FV Fomin, PA Golovach, N Karpov… - Theory of Computing …, 2017 - Springer
Abstract The Secluded Path problem models a situation where sensitive information has to
be transmitted between a pair of nodes along a path in a network. The measure of the …