Malicious Sensor Research Articles

Beta Distribution Function for Cooperative Spectrum Sensing against Byzantine Attack in Cognitive Wireless Sensor Networks

In order to explore more spectrum resources to support sensors and their related applications, cognitive wireless sensor networks (CWSNs) have emerged to identify available channels being underutilized by the primary user (PU). To improve the detection accuracy of the PU signal, cooperative spectrum sensing (CSS) among sensor paradigms is proposed to make a global decision about the PU status for CWSNs. However, CSS is susceptible to Byzantine attacks from malicious sensor nodes due to its open nature, resulting in wastage of spectrum resources or causing harmful interference to PUs. To suppress the negative impact of Byzantine attacks, this paper proposes a beta distribution function (BDF) for CSS among multiple sensors, which includes a sequential process, beta reputation model, and weight evaluation. Based on the sequential probability ratio test (SPRT), we integrate the proposed beta reputation model into SPRT, while improving and reducing the positive and negative impacts of reliable and unreliable sensor nodes on the global decision, respectively. The numerical simulation results demonstrate that, compared to SPRT and weighted sequential probability ratio test (WSPRT), the proposed BDF has outstanding effects in terms of the error probability and average number of samples under various attack ratios and probabilities.

Trust Based Active Game Data Collection Scheme in Smart Cities

The concept of a smart city is to equip sensors to various objects in urban life to monitor areas and collect sensing data, and make wise decisions based on the collected data. However, some malicious sensor devices may interrupt and interfere with data collection, leading to a reduction in the integrity and availability of information, thereby causing harm to Internet of Things(IoT) applications. Therefore, identifying the credibility of sensor nodes to ensure the credibility of data collection is a challenge. This paper proposes a trust based active game data collection (TAGDC) scheme to collect trust data in the IoT. This TAGDC scheme mainly includes the following parts: 1)An active trust framework plus evolutionary game theory is proposed to encourage high-energy sensors to send detection routes and quickly obtain sensor trust. 2)In order to balance the data security requirements of subnetworks, the number and frequency of detection routes required by subnetworks are estimated through mechanism modeling and fuzzy analytic hierarchy process. 3)The design focuses on the internal trust computing model in the region to evaluate the trust of nodes. The findings of the experiment demonstrate that the TAGDC scheme, as described in this research study, enhances the accuracy of identifying malicious nodes by 20%, reduces the required identification time by 40%, and improves the data collection success rate by 5%.

Less sample‐cooperative spectrum sensing against large‐scale Byzantine attack in cognitive wireless sensor networks

AbstractCooperative spectrum sensing (CSS) has emerged as a promising strategy for identifying available spectrum resources by leveraging spatially distributed sensors in cognitive wireless sensor networks (CWSNs). Nevertheless, this open collaborative approach is susceptible to security threats posed by malicious sensors, specifically Byzantine attack, which can significantly undermine CSS accuracy. Moreover, in extensive CWSNs, the CSS process imposes substantial communication overhead on the reporting channel, thereby considerably diminishing cooperative efficiency. To tackle these challenges, this article introduces a refined CSS approach, termed weighted sequential detection (WSD). This method incorporates channel state information to validate the global decision made by the fusion center and assess the trust value of sensors. The trust value based weight is assigned to sensing samples, which are then integrated into a sequential detection framework within a defined time window. This sequential approach prioritizes samples based on descending trust values. Numerical simulation results reveal that the proposed WSD outperforms conventional fusion rules in terms of the error probability, sample size, achievable throughput, and latency, even under varying degrees of Byzantine attack. This innovation signifies a substantial advancement in enhancing the reliability and efficiency of CSS.

Dynamic event-triggered adaptive neural control for MIMO nonlinear CPSs with time-varying parameters and deception attacks

This paper provides a dynamic event-triggered adaptive neural controller for the multi-input–multi-output (MIMO) non-strict feedback nonlinear cyber–physical systems (CPSs) with time-varying parameters encountering deception attacks (DAs). The single parameter learning method (SPLM) and the dynamic surface technology are combined under backstepping framework with adroitness, which not only resist the malicious sensor DA, but also reduce the complexity of the design scheme. Furthermore, a dynamic event-triggered strategy is added to update the threshold dynamically to further reduce the communication load. Theoretical analysis presents that the proposed control scheme can guarantee that all signals are bounded regardless encountering the DAs. Eventually, the validity of the developed methods is illustrated by a simulation case.

Automated Sensor Node Malicious Activity Detection with Explainability Analysis.

Cybersecurity has become a major concern in the modern world due to our heavy reliance on cyber systems. Advanced automated systems utilize many sensors for intelligent decision-making, and any malicious activity of these sensors could potentially lead to a system-wide collapse. To ensure safety and security, it is essential to have a reliable system that can automatically detect and prevent any malicious activity, and modern detection systems are created based on machine learning (ML) models. Most often, the dataset generated from the sensor node for detecting malicious activity is highly imbalanced because the Malicious class is significantly fewer than the Non-Malicious class. To address these issues, we proposed a hybrid data balancing technique in combination with a Cluster-based Under Sampling and Synthetic Minority Oversampling Technique (SMOTE). We have also proposed an ensemble machine learning model that outperforms other standard ML models, achieving 99.7% accuracy. Additionally, we have identified the critical features that pose security risks to the sensor nodes with extensive explainability analysis of our proposed machine learning model. In brief, we have explored a hybrid data balancing method, developed a robust ensemble machine learning model for detecting malicious sensor nodes, and conducted a thorough analysis of the model's explainability.

An Adaptive Temporal Convolutional Network Autoencoder for Malicious Data Detection in Mobile Crowd Sensing.

Mobile crowdsensing (MCS) systems rely on the collective contribution of sensor data from numerous mobile devices carried by participants. However, the open and participatory nature of MCS renders these systems vulnerable to adversarial attacks or data poisoning attempts where threat actors can inject malicious data into the system. There is a need for a detection system that mitigates malicious sensor data to maintain the integrity and reliability of the collected information. This paper addresses this issue by proposing an adaptive and robust model for detecting malicious data in MCS scenarios involving sensor data from mobile devices. The proposed model incorporates an adaptive learning mechanism that enables the TCN-based model to continually evolve and adapt to new patterns, enhancing its capability to detect novel malicious data as threats evolve. We also present a comprehensive evaluation of the proposed model's performance using the SherLock datasets, demonstrating its effectiveness in accurately detecting malicious sensor data and mitigating potential threats to the integrity of MCS systems. Comparative analysis with existing models highlights the performance of the proposed TCN-based model in terms of detection accuracy, with an accuracy score of 98%. Through these contributions, the paper aims to advance the state of the art in ensuring the trustworthiness and security of MCS systems, paving the way for the development of more reliable and robust crowdsensing applications.

An attack-resistant target localization in underwater based on consensus fusion

Target localization has been regarded as one of the most important techniques of underwater sensor networks (USNs). However, the challenges posed by weak communication, inhomogeneous medium, and openness of underwater environment make localization more difficult. With consideration of the asynchronous clock, isogradient sound speed and forging attack, this paper presents a consensus fusion-based target localization solution with USNs. The localization procedure is mainly divided into two phases, i.e., internal position estimation and external information fusion. In the first phase, the received signal strength (RSS) and the time of flight (TOF) measurements are jointly employed to develop an asynchronous localization protocol. Particularly, a ray compensation strategy is incorporated to remove the localization bias from assuming the straight-line transmission. Based on this, a consensus fusion based localization estimator is designed in the second phase to mitigate data falsification attacks introduced by malicious sensor nodes. It is worth mentioning that, the proposed localization solution in this paper can fuse the RSS and TOF measurements by the consensus interaction procedure. Furthermore, it is resistant to data falsification attacks in inhomogeneous water medium. Finally, simulation and experimental results reveal that our solution can reduce the influences of data forging attacks and improve the localization accuracy as compared with the other works.

Energy-efficient classification strategy for detecting interference and malicious sensor nodes in wireless body area Networks

Wireless Body Area Networks (WBANs) play a vital role in healthcare monitoring, using wireless sensors to track physiological parameters and predict illness onset. This study proposes a novel approach for detecting interference and malicious sensor nodes in WBANs, crucial for maintaining system integrity and performance. The method combines feature-based techniques with classification strategies to accurately identify anomalies. Features are taken from WBAN nodes and used to train Support Vector Machine (SVM) classifiers, which makes interference detection work well. A neurofuzzy inference system (ANFIS) classifier is also used to train the system on trusted and untrusted nodes at the start, which makes classification easier in real-world WBAN situations. Link failures due to rogue sensor nodes can severely impact WBAN performance, emphasizing the need for efficient detection and correction mechanisms. The proposed strategy introduces a weight metric to identify broken links, enhancing system reliability. Evaluation metrics, including LFD latency and packet delivery ratio, are analyzed to assess the efficacy of the approach. By improving interference detection and addressing link failures, this study contributes to enhancing the efficiency and reliability of WBAN networks, critical for advancing healthcare monitoring technologies.

Pribadi: A decentralized privacy-preserving authentication in wireless multimedia sensor networks for smart cities

Wireless Multimedia Sensor Network (WMSN) is a network of interconnected sensor nodes equipped with multimedia devices capable to retrieve multimedia as well as scalar sensor data in smart city scenarios. With the progress of smart city development, WMSNs are becoming points of interest. The existing research works on the security of WMSNs show some significant centralized solutions; they are prone to denial of service attacks, central failure, and privacy breaches. Also, these solution are having limitations because of their centralized nature.Therefore, the the proposed scheme adopted the concept of decentralization to achieve more effective and ubiquitous results. As per our best knowledge, we introduce the first decentralized privacy-preserving authentication framework for WMSNs to address the energy and storage challenges. We call our solution PRIvacy-preserving Blockchain-based Authentication for multimeDIa networks (PRIBADI). PRIBADI uses a blockchain framework for authenticated communication between sensor nodes and base stations (as a trusted authority) by using certification and access authentication schemes. We elect trustworthy cluster heads based on weight metrics and these cluster heads forward the information to the Trusted Authority (TA). Subsequently, TA forward large data to the cloud for storage, and the information relevant to certificates and hashes are recorded on the distributed blockchain. Moreover, TA revokes the certificates of malicious sensor nodes and eliminates them from the blockchain. We run a set of experiments on PRIBADI and compare the results with the state-of-the-art models. We use the evaluation criteria of detection accuracy, operation, and energy consumption. We find that PRIBADI is 31.7% better than the existing models.

A Proficient Obtrusion Recognition Clustered Mechanism for Malicious Sensor Nodes in a Mobile Wireless Sensor Network

A collection of wireless nodes that may be installed at any location and at any time without requiring an established network structure is called a mobile wireless sensor network. The problem of network performance arises from the mobility of nodes and their misbehaviour. Network performance is negatively impacted by data loss and sensor node misbehaviour. In certain cases, there are malicious sensor nodes that are designed to destroy the network’s capacity. This work aims to identify hostile nodes using an irregular set technique. The route entry table’s broadcasting metadata helps identify rogue nodes. Every sensor node in the network broadcasts information about adjacent nodes and maintains a sentry table. Premeditated data delivery proportion, throughput, delay, packet drop, and fault rate are used to estimate broadcasting record parameters. In the NS2 environment, mobile nodes with varying velocities are simulated. To generate an information table, mobile nodes with varying speeds are examined based on their broadcasting records. On the basis of guidelines taken from the irregular set tactic table, good and bad nodes are distinguished. Packets are disseminated along the shortest path that doesn’t contain any malicious nodes. The results of the proposed technique show that an irregular set tactic increases throughput, network capability, data delivery percentage, and end-to-end delay reduction in mobile sensors.

Improved Security of a Pairing-Free Certificateless Aggregate Signature in Healthcare Wireless Medical Sensor Networks

Recently, Zhan et al. presented a pairing-free certificateless aggregation signature scheme (ZH-CLAS) to address security issues in healthcare wireless medical sensor networks (HWMSNs), and proved that their scheme is secure against adaptive chosen message attacks. In this article, we analyze the security of the ZH-CLAS scheme by utilizing two types of concrete attacks. Unfortunately, we demonstrate that their scheme cannot withstand public key replacement attacks and is not secure against coalition attacks from malicious sensor nodes. To solve these security challenges, we further improve the security of the ZH-CLAS scheme. Our enhanced scheme has a fixed-length aggregate signature, which efficiently minimizes the transmission bandwidth. Additionally, our scheme outperforms related pairing-free CLAS schemes in terms of security and communication performance.

A Distance Vector Hop-Based Secure and Robust Localization Algorithm for Wireless Sensor Networks

Location information of sensor nodes in a wireless sensor network is important. The sensor nodes are usually required to ascertain their positions so that the data collected by these nodes can be labeled with this information. On the other hand, certain attacks on wireless sensor networks lead to the incorrect estimation of sensor node positions. In such situations, when the location information is not correct, the data may be labeled with wrong location information that may subvert the desired operation of the wireless sensor network. In this work, we formulate and propose a distance vector hop-based algorithm to provide secure and robust localization in the presence of malicious sensor nodes that result in incorrect position estimation and jeopardize the wireless sensor network operation. The algorithm uses cryptography to ensure secure and robust operation in the presence of adversaries in the sensor network. As a result of the countermeasures, the attacks are neutralized and the sensor nodes are able to estimate their positions as desired. Our secure localization algorithm provides a defense against various types of security attacks, such as selective forwarding, wormhole, Sybil, tampering, and traffic replay, compared with other algorithms which provide security against only one or two types. Simulation experiments are performed to evaluate the performance of the proposed method, and the results indicate that our secure localization algorithm achieves the design objectives successfully. Performance of the proposed method is also compared with the performance of basic distance vector hop algorithm and two secure algorithms based on distance vector hop localization. The results reveal that our proposed secure localization algorithm outperforms the compared algorithms in the presence of multiple attacks by malicious nodes.

Securing Software-Defined WSNs Communication via Trust Management

Software-defined wireless sensor networks (SDWSNs) can be functionally affected by malicious sensor nodes that perform arbitrary actions, e.g., message dropping or flooding. The malicious nodes can degrade the availability of the network due to in-band communications and the inherent lack of secure channels in SDWSNs. In this article, we design a hierarchical trust management scheme for SDWSNs (namely, TSW) to detect potential threats inside SDWSNs while promoting node cooperation and supporting decision making in the forwarding process. TSW evaluates the trustworthiness of involved nodes and enables the detection of malicious behavior at various levels of the SDWSN architecture. We develop sensitive trust computational models to detect several malicious attacks. Furthermore, we propose separate trust scores and parameters for control and data traffic, respectively, to enhance the detection performance against attacks directed at the crucial traffic of the control plane. Furthermore, we develop an acknowledgment-based trust recording mechanism by exploiting some built-in SDN control messages. To ensure the resilience and honesty of the trust scores, a weighted averaging approach is adopted, and a reliability trust metric is defined. Through extensive analyses and numerical simulations, we demonstrate that TSW is efficient in detecting malicious nodes that launch several communications and trust management threats, such as black-hole, selective forwarding, denial of service, bad mouthing, and ON–OFF attacks.

AI-Based Wormhole Attack Detection Techniques in Wireless Sensor Networks

The popularity of wireless sensor networks for establishing different communication systems is increasing daily. A wireless network consists of sensors prone to various security threats. These sensor nodes make a wireless network vulnerable to denial-of-service attacks. One of them is a wormhole attack that uses a low latency link between two malicious sensor nodes and affects the routing paths of the entire network. This attack is brutal as it is resistant to many cryptographic schemes and hard to observe within the network. This paper provides a comprehensive review of the literature on the subject of the detection and mitigation of wormhole attacks in wireless sensor networks. The existing surveys are also explored to find gaps in the literature. Several existing schemes based on different methods are also evaluated critically in terms of throughput, detection rate, low energy consumption, packet delivery ratio, and end-to-end delay. As artificial intelligence and machine learning have massive potential for the efficient management of sensor networks, this paper provides AI- and ML-based schemes as optimal solutions for the identified state-of-the-art problems in wormhole attack detection. As per the author’s knowledge, this is the first in-depth review of AI- and ML-based techniques in wireless sensor networks for wormhole attack detection. Finally, our paper explored the open research challenges for detecting and mitigating wormhole attacks in wireless networks.

Behavior analysis of malicious sensor nodes based on optimal response dynamics

Behavior analysis of malicious sensor nodes based on optimal response dynamics

ENERGY EFFICIENT BASED SECURE DATA TRANSMISSION FOR MULTI HOP TRUST MANAGEMENT TECHNIQUE USING WIRELESS SENSOR NETWORK

Secure data transfer is intended to keep data safe from illegal access, damage, or disruption. In this proposed technique, an intrusion prevention system is built to counter the rapidly growing threats offered by the current generation of malware, software, and exploits. As the number of intruders has grown, the network environment has become more complicated, making threat mitigation more difficult. Modern wireless sensor networks have emerged for the aim of transmitting important information and services to an ever-growing set of users. Security is the most important issues in wireless network. Using this proposed Multi Hop Trust Management (MHTM) approach; trust management technique is used to identify the trusted nodes with malicious node. Then secured and efficient way of data transmission are directed and communicated to any kind of networks re confirmed here. The result attained shows MHTM technique attains better performance than TSRP in stipulations of energy efficiency, data transmission delay, communication overhead, throughput, malicious sensor device misclassification rate and identification.

A REVIEW OF DIFFERENT TECHNIQUES WHILE TRUST NODE ESTIMATION IN A HIERARCHICAL WIRELESS SENSOR NETWORKS

When we considered a wireless sensors network, the safety measures have been create depending on non-realistic trusted environment. Some malicious sensor nodes may illegally drop the data packets and disturb network communication. Hence, internal networks attacks of malicious nodes becoming a challenging research topic under on its trust and security solutions for WSN. After analysing the trust mechanism schemes for wireless sensor networks, it has been found that there are different trust mechanism schemes are present. Every scheme has several advantages for finding a better path for source to destination node. In this paper, a review on different trust estimation schemes in WSNs is carried out which are classified.

Secure Localization Algorithms Against Localization Attacks in Wireless Sensor Networks

The accuracy of the location estimation of sensors in wireless sensor networks (WSNs) is important to many applications such as environment surveillance applications. In large-scale and distributed WSNs, locations of the sensors may not be recorded during the deployment process, resulting in the need of localization techniques to help collect the sensor location information. WSNs are highly vulnerable to localization attacks since the localization techniques totally rely on the neighboring relations to determine the location of sensors. In other words, some of malicious sensor nodes can take the advantage of the neighboring relations to manipulate the localization process. In this paper, we propose two localization algorithms to overcome both common types of localization attacks, independent attacks and collusion attacks. In the first algorithm, we propose the Improved Randomized Consistency Position Algorithm to determine the location of unknown nodes using the location estimation information provided by the three random anchor nodes and using the PSO algorithm paradigm to identify the coordinates of the unknown nodes’ location. In addition, the second algorithm, which is a combination of voting method, location optimization, and the PSO algorithm paradigm to identify the location of unknown nodes, is referred to as the Enhanced Attack-Resistant Secure Localization Algorithm. Through rigorous theoretical analysis and experimentation, we demonstrate that our proposed localization algorithms yield better performance comparing to the existing methods.

SAFE ROUTING MODEL AND BALANCED LOAD MODEL FOR WIRELESS SENSOR NETWORK

Wireless Sensor Networks (WSNs) play a very important role in providing realtime data access for Big Data and Internet. However, the open deployment, energy constraint, and lack of centralized administration make WSNs very vulnerable to various kinds of malicious attacks. In WSNs identifying malicious sensor devices and eliminating their sensed information plays a very important role for mission critical applications. Standard cryptography and authentication schemes cannot be directly used in WSNs because of the resource constraint nature of sensor devices. Thus, energy efficient and low latency methodology is required for minimizing the impact of malicious sensor devices. This paper presents a Secure and Load Balanced Routing (SLBR) scheme for heterogeneous clustered based WSNs. SLBR presents a better trust-based security metric that overcomes the problem when sensors keep oscillating from good to bad state and vice versa, and also SLBR balances load among CH. Thus, aids in achieving better security, packet transmission, and energy efficiency performance. Experiments are conducted to evaluate the performance of proposed SLBR model over existing trust-based routing model namely Exponential Cat Swarm Optimization (ECSO). The result attained shows SLBR model attains better performance than ECSO in terms of energy efficiency (i.e., network lifetime considering first sensor device death and total sensor device death), communication overhead, throughput, packet processing latency, malicious sensor device misclassification rate and identification.

Scalable Two-Dimensional Bloom Filter Membership Scheme on Massive Scale Wireless Sensor Networks

Wireless sensor nodes help people to monitor any operational mechanism. It is important to be implemented in industrial automation in detecting unauthorized activity or malicious sensor nodes by the outsider. However, a massive number of devices or things which are needed to be controlled become a challenge. A fast mechanism to recognize a member or a valid device is needed to minimize production costs and avoid future procedural errors. It becomes an open problem for the implementation of massive scale Wireless Sensor Networks (WSN). Hence, a scalable two-dimensional Bloom filter is proposed in this paper to deal with this issue. The low computation complexity and the storage efficiency requirements by the two-dimensional Bloom filter are proven by the experimental results. The insertion, deletion and query procedure of the proposed method only need O (1), while the storage usage of two-dimensional Bloom filters not only lower than counting Bloom filter in average 131 bits difference but also approaches accommodative Bloom filter in about 10 bits difference. These two parameters support a fast membership scheme. Furthermore, the analysis of value initialization has been performed. To the best of our knowledge, the investigation of this parameter has not been addressed by other studies. This process aims to get the best scenario to increase scalability. Several recommendations for selecting dimension number has been stated which is useful for efficient storage usage and reduce false positive.