Performance Analysis of RNC Clustering Protocol in Wireless Sensor Network

2019 ◽  
Vol 10 ◽  
Author(s):  
Piyush Rawat ◽  
Siddhartha Chauhan
Keyword(s):  
Energy Consumption ◽  
Network Performance ◽  
Energy Levels ◽  
Cluster Head ◽  
Base Station ◽  
Sensor Nodes ◽  
Wireless Sensor ◽  
Threshold Function ◽  
Efficient Manner ◽  
Clustering Protocol

Background and Objective: The functionalities of wireless sensor networks (WSN) are growing in various areas, so to handle the energy consumption of network in an efficient manner is a challenging task. The sensor nodes in the WSN are equipped with limited battery power, so there is a need to utilize the sensor power in an efficient way. The clustering of nodes in the network is one of the ways to handle the limited energy of nodes to enhance the lifetime of the network for its longer working without failure. Methods: The proposed approach is based on forming a cluster of various sensor nodes and then selecting a sensor as cluster head (CH). The heterogeneous sensor nodes are used in the proposed approach in which sensors are provided with different energy levels. The selection of an efficient node as CH can help in enhancing the network lifetime. The threshold function and random function are used for selecting the cluster head among various sensors for selecting the efficient node as CH. Various performance parameters such as network lifespan, packets transferred to the base station (BS) and energy consumption are used to perform the comparison between the proposed technique and previous approaches. Results and Discussion: To validate the working of the proposed technique the simulation is performed in MATLAB simulator. The proposed approach has enhanced the lifetime of the network as compared to the existing approaches. The proposed algorithm is compared with various existing techniques to measure its performance and effectiveness. The sensor nodes are randomly deployed in a 100m*100m area. Conclusion: The simulation results showed that the proposed technique has enhanced the lifespan of the network by utilizing the node’s energy in an efficient manner and reduced the consumption of energy for better network performance.

scholarly journals Energy Consumption Based Low Energy Aware Gateway (LEAG) Protocol in Wireless Sensor Networks

2019 ◽  
Vol 8 (5S3) ◽  
pp. 128-132 ◽  
Keyword(s):  
Wireless Sensor Networks ◽  
Energy Consumption ◽  
Sensor Networks ◽  
Cluster Head ◽  
Base Station ◽  
Low Energy ◽  
Secure Routing ◽  
Sensor Nodes ◽  
Wireless Sensor ◽  
Energy Aware

Wireless Sensor Networks (WSN) consists of a large amount of nodes connected in a self-directed manner. The most important problems in WSN are Energy, Routing, Security, etc., price of the sensor nodes and renovation of these networks is reasonable. The sensor node tools included a radio transceiver with an antenna and an energy source, usually a battery. WSN compute the environmental conditions such as temperature, sound, pollution levels, etc., WSN built the network with the help of nodes. A sensor community consists of many detection stations known as sensor nodes, every of which is small, light-weight and portable. Nodes are linked separately. Each node is linked into the sensors. In recent years WSN has grow to be an essential function in real world. The data’s are sent from end to end multiple nodes and gateways, the data’s are connected to other networks such as wireless Ethernet. MGEAR is the existing mechanism. It works with the routing and energy consumption. The principal problem of this work is choosing cluster head, and the selection is based on base station, so the manner is consumes energy. In this paper, develop the novel based hybrid protocol Low Energy Aware Gateway (LEAG). We used Zigbee techniques to reduce energy consumption and routing. Gateway is used to minimize the energy consumption and data is send to the base station. Nodes are used to transmit the data into the cluster head, it transmit the data into gateway and gateway compress and aggregate the data then sent to the base station. Simulation result shows our proposed mechanism consumes less energy, increased throughput, packet delivery ration and secure routing when compared to existing mechanism (MGEAR).

scholarly journals An Energy-Aware Method for Selecting Cluster Heads in Wireless Sensor Networks

2020 ◽  
Vol 10 (21) ◽  
pp. 7886
Author(s):  
Atefeh Rahiminasab ◽  
Peyman Tirandazi ◽  
M. J. Ebadi ◽  
Ali Ahmadian ◽  
Mehdi Salimi
Keyword(s):  
Wireless Sensor Networks ◽  
Sensor Networks ◽  
Network Lifetime ◽  
Cluster Head ◽  
Base Station ◽  
Energy Resources ◽  
Sensor Nodes ◽  
Wireless Sensor ◽  
Dynamic Clustering ◽  
Clustering Protocol

Wireless sensor networks (WSNs) include several sensor nodes that have limited capabilities. The most critical restriction in WSNs is energy resources. Moreover, since each sensor node’s energy resources cannot be recharged or replaced, it is inevitable to propose various methods for managing the energy resources. Furthermore, this procedure increases the network lifetime. In wireless sensor networks, the cluster head has a significant impact on system global scalability, energy efficiency, and lifetime. Furthermore, the cluster head is most important in combining, aggregating, and transferring data that are received from other cluster nodes. One of the substantial challenges in a cluster-based network is to choose a suitable cluster head. In this paper, to select an appropriate cluster head, we first model this problem by using multi-factor decision-making according to the four factors, including energy, mobility, distance to centre, and the length of data queues. Then, we use the Cluster Splitting Process (CSP) algorithm and the Analytical Hierarchy Process (AHP) method in order to provide a new method to solve this problem. These four factors are examined in our proposed approach, and our method is compared with the Base station Controlled Dynamic Clustering Protocol (BCDCP) algorithm. The simulation results show the proposed method in improving the network lifetime has better performance than the base station controlled dynamic clustering protocol algorithm. In our proposed method, the energy reduction is almost 5% more than the BCDCP method, and the packet loss rate in our proposed method is almost 25% lower than in the BCDCP method.

scholarly journals Cluster Head Relocation Based on Selfish Herd Hypothesis for Prolonging the Life Span of Wireless Sensor Networks

Electronics ◽  
2018 ◽  
Vol 7 (12) ◽  
pp. 403 ◽  
Author(s):  
Goran Popovic ◽  
Goran Djukanovic ◽  
Dimitris Kanellopoulos
Keyword(s):  
Wireless Sensor Networks ◽  
Sensor Networks ◽  
Network Lifetime ◽  
Network Performance ◽  
Cluster Head ◽  
Base Station ◽  
Sensor Nodes ◽  
Wireless Sensor ◽  
Total Energy Consumption ◽  
Selfish Herd

Clustering achieves energy efficiency and scalable performance in wireless sensor networks (WSNs). A cluster is formed of several sensor nodes, one of them selected as the cluster head (CH). A CH collects information from the cluster members and sends aggregated data to the base station or another CH. In such a hierarchical WSN, some nodes are possibly moveable or nomadic (relocated periodically), while others are static. The mobility of sensor nodes can improve network performance and prolong network lifetime. This paper presents the idea of mobile, solar-powered CHs that relocate themselves inside clusters in such a way that the total energy consumption in the network is reduced and the network lifetime is extended. The positioning of CHs is made in each round based on a selfish herd hypothesis, where the leader retreats to the center of gravity. Based on this idea, the CH-active algorithm is proposed in this study. Simulation results show that this algorithm has benefits in terms of network lifetime and in the prolongation of the duration of network stability period.

scholarly journals Efficient organization of nodes in wireless sensor networks (clustering location-based LEACH)

2022 ◽  
Vol 12 (1) ◽  
pp. 1011
Author(s):  
Mohammed Réda El Ouadi ◽  
Abderrahim Hasbi
Keyword(s):  
Wireless Sensor Networks ◽  
Energy Consumption ◽  
Sensor Networks ◽  
Network Lifetime ◽  
Rapid Development ◽  
Cluster Head ◽  
Base Station ◽  
Sensor Nodes ◽  
Wireless Sensor ◽  
Main Element

The rapid development of connected devices and wireless communication has enabled several researchers to study wireless sensor networks and propose methods and algorithms to improve their performance. Wireless sensor networks (WSN) are composed of several sensor nodes deployed to collect and transfer data to base station (BS). Sensor node is considered as the main element in this field, characterized by minimal capacities of storage, energy, and computing. In consequence of the important impact of the energy on network lifetime, several researches are interested to propose different mechanisms to minimize energy consumption. In this work, we propose a new enhancement of low-energy adaptive clustering hierarchy (LEACH) protocol, named clustering location-based LEACH (CLOC-LEACH), which represents a continuity of our previous published work location-based LEACH (LOC-LEACH). The proposed protocol organizes sensor nodes into four regions, using clustering mechanism. In addition, an efficient concept is adopted to choose cluster head. CLOC-LEACH considers the energy as the principal metric to choose cluster heads and uses a gateway node to ensure the inter-cluster communication. The simulation with MATLAB shows that our contribution offers better performance than LEACH and LOC-LEACH, in terms of stability, energy consumption and network lifetime.

scholarly journals Energy Efficient Receiver Signal Strength Indicator Based Clustered Routing Algorithm for Wireless Sensor Network

2020 ◽  
Vol 9 (3) ◽  
pp. 2590-2593
Keyword(s):  
Energy Consumption ◽  
Wireless Sensor Network ◽  
Sensor Network ◽  
Cluster Head ◽  
Signal Strength ◽  
Base Station ◽  
Sensor Nodes ◽  
Wireless Sensor ◽  
Cluster Head Selection ◽  
Head Node

Robust and efficient algorithms for routing and other process for a wireless sensor network are under active development due to technological advancements on wireless transmission systems. Each of the sensor nodes in a wireless sensor network either transmits or forwards the data packets to the base station. The main objective of the majority of the work in the literature is to save the energy consumption efficiently. The cluster based routing mechanism helps to achieve low energy consumption within the network. The network organizes its nodes as a cluster and selects a particular node as cluster head to manage the transmission within and between clusters. The majority of the clustering approach selects the cluster head using a thresholding based approach. Nodes having energy level higher than the threshold are the candidates for the cluster head selection. In the proposed approach the nodes remaining energy and the sum of distance between individual nodes to the cluster head node is considered. Optimal cluster head selection will help to increase the overall life time of the network. The distance between the sensor nodes is estimated using RSSI (Received Signal Strength Indicator) and other parameters measured from the physical layer. Experiments are conducted with simulation environment created with the NS-2 simulator and efficiency of the approach is analyzed in detail.

scholarly journals Tree-Based Multihop Routing Method for Energy Efficiency of Wireless Sensor Networks

2021 ◽  
Vol 2021 ◽  
pp. 1-14
Author(s):  
Jin Yong ◽  
Zhou Lin ◽  
Wei Qian ◽  
Bai Ke ◽  
Wang Chen ◽  
...  
Keyword(s):  
Wireless Sensor Networks ◽  
Energy Consumption ◽  
Sensor Networks ◽  
Cluster Head ◽  
Residual Energy ◽  
Base Station ◽  
Sensor Nodes ◽  
Wireless Sensor ◽  
Network Resources ◽  
Multihop Routing

In wireless sensor networks (WSNs), due to the limited energy of sensor nodes, how to design efficient hierarchical routing algorithms to balance network resources and extend network life is an important problem to be solved. Aiming at the problems such as random selection of cluster head, redundancy of working node, and construction of cluster head transmission path, which affect network energy consumption, this paper proposes a multihop routing algorithm based on path tree (MHRA-PT) to optimize the network energy. Firstly, some nodes are those close to the base station and have large remaining energy which are selected to construct a cluster head set. Then, after clustering, each cluster is divided into different regions, and in each region, nodes with residual energy greater than the average residual energy of the cluster are selected as a working node. Finally, the cluster heads are sorted according to their distance from base station, and the next hop node is selected for each cluster head in turn until a path tree rooted at base station is formed completely, leading to data transmission from working node to base station. Simulation results show that the proposed algorithm can effectively reduce network energy consumption, balance network resources, and prolong network life cycle.

Hybridization of the LEACH Protocol with Penalized Fuzzy C-Means (PFCM) and Self-Organization Map (SOM) Algorithms for Decreasing Energy in Wireless Sensor Networks

2014 ◽  
Vol 10 (3) ◽  
pp. 46-64 ◽  
Author(s):  
Asgarali Bouyer ◽  
Abdolreza Hatamlou
Keyword(s):  
Wireless Sensor Networks ◽  
Energy Consumption ◽  
Sensor Networks ◽  
Cluster Head ◽  
Base Station ◽  
Sensor Nodes ◽  
Wireless Sensor ◽  
Self Organization ◽  
Fuzzy C Means ◽  
Leach Protocol

Wireless Sensor Networks (WSNs) consist of many sensor nodes, which are used for capturing the essential data from the environment and sending it to the Base Station (BS). Most of the research has been focused on energy challenges in WSN. There are many notable studies on minimization of energy consumption during the process of sensing the important data from the environment where nodes are deployed. Clustering-based routing protocols are an energy-efficient protocols that improve the lifetime of a wireless sensor network. The objective of the clustering is to decrease the total transmission power by aggregating into a single path for prolonging the network lifetime. However, the problem of unbalanced energy consumption exists in some cluster nodes in the WSNs. In this paper, a hybrid algorithm is proposed for clustering and cluster head (CH) election. The proposed routing protocol hybridized Penalized Fuzzy C-Means (PFCM) and Self Organization Map (SOM) algorithms with LEACH protocol for the optimum numbers of the CHs and the location of them. Simulation results reveal that the proposed algorithm outperforms other existing protocols in terms of network life, number of dead sensor nodes, energy consumption of the network and convergence rate of the algorithm in comparison to the LEACH algorithm.

scholarly journals AN EFFICIENT LOAD BALANCING CLUSTERING SCHEME FOR DATA CENTRIC WIRELESS SENSOR NETWORKS

2012 ◽  
pp. 24-28 ◽  
Author(s):  
K R Yadav ◽  
Vipin Pal ◽  
Girdhari Singh ◽  
R P Yadav
Keyword(s):  
Wireless Sensor Networks ◽  
Energy Consumption ◽  
Sensor Networks ◽  
Load Balancing ◽  
Death Rate ◽  
Cluster Head ◽  
Base Station ◽  
Sensor Nodes ◽  
Wireless Sensor ◽  
Frame Length

Clustering is an efficient approach to capitalize the energy of energy constraint sensor nodes in wireless sensor networks. Clustering schemes do not guarantee formation of clusters with equal number of nodes. So data frames transmitted by the nodes vary. TDMA schedule of nodes of smaller cluster is smaller than others that results more number of data frames and hence more energy consumption. The non uniform energy consumption of nodes affects the load balancing of network and these nodes are more prone to die earlier than others. In this paper, an improved scheme for cluster head selection is proposed. Clusters having variable frame slots for nodes are applied to E-LEACH and improved E-LEACH to make the cluster more load balanced. Simulation is carried out in NS-2 to analyze the performance of E-LEACH and improved E-LEACH with variable frame length. Variable frame slot scheme for clusters is also measured with the varying distance of base station from the field. Simulation results show that clustering with variable frame length has an improvement of 7% in node death rate over E-LEACH and an improvement of 9% in node death rate over improved ELEACH. Results suggest that variable frame length scheme improves the performance of clustering schemes for WSNs and have most significant result at base station located at 75m from the field.

scholarly journals NEW CLUSTERING SCHEMES FOR WIRELESS SENSOR NETWORKS

2010 ◽  
Vol 11 (1) ◽  
pp. 51-69
Author(s):  
S. M. Mazinani ◽  
J. Chitizadeh ◽  
M. H. Yaghmaee ◽  
M. T. Honary ◽  
F. Tashtarian
Keyword(s):  
Wireless Sensor Networks ◽  
Energy Consumption ◽  
Sensor Networks ◽  
Clustering Algorithm ◽  
Cluster Head ◽  
Residual Energy ◽  
Base Station ◽  
Wireless Sensor ◽  
Cluster Heads ◽  
Clustering Protocol

In this paper, two clustering algorithms are proposed. In the first one, we investigate a clustering protocol for single hop wireless sensor networks that employs a competitive scheme for cluster head selection. The proposed algorithm is named EECS-M that is a modified version to the well known protocol EECS where some of the nodes become volunteers to be cluster heads with an equal probability.  In the competition phase in contrast to EECS using a fixed competition range for any volunteer node, we assign a variable competition range to it that is related to its distance to base station. The volunteer nodes compete in their competition ranges and every one with more residual energy would become cluster head. In the second one, we develop a clustering protocol for single hop wireless sensor networks. In the proposed algorithm some of the nodes become volunteers to be cluster heads. We develop a time based competitive clustering algorithm that the advertising time is based on the volunteer node’s residual energy. We assign to every volunteer node a competition range that may be fixed or variable as a function of distance to BS. The volunteer nodes compete in their competition ranges and every one with more energy would become cluster head. In both proposed algorithms, our objective is to balance the energy consumption of the cluster heads all over the network. Simulation results show the more balanced energy consumption and longer lifetime.

scholarly journals An Energy-Aware Clustering Protocol Based Grid For WSN

2018 ◽  
Vol 2 (4) ◽  
pp. 239
Author(s):  
Yousif Khalid Yousid ◽  
R Badlishah ◽  
N. Yaakob ◽  
A Amir
Keyword(s):  
Energy Efficiency ◽  
Energy Consumption ◽  
Load Balancing ◽  
Cluster Head ◽  
Sensor Nodes ◽  
Wireless Sensor ◽  
Energy Aware ◽  
Clustering Protocol ◽  
Critical Problems ◽  
Reduce Energy Consumption

One of the most critical problems in Wireless Sensor Networks (WSNs) is to how to reduce energy consumption and prolong the network lifetime of WSNs. Clustering is of the solutions, which have been used to reduce energy consumption by partition the network into clusters. However; most of the clustering schemes select the cluster head (CH) either randomly or based on centralized manner. Both approaches lead to deficient utilization of WSN resources. Therefore, the purpose of this paper is to illustrate a new multi-hop clustering protocol called EACPG, which aimed to provide energy efficiency and maintain load balancing. In EACPG the network is divvied into multiple numbers of virtual square grids. Also, different parameters are considered for cluster head election based on distributed manner. In addition, a new mechanism for CH rotation is used in order to maintain load balancing between CHs.  Finally, Results show that the proposed scheme has better performance in term of energy consumption and the number of alive sensor nodes and throughput.

Sign in / Sign up

Export Citation Format

Share Document