Fault tolerance in WSN through PE‐LEACH protocol

Mohapatra, Hitesh; Rath, Amiya Kumar

doi:10.1049/iet-wss.2018.5229

Cited by 54 publications

(51 citation statements)

References 24 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…Such hostile and harsh environment seriously needs such protocol where the sensors can sustain for a long period of time. Though the real-time demonstration is out of scope of this work but here we are providing few lists of refereed articles where such clustering algorithms will be fruitful [24][25][26][27][28][29].…”

Section: Results Discussionmentioning

confidence: 99%

Fault‐tolerant mechanism for wireless sensor network

Mohapatra

Rath

2020

IET wirel. sens. syst.

Self Cite

View full text Add to dashboard Cite

The study aims to understand the various types of faults occur in a wireless sensor network (WSN). The primary objective of the fault-tolerant technique is to enhance the robustness and self-healing capacity of sensor network. The resource constraint environment, remote deployment and harsh monitoring conditions frequently invite different types of faults in WSN. The fault can be handled in two ways such as fault tolerance and fault prevention method. The novelty of this state-of-art is, the authors propose two new algorithms named Uniform Energy Clustering for fault tolerance and Population-Based Clustering for fault prevention. The result of the simulation is satisfactory in comparison to existing algorithms such as Low Energy Adaptive Clustering Hierarchy, Stable Election Protocol, Virtual Area Partition-Energy and Energy-Aware Multi-Hop Multi-Path Hierarchical protocols. In addition to these new algorithms, they also propose a unique taxonomy on fault which is based on sensitivity issues of specific applications. PBC (Population-Based Clustering), which is a fault prevention mechanism. The UEC algorithm is based on the equal energy distribution among clusters, whereas the PBC focus on the mapping of CH according to the cluster population. The UEC algorithm performance has been compared against Low Energy Adaptive Clustering Hierarchy (LEACH) and Stable Election Protocol (SEP), whereas the PBC algorithm performance has been compared against Virtual Area Partition-Energy (VAP-E) and Energy-Aware Multi-Hop Multi-Path Hierarchical (EAMMH) protocols. The results of our simulation prove that both UEC and PBC protocols perform better than their ancestors. The deep literature survey concludes that there are two major proven methodologies exist for energy management that are (i) clustering and (ii) routing [3]. Sensitivity: Here, the term sensitivity defines the impact of consequences that occurs due to fault occurrence. The use of sensors is very common in a modern digitised era where everything eventually accommodated with sensors. When these sensors get fail because of any reason it generates some level of impact on the overall performance and design of the system. The consequences of faults can be gauged by various factors such as time, money, effort. On the basis of this, we have been proposed a unique sensitivity based taxonomy in Section 3. Clustering: Cluster formation is an essential part of the routing mechanism. The cluster may form with homogeneous or heterogeneous SNs. The objective behind clustering is as the SNs are limited with energy, therefore, the direct communication with BS is not suitable by considering efficient energy management. Normally, each cluster is controlled by a dominated CH node, which is responsible for regulating the cluster members (CMs) and additionally performs data collection & aggregation operation [4]. The details about various clustering technologies can be found in [5, 6]. Routing: Routing is a best practice adopted by clusters of WSN to select appropriate CH and to choose t...

show abstract

Section: Results Discussionmentioning

confidence: 99%

Fault‐tolerant mechanism for wireless sensor network

Mohapatra

Rath

2020

IET wirel. sens. syst.

Self Cite

View full text Add to dashboard Cite

show abstract

“…Lee et al optimized the LEACH based on expected residual energy (LEACH-ERE), which adopts an improved CHN selection scheme based on the LEACH protocol, employs energy predication, and distributes the network load evenly in order to extend the network lifetime [28]. Mohapatra et al presented a partitioned-based and energy-efficient LEACH (PE-LEACH) protocol that divides the whole network into quadrants, which is energy-efficient and fault-tolerant [29]. In addition, the CHN selection scheme and the data transmission process are improved in PE-LEACH protocol.…”

Section: The Clustering Routing Protocolmentioning

confidence: 99%

Underwater Wireless Sensor Networks: An Energy-Efficient Clustering Routing Protocol Based on Data Fusion and Genetic Algorithms

2020

View full text Add to dashboard Cite

Due to the limited battery energy of underwater wireless sensor nodes and the difficulty in replacing or recharging the battery underwater, it is of great significance to improve the energy efficiency of underwater wireless sensor networks (UWSNs). We propose a novel energy-efficient clustering routing protocol based on data fusion and genetic algorithms (GAs) for UWSNs. In the clustering routing protocol, the cluster head node (CHN) gathers the data from cluster member nodes (CMNs), aggregates the data through an improved back propagation neural network (BPNN), and transmits the aggregated data to a sink node (SN) through a multi-hop scheme. The effective multi-hop transmission path between the CHN and the SN is determined through the enhanced GA, thereby improving transmission efficiency and reducing energy consumption. This paper presents the GA based on a specific encoding scheme, a particular crossover operation, and an enhanced mutation operation. Additionally, the BPNN employed for data fusion is improved by adopting an optimized momentum method, which can reduce energy consumption through the elimination of data redundancy and the decrease of the amount of transferred data. Moreover, we introduce an optimized CHN selecting scheme considering residual energy and positions of nodes. The experiments demonstrate that our proposed protocol outperforms its competitors in terms of the energy expenditure, the network lifespan, and the packet loss rate.

show abstract

“…Several protocols for energy management have been implemented on WSNs. In [29], the authors proposed a variant of the low-energy adaptive clustering hierarchy (LEACH) algorithm called the partitioned-based energy-efficient LEACH (PE-LEACH) protocol, which tends toward the energy-based fault-tolerant technique. LEACH is a clusterbased routing protocol that uses a clustering approach [30].…”

Section: Related Workmentioning

confidence: 99%

An efficient data collection path planning scheme for wireless sensor networks with mobile sinks

Chang

Jeng

Sheu

et al. 2020

J Wireless Com Network

View full text Add to dashboard Cite

Wireless sensor networks with mobile sinks enable a mobile device to move into the sensing area for the purpose of collecting the sensing data. Mobile sinks increase the flexibility and convenience of data gathering in such systems. Taking the energy consumption of the mobile sink into account, the moving distance of the mobile sink must be reduced efficiently. Hence, it is important and necessary to develop an efficient path planning scheme for mobile sinks in large-scale wireless sensor network systems. According to several greedy-based algorithms, we adopt an angle bisector concept to create the moving path for the mobile sink. In this paper, a novel and efficient data collection path planning scheme is proposed to reduce the moving distances and to prolong the lifetimes of mobile sinks in wireless sensor networks. Considering the communication range limitations of sensor nodes and the obstacles within sensing areas, we design an inner center path planning algorithm to reduce the moving distance for the mobile sink. A back-routing avoidance method is included to address the moving path backpropagation problem. We account for the obstacles in sensing area. The reference point of obstacle avoidance is employed to address the obstacle problem. The proposed scheme makes an adaptive decision for creating the moving path of the mobile sink. A suitable moving path planning scheme can be achieved, and the moving distance of the mobile sink can be reduced. The proposed scheme is promising in large-scale wireless sensor networks. When the number of sensor nodes in the sensing area is increased by 50, the proposed scheme yields an average moving distance that is 1.1 km shorter than that of the heuristic tour-planning algorithm, where the sensing area is 5 km × 5 km. Simulation results demonstrate that the proposed data collection path planning scheme outperforms the previously developed greedy-based scheme in terms of the moving paths and moving distances of mobile sinks in wireless sensor networks.

show abstract

Fault tolerance in WSN through PE‐LEACH protocol

Cited by 54 publications

References 24 publications

Fault‐tolerant mechanism for wireless sensor network

Fault‐tolerant mechanism for wireless sensor network

Underwater Wireless Sensor Networks: An Energy-Efficient Clustering Routing Protocol Based on Data Fusion and Genetic Algorithms

An efficient data collection path planning scheme for wireless sensor networks with mobile sinks

Contact Info

Product

Resources

About