scholarly journals Energy-Efficient Clustering Multi-Hop Routing Protocol in a UWSN

Sensors ◽  
2021 ◽  
Vol 21 (2) ◽  
pp. 627
Author(s):  
Nhat-Tien Nguyen ◽  
Thien T. T. Le ◽  
Huy-Hung Nguyen ◽  
Miroslav Voznak

Underwater wireless sensor networks are currently seeing broad research in various applications for human benefits. Large numbers of sensor nodes are being deployed in rivers and oceans to monitor the underwater environment. In the paper, we propose an energy-efficient clustering multi-hop routing protocol (EECMR) which can balance the energy consumption of these nodes and increase their network lifetime. The network area is divided into layers with regard to the depth level. The data sensed by the nodes are transmitted to a sink via a multi-hop routing path. The cluster head is selected according to the depth of the node and its residual energy. To transmit data from the node to the sink, the cluster head aggregates the data packet of all cluster members and then forwards them to the upper layer of the sink node. The simulation results show that EECMR is effective in terms of network lifetime and the nodes’ energy consumption.

2019 ◽  
Vol 4 (1) ◽  
Author(s):  
Abdoulie M.S. Tekanyi ◽  
Jinadu A Braimoh ◽  
Buba G Bajoga

Energy efficiency is one of the most important challenges for Wireless Sensor Networks (WSNs). This is due to the fact that sensor nodes have limited energy capacity. Therefore, the energy of sensor nodes has to be efficiently managed to provide longer lifetime for the network. To reduce energy consumption in WSNs, a modified Energy Efficient Clustering with Splitting and Merging (EECSM) for WSNs using Cluster-Head Handover Mechanism was implemented in this research. The modified model used information of the residual energy of sensor nodes to select backup Cluster Heads (CHs) while maintaining a suitable CH handover threshold to minimize energy consumption in the network. The backup CHs take over the responsibilities of the CHs once the handover threshold is reached. The modified model was validated in terms of network lifetime and residual energy ratio with EECSM using MATLAB R2013a. Average improvements of 7.5% and 50.7% were achieved for the network lifetime and residual energy ratio respectively which indicates a significant reduction in energy consumption of the network nodes. Keywords— Clustering, Energy-Efficiency, Handover, Lifetime, Wireless Sensor Network


2020 ◽  
Vol 39 (6) ◽  
pp. 8139-8147
Author(s):  
Ranganathan Arun ◽  
Rangaswamy Balamurugan

In Wireless Sensor Networks (WSN) the energy of Sensor nodes is not certainly sufficient. In order to optimize the endurance of WSN, it is essential to minimize the utilization of energy. Head of group or Cluster Head (CH) is an eminent method to develop the endurance of WSN that aggregates the WSN with higher energy. CH for intra-cluster and inter-cluster communication becomes dependent. For complete, in WSN, the Energy level of CH extends its life of cluster. While evolving cluster algorithms, the complicated job is to identify the energy utilization amount of heterogeneous WSNs. Based on Chaotic Firefly Algorithm CH (CFACH) selection, the formulated work is named “Novel Distributed Entropy Energy-Efficient Clustering Algorithm”, in short, DEEEC for HWSNs. The formulated DEEEC Algorithm, which is a CH, has two main stages. In the first stage, the identification of temporary CHs along with its entropy value is found using the correlative measure of residual and original energy. Along with this, in the clustering algorithm, the rotating epoch and its entropy value must be predicted automatically by its sensor nodes. In the second stage, if any member in the cluster having larger residual energy, shall modify the temporary CHs in the direction of the deciding set. The target of the nodes with large energy has the probability to be CHs which is determined by the above two stages meant for CH selection. The MATLAB is required to simulate the DEEEC Algorithm. The simulated results of the formulated DEEEC Algorithm produce good results with respect to the energy and increased lifetime when it is correlated with the current traditional clustering protocols being used in the Heterogeneous WSNs.


Author(s):  
Mohit Kumar ◽  
Sonu Mittal ◽  
Md. Amir Khusru Akhtar

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.


2020 ◽  
Vol 17 (12) ◽  
pp. 5447-5456
Author(s):  
R. M. Alamelu ◽  
K. Prabu

Wireless sensor network (WSN) becomes popular due to its applicability in distinct application areas like healthcare, military, search and rescue operations, etc. In WSN, the sensor nodes undergo deployment in massive number which operates autonomously in harsh environment. Because of limited resources and battery operated sensor nodes, energy efficiency is considered as a main design issue. To achieve, clustering is one of the effective technique which organizes the set of nodes into clusters and cluster head (CH) selection takes place. This paper presents a new Quasi Oppositional Glowworm Swarm Optimization (QOGSO) algorithm for energy efficient clustering in WSN. The proposed QOGSO algorithm is intended to elect the CHs among the sensor nodes using a set of parameters namely residual energy, communication cost, link quality, node degree and node marginality. The QOGSO algorithm incorporates quasi oppositional based learning (QOBL) concept to improvise the convergence rate of GSO technique. The QOGSO algorithm effectively selects the CHs and organizes clusters for minimized energy dissipation and maximum network lifetime. The performance of the QOGSO algorithm has been evaluated and the results are assessed interms of distinct evaluation parameters.


2017 ◽  
Vol 2017 ◽  
pp. 1-12 ◽  
Author(s):  
Mohammad Baniata ◽  
Jiman Hong

The recent advances in sensing and communication technologies such as wireless sensor networks (WSN) have enabled low-priced distributed monitoring systems that are the foundation of smart cities. These advances are also helping to monitor smart cities and making our living environments workable. However, sensor nodes are constrained in energy supply if they have no constant power supply. Moreover, communication links can be easily failed because of unequal node energy depletion. The energy constraints and link failures affect the performance and quality of the sensor network. Therefore, designing a routing protocol that minimizes energy consumption and maximizes the network lifetime should be considered in the design of the routing protocol for WSN. In this paper, we propose an Energy-Efficient Unequal Chain Length Clustering (EEUCLC) protocol which has a suboptimal multihop routing algorithm to reduce the burden on the cluster head and a probability-based cluster head selection algorithm to prolong the network lifetime. Simulation results show that the EEUCLC mechanism enhanced the energy balance and prolonged the network lifetime compared to other related protocols.


2013 ◽  
Vol 787 ◽  
pp. 1050-1055 ◽  
Author(s):  
Zhi Gui Lin ◽  
Hui Qi Zhang ◽  
Xu Yang Wang ◽  
Fang Qin Yao ◽  
Zhen Xing Chen

To the disadvantages, such as high energy consumption and the energy consumption imbalance, we proposed an energy-efficient routing protocol on mobile sink (MSEERP) in this paper. In the MSEERP, the network is divided into several square virtual grids based on GAF, each grid is called a cluster, and the cluster head election method of GAF is improved. In addition, the MSEERP introduces a mobile sink in the network, the sink radios in limited number of hops and uses control moving strategy, namely the sink does not collect the information until it moves to a cluster with highest residual energy. We applied NS2 to evaluate its performance and analyze the simulation results by the energy model. Simulation results show that the MSEERP balances the energy consumption of the network, saves nodes energy and extends the network lifetime.


in WSN, clustering gives an effective way to enhance the network lifetime. Moreover It has been observed that the clustering algorithm utilizes the two main technique first is selection of cluster head and cycling it periodically in order to distribute the energy among the clusters and this in terms increases the lifetime of network. Another challenge comes with this is minimize the energy consumption. In past several algorithm has been proposed to increase the lifetime of the network and energy consumption, however these methodologies lacks from efficiency. In this paper, we have proposed a methodologies named as EE-CI (Energy Efficient Clustering using Interconnection), along with the random updation. Here the networks are parted into different clusters, the cluster updation are done based on the CHC scheme. Moreover, in proposed methodology cluster updation and data sample is determined through the change in sensor data. Here we propose a method for sampling sensor and CHC for selecting the cluster head to balance the energy and improvise the energy efficiency. Moreover, the proposed methodology is evaluated and the result is demonstrated by considering the Leach as existing methodology, experiments results shows that the proposed methodology outperforms the existing methodology.


Mathematics ◽  
2020 ◽  
Vol 8 (9) ◽  
pp. 1515 ◽  
Author(s):  
Alma Rodríguez ◽  
Carolina Del-Valle-Soto ◽  
Ramiro Velázquez

The usage of wireless sensor devices in many applications, such as in the Internet of Things and monitoring in dangerous geographical spaces, has increased in recent years. However, sensor nodes have limited power, and battery replacement is not viable in most cases. Thus, energy savings in Wireless Sensor Networks (WSNs) is the primary concern in the design of efficient communication protocols. Therefore, a novel energy-efficient clustering routing protocol for WSNs based on Yellow Saddle Goatfish Algorithm (YSGA) is proposed. The protocol is intended to intensify the network lifetime by reducing energy consumption. The network considers a base station and a set of cluster heads in its cluster structure. The number of cluster heads and the selection of optimal cluster heads is determined by the YSGA algorithm, while sensor nodes are assigned to its nearest cluster head. The cluster structure of the network is reconfigured by YSGA to ensure an optimal distribution of cluster heads and reduce the transmission distance. Experiments show competitive results and demonstrate that the proposed routing protocol minimizes the energy consumption, improves the lifetime, and prolongs the stability period of the network in comparison with the stated of the art clustering routing protocols.


2018 ◽  
Vol 7 (S1) ◽  
pp. 119-122
Author(s):  
G. Pattabirani ◽  
K. Selvakumar

Wireless Sensor Network (WSN) is used in almost all applications in developing environment. This is due to their ability and easy implementation through several applications. The most important criteria in WSN are to minimize the energy consumption and improve the network lifetime. Clustering algorithms are considered as one of the effective way to improve the network lifetime in WSN. Hybrid, Energy-Efficient and Distributed (HEED) clustering approach uses energy-efficient clustering algorithm. This paper proposes an Enhanced Rotational HEED (ER-HEED) protocol using super cluster head for minimizing energy consumption and to improve the network lifetime. The proposed work is carried out in two stages, first stage, super cluster head is introduced. In second stage, the node with maximum threshold is chosen as a cluster head on rotation within in the cluster. The results show that the ER-HEED performs well when compared with HEED and LEACH.


Author(s):  
Kummathi Chenna Reddy ◽  
Geetha D. Devanagavi ◽  
Thippeswamy M. N.

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