Maximizing Network Lifetime through VaryingTransmission Radii with Energy Efficient Cluster RoutingAlgorithm in Wireless Sensor Networks (original) (raw)

Energy Efficient Cluster-based Routing Algorithm for Prolonging the Lifetime of Wireless Sensor Networks

Journal of Global …, 2010

Clustering algorithm has an important effect on the performance of wireless sensor network. In this paper, energy efficient clusterbased routing (EECR) algorithm is proposed to prolong life time of wireless sensor networks. EECR selects the cluster-heads according to the two parameters remaining energy and node degree. Also cluster-heads select its members according to the two parameters of sensor remaining energy and the distance to its cluster-head. EECR is done in three phases quickly. Simulation results show that the proposed algorithm, increase the network lifetime more than 18 percent in compare of LEACH protocol.

Energy Efficient in Wireless Sensor Networks Using Cluster-Based Approach Routing

In wireless sensor networks, the energy consumed by each node of the network influences the lifetime of the networks, more than the consumption of energy increases more than the lifetime of the networks decreases, this is why the increase of the lifetime of the networks requires a strategy (protocol) which reduces the power consumption of the transmission or reception of data by the sensor nodes. In recent years much research has been done to maximize a life time of network sensor. To deal with this, the hierarchical protocols (Cluster based-approach, chain based-approach) have been developed in order to reduce the network traffic toward the sink and therefore prolong the network lifetime. In this paper, the focus is mainly driven over the survey of the energy-efficient using hierarchical cluster-based approach namely LEACH (Low Energy Adaptive Clustering Hierarchy Protocol), in order to propose a new method to maximize more the life time of network sensor. Our method is to conserve energy consumption when transmitting data to the Base Station (BS). We evaluated the performance of the LEACH protocol with our proposed method simulated, the results of our method are demonstrated by the simulation results using Matlab Simulink.

Empirical Analysis of Energy Efficient Clustering Base Routing Protocols in Wireless Sensor Network

2020

Wireless sensor networks are energy constraint networks. Energy efficiency, to prolong the network for a longer time is critical issue for wireless sensor network protocols. Clustering protocols are energy efficient approaches to extend the network lifetime. LEACH protocol is one of the basic cluster based protocol in wireless sensor network. The performance analysis of energy efficient multi-hop clustering protocols like LEACH, DEEC and EAMR are carried out by considering change in the number of nodes for same network area with respect to the time using Network Simulations (NS-2/NS-3) Software. This is efficiently helps the comparative study of node death rate, energy consumption and network lifetime. Index Terms – Clustering, LEACH, DEEC & EAMR Energy-efficient Protocols

Energy Efficient Cluster Based Routing Protocol for Wireless Sensor Networks

Wireless sensor network are sophisticated systems that are used to collect data from an inaccessible environment. They consist of base station and hundred to thousand of tiny nodes called sensor nodes. Nodes in the sensor network are constrained by energy. The sensor networks where base station is very distant from the sensor field, the energy efficiency in the working of sensor networks plays an important role in the lifetime of the sensor networks. To prolong the life of the sensor network energy efficient techniques for routing is an important issue. In this paper we proposed a new algorithm for cluster head selection in each cluster for each round of communication. The clusters are fixed through out the network life time. Our proposed work is based on LEACH and LEACH-C. The protocol works efficiently to increase the overall network lifetime and outperforms LEACH in terms of minimizing the overall energy consumption.

Lifetime Maximization Using Modified Leach Protocol for Energy Efficient Routing In Wireless Sensor Networks

2013

Wireless Sensor Networks (WSN) are networks of typically small, battery-powered, wireless devices, equipped with on-board processing, communication, and sensing capabilities. Especially wireless sensor network suffers from excessive packet loss, over hearing, retransmission of the packets due to node mobility and constant energy dissipation. A current technique for routing and data transmission does not take into account of optimizing the transmission through Energy Balancing. There are several power and energy aware algorithms that claim to compensate for the energy losses. The main fundamental of most of the techniques is to route the packets through the highest energy nodes which lead to quick battery drainage of those node. Therefore the network lifetime decreases. In this project we have proposed a unique protocol for Network lifetime improvement by modifying the Leach protocol. The fundamental of the protocol is to develop a cluster based routing where cluster heads should be selected based on maximum coverage and should have sufficient energy to prolong the communication. Clusters are dynamically formed and changed with transmission. The technique is compared with conventional LEACH. Result shows that the proposed system achieves high data delivery with extended lifetime.

A New Approach to Improve LEACH Protocol for Optimization of the Energy Consumption Efficient Clustering in Wireless Sensor Network

This paper propose a new low power consumption routing protocol for wireless sensor networks based on clustering approach. The suggest protocol is to use energy more evenly selected node cluster-heads, and save the energy dissipated when routing captured data to the base station. Simulation results have shown that suggest protocol allows a reduction in energy dissipation and a life of greater network. Various hierarchical routing solutions practice clustering techniques, to reduce energy consumption and enable scaling; The KOCA (K-hop Overlapping Clustering Algorithm) forms overlapped K-Clusters (cluster with K-hop) to enable inter-cluster multi-hop routing; and the LEACH (Low Energy Adaptive Clustering Hierarchy) protocol, whichever arrange the sensors nodes as a layered clustering construction to decrease data delivery time. In order to illustrate the substantial assets of KOCA, the simulations show the impact of mobility on the performance of sensors LEACH and M-LEACH (Multi-hop Low Energy Adaptive Clustering Hierarchy) in WSNs (Wireless sensor networks) environments. Therefore, the results obtained have shown that the mobility has a significant impact on the performance of these two protocols in terms of lifetime of the network and the number of data sent to the base station packets. The KOCA provided better performance than these two protocols. The simulations applying the NS2 simulator present the protocol perform good presentation in both delivering data and energy conservation. It create a small number of clusters, and distributes energy consumption equally on the network.

ENERGY-BALANCED IMPROVED LEACH ROUTING PROTOCOL FOR WIRELESS SENSOR NETWORKS

A proper sensor node clustering is an effective topology control that can balance energy consumption among sensor nodes and increase network scalability and life time. As the use of wireless sensor networks (WSNs) has grown enormously, the need for energy-efficient routing and data aggregation has also risen. LEACH (Low Energy Adaptive Cluster Hierarchy) is a hierarchical clustering protocol that provides an elegant solution for such protocols. Random clustering is the main deficiency of LEACH. In this paper an energy balanced clustering approach is proposed, in which the K-mean clustering algorithm is applied. It is centralized clustering algorithm that based on minimum energy clustering to form optimal clusters. For the candidate nodes, the location and the residual energy are used as key parameters to select the cluster head (CH). The method shows that the proposed approach outperforms LEACH in terms of energy conservation and network life time prolonging.

A Modified E-LEACH Routing Protocol for Improving the Lifetime of a Wireless Sensor Network

Journal of Information Processing Systems, 2020

This paper proposes a modified end-to-end secure low energy adaptive clustering hierarchy (ME-LEACH) algorithm for enhancing the lifetime of a wireless sensor network (WSN). Energy limitations are a major constraint in WSNs, hence every activity in a WSN must efficiently utilize energy. Several protocols have been introduced to modulate the way a WSN sends and receives information. The end-to-end secure low energy adaptive clustering hierarchy (E-LEACH) protocol is a hierarchical routing protocol algorithm proposed to solve high-energy dissipation problems. Other methods that explore the presence of the most powerful nodes on each cluster as cluster heads (CHs) are the sparsity-aware energy efficient clustering (SEEC) protocol and an energy efficient clustering-based routing protocol that uses an enhanced cluster formation technique accompanied by the fuzzy logic (EERRCUF) method. However, each CH in the E-LEACH method sends data directly to the base station causing high energy cons...

Energy Efficient Cluster Based Routing Mechanism for Wireless Sensor Networks

Journal of emerging technologies and innovative research, 2018

The Wireless sensor networks is one of the premier research are from past few decades, so the need to maintain energy efficient routing between from the nodes to base station, proper data aggregation and scalability is the important concern. In hierarchical routing LEACH is one of the energy efficient clustering protocol, but only the problem is size of the clusters are not same either they may be small or large, which causes to reduce the network lifetime. The other protocol FZ-LEACH addresses the LEACH problem by selecting some random cluster heads, but not energy efficient. In this paper, we propose a new protocol enhanced far-zone cluster-based routing protocol with optimized algorithm (FZ-CRP), form's cluster heads and zone heads based on the intra communication cost and energy. If the node's energy is the less than or equal to average minimum reach ability power then that node is said to be in far zone, far zone node transmits the data to base station via far zone, cluster heads. The performance of the proposed is better when we compare with existed scenarios. IndexTerms-wireless sensor network, cluster head, cluster formation, network life time and energy consumption, leach protocol.

Energy Optimization Algorithms Study On Routing Protocol In Wireless Sensor Network

IEEE Explore, 2023

Innovative methods are required to remove energy inefficiency that reduces the network lifetime because battery power is limited on the sensor nodes used in WSN applications. Because the path is not established at that time, there is a difficulty with dead node identification during data transfer. Another issue is the redundancy-related network lifetime concern. Energy is lost during transmission, which causes an issue with energy usage. We have encountered an NP-hard scheduling problem in our review of the literature. It's also a problem that, as bandwidth increases, the lifespan of the network itself decreases. A hybrid routing approach for WSNs based on the combination of DEEC and CH-Leach In clustering-based wireless sensor networks, protocols like ACO and LEACH are used. The CH-Leach Protocol is proposed as an algorithm. In this research, each CH communicates with the BS via the total number of CH connections. The amount of clusters on the network gird region, however, determines which cluster head is chosen. This technique enables the network to adopt the ideal condition to increase network longevity. Numerous studies on diverse situations were conducted and tested. By using the ZECR, which reduces the amount of energy used, wireless sensor networks can work better. The performance in this painting is higher than in the current painting since the current painting primarily depends on physical appearance, whereas our painting is completed using logical painting, and the overall output is 70%.