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 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 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 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.

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 Performance Analysis of Mobile Wireless Sensor Network with Energy Efficient and Reliable Routing

2019 ◽  
pp. 123-133
Author(s):  
K. Neeraja
Keyword(s):  
Wireless Sensor Networks ◽  
Energy Consumption ◽  
Sensor Networks ◽  
Energy Requirement ◽  
Cluster Head ◽  
Base Station ◽  
Sensor Nodes ◽  
Wireless Sensor ◽  
Mobile Wireless ◽  
Mobile Wireless Sensor

In this paper author describing the concept of throughput and limited energy consumption while routing data to base station and will use multiple routes to forward data to base station. Wireless sensor networks (WSNs)remains resource constrict. Energy is one of the most essential resources in such networks. Hence, optimal use of energy is significant. In existing scheme sensor nodes are movable, base station is fixed and energy consumption is more. To overcome this, we are using the E2R2 protocol in which both sensor nodes & base station are mobile. The proposed protocol is hierarchical along with cluster based. All clusters contain one cluster head (CH) node, dual deputy CH nodes, also a few of ordinary sensor nodes. The reclustering time along with energy requirement has been decreases by introducing the concept of CH panel. All things Considered the reliability aspect of this protocol, it brings leading effort to provide a detailed throughput level by the BS. Topology of mobile wireless sensor networks with more no of nodes which is formed as clusters and transmission of packets between the sensor nodes is done to the base station [BS].Which is routed using E2R2 PROTOCOL, parameters such as throughput, energy spent. The simulation displays a certain proposed design successfully decreases the energy consumption among the nodes, and thus significantly improves the throughput compared to the existing protocol.

scholarly journals Cluster-Based Routing Approach in Hierarchical Wireless Sensor Networks toward Energy Efficiency using Genetic Algorithm

2020 ◽  
Vol 30.8 (147) ◽  
pp. 14-21
Author(s):  
Thanh Huong Nguyen ◽  
◽  
Dang Toan Dao ◽  
Keyword(s):  
Genetic Algorithm ◽  
Energy Efficiency ◽  
Wireless Sensor Networks ◽  
Energy Consumption ◽  
Sensor Networks ◽  
Cluster Head ◽  
Base Station ◽  
Sensor Nodes ◽  
Wireless Sensor ◽  
Hierarchical Architecture

Energy efficiency is one of the important factors when exploiting Wireless Sensor Networks, especially for increasing lifespan and performance. In the network nowadays, the number of sensor nodes can reach hundreds or thousands and can be arranged in complex hierarchical architecture. Besides, the current sensor nodes have a small size, limited battery source but are operated in vast areas. The clustered-based method has been an effective and potentially extensible means of boosting the management and operation of such large-scale networks and minimizing the overall energy consumption. In this paper, the issue of arranging and routing the nodes in the sensor network in a hierarchical manner is investigated, in which each lowest level sensor nodes are grouped in a cluster with a common cluster head, then the cluster-head plays an intermediate role transmit the information back and forth between the sensor nodes and the base station. In this way, the route to exchange information can not only be optimized with respect to the distance but also for energy spent on the communication. In order to do so, this paper proposed a novel method based on a Genetic Algorithm to establish a routing protocol to achieve energy optimization. The results demonstrate that this approach can decrease the energy consumption according to the optimized routing through clustering and increase the performance superior to the other clustering schemes.

A Node Authentication Model in Wireless Sensor Networks With Locked Cluster Generation

2021 ◽  
pp. 236-250
Author(s):  
C. R. Bharathi ◽  
Alapati Naresh ◽  
Arepalli Peda Gopi ◽  
Lakshman Narayana Vejendla
Keyword(s):  
Wireless Sensor Networks ◽  
Sensor Networks ◽  
Sensor Node ◽  
Cluster Formation ◽  
Cluster Head ◽  
Base Station ◽  
Sensor Nodes ◽  
Wireless Sensor ◽  
Cluster Generation ◽  
Secure Network

In wireless sensor networks (WSN), the majority of the inquiries are issued at the base station. WSN applications frequently require collaboration among countless sensor nodes in a network. One precedent is to persistently screen a region and report occasions. A sensor node in a WSN is initially allocated with an energy level, and based on the tasks of that sensor node, energy will be reduced. In this chapter, two proposed methods for secure network cluster formation and authentication are discussed. When a network is established then all the nodes in it must register with cluster head and then authentication is performed. The selection of cluster head is done using a novel selection algorithm and for authenticating the nodes. Also, a novel algorithm for authentication is used in this chapter. The validation and authorization of nodes are carried over by managing the keys in WSN. The results have been analyzed using NS2 simulator with an aid of list of relevant parameters.

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.

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.

A Cluster Algorithm for Wireless Sensor Networks Based on Energy Efficiency

2015 ◽  
Vol 785 ◽  
pp. 744-750
Author(s):  
Lei Gao ◽  
Qun Chen
Keyword(s):  
Energy Efficiency ◽  
Wireless Sensor Networks ◽  
Energy Consumption ◽  
Sensor Networks ◽  
Clustering Algorithm ◽  
Cluster Head ◽  
Selection Criterion ◽  
Sensor Nodes ◽  
Wireless Sensor ◽  
Head Node

In order to solve the energy limited problem of sensor nodes in the wireless sensor networks (WSN), a fast clustering algorithm based on energy efficiency for wire1ess sensor networks is presented in this paper. In the system initialization phase, the deployment region is divided into several clusters rapidly. The energy consumption ratio and degree of the node are chosen as the selection criterion for the cluster head. Re-election of the cluster head node at this time became a local trigger behavior. Because of the range of the re-election is within the cluster, which greatly reduces the complexity and computational load to re-elect the cluster head node. Theoretical analysis indicates that the timing complexity of the clustering algorithm is O(1), which shows that the algorithm overhead is small and has nothing to do with the network size n. Simulation results show that clustering algorithm based on energy efficiency can provide better load balancing of cluster heads and less protocol overhead. Clustering algorithm based on energy efficiency can reduce energy consumption and prolong the network lifetime compared with LEACH protocol.

Sign in / Sign up

Export Citation Format

Share Document