Dimensions of clustering in wireless sensor network

Among important issues in the current energy-efficient routing protocols for wireless sensor networks (WSNs) based on clustering approaches are how to determine the optimal number of clusters, how to generate clusters and how select cluster-heads to improve WSNs performance. These approaches aim to reduce energy consumption of the WSN nodes and to extend the network lifetime. This paper reviews and compares the performance of three clustering techniques for determining number of clusters: rule of thumb, elbow, and silhouette. Each of these techniques involves a distributed K-means approach to generate clusters. Moreover, we compare these three clustering methods with low energy adaptive clustering hierarchy (LEACH), Imp LEACH and MODLEACH in terms of network lifetime, energy consumption and the number of packets sent to the base station (BS). The results obtained indicate that rule of thumb method provides better performance compared to other clustering techniques in terms of energy consumption and network lifetime.

Wireless Sensor Networks (WSNs) is the vast area and developing very speedily now-a-days. This paper gives some of the major applications and critical limitations of WSNs like power and lifespan, communication bandwidth, memory size. Sensor nodes are working by node energy so the energy consumption is the essential issue in WSN. Routing in WSN consumes more energy than any other phase. Various routing techniques in WSNs are discussed and different routing protocols are illustrated. Low Energy Adaptive Clustering Hierarchy (LEACH) is one of the popular and feasible hierarchical clustering routing protocols in WSN. Working of LEACH is explained in brief. Furthermore, the descendants of LEACH e.g. LEACH-C (Centralized LEACH), LEACH-B (Balanced LEACH), LEACH-F, Multihop LEACH, MS-LEACH (Multihop and Single hop LEACH), MH-LEACH etc. are discussed in terms of the energy utilization. By analyzing the variants of LEACH, it is observed that the energy requirement in the cluster set up phase or data transmission phase is minimized to minimize the total energy consumption of the WSN. To elect the proper cluster head node, centralized approach is followed. Afterwards, data transmission will use the multihop communication technique. This will help to save some energy when base station is located far away from the cluster head node. Proposed protocol aims to decrease the energy overhead of the sensor nodes. The new approach is proposed entitled PV-LEACH which will save the energy consumption in cluster setup phase and also in data transmission phase of the conventional LEACH protocol. So, this will enhance the performance ratio in terms of energy consumption and life time of the sensor nodes.

Wireless sensor networks (WSNs) consist of a large number of small, low data rate and inexpensive nodes that communicate in order to sense or control a physical phenomenon. The major difference between the WSN and the traditional wireless network is that sensors are very sensitive to energy consumption. Moreover, the performance of the sensor network applications highly depends on the lifetime of the network and we expect the lifetime of several months to several years. Thus, energy saving is crucial in designing long-lived wireless sensor networks. Many researchers have focused on developing energy efficient cluster based protocols for WSNs, but there has not been much research on event driven WSNs and, their focus is on continuous driven networks. In this paper, we propose a modified algorithm of Low Energy Adaptive Clustering Hierarchy (LEACH) protocol which is a well known energy efficient clustering algorithm for WSNs. Our modified protocol called “Adaptive and Energy Efficient Clustering Algorithm for Event-Driven Application in Wireless Sensor Networks (AEEC)” is aimed at prolonging the lifetime of a sensor network by balancing energy usage of the nodes. AEEC makes the nodes with more residual energy have more chances to be selected as cluster head. Also, we use elector nodes which take the responsibility of collecting energy information of the nearest sensor nodes and selecting the cluster head. We compared the performance of our AEEC algorithm with the LEACH protocol using simulations .

The lifetime of Wireless Sensor Network (WSN) is based on the energy of each sensor. Therefore, numerous routing protocols have been introduced such as SEP (Stable Election Protocol), LEACH (Low energy adaptive clustering hierarchy) and EAMMH (Energy Aware Multi-hop Multi-path Hierarchical routing protocol) to stable the lifetime of WSN by efficient utilization of energy of the sensors. In WSN networks data is collected and forwarded wirelessly to the base stations. Routing protocols in WSN provide an efficient path for multi-hop communication because the transmission range and battery power storage of nodes is limited. As nodes are usually deployed in remote areas so, they face challenges of long lifetime, network architecture, security issues, and network coverage. Many routing protocols have been developed to increase the efficiency of networks. Out of these clustering algorithms are the best choice to increase the lifetime of the nodes. Each protocol has its limitations in different scenarios. In this paper, we discussed and compared the performance of LEACH, EAMMH and SEP. SEP is an efficient algorithm due to its weighted cluster head (CH) selection method. Simulation results are obtained using MATLAB. Design metrics of energy consumption and network lifetime are under consideration in this research work.

Wireless sensor networks (WSNs) are composed of many low cost, low power devices with sensing, local processing and wireless communication capabilities. Recent advances in wireless networks have led to many new protocols specifically designed for WSNs where energy awareness is an essential consideration. Most of the attention, however, has been given to the routing protocols since they might differ depending on the application and network architecture. Minimizing energy dissipation and maximizing network lifetime are important issues in the design of routing protocols for WSNs. In this paper, the low-energy adaptive clustering hierarchy (LEACH) routing protocol is considered and improved. We propose a clustering routing protocol named intra-balanced LEACH (IBLEACH), which extends LEACH protocol by balancing the energy consumption in the network. The simulation results show that IBLEACH outperforms LEACH and the existing improvements of LEACH in terms of network lifetime and energy consumption minimization.

Recently, special types of routing protocols are designed for sensor networks. Almost all of these routing protocols have considered the energy efficiency as the ultimate objective in order to maximize the lifetime of the whole network. The different types of routing protocols available in WSN are data centric, hierarchical, and location-based and on demand routing protocols. Low-Energy Adaptive Clustering Hierarchy (LEACH) protocol is one of the best hierarchical clustering protocols with probabilistic model to manage the energy consumption of WSN. However, LEACH uses global information without considering the local information i.e. the residual energy of each node for CH election process. Hence, Deterministic Energy-efficient Clustering protocol (DEC), a deterministic model is developed by using clustering scheme to manage and organize the WSN with mobile scenario. This protocol promises a better election of cluster-heads based on residual energy information and it is more energy efficient than LEACH protocols. Ad hoc on demand Distance Vector (AODV) is another routing protocol used in sensor network to support mobility. AODV is also on demand routing protocol. However, AODV do not provide multipath loop free and has link disjoint path. Hence, Ad hoc On-demand Multipath Distance Vector (AOMDV) is developed for WSN to guarantee loop freedom and disjointness of alternate paths. Frequent route discovery and route failure is occurred in AOMDV protocols due to the involvement of repeated mobile nodes without checking the energy levels of those nodes for packet transmission. To reduce the route failures occurred by the usage of nodes with reduced energy, energy aware ad hoc on-demand multipath distance vector routing protocol (E-AOMDV) is developed by incorporating energy aware concept in AOMDV protocol to increase the network performance. In this paper, the performance analysis namely residual energy of DEC protocol is examined for various packet length and nodes. Delivery ratio analysis of EAOMDV protocol is also done in this paper for various simulation times and nodes. The simulation results shows that DEC has better performance than LEACH and also E-AOMDV has better performance than AOMDV.

Energy efficiency is critical in Wireless Sensor Networks (WSNs), pivotal for Internet of Things (IoT) applications like environmental monitoring and smart cities. Clustering protocols like Low-Energy Adaptive Clustering Hierarchy (LEACH) extend network lifetime through Cluster Head (CH) rotation, but random CH selection often leads to suboptimal energy use. This study evaluates eight hybrid Particle Swarm Optimization-based LEACH (PSO-LEACH) variants to optimize CH selection and clustering: FA-PSO-LEACH (Firefly Algorithm), CSA-PSO-LEACH (Crow Search Algorithm), PSO-LEACH with CBTEERA, Adaptive PSO-LEACH, ABC-PSO-LEACH (Artificial Bee Colony), ACO-PSO-LEACH (Ant Colony Optimization), WOA-PSO-LEACH (Whale Optimization Algorithm), and Hybrid GA-PSO-LEACH (Genetic Algorithm). The primary research objective is to compare these variants in terms of energy efficiency, network lifetime, and clustering quality to identify the most effective strategies for prolonging WSN operation in IoT environments. Specifically, this paper addresses the research question: Which hybrid PSO-LEACH variant provides the optimal balance between early-stage stability and long-term energy conservation in a simulated WSN with 50 nodes? Each variant uses a unique metaheuristic for CH selection based on residual energy and distance, with PSO refining clustering. A Python simulation modelled a 100m × 100m WSN with 50 nodes, assessing network lifetime (First Node Died, FND; Half Nodes Died, HND; Last Node Died, LND), energy consumption, and clustering quality. Results show ABC-PSO-LEACH leading with FND at 57 rounds and LND at 462 rounds, followed by WOA-PSO-LEACH (HND 148, LND 406), surpassing others (e.g., PSO-LEACH with CBTEERA: FND 10, LND 280). WOA-PSO-LEACH’s balanced energy distribution excels in mid-to-late stages, despite computational overhead. These bio-inspired hybrids outperform traditional LEACH, with ABC-PSO-LEACH and WOA-PSO-LEACH ideal for prolonged WSN operation. Future work aims to enhance early-stage performance and explore dynamic topologies.

Routing protocols in wireless sensor network are vulnerable to various malicious security attacks that can degrade network performance and lifetime. This becomes more important in cluster routing protocols that is composed of multiple node and cluster head, such as low energy adaptive clustering hierarchy (LEACH) protocol. Namely, if an attack succeeds in failing the cluster head, then the entire set of nodes fail. Therefore, it is necessary to develop robust recovery schemes to overcome security attacks and recover packets at short times. Hence this paper proposes a detection and recovery scheme for selective forwarding attacks in wireless sensor networks using LEACH protocol. The proposed solution features near-instantaneous recovery times, without the requirement for feedback or retransmissions once an attack occurs.

Routing Algorithm determines the optimal route to transmit data packet from source to destination. The nodes in wireless sensor networks (WSN) are devoid of abundant energy and hence energy efficiency is the vital benchmarks for data transmission in WSN. The basic importance of wireless sensor networks (WSN) in present scenario is to reduce the node energy consumption such that it improves the data transmission efficiency and reliability to extend entire network life time. In these respect, we need to search the optimal route for data transmission in WSN. Here an Improved Ant Colony Optimization (IACO) based energy efficient routing algorithm is proposed in WSN to solve the issue. The function of improved Low Energy Adaptive Clustering Hierarchy (LEACH) routing algorithm is to select cluster heads (CH) by considering residual energy and the distance in between the nodes. To balance the energy consumption between the nodes, residual energy is used as an energy control factor, which affects the network life time and enhances the data transmission efficiency. An ACO algorithm is applied to search the optimal path from the various available routes in between CH and sink for data transmission. Simulation results show that the proposed method Improved Ant Colony Optimization based Low Energy Adaptive Clustering Hierarchy (IACOLEACH) is found to yield better results over other conventional algorithms.

Wireless sensor networks (WSN) play a key role in enabling wireless communication technology among several nodes to remotely communicate and exchange information. WSN consists of tiny sensor nodes equipped with battery, scattered in an area to gather information around an environment and send to data collection node known as sink or base station (BS). WSN have been widely used in various applications like agriculture, fire detection, health care and military and has become imperative necessity for future revolutionary area like UAV (unmanned aerial vehicles), IoT (Internet of things) and smart cities which employs large scale sensor nodes. However sensor nodes are limited to battery, memory, low computational power, resource and bandwidth. Continues sensing of events, makes node to drain its battery faster and goes dead fast. For resource constrained WSN, hierarchical cluster based approaches are considered as energy efficient and improves network performance for large scale WSN. Minimizing energy consumption and extending network lifetime are major challenging issues of WSN, clustering methods with optimized routing have offered solution to optimize energy utilization. To balance energy consumption and improve network lifetime many existing hierarchical clustering approaches have been proposed, however existing method does not consider rotation of cluster head (CH) and considers cluster head selection based on residual energy and distance parameter. In this paper we propose an improved energy efficient cluster tree (IEECT) based routing to improve energy efficiency of hierarchical cluster. IEECT considers modification of existing LEACH (Low energy adaptive clustering hierarchy) protocol to improved energy efficient LEACH by considering energy parameters like residual node energy and average network energy. IEECT accounts optimal number of cluster head (CH) and selection of CH is done using threshold value among sensor nodes. Proposed IEECT combines tree based routing and data aggregation scheme to maintain desirable quality of service. Simulation experiments are carried out by using network simulator. Performance of IEECT is evaluated in terms of PDR, delay, energy consumption, network lifetime and overhead.

Wireless Sensor Networks (WSN) is an ever growing field owing to their extensive variety of applications. WSN have limited battery energy, consequently, an energy efficient routing protocol is of major concern. LEACH (Low Energy Adaptive Clustering Hierarchy) is one of the fundamental clustering protocols in WSN that provides high energy efficiency. Many protocols have been derived from LEACH which mostly address a single inherent challenge. Instead of focusing on a single parameter, combining independent techniques can compound gains in energy efficiency. This paper proposes Yet Another LEACH (YA-LEACH) which uses centralised cluster formation to ensure optimal clusters and allow Cluster Heads (CH) to extend operation into multiple rounds to achieve energy savings. Also, the proposed protocol will have an alternative (vice) CH that takes over when CH residual energy reaches a critically low level. The extended protocol was simulated on NS2 with results showing an improvement in network lifetime and overall data throughput.

Energy consumption is the main issue that researchers have dealt with to design any routing application. To design comprehensive reliable wireless sensors networks (WSNs), it is essential to consider node failure and energy constraint as inevitable phenomena. In this paper, a new method for optimal clustering is proposed, that accurately localizes sensors while minimizing their power consumption. It also splits the task of Cluster head between sensor nodes to send data to the base station (BS). The proposed scheme is based on K-means method to selected Cluster-Head. The selection of CH starts with the closest nodes to the centroid point. In the second step, we selected nodes with high power compared to its neighbors, after repeating this phenomenon until the energy of all the nodes is drained. This method can equilibrate the role of Cluster-Head between all the network sensors. Simulation results showed that our clustering mechanism seemed to effectively improve the network lifetime over Low Energy Adaptive Clustering Hierarchy (LEACH) and Energy efficient clustering algorithm for maximizing the lifetime of wireless sensor networks.

In recent literature surveys low energy adaptive clustering hierarchy (LEACH) protocol got more attention in Wireless Senor Network (WSN) for improving network lifetime in terms of energy consumption. Many versions of LEACH are coming with modifications with single hop communication to multi-hop communications. More work is done on LEACH protocol, and it is a good start for researchers in WSN. In this paper we surveyed various LEACH based routing protocols are discussed with their working models in WSN. This survey classified in two ways single hop communication and multihop communication on basis of transmission in cluster to base station and explains about hierarchical routing protocols with LEACH. This survey describes about various versions of LEACH with analysis of various characteristics like network lifetime, communication type, clustering mechanisms, and so on, of LEACH protocol. This survey describes about pros and cons of each version of LEACH. At last, the paper finishes up with ideas on future research in WSN.

Network lifetime and energy consumption of data transmission have been primary Quality of Service (QoS) obligations in Wireless Sensor Networks (WSNs). The environment of a WSN is often organized into clusters to mitigate the management complexity of such obligations. However, the distance between Sensor Nodes (SNs) and the number of clusters per round are vital factors that affect QoS performance of a WSN. A designer's conundrum resolves around the desire to sustain a balance between the limited residual energy of SNs and the demand for prolonged network lifetime. Any imbalance in controlling such objectives results in either QoS penalties due to draining SN energies, or an over-cost environment that is significantly difficult to distribute and operate. Low-Energy Adaptive Clustering Hierarchy (LEACH) is a distributed algorithm proposed to tackle such difficulties. Proposed LEACH-based algorithms focus on residual energies of SNs to compute a probability function that selects cluster-heads and an optimal energy-efficient path toward a destination SN. Nevertheless, these algorithms do not consider variations in network's state at run-time. Such a state changes in an adaptive manner according to existing network structures and conditions. Thus, cluster-heads per round are not elected adaptively depending on the state and distances between SNs. This paper proposes an energy-efficient adaptive distance-based clustering called Adapt-P, in which an adaptive probability function is developed to formulate clusters. A near-optimal distance between each cluster-head and its cluster-members is formulated so that energy consumption of the network is mitigated and network lifetime is maximized. The cluster-head selection probability is adapted at the end of each round based on the maximum number of cluster-heads permitted per round found a priori and the number of alive SNs in the network.

Wireless Sensor Network (WSN) is a self-configured network of light-weight nodes, that are used in many applications by sending their data through this network to a Base Station (BS), which in turn, delivers the data to its final destination. In WSN, the sensor node’s energy is usually limited, and thus, the overall power consumption of the network is a real challenge. Numerous methods have been proposed to overcome this challenge by improving the overall power consumption and thus, prolonging the lifetime of the network. Low Energy Adaptive Clustering Hierarchy (LEACH) protocol has been considered as a leading routing protocol in WSN, due to its low power consumption resultant from its cluster-based behavior. However, for dense networks, LEACH suffers from large burden over cluster head (CH), which might result in packet loss due to the induced congestion in the CH. In this paper, an improved algorithm based on LEACH is proposed to maximize the lifetime of WSN, by using another node to relieve CH’s burden. The routing path selection process is refined through selecting a new node that has the highest residual energy in each cluster to be an alternative gateway for the cluster head. Then, the routing path will be decided based on distance. This modified algorithm outperforms the original LEACH by 4.35% increase in the residual energy, which prolongs the network lifetime. However, there is a slight increase in the overhead ratio.