scholarly journals Online fault diagnosis of wireless sensor networks

2014 ◽  
Vol 4 (1) ◽  
Author(s):  
Arunanshu Mahapatro ◽  
Pabitra Khilar
Keyword(s):  
Wireless Sensor Networks ◽  
Sensor Networks ◽  
Fault Diagnosis ◽  
Wireless Sensor ◽  
Transient Faults ◽  
Intermittent Faults ◽  
Detection Latency ◽  
Time Redundancy ◽  
Simulation Results ◽  
Time And Energy

AbstractThis paper proposes an adaptive online distributed solution for fault diagnosis in wireless sensor networks (WSNs). Fault diagnosis is achieved by comparing the heartbeat message generated by neighboring nodes and dissemination of decision made at each node. Time redundancy is used to detect the intermittent faults since an intermittent fault will not occur consistently. The diagnosis performance degradation due to intermittent faults in sensing and transient faults in communication is analyzed. A near optimal trade-off between detection latency and number of tests required to detect intermittent faults is obtained. Simulation results are provided and they show that this work performs better, from both time and energy complexity viewpoint.

scholarly journals An Adaptive Approach to Discriminate the Persistence of Faults in Wireless Sensor Networks

2012 ◽  
Vol 2012 ◽  
pp. 1-13 ◽  
Author(s):  
Arunanshu Mahapatro ◽  
Pabitra Mohan Khilar
Keyword(s):  
Wireless Sensor Networks ◽  
Sensor Networks ◽  
Fault Detection ◽  
Detection Algorithm ◽  
Sensor Nodes ◽  
Wireless Sensor ◽  
Transient Fault ◽  
Intermittent Faults ◽  
Parametric Fault ◽  
Simulation Results

This paper presents a parametric fault detection algorithm which can discriminate the persistence (permanent, intermittent, and transient) of faults in wireless sensor networks. The main characteristics of these faults are the amount the fault appears. We adopt this state-holding time to discriminate transient from intermittent faults. Neighbor-coordination-based approach is adopted, where faulty sensor nodes are detected based on comparisons between neighboring nodes and dissemination of the decision made at each node. Simulation results demonstrate the robustness of the work at varying transient fault rate.

An Obstacle-resistant Relay Node Placement in Constrained Environment

2019 ◽  
Author(s):  
Abhishek Verma ◽  
Virender Ranga
Keyword(s):  
Wireless Sensor Networks ◽  
Sensor Networks ◽  
Mobile Robots ◽  
Relay Node ◽  
Wireless Sensor ◽  
Relay Node Placement ◽  
Node Placement ◽  
Simulation Results ◽  
Additional Hardware ◽  
Shape And Size

Relay node placement in wireless sensor networks for constrained environment is a critical task due to various unavoidable constraints. One of the most important constraints is unpredictable obstacles. Handling obstacles during relay node placement is complicated because of complexity involved to estimate the shape and size of obstacles. This paper presents an Obstacle-resistant relay node placement strategy (ORRNP). The proposed solution not only handles the obstacles but also estimates best locations for relay node placement in the network. It also does not involve any additional hardware (mobile robots) to estimate node locations thus can significantly reduce the deployment costs. Simulation results show the effectiveness of our proposed approach.

A Small World Routing Protocol in Wireless Sensor Networks

2011 ◽  
Vol 474-476 ◽  
pp. 828-833
Author(s):  
Wen Jun Xu ◽  
Li Juan Sun ◽  
Jian Guo ◽  
Ru Chuan Wang
Keyword(s):  
Wireless Sensor Networks ◽  
Sensor Networks ◽  
Routing Protocol ◽  
Data Transmission ◽  
Small World ◽  
Wireless Sensor ◽  
Small World Network ◽  
Average Delay ◽  
Network Diameter ◽  
Simulation Results

In order to reduce the average path length of the wireless sensor networks (WSNs) and save the energy, in this paper, the concept of the small world is introduced into the routing designs of WSNs. So a new small world routing protocol (SWRP) is proposed. By adding a few short cut links, which are confined to a fraction of the network diameter, we construct a small world network. Then the protocol finds paths through recurrent propagations of weak and strong links. The simulation results indicate that SWRP reduces the energy consumption effectively and the average delay of the data transmission, which leads to prolong the lifetime of both the nodes and the network.

Performance Analysis of OQPSK Signals with Bi-Kappa Noise for Wireless Sensor Networks

2013 ◽  
Vol 330 ◽  
pp. 957-960
Author(s):  
Qiao Ling Du ◽  
Zhi Rui Wang ◽  
Yu Pei ◽  
Yi Ding Wang
Keyword(s):  
Wireless Sensor Networks ◽  
Sensor Networks ◽  
Performance Analysis ◽  
Error Rate ◽  
Fading Channel ◽  
Rayleigh Fading ◽  
Symbol Error Rate ◽  
Wireless Sensor ◽  
Channel Simulation ◽  
Simulation Results

This paper investigates the performance analysis of OQPSK in HF band for wireless sensor networks. An analytical model for getting symbol error rate (SER) is given in presence of Bi-Kappa noise in HF band. And the SER of OQPSK is given in AWGN and Rayleigh fading channel. Simulation results HF noise as Bi-Kappa noise should be investigated in HF band for WSN.

Secured data aggregation in wireless sensor networks

Sensor Review ◽  
2018 ◽  
Vol 38 (3) ◽  
pp. 369-375 ◽  
Author(s):  
Sathya D. ◽  
Ganesh Kumar P.
Keyword(s):  
Wireless Sensor Networks ◽  
Energy Consumption ◽  
Sensor Networks ◽  
Data Aggregation ◽  
Computation Time ◽  
Wireless Sensor ◽  
Content Type ◽  
Homomorphic Cryptosystem ◽  
Secured Data ◽  
Time And Energy

PurposeThis study aims to provide a secured data aggregation with reduced energy consumption in WSN. Data aggregation is the process of reducing communication overhead in wireless sensor networks (WSNs). Presently, securing data aggregation is an important research issue in WSNs due to two facts: sensor nodes deployed in the sensitive and open environment are easily targeted by adversaries, and the leakage of aggregated data causes damage in the networks, and these data cannot be retrieved in a short span of time. Most of the traditional cryptographic algorithms provide security for data aggregation, but they do not reduce energy consumption.Design/methodology/approachNowadays, the homomorphic cryptosystem is used widely to provide security with low energy consumption, as the aggregation is performed on the ciphertext without decryption at the cluster head. In the present paper, the Paillier additive homomorphic cryptosystem and Bonehet al.’s aggregate signature method are used to encrypt and to verify aggregate data at the base station.FindingsThe combination of the two algorithms reduces computation time and energy consumption when compared with the state-of-the-art techniques.Practical implicationsThe secured data aggregation is useful in health-related applications, military applications, etc.Originality/valueThe new combination of encryption and signature methods provides confidentiality and integrity. In addition, it consumes less computation time and energy consumption than existing methods.

scholarly journals Fault diagnosis of wind turbine bearing using wireless sensor networks

2017 ◽  
Vol 21 (suppl. 2) ◽  
pp. 523-531 ◽  
Author(s):  
Indhu Ramalingam ◽  
Sankaran Annamalai ◽  
Sugumaran Vaithiyanathan
Keyword(s):  
Wireless Sensor Networks ◽  
Sensor Networks ◽  
Fault Diagnosis ◽  
Wind Turbine ◽  
Wireless Sensor ◽  
Turbine Bearing

scholarly journals Secure and Robust 3D Localization in Wireless Sensor Networks

2019 ◽  
Vol 9 (1S) ◽  
pp. 104-111
Keyword(s):  
Wireless Sensor Networks ◽  
Sensor Networks ◽  
Sensor Node ◽  
Wireless Sensor ◽  
Localization Algorithm ◽  
Malicious Nodes ◽  
3D Localization ◽  
Secure Localization ◽  
Simulation Results ◽  
Two Phases

The fundamental capacity of a sensor system is to accumulate and forward data to the destination. It is crucial to consider the area of gathered data, which is utilized to sort information that can be procured using confinement strategy as a piece of Wireless Sensor Networks (WSNs).Localization is a champion among the most basic progressions since it agreed as an essential part in various applications, e.g., target tracking. If the client can't gain the definite area information, the related applications can't be skillful. The crucial idea in most localization procedures is that some deployed nodes with known positions (e.g., GPS-equipped nodes) transmit signals with their coordinates so as to support other nodes to localize themselves. This paper mainly focuses on the algorithm that has been proposed to securely and robustly decide thelocation of a sensor node. The algorithm works in two phases namely Secure localization phase and Robust Localization phase. By "secure", we imply that malicious nodes should not effectively affect the accuracy of the localized nodes. By “robust”, we indicate that the algorithm works in a 3D environment even in the presence of malicious beacon nodes. The existing methodologies were proposed based on 2D localization; however in this work in addition to security and robustness, exact localization can be determined for 3D areas by utilizing anefficient localization algorithm. Simulation results exhibit that when compared to other existing algorithms, our proposed work performs better in terms of localization error and accuracy.

scholarly journals Implementation of Intrusion Detection in Homogeneous and Heterogeneous Wireless Sensor Networks

2021 ◽  
pp. 664-670
Author(s):  
Manoshri A. Ghawade ◽  
Dr. Sheetal S. Dhande
Keyword(s):  
Wireless Sensor Networks ◽  
Wireless Sensor Network ◽  
Sensor Networks ◽  
Intrusion Detection ◽  
Practical Interest ◽  
Wireless Sensor ◽  
Heterogeneous Wireless Sensor Networks ◽  
Multiple Sensor ◽  
Simulation Results ◽  
Multiple Sensing

Intrusion detection in Wireless Sensor Network (WSN) is of practical interest in many applications such as detecting an intruder in a battlefield. The intrusion detection is defined as a mechanism for a WSN to detect the existence of inappropriate, incorrect, or anomalous moving attackers. In this paper, we consider this issue according to heterogeneous WSN models. Furthermore, we consider two sensing detection models: single-sensing detection and multiple-sensing detection... Our simulation results show the advantage of multiple sensor heterogeneous WSNs.

scholarly journals Overview of DOS attacks on wireless sensor networks and experimental results for simulation of interference attacks

2018 ◽  
Vol 38 (1) ◽  
pp. 130-138 ◽  
Author(s):  
Željko Gavrić ◽  
Dejan Simić
Keyword(s):  
Wireless Sensor Networks ◽  
Sensor Networks ◽  
Denial Of Service ◽  
Wireless Sensor ◽  
Dos Attacks ◽  
Security Issue ◽  
Simulation Scenario ◽  
Simulation Results ◽  
Potential Methods

Wireless sensor networks are now used in various fields. The information transmitted in the wireless sensor networks is very sensitive, so the security issue is very important. DOS (denial of service) attacks are a fundamental threat to the functioning of wireless sensor networks. This paper describes some of the most common DOS attacks and potential methods of protection against them. The case study shows one of the most frequent attacks on wireless sensor networks – the interference attack. In the introduction of this paper authors assume that the attack interference can cause significant obstruction of wireless sensor networks. This assumption has been proved in the case study through simulation scenario and simulation results.

Sign in / Sign up

Export Citation Format

Share Document