Probabilistic intrusion detection based on an optimal strong K-barrier strategy in WSNs

Ensuring better surveillance of borders with K-barrier coverage type via homogeneous wireless sensor networks (WSNs) remains a challenging task to be solved urgently since it influences the lifetime of the network. The main contribution of this paper is the proposal of a strong K-barrier coverage strategy based on the scheduling of state change combinations (0/1) in the truth table. The change of node state (Active/Passive) truth tables depends on a mathematical probability formula according which it makes impossible the crossing of the barriers (intrusion probability tends towards zero). Furthermore, the proposed probabilistic interference increases the vulnerability against any type of possible intrusion in the WSN regardless of the speed of the intruder. The proposed protocol is named; K-Barrier Coverage via Probabilistic Interference of Truth-Table states in Homogeneous Sensor Network (KBC-PITT). We have shown in two ways that our strategy is optimal compared to the proposed k-barrier coverage strategies in the literature; (a) by demonstrating that the probability of barrier intrusion tends towards zero; and (b) by simulations to confirm the effectiveness of KBC-PITT in terms of perfect coverage, connectivity, and power consumption with high reliability and simple architecture. The simulation results highlight the benefits of using KBC-PITT strategy to solve the intrusion detection problem by maintaining coverage and connectivity with minimal power consumption throughout the network’s lifetime, reaching 100% of coverage, compared to other well-known strategies, namely WTBC, AND, HMB-SAA, PGSA, CHA, and QUEC.