scholarly journals A Cluster-Based Routing Protocol and Fault Detection for Wireless Sensor Network

2021 ◽  
Vol 13 (04) ◽  
pp. 71-83
Author(s):  
Slaheddine Chelbi ◽  
Riadh Moussi
Keyword(s):  
Energy Consumption ◽  
Network Lifetime ◽  
Routing Protocol ◽  
Wireless Sensors ◽  
Large Scale ◽  
Routing Algorithm ◽  
Data Accuracy ◽  
Wireless Sensor ◽  
Consumption Data ◽  
Sensor Devices

In Wireless Sensors Networks (WSN) based application, a large number of sensor devices must be deployed. Energy efficiency and network lifetime are the two most challenging issues in WSN. As a consequence, the main goal is to reduce the overall energy consumption using clustering protocols which have to ensure reliability and connectivity in large-scale WSN. This work presents a new clustering and routing algorithm based on the properties of the sensor networks. The main goal of this work is to extend the network lifetime via charge equilibration in the WSN. According to many errors with sensing devices and to have greater data accuracy, we use a quorum mechanism. The proposed algorithms are evaluated widely and the results are compared with related works. The experimental results show that the proposed algorithm provides an effective improvement in terms of energy consumption, data accuracy and network lifetime.

Energy Efficient Clustering and Routing Algorithm for WSN

2019 ◽  
Vol 12 ◽  
Author(s):  
Mohit Kumar ◽  
Sonu Mittal ◽  
Md. Amir Khusru Akhtar
Keyword(s):  
Energy Consumption ◽  
Network Lifetime ◽  
Energy Efficient ◽  
Hot Spot ◽  
Routing Algorithm ◽  
Relay Node ◽  
Sensor Nodes ◽  
Wireless Sensor ◽  
Energy Efficient Clustering ◽  
Hot Spot Problem

Background: This paper presents a novel Energy Efficient Clustering and Routing Algorithm (EECRA) for WSN. It is a clustering-based algorithm that minimizes energy dissipation in wireless sensor networks. The proposed algorithm takes into consideration energy conservation of the nodes through its inherent architecture and load balancing technique. In the proposed algorithm the role of inter-cluster transmission is not performed by gateways instead a chosen member node of respective cluster is responsible for data forwarding to another cluster or directly to the sink. Our algorithm eases out the load of the gateways by distributing the transmission load among chosen sensor node which acts as a relay node for inter-cluster communication for that round. Grievous simulations show that EECRA is better than PBCA and other algorithms in terms of energy consumption per round and network lifetime. Objective: The objective of this research lies in its inherent architecture and load balancing technique. The sole purpose of this clustering-based algorithm is that it minimizes energy dissipation in wireless sensor networks. Method: This algorithm is tested with 100 sensor nodes and 10 gateways deployed in the target area of 300m × 300m. The round assumed in this simulation is same as in LEACH. The performance metrics used for comparisons are (a) network lifetime of gateways and (b) energy consumption per round by gateways. Our algorithm gives superior result compared to LBC, EELBCA and PBCA. Fig 6 and Fig 7 shows the comparison between the algorithms. Results: The simulation was performed on MATLAB version R2012b. The performance of EECRA is compared with some existing algorithms like PBCA, EELBCA and LBCA. The comparative analysis shows that the proposed algorithm outperforms the other existing algorithms in terms of network lifetime and energy consumption. Conclusion: The novelty of this algorithm lies in the fact that the gateways are not responsible for inter-cluster forwarding, instead some sensor nodes are chosen in every cluster based on some cost function and they act as a relay node for data forwarding. Note the algorithm does not address the hot-spot problem. Our next endeavor will be to design an algorithm with consideration of hot-spot problem.

scholarly journals Energy Aware Simple Ant Routing Algorithm for Wireless Sensor Networks

2015 ◽  
Vol 2015 ◽  
pp. 1-11
Author(s):  
Sohail Jabbar ◽  
Rabia Iram ◽  
Muhammad Imran ◽  
Awais Ahmad ◽  
Anand Paul ◽  
...  
Keyword(s):  
Wireless Sensor Networks ◽  
Sensor Networks ◽  
Network Lifetime ◽  
Large Scale ◽  
Routing Algorithm ◽  
Wireless Sensor ◽  
Route Discovery ◽  
Route Selection ◽  
Energy Aware ◽  
Forwarding Node

Network lifetime is one of the most prominent barriers in deploying wireless sensor networks for large-scale applications because these networks employ sensors with nonrenewable scarce energy resources. Sensor nodes dissipate most of their energy in complex routing mechanisms. To cope with limited energy problem, we present EASARA, an energy aware simple ant routing algorithm based on ant colony optimization. Unlike most algorithms, EASARA strives to avoid low energy routes and optimizes the routing process through selection of least hop count path with more energy. It consists of three phases, that is, route discovery, forwarding node, and route selection. We have improved the route discovery procedure and mainly concentrate on energy efficient forwarding node and route selection, so that the network lifetime can be prolonged. The four possible cases of forwarding node and route selection are presented. The performance of EASARA is validated through simulation. Simulation results demonstrate the performance supremacy of EASARA over contemporary scheme in terms of various metrics.

scholarly journals A PSO-Based Uneven Dynamic Clustering Multi-Hop Routing Protocol for Wireless Sensor Networks

Sensors ◽  
2019 ◽  
Vol 19 (8) ◽  
pp. 1835 ◽  
Author(s):  
Ruan ◽  
Huang
Keyword(s):  
Wireless Sensor Networks ◽  
Energy Consumption ◽  
Sensor Networks ◽  
Network Lifetime ◽  
Routing Protocol ◽  
Cluster Head ◽  
Base Station ◽  
Wireless Sensor ◽  
Dynamic Clustering ◽  
Energy Efficient Routing

Since wireless sensor networks (WSNs) are powered by energy-constrained batteries, many energy-efficient routing protocols have been proposed to extend the network lifetime. However, most of the protocols do not well balance the energy consumption of the WSNs. The hotspot problem caused by unbalanced energy consumption in the WSNs reduces the network lifetime. To solve the problem, this paper proposes a PSO (Particle Swarm Optimization)-based uneven dynamic clustering multi-hop routing protocol (PUDCRP). In the PUDCRP protocol, the distribution of the clusters will change dynamically when some nodes fail. The PSO algorithm is used to determine the area where the candidate CH (cluster head) nodes are located. The adaptive clustering method based on node distribution makes the cluster distribution more reasonable, which balances the energy consumption of the network more effectively. In order to improve the energy efficiency of multi-hop transmission between the BS (Base Station) and CH nodes, we also propose a connecting line aided route construction method to determine the most appropriate next hop. Compared with UCCGRA, multi-hop EEBCDA, EEMRP, CAMP, PSO-ECHS and PSO-SD, PUDCRP prolongs the network lifetime by between 7.36% and 74.21%. The protocol significantly balances the energy consumption of the network and has better scalability for various sizes of network.

A Wireless Sensor Network Routing Algorithm Based on Zigbee

2014 ◽  
Vol 513-517 ◽  
pp. 1845-1849
Author(s):  
Hua Rui Wu ◽  
Li Zhu
Keyword(s):  
Energy Consumption ◽  
Wireless Sensor Network ◽  
Sensor Network ◽  
Large Scale ◽  
Routing Algorithm ◽  
Network Routing ◽  
Routing Algorithms ◽  
Wireless Sensor ◽  
Quantitative Relation ◽  
Analysis Model

Routing strategy with effective and saving energy is an important problem in the research on the application of wireless sensor network into the farmland micro climate and soil moisture monitoring,it analyzed the disadvantage of the layered tree routing algorithm and ZigBee routing algorithms in energy saving, combined with ZigBee network topology,establishing an optimal node analysis model based on fuzzy decision, bringing forward a new routing algorithm which is suitable for large-scale farmland gradient environment, this new algorithm find out the quantitative relation between energy consumption and routing node selecting strategy,which can greatly decrease the route hop number by routing discovery mechanism and create an optimum goal group. Simulation results showed that compared with the layered tree and ZigBee routing algorithms,the new routing algorithms can significantly reduce the energy consumption of routing process.

scholarly journals Energy Balance Routing Algorithm Based on Virtual MIMO Scheme for Wireless Sensor Networks

2014 ◽  
Vol 2014 ◽  
pp. 1-7 ◽  
Author(s):  
Jianpo Li ◽  
Xue Jiang ◽  
I-Tai Lu
Keyword(s):  
Wireless Sensor Networks ◽  
Energy Consumption ◽  
Sensor Networks ◽  
Energy Balance ◽  
Network Lifetime ◽  
Routing Algorithm ◽  
Cluster Head ◽  
Wireless Sensor ◽  
Virtual Mimo ◽  
Head Node

Wireless sensor networks are usually energy limited and therefore an energy-efficient routing algorithm is desired for prolonging the network lifetime. In this paper, we propose a new energy balance routing algorithm which has the following three improvements over the conventional LEACH algorithm. Firstly, we propose a new cluster head selection scheme by taking into consideration the remaining energy and the most recent energy consumption of the nodes and the entire network. In this way, the sensor nodes with smaller remaining energy or larger energy consumption will be much less likely to be chosen as cluster heads. Secondly, according to the ratio of remaining energy to distance, cooperative nodes are selected to form virtual MIMO structures. It mitigates the uneven distribution of clusters and the unbalanced energy consumption of the whole network. Thirdly, we construct a comprehensive energy consumption model, which can reflect more realistically the practical energy consumption. Numerical simulations analyze the influences of cooperative node numbers and cluster head node numbers on the network lifetime. It is shown that the energy consumption of the proposed routing algorithm is lower than the conventional LEACH algorithm and for the simulation example the network lifetime is prolonged about 25%.

scholarly journals An Election Energy Threshold Based Multi-Hop Routing Protocol in a Grid-Clustered Wireless Sensor Network

2018 ◽  
pp. 327-336 ◽  
Author(s):  
Funom Samuel Dadah ◽  
Ajayi Ore-Ofe ◽  
Aliyu D Usman ◽  
Y A Mshelia ◽  
M O Babatunde
Keyword(s):  
Energy Consumption ◽  
Wireless Sensor Network ◽  
Sensor Network ◽  
Routing Protocol ◽  
Energy Efficient ◽  
Routing Algorithm ◽  
Base Station ◽  
Energy Threshold ◽  
Wireless Sensor ◽  
Data Packets

Owing to the limited energy of sensor nodes (SNs) in a wireless sensor network (WSN), it is important to reduce and balance the energy consumption of the SNs in order to extend the WSN lifetime. Clustering mechanism is a highly efficient and effective mechanism for minimizing the amount of energy that SNs consume during the transmission of data packets. In this paper, an election energy threshold based multi-hop routing protocol (mEEMRP) is presented. In order to minimize energy consumption, this routing protocol uses grid clustering, where the network field is divided into grid clusters. SNs in each grid cluster select a cluster head (CH) based on a weight factor that takes the node location, node’s residual energy (RE) as well as the node’s distance from the base station into consideration. An energy efficient multi-hop routing algorithm is adopted during the transmission of data packets from the cluster heads (CHs) to the base station (BS). This multi-hop routing algorithm uses an election energy threshold value, T­nhCH that takes into consideration the RE of CHs as well as the distance between CHs. Simulation results show a 1.77% and 10.65% improvement in terms of network lifetime for two network field scenarios over Energy Efficient Multi-hop Routing Protocol (EEMRP).

scholarly journals Energy-Efficient QoS-Aware Intelligent Hybrid Clustered Routing Protocol for Wireless Sensor Networks

2019 ◽  
Vol 2019 ◽  
pp. 1-12
Author(s):  
Parvinder Singh ◽  
Rajeshwar Singh
Keyword(s):  
Wireless Sensor Networks ◽  
Sensor Networks ◽  
Network Lifetime ◽  
Routing Protocol ◽  
Large Scale ◽  
Fitness Function ◽  
Geographical Area ◽  
Cluster Head ◽  
Sensor Nodes ◽  
Wireless Sensor

A wireless sensor network consists of numerous low-power microsensor devices that can be deployed in a geographical area for remote sensing, surveillance, control, and monitoring applications. The advancements of wireless devices in terms of user-friendly interface, size, and deployment cost have given rise to many smart applications of wireless sensor networks (WSNs). However, certain issues like energy efficiency, long lifetime, and communication reliability restrict their large scale utilization. In WSNs, the cluster-based routing protocols assist nodes to collect, aggregate, and forward sensed data from event regions towards the sink node through minimum cost links. A clustering method helps to improve data transmission efficiency by dividing the sensor nodes into small groups. However, improper cluster head (CH) selection may affect the network lifetime, average network energy, and other quality of service (QoS) parameters. In this paper, a multiobjective clustering strategy is proposed to optimize the energy consumption, network lifetime, network throughput, and network delay. A fitness function has been formulated for heterogenous and homogenous wireless sensor networks. This fitness function is utilized to select an optimum CH for energy minimization and load balancing of cluster heads. A new hybrid clustered routing protocol is proposed based on fitness function. The simulation results conclude that the proposed protocol achieves better efficiency in increasing the network lifetime by 63%, 26%, and 10% compared with three well-known heterogeneous protocols: DEEC, EDDEEC, and ATEER, respectively. The proposed strategy also attains better network stability than a homogenous LEACH protocol.

Level Crossing Sampling for Energy Conservation in Wireless Sensor Networks

2011 ◽  
pp. 207-228 ◽  
Author(s):  
Hadi Alasti
Keyword(s):  
Wireless Sensor Networks ◽  
Sensor Networks ◽  
Energy Conservation ◽  
Network Lifetime ◽  
Wireless Sensors ◽  
Large Scale ◽  
Real Life ◽  
Wireless Sensor ◽  
Level Crossing ◽  
Bandlimited Signals

In periodic sampling of the bandlimited signals, many of the consecutive samples are very similar and sometimes the signal remains unchanged over periods of time. These samples can be interpreted as redundant. For this, transmission of all of the periodic samples from all of the sensors in wireless sensor networks is wasteful. The problem becomes more challenging in large scale wireless sensor networks. Level crossing sampling in time is proposed for energy conservation in real-life application of wireless sensor networks to increase the network lifetime by avoiding the transmission of redundant samples. In this chapter, a design framework is discussed for application of level crossing sampling in wireless sensor networks. The performance of level crossing sampling for various level definition schemes are evaluated using computer simulations and experiments with real-life wireless sensors.

scholarly journals PCA-Guided Routing Algorithm for Wireless Sensor Networks

2012 ◽  
Vol 2012 ◽  
pp. 1-10 ◽  
Author(s):  
Gong Chen ◽  
Liansheng Tan ◽  
Yanlin Gong ◽  
Wei Zhang
Keyword(s):  
Wireless Sensor Networks ◽  
Energy Consumption ◽  
Sensor Networks ◽  
Network Lifetime ◽  
Routing Algorithm ◽  
Principal Component ◽  
Wireless Sensor ◽  
Energy Dissipated ◽  
Sum Of Distances ◽  
Theoretical Analyses

An important performance concern for wireless sensor networks (WSNs) is the total energy dissipated by all the nodes in the network over the course of network lifetime. In this paper, we propose a routing algorithm termed as PCA-guided routing algorithm (PCA-RA) by exploring the principal component analysis (PCA) approach. Our algorithm remarkably reduces energy consumption and prolongs network lifetime by realizing the objective of minimizing the sum of distances between the nodes and the cluster centers in a WSN network. It is demonstrated that the PCA-RA can be efficiently implemented in WSNs by forming a nearly optimalK-means-like clustering structure. In addition, it can decrease the network load while maintaining the accuracy of the sensor measurements during data aggregating process. We validate the efficacy and efficiency of the proposed algorithm by simulations. Both theoretical analyses and simulation results demonstrate that this algorithm can perform significantly with less energy consumption and thus prolong the system lifetime for the networks.

scholarly journals EARPC – Energy Aware Routing Protocol for Cooperative MIMO Scheme in WSNs

2020 ◽  
Vol 3 ◽  
pp. 22-27
Author(s):  
Kummathi Chenna Reddy ◽  
Geetha D. Devanagavi ◽  
Thippeswamy M. N.
Keyword(s):  
Energy Consumption ◽  
Network Lifetime ◽  
Routing Protocol ◽  
Energy Levels ◽  
Routing Algorithm ◽  
Cluster Head ◽  
Sensor Nodes ◽  
Energy Aware ◽  
Energy Efficient Routing ◽  
Energy Aware Routing

Wireless sensor networks are typically operated on batteries. Therefore, in order to prolong network lifetime, an energy efficient routing algorithm is required. In this paper, an energy-aware routing protocol for the co-operative MIMO scheme in WSNs (EARPC) is presented. It is based on an improved cluster head selection method that considers the remaining energy level of a node and recent energy consumption of all nodes. This means that sensor nodes with lower energy levels are less likely to be chosen as cluster heads. Next, based on the cooperative node selection in each cluster, a virtual MIMO array is created, reducing uneven distribution of clusters. Simulation results show that the proposed routing protocol may reduce energy consumption and improve network lifetime compared with the LEACH protocol

Sign in / Sign up

Export Citation Format

Share Document