IEEE Transactions on Green Communications and Networking · 2021 · 19 citations · 17 references
ComputingComputer SystemsInformation TechnologyNetwork SecuritySecurity ArchitectureWireless SecurityEmbedded SecurityEmbedded System SecuritySensor NetworksWireless Sensor Network SecurityWireless Sensor NetworksBarrier CoverageGreedy HeuristicsNode FailuresNode SchedulingQos ManagementSensor NodesWeighted AveragingWireless Sensor Node Security
Barrier coverage scheduling is an energy conservation scheme in which a subset of sensor nodes with overlapped sensing area (also called barrier) is activated to meet the key Quality of Service (QoS) requirements such as energy-efficiency, coverage, and connectivity. However, sudden and unexpected node failures in a barrier due to security attacks such as Denial of Service (DoS) poses a challenge for maintaining the desired QoS levels. In this paper, we propose a secure barrier coverage scheduling scheme called SEC <sup xmlns:mml="http://www.w3.org/1998/Math/MathML" xmlns:xlink="http://www.w3.org/1999/xlink">2</sup> , which prevents QoS degradation in the event of security breaches. This scheme uses a fully weighted attributed dynamic graph model in which a novel attribute-based weight balancing greedy strategy is used to construct barriers. A weighted averaging-based K-means Spectral, and Hierarchical (WKSH) cluster ensemble scheme is proposed to secure a barrier from malicious attacks. WKSH is a graph-based anomaly detection scheme based on weighted Euclidean distance computation and weighted average consensus. The experimental result shows that SEC <sup xmlns:mml="http://www.w3.org/1998/Math/MathML" xmlns:xlink="http://www.w3.org/1999/xlink">2</sup> guarantees the required QoS at all times. Moreover, the proposed WKSH shows better accuracy in the classification and detection of attacks in the barrier.
17
A Comprehensive Survey of Clustering Algorithms
Dongkuan Xu, Yingjie Tian · Annals of Data Science · 2015 · 1.9K citations · Full text