A New Random Walk for Replica Detection in WSNs

The authors wish to thanks the anonymous reviewers for their valuable comments for the improvement of this manuscript. The authors wish to acknowledge the support and help of Deanship of Scientific Research at Jazan University and the authors also extend their sincere appreciations to Deanship of Scientific Research at King Saud University for its funding this Prolific Research Group (PRG-1436-16).Wireless Sensor Networks (WSNs) are vulnerable to Node Replication attacks or Clone attacks. Among all the existing clone detection protocols in WSNs, RAWL shows the most promising results by employing Simple Random Walk (SRW). More recently, RAND outperforms RAWL by incorporating Network Division with SRW. Both RAND and RAWL have used SRW for random selection of witness nodes which is problematic because of frequently revisiting the previously passed nodes that leads to longer delays, high expenditures of energy with lower probability that witness nodes intersect. To circumvent this problem, we propose to employ a new kind of constrained random walk, namely Single Stage Memory Random Walk and present a distributed technique called SSRWND (Single Stage Memory Random Walk with Network Division). In SSRWND, single stage memory random walk is combined with network division aiming to decrease the communication and memory costs while keeping the detection probability higher. Through intensive simulations it is verified that SSRWND guarantees higher witness node security with moderate communication and memory overheads. SSRWND is expedient for security oriented application fields of WSNs like military and medical.Yeshttp://www.plosone.org/static/editorial#pee

Whac-A-Mole: Smart Node Positioning in Clone Attack in Wireless Sensor Networks

Wireless sensor networks are often deployed in unattended environments and, thus, an adversary can physically capture some of the sensors, build clones with the same identity as the captured sensors, and place these clones at strategic positions in the network for further malicious activities. Such attacks, called clone attacks, are a very serious threat against the usefulness of wireless networks. Researchers proposed different techniques to detect such attacks. The most promising detection techniques are the distributed ones that scale for large networks and distribute the task of detecting the presence of clones among all sensors, thus, making it hard for a smart attacker to position the clones in such a way as to disrupt the detection process. However, even when the distributed algorithms work normally, their ability to discover an attack may vary greatly with the position of the clones. We believe this aspect has been greatly underestimated in the literature. In this paper, we present a thorough and novel study of the relation between the position of clones and the probability that the clones are detected. To the best of our knowledge, this is the first such study. In particular, we consider four algorithms that are representatives of the distributed approach. We evaluate for them whether their capability of detecting clone attacks is influenced by the positions of the clones. Since wireless sensor networks may be deployed in different situations, our study considers several possible scenarios: a uniform scenario in which the sensors are deployed uniformly, and also not uniform scenarios, in which there are one or more large areas with no sensor (we call such areas “holes”) that force communications to flow around these areas. We show that the different scenarios greatly influence the performance of the algorithms. For instance, we show that, when holes are present, there are some clone positions that make the attacks much harder to be detected. We believe that our work is key to better understand the actual security risk of the clone attack in the presence of a smart adversary and also with respect to different deployment scenarios. Moreover, our work suggests, for the different scenarios, effective clone detection solutions even when a smart adversary is part of the game

Network performance optimisation using odd and even dual interleaving routing algorithm for oil and gas pipeline networke

Wireless Sensor Network (WSN) provide promising and resilient solutions in a broad range of industrial applications, especially in the pipeline of oil and gas midstream pipeline. Such application requires a wide communication coverage area because the pipelines are usually stretched over a long distance. To fit the requirement, the sensor nodes have to be arranged in a linear formation. Performance evaluation has been carried out using reactive (AODV) and proactive (DSDV) routing protocols during the initial phases of the research. The factors causing the overall network performance to degrade as the network density increases are identified. It is mainly due to the load's increment, which will inhabit the packet queue and clog the network. These will result in packet loss, throughput unfairness, higher power consumption, and passive nodes in the network. The AODVEO reactive routing protocol is proposed to reduce the routing instabilities by splitting the traffic into (1) even-path and (2) odd with the consideration of the x-axis. The proposed routing algorithm was then compared to AODV and DSDV routing algorithms in terms of network performance with node deployment of 20,40,60,80,100,120,140,160,180 and 200. The proposed routing algorithm has shown substantial improvements in the delivery ratio (19.07% more), throughput (9 kbps more), fairness index (0.06 more), passive node's presence (30% less), and energy consumption (0.038J less) when compared to AODV on 200 nodes deploymen