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.

scholarly journals AN EFFICIENT FAULT TOLERANT SYSTEM USING IMPROVED CLUSTERING IN WIRELESS SENSOR NETWORKS

2013 ◽  
pp. 8-13
Author(s):  
VENKATESH S
Keyword(s):  
Wireless Sensor Networks ◽  
Energy Consumption ◽  
Fault Tolerance ◽  
Sensor Networks ◽  
Fault Tolerant ◽  
Cluster Head ◽  
Residual Energy ◽  
Previous Method ◽  
Wireless Sensor ◽  
Novel Approach

In Wireless Sensor Networks (WSNs), Efficient clustering is key for optimal use of available nodes. Fault tolerance to any failure on the network or node level is an essential requirement in this context. Hence, a novel approach towards clustering and multiple object tracking in WSNs is being explored. The Proposed method employs judicious mix of burdening all available nodes including GH (Group Head) to earn energy efficiency and fault tolerance. Initially, node with the maximum residual energy in a cluster becomes group head and node with the second maximum residual energy becomes altruist node, but not mandatory. Later on, selection of cluster head will be based on available residual energy. We use Matlab software as simulation platform to check energy consumption at cluster by evaluation of proposed algorithm. Eventually we evaluated and compare this proposed method against previous method and we demonstrate our model is better optimization than other method such as Traditional clustering in energy consumption rate.

A NOVEL FAULT-TOLERANT LEACH CLUSTERING PROTOCOL FOR WIRELESS SENSOR NETWORKS

2014 ◽  
Vol 23 (03) ◽  
pp. 1450041 ◽  
Author(s):  
MAHDI NAZARI CHERAGHLOU ◽  
MAJID HAGHPARAST
Keyword(s):  
Wireless Sensor Networks ◽  
Energy Consumption ◽  
Fault Tolerance ◽  
Sensor Networks ◽  
Energy Loss ◽  
Fault Tolerant ◽  
Cluster Head ◽  
Wireless Sensor ◽  
The Face ◽  
The One

Energy restrictions are a major challenge for wireless sensor networks, since after the deployment of network nodes in the environment, they can hardly be accessed or even recharged. Since the nodes are placed in harsh and unfriendly areas, they rapidly become prone to defects. Therefore, the management of these networks towards increasing their fault-tolerance capacity in the face of limited resources is extremely important. In this paper, a novel protocol is presented here, where in each node as a cluster member must send its last residing energy level to its upstream head cluster. Also, to prevent rework and energy loss, the node will see to it that only when the current sensed data is different than that of the previous interval, it sends the sensed data to the cluster head (CH). So, on the one hand the proposed protocol distinguishes between live and faulty nodes and therefore increases the network's fault-tolerance capacity, and on the other hand it prevents energy loss by eliminating rework. To implement Leach algorithm plus the proposed FT-Leach protocol, we used MATLAB software to simulate node energy consumption in each interval along with the residing energy of the nodes. The results and comparisons showed that our proposed protocol is visibly better than Leach in terms of fault-tolerance capacity and also energy consumption which ultimately extends network's lifetime.

scholarly journals An Intelligent Vice Cluster Head Election Protocol in WSN

2021 ◽  
Vol 13 (3) ◽  
pp. 202-222
Author(s):  
Ghassan Samara ◽  
Mohammad Hassan ◽  
Yahya Zayed
Keyword(s):  
Wireless Sensor Networks ◽  
Fuzzy Logic ◽  
Sensor Networks ◽  
Wireless Network ◽  
Cluster Head ◽  
Sensor Nodes ◽  
Wireless Sensor ◽  
Network Efficiency ◽  
Fuzzy Logic Algorithm ◽  
Wide Range

Wireless sensor networks (WSNs) has a practical ability to link a set of sensors to build a wireless network that can be accessed remotely; this technology has become increasingly popular in recent years. Wi-Fi-enabled sensor networks (WSNs) are used to gather information from the environment in which the network operates. Many obstacles prevent wireless sensor networks from being used in a wide range of fields. This includes maintaining network stability and extending network life. In a wireless network, sensors are the most essential component. Sensors are powered by a battery that has a finite amount of power. The battery is prone to power loss, and the sensor is therefore rendered inoperative as a result. In addition, the growing number of sensor nodes off-site affects the network's stability. The transmission and reception of information between the sensors and the base consumes the most energy in the sensor. An Intelligent Vice Cluster Head Selection Protocol is proposed in this study (IVC LEACH). In order to achieve the best performance with the least amount of energy consumption, the proposed hierarchical protocol relies on a fuzzy logic algorithm using four parameters to calculate the value of each node in the network and divides them into three hierarchical levels based on their value. This improves network efficiency and reliability while extending network life by 50 percent more than the original Low Energy Adaptive Clustering Hierarchy protocol. Keywords: Wireless Sensor Networks, Sensors, Communication Protocol, Fuzzy logic, Leach protocol.

Improving the performance of hierarchical wireless sensor networks using the metaheuristic algorithms: efficient cluster head selection

Sensor Review ◽  
2021 ◽  
Vol ahead-of-print (ahead-of-print) ◽  
Author(s):  
Farzad Kiani ◽  
Amir Seyyedabbasi ◽  
Sajjad Nematzadeh
Keyword(s):  
Wireless Sensor Networks ◽  
Sensor Networks ◽  
Data Transmission ◽  
Fitness Function ◽  
Cluster Head ◽  
Base Station ◽  
Wireless Sensor ◽  
Delivery Ratio ◽  
Second Phase ◽  
Content Type

Purpose Efficient resource utilization in wireless sensor networks is an important issue. Clustering structure has an important effect on the efficient use of energy, which is one of the most critical resources. However, it is extremely vital to choose efficient and suitable cluster head (CH) elements in these structures to harness their benefits. Selecting appropriate CHs and finding optimal coefficients for each parameter of a relevant fitness function in CHs election is a non-deterministic polynomial-time (NP-hard) problem that requires additional processing. Therefore, the purpose of this paper is to propose efficient solutions to achieve the main goal by addressing the related issues. Design/methodology/approach This paper draws inspiration from three metaheuristic-based algorithms; gray wolf optimizer (GWO), incremental GWO and expanded GWO. These methods perform various complex processes very efficiently and much faster. They consist of cluster setup and data transmission phases. The first phase focuses on clusters formation and CHs election, and the second phase tries to find routes for data transmission. The CH selection is obtained using a new fitness function. This function focuses on four parameters, i.e. energy of each node, energy of its neighbors, number of neighbors and its distance from the base station. Findings The results obtained from the proposed methods have been compared with HEEL, EESTDC, iABC and NR-LEACH algorithms and are found to be successful using various analysis parameters. Particularly, I-HEELEx-GWO method has provided the best results. Originality/value This paper proposes three new methods to elect optimal CH that prolong the networks lifetime, save energy, improve overhead along with packet delivery ratio.

New Fault-Tolerant Hierarchical Routing Protocol for WSNs

2012 ◽  
Vol 433-440 ◽  
pp. 3223-3229
Author(s):  
Davood Keykhosravi ◽  
Ali Hosseinalipour
Keyword(s):  
Wireless Sensor Networks ◽  
Sensor Networks ◽  
Network Lifetime ◽  
High Performance ◽  
Clustering Algorithm ◽  
Fault Tolerant ◽  
Clustering Algorithms ◽  
Cluster Head ◽  
Wireless Sensor ◽  
Geographical Position

Clustering in wireless sensor networks is one of the crucial methods for increasing of network lifetime. There are many algorithms for clustering. One of the cluster based algorithm in wireless sensor networks is LEACH algorithm. In this paper we proposed a new clustering method for increasing of network lifetime. In proposed method Clustering is done symmetrically and the best node with respect to remained energy and distance of other nodes in comparing with each that selected as a cluster head. Although in this protocol we didn’t use GPS but we could find geographical position nodes so easily. However, failures in higher level of hierarchy e.g. cluster-head cause more damage to the system because they also limit accessibility to the nodes that are under their supervision. In this paper we propose an efficient mechanism to recover sensors from a failed cluster. In this performance of the proposed algorithm via computer simulation was evaluated and compared with other clustering algorithms. The simulation results show the high performance of the proposed clustering algorithm.

scholarly journals A Distributed Reclustering Hierarchy Routing Protocol Using Social Welfare in Wireless Sensor Networks

2012 ◽  
Vol 8 (4) ◽  
pp. 681026 ◽  
Author(s):  
Pu-Tai Yang ◽  
Seokcheon Lee
Keyword(s):  
Energy Efficiency ◽  
Wireless Sensor Networks ◽  
Sensor Networks ◽  
Routing Protocol ◽  
Time Complexity ◽  
Cluster Head ◽  
Wireless Sensor ◽  
Average Case ◽  
Wide Range ◽  
Potential Applications

In recent years, there has been a rapid proliferation of research concerning Wireless Sensor Networks (WSNs), due to the wide range of potential applications that they can be used for. Lifetime is one of the most important considerations for WSNs due to their inherent energy constraints, and various protocols have been proposed to overcome these difficulties. This study proposes a novel distributed reclustering routing protocol: Predictive and Adaptive Routing Protocol using Energy Welfare (PARPEW). PARPEW incorporates the concept of energy welfare (EW) to achieve both energy efficiency and energy balance simultaneously. PARPEW is equipped with a cluster head (CH) shift mechanism that utilizes predictive energy after transmission for the computation of EW. The average case time complexity of the shift mechanism belongs to [Formula: see text], where [Formula: see text] is the average number of sensors in a cluster in the WSN. Experimental results demonstrate that the new protocol is capable of significantly prolonging the lifetime of WSNs under various scenarios.

A Fuzzy Knowledge Based Fault Tolerance Mechanism for Wireless Sensor Networks

2020 ◽  
pp. 679-697
Author(s):  
Sasmita Acharya ◽  
C. R. Tripathy
Keyword(s):  
Wireless Sensor Networks ◽  
Fault Tolerance ◽  
Sensor Networks ◽  
Cluster Head ◽  
Network Routing ◽  
Wireless Sensor ◽  
Tolerance Mechanism ◽  
Adaptive Clustering ◽  
Knowledge Based ◽  
Fuzzy Knowledge

Wireless Sensor Networks (WSNs) are the focus of considerable research for different applications. This paper proposes a Fuzzy Knowledge based Artificial Neural Network Routing (ANNR) fault tolerance mechanism for WSNs. The proposed method uses an exponential Bi-directional Associative Memory (eBAM) for the encoding and decoding of data packets and application of Intelligent Sleeping Mechanism (ISM) to conserve energy. A combination of fuzzy rules is used to identify the faulty nodes in the network. The Cluster Head (CH) acts as the data aggregator in the network. It applies the fuzzy knowledge based Node Appraisal Technique (NAT) in order to identify the faulty nodes in the network. The performance of the proposed ANNR is compared with that of Low-Energy Adaptive Clustering Hierarchy (LEACH), Dual Homed Routing (DHR) and Informer Homed Routing (IHR) through simulation.

A Fuzzy Knowledge Based Fault Tolerance Mechanism for Wireless Sensor Networks

2018 ◽  
Vol 5 (1) ◽  
pp. 99-116 ◽  
Author(s):  
Sasmita Acharya ◽  
C. R. Tripathy
Keyword(s):  
Wireless Sensor Networks ◽  
Fault Tolerance ◽  
Sensor Networks ◽  
Cluster Head ◽  
Network Routing ◽  
Wireless Sensor ◽  
Tolerance Mechanism ◽  
Data Packets ◽  
Knowledge Based ◽  
Fuzzy Knowledge

Wireless Sensor Networks (WSNs) are the focus of considerable research for different applications. This paper proposes a Fuzzy Knowledge based Artificial Neural Network Routing (ANNR) fault tolerance mechanism for WSNs. The proposed method uses an exponential Bi-directional Associative Memory (eBAM) for the encoding and decoding of data packets and application of Intelligent Sleeping Mechanism (ISM) to conserve energy. A combination of fuzzy rules is used to identify the faulty nodes in the network. The Cluster Head (CH) acts as the data aggregator in the network. It applies the fuzzy knowledge based Node Appraisal Technique (NAT) in order to identify the faulty nodes in the network. The performance of the proposed ANNR is compared with that of Low-Energy Adaptive Clustering Hierarchy (LEACH), Dual Homed Routing (DHR) and Informer Homed Routing (IHR) through simulation.

Research on a Real-Time Fault Tolerant Time Synchronization Algorithm for GSM-R Wireless Sensor Networks Based on Network Materials

2011 ◽  
Vol 63-64 ◽  
pp. 905-910
Author(s):  
Xiao Wu Huang ◽  
Gui Tang Wang ◽  
Wen Juan Liu ◽  
Feng Wang
Keyword(s):  
Wireless Sensor Networks ◽  
Fault Tolerance ◽  
Sensor Networks ◽  
Real Time ◽  
High Speed ◽  
Time Synchronization ◽  
Fault Tolerant ◽  
Wireless Sensor ◽  
Synchronization Algorithm ◽  
Network Time

Time synchronization is a key technology in wireless sensor networks. In this paper, aim at high-speed railway GSM-R network require higher real time, fault tolerance and band coverage way, presents a real-time fault-tolerant wireless sensor network time synchronization algorithm, using direct forwarding strategy, regression analysis and abnormal data filtering methods to meet the requirements of GSM-R network. Analysis and simulation show that the algorithm has good real-time and fault tolerance to meet the requirements of GSM-R network applications.

Sign in / Sign up

Export Citation Format

Share Document