Fault tolerance in sensor networks using self-diagnosing sensor nodes

2005 ◽  
Author(s):  
S. Harte
Keyword(s):  
Fault Tolerance ◽  
Sensor Networks ◽  
Sensor Nodes

scholarly journals A Byzantine Sensing Network Based on Majority-Consensus Data Aggregation Mechanism

Sensors ◽  
2021 ◽  
Vol 21 (1) ◽  
pp. 248
Author(s):  
Jenghorng Chang ◽  
Fanpyn Liu
Keyword(s):  
Wireless Sensor Networks ◽  
Fault Tolerance ◽  
Sensor Networks ◽  
Data Aggregation ◽  
Sensor Nodes ◽  
Wireless Sensor ◽  
Function Technique ◽  
Byzantine Fault Tolerance ◽  
Form Complex ◽  
Aggregation Mechanism

In the current Internet of Things era, digital devices form complex interconnections. The statuses of objects of interest are monitored using sensors, and distributed wireless sensor networks are formed from numerous sensor nodes. Many Byzantine fault tolerance mechanisms in wireless sensor networks (WSNs) were proposed from Byzantine agreement which even with a few faulty nodes in a sensor network, most healthy nodes can reach a consensus, perform data transmission tasks, and maintain network operation. In this study, this mechanism was utilized together with the majority function technique; in particular, the proposed method uses original sensor signals to define a threshold to assert a binary value of one or zero, thereby performing data judgment and aggregation. This approach reduces node energy consumption and enables the nodes to quickly reach a consensus. Moreover, the operating performance of the network can be maintained even when problems such as node failure and faults occur within the fault tolerance range. Compared with existing algorithms, the proposed data aggregation mechanism exhibits a better network life cycle and can effectively extend the flexibility of network operations.

Performance Analysis of TBC-ACO Routing Protocol with Existing Routing Protocols of Wireless Sensor Networks

2017 ◽  
Vol 7 (8) ◽  
pp. 169
Author(s):  
A. Radhika ◽  
D. Haritha
Keyword(s):  
Energy Efficiency ◽  
Wireless Sensor Networks ◽  
Sensor Networks ◽  
Swarm Intelligence ◽  
Routing Protocol ◽  
Routing Protocols ◽  
Energy Efficient ◽  
Sensor Nodes ◽  
Wireless Sensor ◽  
Congestion Aware

Wireless Sensor Networks, have witnessed significant amount of improvement in research across various areas like Routing, Security, Localization, Deployment and above all Energy Efficiency. Congestion is a problem of  importance in resource constrained Wireless Sensor Networks, especially for large networks, where the traffic loads exceed the available capacity of the resources . Sensor nodes are prone to failure and the misbehaviour of these faulty nodes creates further congestion. The resulting effect is a degradation in network performance, additional computation and increased energy consumption, which in turn decreases network lifetime. Hence, the data packet routing algorithm should consider congestion as one of the parameters, in addition to the role of the faulty nodes and not merely energy efficient protocols .Nowadays, the main central point of attraction is the concept of Swarm Intelligence based techniques integration in WSN.  Swarm Intelligence based Computational Swarm Intelligence Techniques have improvised WSN in terms of efficiency, Performance, robustness and scalability. The main objective of this research paper is to propose congestion aware , energy efficient, routing approach that utilizes Ant Colony Optimization, in which faulty nodes are isolated by means of the concept of trust further we compare the performance of various existing routing protocols like AODV, DSDV and DSR routing protocols, ACO Based Routing Protocol  with Trust Based Congestion aware ACO Based Routing in terms of End to End Delay, Packet Delivery Rate, Routing Overhead, Throughput and Energy Efficiency. Simulation based results and data analysis shows that overall TBC-ACO is 150% more efficient in terms of overall performance as compared to other existing routing protocols for Wireless Sensor Networks.

Fault Tolerant Reliable Protocol (FTRP) Performance Evaluation in Wireless Sensor Networks: An Extensitive Study

2019 ◽  
pp. 1-36
Keyword(s):  
Wireless Sensor Networks ◽  
Fault Tolerance ◽  
Sensor Networks ◽  
Fault Tolerant ◽  
Cluster Head ◽  
Biological Data ◽  
Wireless Sensor ◽  
Delivery Ratio ◽  
Good Performer ◽  
Wide Range

Fault Tolerant Reliable Protocol (FTRP) is proposed as a novel routing protocol designed for Wireless Sensor Networks (WSNs). FTRP offers fault tolerance reliability for packet exchange and support for dynamic network changes. The key concept used is the use of node logical clustering. The protocol delegates the routing ownership to the cluster heads where fault tolerance functionality is implemented. FTRP utilizes cluster head nodes along with cluster head groups to store packets in transient. In addition, FTRP utilizes broadcast, which reduces the message overhead as compared to classical flooding mechanisms. FTRP manipulates Time to Live values for the various routing messages to control message broadcast. FTRP utilizes jitter in messages transmission to reduce the effect of synchronized node states, which in turn reduces collisions. FTRP performance has been extensively through simulations against Ad-hoc On-demand Distance Vector (AODV) and Optimized Link State (OLSR) routing protocols. Packet Delivery Ratio (PDR), Aggregate Throughput and End-to-End delay (E-2-E) had been used as performance metrics. In terms of PDR and aggregate throughput, it is found that FTRP is an excellent performer in all mobility scenarios whether the network is sparse or dense. In stationary scenarios, FTRP performed well in sparse network; however, in dense network FTRP’s performance had degraded yet in an acceptable range. This degradation is attributed to synchronized nodes states. Reliably delivering a message comes to a cost, as in terms of E-2-E. results show that FTRP is considered a good performer in all mobility scenarios where the network is sparse. In sparse stationary scenario, FTRP is considered good performer, however in dense stationary scenarios FTRP’s E-2-E is not acceptable. There are times when receiving a network message is more important than other costs such as energy or delay. That makes FTRP suitable for wide range of WSNs applications, such as military applications by monitoring soldiers’ biological data and supplies while in battlefield and battle damage assessment. FTRP can also be used in health applications in addition to wide range of geo-fencing, environmental monitoring, resource monitoring, production lines monitoring, agriculture and animals tracking. FTRP should be avoided in dense stationary deployments such as, but not limited to, scenarios where high application response is critical and life endangering such as biohazards detection or within intensive care units.

Deterministic Deployment for Wireless Image Sensor Nodes

2014 ◽  
Vol 8 (1) ◽  
pp. 668-674
Author(s):  
Junguo Zhang ◽  
Yutong Lei ◽  
Fantao Lin ◽  
Chen Chen
Keyword(s):  
Wireless Sensor Networks ◽  
Sensor Networks ◽  
Visual Information ◽  
Image Sensor ◽  
Sensor Nodes ◽  
Wireless Sensor ◽  
Coverage Area ◽  
Effective Coverage ◽  
Area Of Interest ◽  
Key Issues

Wireless sensor networks composed of camera enabled source nodes can provide visual information of an area of interest, potentially enriching monitoring applications. The node deployment is one of the key issues in the application of wireless sensor networks. In this paper, we take the effective coverage and connectivity as the evaluation indices to analyze the effect of the perceivable angle and the ratio of communication radius and sensing radius for the deterministic circular deployment. Experimental results demonstrate that the effective coverage area of the triangle deployment is the largest when using the same number of nodes. When the nodes are deployed in the same monitoring area in the premise of ensuring connectivity, rhombus deployment is optimal when √2 < rc / rs < √3 . The research results of this paper provide an important reference for the deployment of the image sensor networks with the given parameters.

Energy Efficient Group Based Linear Wireless Sensor Networks for Application in Pipeline Monitoring

2020 ◽  
Vol 10 ◽  
Author(s):  
Chinedu Duru ◽  
Neco Ventura ◽  
Mqhele Dlodlo
Keyword(s):  
Wireless Sensor Networks ◽  
Energy Consumption ◽  
Sensor Networks ◽  
Remote Monitoring ◽  
Linear Array ◽  
Minimum Energy ◽  
Sensor Nodes ◽  
Wireless Sensor ◽  
Sink Node ◽  
Pipeline Monitoring

Background: Wireless Sensor Networks (WSNs) have been researched to be one of the ground-breaking technologies for the remote monitoring of pipeline infrastructure of the Oil and Gas industry. Research have also shown that the preferred deployment approach of the sensor network on pipeline structures follows a linear array of nodes, placed a distance apart from each other across the infrastructure length. The linear array topology of the sensor nodes gives rise to the name Linear Wireless Sensor Networks (LWSNs) which over the years have seen themselves being applied to pipelines for effective remote monitoring and surveillance. This paper aims to investigate the energy consumption issue associated with LWSNs deployed in cluster-based fashion along a pipeline infrastructure. Methods: Through quantitative analysis, the study attempts to approach the investigation conceptually focusing on mathematical analysis of proposed models to bring about conjectures on energy consumption performance. Results: From the derived analysis, results have shown that energy consumption is diminished to a minimum if there is a sink for every placed sensor node in the LWSN. To be precise, the analysis conceptually demonstrate that groups containing small number of nodes with a corresponding sink node is the approach to follow when pursuing a cluster-based LWSN for pipeline monitoring applications. Conclusion: From the results, it is discovered that energy consumption of a deployed LWSN can be decreased by creating groups out of the total deployed nodes with a sink servicing each group. In essence, the smaller number of nodes each group contains with a corresponding sink, the less energy consumed in total for the entire LWSN. This therefore means that a sink for every individual node will attribute to minimum energy consumption for every non-sink node. From the study, it can be concurred that energy consumption of a LWSN is inversely proportional to the number of sinks deployed and hence the number of groups created.

Improved DV-Hop Localization Scheme for Randomly Deployed WSNs

2020 ◽  
Vol 10 (1) ◽  
pp. 94-109 ◽  
Author(s):  
Rekha Goyat ◽  
Mritunjay Kumar Rai ◽  
Gulshan Kumar ◽  
Hye-Jin Kim ◽  
Se-Jung Lim
Keyword(s):  
Wireless Sensor Networks ◽  
Energy Consumption ◽  
Sensor Networks ◽  
Research Area ◽  
Sensor Nodes ◽  
Wireless Sensor ◽  
Localization Error ◽  
Anchor Nodes ◽  
Least Energy ◽  
Range Free

Background: Wireless Sensor Networks (WSNs) is considered one of the key research area in the recent. Various applications of WSNs need geographic location of the sensor nodes. Objective: Localization in WSNs plays an important role because without knowledge of sensor nodes location the information is useless. Finding the accurate location is very crucial in Wireless Sensor Networks. The efficiency of any localization approach is decided on the basis of accuracy and localization error. In range-free localization approaches, the location of unknown nodes are computed by collecting the information such as minimum hop count, hop size information from neighbors nodes. Methods: Although various studied have been done for computing the location of nodes but still, it is an enduring research area. To mitigate the problems of existing algorithms, a range-free Improved Weighted Novel DV-Hop localization algorithm is proposed. Main motive of the proposed study is to reduced localization error with least energy consumption. Firstly, the location information of anchor nodes is broadcasted upto M hop to decrease the energy consumption. Further, a weight factor and correction factor are introduced which refine the hop size of anchor nodes. Results: The refined hop size is further utilized for localization to reduces localization error significantly. The simulation results of the proposed algorithm are compared with other existing algorithms for evaluating the effectiveness and the performance. The simulated results are evaluated in terms localization error and computational cost by considering different parameters such as node density, percentage of anchor nodes, transmission range, effect of sensing field and effect of M on localization error. Further statistical analysis is performed on simulated results to prove the validation of proposed algorithm. A paired T-test is applied on localization error and localization time. The results of T-test depicts that the proposed algorithm significantly improves the localization accuracy with least energy consumption as compared to other existing algorithms like DV-Hop, IWCDV-Hop, and IDV-Hop. Conclusion: From the simulated results, it is concluded that the proposed algorithm offers 36% accurate localization than traditional DV-Hop and 21 % than IDV-Hop and 13% than IWCDV-Hop.

Security based on Received Signal Strength in Localization for Underwater Sensor Networks

2016 ◽  
Vol 1 (2) ◽  
pp. 1-7
Author(s):  
Karamjeet Kaur ◽  
Gianetan Singh Sekhon
Keyword(s):  
Sensor Networks ◽  
Threshold Value ◽  
Critical Issue ◽  
Sensor Nodes ◽  
Underwater Sensor Networks ◽  
Research Subjects ◽  
Malicious Nodes ◽  
Intermediate Node ◽  
End To End Delay ◽  
End To End

Underwater sensor networks are envisioned to enable a broad category of underwater applications such as pollution tracking, offshore exploration, and oil spilling. Such applications require precise location information as otherwise the sensed data might be meaningless. On the other hand, security critical issue as underwater sensor networks are typically deployed in harsh environments. Localization is one of the latest research subjects in UWSNs since many useful applying UWSNs, e.g., event detecting. Now day’s large number of localization methods arrived for UWSNs. However, few of them take place stability or security criteria. In purposed work taking up localization in underwater such that various wireless sensor nodes get localize to each other. RSS based localization technique used remove malicious nodes from the communication intermediate node list based on RSS threshold value. Purposed algorithm improves more throughput and less end to end delay without degrading energy dissipation at each node. The simulation is conducted in MATLAB and it suggests optimal result as comparison of end to end delay with and without malicious node.

scholarly journals Clique Size in Sensor Networks with Key Pre-Distribution Based on Transversal Design

2005 ◽  
Vol 1 (3-4) ◽  
pp. 345-354 ◽  
Author(s):  
Dibyendu Chakrabarti ◽  
Subhamoy Maitra ◽  
Bimal Roy
Keyword(s):  
Sensor Networks ◽  
Distributed Computing ◽  
Secure Communication ◽  
Sensor Nodes ◽  
Transversal Design ◽  
Secret Key ◽  
Distributed Sensor Networks ◽  
Distributed Sensor

Key pre-distribution is an important area of research in Distributed Sensor Networks (DSN). Two sensor nodes are considered connected for secure communication if they share one or more common secret key(s). It is important to analyse the largest subset of nodes in a DSN where each node is connected to every other node in that subset (i.e., the largest clique). This parameter (largest clique size) is important in terms of resiliency and capability towards efficient distributed computing in a DSN. In this paper, we concentrate on the schemes where the key pre-distribution strategies are based on transversal design and study the largest clique sizes. We show that merging of blocks to construct a node provides larger clique sizes than considering a block itself as a node in a transversal design.

Sign in / Sign up

Export Citation Format

Share Document