10,904 research outputs found

    Enhancing the Stability of the Improved-LEACH Routing Protocol for WSNs

    Get PDF
    Recently, increasing battery lifetime in wireless sensor networks has turned out to be one of the major challenges faced by researchers. The sensor nodes in wireless sensor networks use a battery as their power source, which is hard to replace during deployment. Low Energy Adaptive Clustering Hierarchy (LEACH) is one of the most prominent wireless sensor network routing protocols that have been proposed to improve network lifetime by utilizing energy-efficient clustering. However, LEACH has some issues related to cluster-head selection, where the selection is done randomly. This leads to rapid loss of energy in the network. Improved LEACH is a LEACH alternative that has the ability to increase network lifetime by using the nodes' residual energy and their distance to the base station to select cluster-head nodes. However, Improved LEACH causes reduced stability, where the stability period is the duration before the death of the first node. The network stability period is important for applications that require reliable feedback from the network. Thus, we were motivated to investigate the Improved LEACH algorithm and to try to solve the stability problem. A new protocol is proposed in this paper: Stable Improved Low Energy Adaptive Clustering Hierarchy (SILEACH), which was developed to overcome the flaws of the Improved LEACH protocol. SILEACH balances the load between the nodes by utilizing an optimized method that considers the nodes' distance to the base station and their residual energy to select the cluster-head nodes and considers the nodes' distance to the cluster head and the base station to form clusters. The simulation results revealed that SILEACH is significantly more efficient than Improved LEACH in terms of stability period and network lifetime

    Optimal leach protocol with improved bat algorithm in wireless sensor networks

    Full text link
    © 2019, Korean Society for Internet Information. All rights reserved. A low-energy adaptive clustering hierarchy (LEACH) protocol is a low-power adaptive cluster routing protocol which was proposed by MIT’s Chandrakasan for sensor networks. In the LEACH protocol, the selection mode of cluster-head nodes is a random selection of cycles, which may result in uneven distribution of nodal energy and reduce the lifetime of the entire network. Hence, we propose a new selection method to enhance the lifetime of network, in this selection function, the energy consumed between nodes in the clusters and the power consumed by the transfer between the cluster head and the base station are considered at the same time. Meanwhile, the improved FTBA algorithm integrating the curve strategy is proposed to enhance local and global search capabilities. Then we combine the improved BA with LEACH, and use the intelligent algorithm to select the cluster head. Experiment results show that the improved BA has stronger optimization ability than other optimization algorithms, which the method we proposed (FTBA-TC-LEACH) is superior than the LEACH and LEACH with standard BA (SBA-LEACH). The FTBA-TC-LEACH can obviously reduce network energy consumption and enhance the lifetime of wireless sensor networks (WSNs)

    Energy Efficient System for Wireless Sensor Networks using Modified RECHS Protocol

    Get PDF
    The area of wireless sensor networks (WSNs) is one of the emerging and fast growing fields in the scientific world. This has brought about developing low cost, low-power and multi-function sensor nodes. Prolonged network lifetime, scalability, node mobility and load balancing are important requirements for many WSN applications. Clustering the sensor nodes is an effective technique to achieve these goals. Cluster-based routing protocol is currently a hot research in wireless sensor network. In this paper, we have added additional criteria for the selection of cluster heads in a Redundant and Energy-efficient Cluster head Selection Protocol(RECHS) and compared results with Energy Aware Low Energy Adaptive Clustering Hierarchy (EA-LEACH) protocol. This modified RECHS significantly increases the lifetime, reliability of the network. Simulation results show that comparison between two methods (Modified RECHS and EA- LEACH) for LEACH protocol on the basis of network lifetime (stability period), number of cluster heads are present per round, number of alive node are present per round and throughput of data transfer in the network. DOI: 10.17762/ijritcc2321-8169.15016

    Stochastic Approach for Energy-Efficient Clustering in WSN

    Get PDF
    Abstract- Wireless sensor networks are self-organizing networks in which sensor nodes with limited resource are scattered in an area of interest to gather information. WSNs need to have effective node2019;s energy management methods for stable and seamless communication. Power efficient clustering is done in WSN to prolong the life of the network. In WSN, many algorithms are developed to save energy of sensor nodes and to increase the lifetime of the network. This paper provides an energy efficient clustering algorithm inspired by prophet routing protocol to enhance the cluster based operation of the nodes. Adaptive learning is implemented for head selection for efficientcommunication. Simulation results confirm the efficiency of the mechanism

    Base station controlled adaptive clustering for Qos in wireless sensor networks

    Get PDF
    Wireless Sensor Networks (WSNs) are a collection of nodes organized into a cooperative network. Harsh and dynamic physical environments and extremely limited resources are major obstacles for satisfying QoS metrics. This paper proposes and analyzes an Base station Controlled Adaptive Clustering Protocol (BCACP) for Wireless Sensor Networks suitable to support real time traffic. The protocol achieves fault tolerance and energy efficiency through a dual cluster head mechanism and guarantees the desired QoS by including delay and bandwidth parameters in the route selection process. Simulation results indicate that BCACP reduces overall energy consumption and improves network lifetime while maintaining required QoS

    Analisis Perbandingan Teknik Pemilihan Cluster Head Pada Wireless Sensor Network Berbasis Clustering Menggunakan Algoritma Routing Protocol LEACH dan G-LEACH

    Get PDF
    Wireless Sensor Network (WSN) is a series of wireless networks consisting of several nodes in a limited area. Low Energy Adaptive Clustering Hierarchy (LEACH) and Grid-Based Low Energy Adaptive Clustering Hierarchy (G-LEACH) methods are clustering methods used to collet data by clustering nodes in the WSN area. The clustering process for both methods is the same, namely by select node as the Cluster head (CH) whose job is to collet data from other nodes to the sink. The selection of CH is carried out in each round by taking into account the probability formula used and the largest the remaining energy at that node. This study aims to determine the quality comparison of CH selection techniques in clustering-based routing protocol on WSN. The result of the study show that the G-LEACH routing protocol has good quality CH selection techniques and a long network lifetime compared to LEACH but requires a long time to reach the CH selection proces

    DEKCS: a dynamic clustering protocol to prolong underwater sensor networks

    Get PDF
    Energy consumption is a critical issue in the design of wireless underwater sensor networks (WUSNs). Data transfer in the harsh underwater channel requires higher transmission powers compared to an equivalent terrestrial-based network to achieve the same range. However, battery-operated underwater sensor nodes are energy-constrained and require that they transmit with low power to conserve power. Clustering is a technique for partitioning wireless networks into groups where a local base station (cluster head) is only one hop away. Due to the proximity to the cluster head, sensor nodes can lower their transmitting power, thereby improving the network energy efficiency. This paper describes the implementation of a new clustering algorithm to prolong the lifetime of WUSNs. We propose a new protocol called distance- and energy-constrained k-means clustering scheme (DEKCS) for cluster head selection. A potential cluster head is selected based on its position in the cluster and based on its residual battery level. We dynamically update the residual energy thresholds set for potential cluster heads to ensure that the network fully runs out of energy before it becomes disconnected. Also, we leverage the elbow method to dynamically select the optimal number of clusters according to the network size, thereby making the network scalable. Our evaluations show that the proposed scheme outperforms the conventional low-energy adaptive clustering hierarchy (LEACH) protocol by over 90% and an optimised version of LEACH based on k-means clustering by 42%

    Improving on the network lifetime of clustered-based wireless sensor network using modified leach algorithm

    Get PDF
    Wireless sensor networks (WSNs) composed from a large number of sensor node with the ability to sense and process data in the physical world in a timely manner. The sensor nodes contain a battery constraint which limit the network lifetime. Due to energy constraints, the deployment of WSNs will required advance techniques to maintain the network lifetime. A clustering based routing algorithm called Low- Energy Adaptive Clustering Hierarchy (LEACH) was proposed as a solution for low power consumption. This document is a study about LEACH algorithm where the implementation was done using OMNeT++ network simulator to study the performance of this algorithm in term of network lifetime. OMNeT++ was selected as a simulator because it provides some important features for this project like very good scalability unlike other simulators do. During this study, LEACH algorithm shows some drawbacks that need an improvements to overcome it as to improve the performance. Then, the modified LEACH algorithm was proposed where the improvement was done in cluster head selection based on LEACH. In cluster head selection, modified LEACH taking into account the residual energy of each node for calculation of the threshold value for next round. Meanwhile in LEACH, the cluster head selection was based on distributed algorithm. Both of these protocols was implemented in network simulator to compare the performance. This study shows that there were a better performance achieved by modified LEACH depends on the results obtained
    corecore