scholarly journals An Improved Clustering Using by Likely Attributable Function and Informed Selection in WSN for Science of Management and Engineering

Author(s):  
Tarlan Motamedi Nia ◽  
Rohollah Omidvar ◽  
Elham Azarm

Wireless sensors networks (WSNs) are traditionally composed of large number of tiny homogenous sensors nodes connected through a wireless network that gather data to be treated locally or relayed to the sink node through multi-hop wireless transmission. The low-energy adaptive clustering hierarchy (LEACH) protocol is one of the Famous protocols used in the wireless sensor networks (WSNs). The LEACH protocol in wireless sensor network suffers from many Bugs and many researchers proposed different methods to mitigate them. In this paper, we propose two ideas in a format for improving leach protocol. For Cluster head selection we used a Likely Attributable Function that in this function used from a factor. This factor that we called the informed selection factor helps to farther nodes not selection for cluster head. This significantly decreases the energy consumption and increases the lifetime of associated nodes. Simulation is conducted in using MATLAB results are analyzed for energy consumption.

Author(s):  
Taous Lechani ◽  
Victor Tourtchine ◽  
Said Amari

<p>The limited energy of nodes in wireless sensor networks and the<br />impossibility of replacing their batteries, have lead to protocols development<br />which optimize and balance the energy consumption over the network.<br />LEACH is the most used hierarchical protocol. However, one major<br />weakness of the LEACH protocol lies in both of its random cluster formation<br />and cluster head election. In this paper, we present two new protocols based<br />virtual grid clustering on coverage area. In the first one, sensing area is<br />devided into grids as squares named as VSG-LEACH and in the second one<br />into grids as hexagons named as VHG-LEACH. In each zone, one cluster<br />head is elected according to its residual energy and its distance from the cell<br />center. The simulation results show that the network lifetime is prolonged by<br />169.67% and the energy consumption is improved by 80.97% compared to<br />LEACH protocol.</p>


2016 ◽  
Vol 8 (3) ◽  
pp. 76 ◽  
Author(s):  
Ridha Azizi

Extend the life of a wireless sensor network (WSN) is a fundamental challenge, as they have a limited supply. Multiple protocols and approaches have been proposed to minimize power consumption. Routing protocols and especially the hierarchical approach is one of the techniques used to minimize energy consumption and to improve the duration of network life. In this paper we propose a new approach to transfer and select the CH (Cluster Head). ART-LEACH (Advanced Routing Transfer- Low-Energy Adaptive Clustering Hierarchy) is a self-organizing protocol based on clustering. Our approach is to use energy more evenly the selected nodes as CH. We evaluated the performance of LEACH (Low-Energy Adaptive Clustering Hierarchy) and IB-LEACH (Improved and Balanced Low Energy Adaptive Clustering Hierarchy) protocol with the proposed new approach using MATLAB as a simulation tool. The simulation results showed that our proposal provides a reduction in energy consumption and increase the duration of network life.


2021 ◽  
Vol 4 (2) ◽  
pp. 25
Author(s):  
Anupkumar Bongale ◽  
Arunkumar Bongale ◽  
Satish Kumar ◽  
Rahul Joshi ◽  
Kishore Bhamidipati

Efficient energy utilization and network life prolongation are primary objectives to be considered when designing a Wireless Sensor Network. Cluster-based routing protocols are most suitable for achieving such goals. Energy and Optimal Inter Cluster Head Distance (EOICHD) is a cluster-based hierarchical routing protocol inspired by the Low-Energy Adaptive Clustering Hierarchy (LEACH) protocol. EOICHD resolves the problems associated with LEACH protocol, such as selecting cluster head nodes in close proximity. By carefully selecting the cluster head nodes based on residual energy and optimal inter-cluster head distance, EOICHD ensures that selected cluster head nodes are separated by a certain optimal distance. This approach ensures uniform distribution of cluster head nodes across the entire network. The study of the EOICHD protocol presented so far is not sufficient. Hence, in this paper, we propose three variants of EOICHD protocol to understand its behavior in a better manner. A comparative analysis of all three EOICHD variants, LEACH and LEACH-central constrained (LEACH-C) protocol, is performed by considering comparative parameters such as alive nodes, cumulative network energy, data packets arrived at the base station, and stability of the network.


Author(s):  
Sama Hussam Sabah ◽  
Muayad Sadik Croock

Energy-efficiency ofwireless sensor networks (WSN) becomes an essential issue in the research area. This is because of the energy constraints in WSN that depend on a battery, which is difficult to replace or recharge; therefore, multiple clustering algorithms were proposed to achieve efficiency in using the available energy as much as possible. This paper proposed energy-efficient and fault-tolerance algorithms that enhance thelow energy adaptive clustering hierarchy (LEACH) protocol by three algorithms. The first focuses on selecting the best cluster head and the second focuses on minimizing the required nodes within the same cluster. Simultaneously, the third fault tolerance algorithm uses software engineering techniques like sleep schedules to increase network lifetime as much as possible. The testing results of the proposed algorithms prove the claim of enhancing the lifetime of WSN. In order to check improvement of lifetime of WSN we have compered the results of the proposed algorithms with standered algorthim. The results show prove the claim of enhancing the life-time of WSN, where the total lifetime of WSN rise from about 550 rounds to reach 4100 when utilized self-checking process and rised up to 5200 after enhance minimum distans.


2013 ◽  
Vol 442 ◽  
pp. 532-537
Author(s):  
Xian Li Li ◽  
Jia Wei Zhang ◽  
Liang Bing Liu

Considering the shortage of LEACH protocol, a novel dynamic multi-hop routing protocol named Balance Energy-efficient and Real-time with Reliable communication protocol based on Connected Dominant Set (BERR-CDS) is proposed in this paper. BERR-CDS protocol fully takes account of the energy consumption of an individual node and entire network, a rational transmission path from source node to sink node is searched, aiming at the network topology changes which are caused by the death of cluster head, the invalidation of cluster member nodes and new nodes joining, BERR-CDS designs the corresponding valid mechanism to respond, and it can rapidly adapt to the topology change of network. Simulation results show that BERR-CDS protocol has better performances in term of energy consumption, network lifetime and reliability, it is an ideal routing protocol in wireless sensor networks.


Author(s):  
Asgarali Bouyer ◽  
Abdolreza Hatamlou

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.


2014 ◽  
Vol 665 ◽  
pp. 745-750
Author(s):  
Qi Gong Chen ◽  
Yong Zhi Wang ◽  
Li Sheng Wei ◽  
Wen Gen Gao

Energy consumption is a hot issue in WSNs (Wireless Sensor Networks). In this paper, we present an improved clustering algorithm. By changing the order of traditional WSNs clustering algorithm, this algorithm uses k-means clustering firstly base on optimal number of cluster head is determined; Then selects cluster head by an improved LEACH (Low Energy Adaptive Clustering Hierarchy) algorithm; Finally, Our experimental results demonstrate that this approach can reduces energy consumption and increases the lifetime of the WSNs.


2014 ◽  
Vol 536-537 ◽  
pp. 744-747
Author(s):  
Zhong Min Li

Energy consumption is an open issue in research field of Wireless Sensor Networks (WSNs). Low Energy Adaptive Clustering Hierarchy (LEACH) protocol is the most additional routing protocol in WSNs. In LEACH, Cluster Head (CH) is selected randomly, not considering any parameter such as node energy, distance, which causes shortening its lifetime while energy consumption is unbalanced in WSNs. In this paper, it proposes a new LEACH-based protocol, energy consumption balance LEACH protocol. Firstly, all nodes are grouped based on their locations, and a CH is elected in every group, which ensures CHs even distribution in the network area. And an important factor selecting CHs, node energy is considered, which further energy consumption in WSNs. The results of simulation show that ECB-LEACH can increase energy efficiency and prolong the network lifetime.


2020 ◽  
Vol 2020 ◽  
pp. 1-7
Author(s):  
Wenguang Song ◽  
Haiyu Chen ◽  
Qiujuan Zhang ◽  
Bingxin Zhang ◽  
Hao Wang ◽  
...  

Leach (low energy adaptive clustering hierarchy) algorithm is a self-clustering topology algorithm. Its execution process is cyclical. Each cycle is divided into two phases: cluster building phase and stable data communication phase. In the stage of cluster building, the adjacent nodes cluster dynamically and randomly generate cluster heads. In the data communication phase, the nodes in the cluster send the data to the cluster head, and the cluster head performs data fusion and sends the results to the aggregation node. Because the cluster head needs to complete data fusion, communication with the convergence node and other works, the energy consumption is large. Leach algorithm can ensure that each node acts as cluster head with equal probability, so that the nodes in the network consume energy relatively evenly. The basic idea of Leach algorithm is to randomly select cluster head nodes in a circular way. It evenly distributes the energy load of the whole network to each sensor node in the network. It can reduce network energy consumption and improve network life cycle. Leach repeatedly performs cluster refactoring during its operation. This paper studies the parameter detection of wireless sensor network based on Leach algorithm on the on-chip embedded debugging system. Because the classical low-power adaptive clustering layered protocol (Leach) has the problem of energy imbalance and short node life cycle, this paper uses embedded debugging technology based on Leach algorithm and the residual energy and position of nodes in wireless sensor networks were tested for research. This Leach algorithm uses the concept of wheel. Each round consists of two phases: initialization and stabilization. In the initialization stage, each node generates a random number between 0 and 1. If the random number generated by a node is less than the set threshold T (n), the node publishes a message that it is a cluster head. Through the research on the parameter detection, the simulation results show that the research in this paper has good feasibility and rationality.


Sign in / Sign up

Export Citation Format

Share Document