Clone Node Detection Attacks and Mitigation Mechanisms in Static Wireless Sensor Networks

The development of the wireless sensor networks technology commonly named WSNs has been gaining a significantly increased amount of attention from researchers over the last few decades. Its large number of sensor nodes is one of the features that makes it beneficial to the technology. The sensors can communicate with each other to form a network. These sensor nodes are generally used for diverse applications, such as pressure monitoring, fire detection, target tracking, and health monitoring, etc. However, the downside is that WSNs are often deployed in hostile, critical environments where they do not restrain physical access. This reality makes them incredibly vulnerable to clone node attacks or node replication attacks. The adversary can capture the legitimate sensor nodes, extract them and then collect some sensitive information, such as node ID, keys and perform a replication attack. This possibility will afterward facilitate the attacker to be able to take control of the whole network and execute the same functions as that of the authorized nodes. Based on this vulnerability, it is of great importance for researchers to invent a detection protocol for the clone attacks as well as a mitigation method. From all of the researches that have been published, a lot of them proposed some techniques to detect the clone node attacks and also to mitigate the attacks. However, almost none of them semantically focused on the security layer establishment. Based on this fact, we proposed an ontology-based approach Ontology for Replication Attacks in Static Wireless Sensor Networks “ORASWSN”, which can semantically be used for the detection and mitigation of the attacks by taking into consideration the importance of using security layers.

Analysis of Coverage Hole Problem for Detection and Restoration in Wireless Sensor Networks

Wireless Sensor Network is an evolving technology which has gained massive attention in the past few years. Researchers are focusing on designing the wireless sensors more and more intelligent and efficient to make our life extremely comfortable and luxurious. Wireless Sensor Networks are used in bridge monitoring, smart agriculture, health care monitoring, landslide detection, biodiversity mapping, etc. Coverage holes are one of the key problems which occur in the Wireless Sensor Network accidentally and they cannot be neglected. The coverage holes appear in the sensing field due to poor instalment, node failure, battery depletion, etc. In this paper, detection and restoration method based on Hybrid Wireless Sensor Networks and Static Wireless Sensor Networks are discussed. Further, we have analysed the performances of these networks using Unequal Clustering and Connected Graphand Novel Energy Efficient Clustering Protocol techniques. The simulation results revealed that for Hybrid Wireless Sensor Networks, Unequal Clustering and Connected Graph protocol is best suitable and for Static Wireless Sensor Networks, Novel Energy Efficient Clustering Protocoltechnique will be preferred.

Energy-Efficient Mobility Heuristics for Maximizing Network Lifetime in Robotic Wireless Sensor Networks

In a static wireless sensor networks (WSN), the fundamental issue is the formation of energy hole in the sink's immediate locality. The solution to the energy-hole problem can be resolved by incorporating mobile entities like mobile robot (MR) into the network. This chapter proposes three strategies that exploits the mobility of the MR to overcome the energy-hole problem resulting in optimized energy usage across the network and thus maximized network lifetime. Firstly, the energy hole problem using MR is formulated as an optimization model to maximize the sojourn time of the MR at each node and a MR-ranking heuristic that ranks the critical node to be serviced is proposed. Secondly, MR-optimal scheme that finds the optimal path for the MR is formulated and designed. Thirdly, Multi-MR cooperation approach is proposed where multiple MR's collaborate to service the critical nodes. Adequate experiments have been performed to analyze the performance of the proposed schemes. The proposed methods ensure uniform energy distribution and prolonged network lifetime.

A Dynamic ID Assignment Mechanism to Defend Against Node Replication Attack in Static Wireless Sensor Networks

One of the known dangerous attacks against wireless sensor networks (WSNs) is node replica. In this attack, adversary captures one or more normal nodes of the network, generates copies of them (replicas) and deploy them in the network. These copied nodes are controlled by the adversary which can establish a shared key with other nodes of the network easily and exchange information. In this paper, a novel algorithm is proposed to defend against this attack in static sensor networks. The proposed algorithm employs a multi-tree architecture to assign ID to the nodes dynamically and prevent attachment of the injected replica nodes to the network by the adversary. The efficiency of the proposed algorithm is evaluated in terms of memory, communication, and computation overheads and the results are compared with other existing algorithms. Comparison results indicate the superiority of the proposed algorithm in terms of mentioned measures. In addition, the proposed algorithm is simulated and its efficiency is evaluated in terms of probability of detecting replica nodes. Experiment results show that the proposed algorithm has favorable performance in detection of replica nodes.