Comparative study of hierarchy energy protocol in wireless sensor network

A protocol for position-responsive routing (PRRP) was developed dynamically to minimize the maximum distance between nodes and gateways/cluster heads, for maximum energy utilization of a deployed wireless sensor node. A tree routing technique was employed to display notable gains in key performance metrics. Network Simulator (NS3) software was utilized to evaluate and compare the effectiveness of the suggested technique using two selected conventional techniques: LEACH (Low Energy Adaptive Clustering Hierarchy) and PEGASIS (Power Efficient Gathering in Sensor Information System). The node energy efficiency of the proposed PRRP was obtained as 0.3881J, LEACH as 0.2249J and PEGASIS as 0.2755J. The total energy remaining after 100 second iteration process was evaluated as 19.4060J, 11.2490J and 13.7745J for PPRP, LEACH and PEGASIS respectively. The result obtained showed that PRRP achieved a 63% energy efficiency improvement over LEACH and 41% over PEGASIS, demonstrating superior energy conservation capabilities.

In this paper, the optimization strategies of routing protocols are analysed with respect to energy utilization of sensor nodes in Wireless Sensor Networks (WSNs). Routing Protocols are in charge of discovering and maintaining the routes in the network. Different routing mechanisms have been proposed to address energy optimization problem in sensor nodes. Clustering mechanism is one of the most efficient mechanisms which cater to the requirements of energy conservation in wireless sensor networks. To check the efficiency of different clustering scheme against modelled constraints, we select five cluster based routing protocols; Low Energy Adaptive Clustering Hierarchy (LEACH), Threshold Sensitive Energy Efficient sensor Network (TEEN), Stable Election Protocol (SEP), Distributed Energy Efficient Clustering (DEEC), and Hybrid Energy Efficient Distributed protocol. To validate our mathematical framework, we perform analytical simulations in MATLAB by choosing number of alive nodes, number of dead nodes, number of packets, number of cluster heads, as performance metrics.

A wireless sensor network is a deployment of massive numbers of small, inexpensive, self powered devices that can sense, compute and communicate with other devices for the purpose of gathering local information to make global decisions about a physical environment. Wireless Sensor Networks are tightly constrained in terms of transmission power, onboard energy, processing capacity and storage, and thus require careful resource management. We mainly have LEACH(Low Energy Adaptive Clustering Hierarchy) and PEGASIS(Power Efficient Gathering in Sensor Information Systems) protocols. But LEACH doesn’t support distribution of cluster heads optimally and PEGASIS has the overhead of data delay. This proposed approach emphasizes on increasing network lifetime via efficient routing path ands , efficient energy consumption.

Due to the limitation of power and memory size for WSN (wireless sensor networks), the routing protocol of wireless sensor networks must maintain small routing information and reduce the power consumption as much as possible. LEACH (low-energy adaptive clustering hierarchy) protocol and PEGASIS (power-efficient gathering in sensor information systems) protocol are analyzed firstly in this paper. Use for reference of the ideas used in both of the two protocols of reducing power dissipation, a three-layered routing protocol for WSN based on LEACH (TL-LEACH) is given. Then, this improved LEACH protocol is simulated and the simulation results show that TL-LEACH protocol is with greatly improved WSN lifetime than LEACH protocol.

The area of Wireless Sensor Networks (WSNs) is one of the fast growing and emerging field in the scientific and engineering world.It is an ad-hoc network that consists of small nodes with sensing, computing and communicating wireless abilities.These sensor nodes are densely deployed in the sensor field environments.The environment can be an Information Technological framework, a physical world, or a biological system.The main objective of WSN is to sense the crucial information from the environment depending on the type of application for which it is deployed and send this information to its Base Station (BS) so that it can take corrective actions.These Sensor Nodes communicate with each other via various Routing Protocols.Protocols in WSNs are broadly classified as Flat, Hierarchical and Location Based routing protocols.This paper presentshierarchical routing protocol, Power Efficient Gathering in Sensor Information Systems (PEGASIS) and a comparative study on various versions of PEGASIS protocols.

Traditional network data transmission (DT) has certain limitations in terms of processing, storage, and communication capabilities. Moreover, DT is easily affected by the network environment, which can reduce the real-time performance of DT. In severe cases, network transmission failures, DT interruptions, and other issues may even occur. As a new network, wireless sensor networks (WSN) have been widely used in military, industrial, agricultural, medical and other fields. In this paper, WSN was regarded as an important research method, and in-depth research was carried out around the real-time and energy consumption (for the convenience of the following text, the abbreviation for energy consumption is EC) of WSN DT. This paper focused on the issues of real-time performance, EC, and real-time transmission. It balanced EC and improved real-time performance through the low energy adaptive clustering hierarchy (LEACH) protocol and the power-efficient gathering in sensor information systems (PEGASIS) protocol. The experimental results showed that the real-time rates of LEACH under single reaction nodes were 45.5% and 48.6%, respectively. The lowest and highest real-time rates of PEGASIS were 86.2% and 89.5%, respectively. The real-time rate of PEGASIS was much higher than that of LEACH, proving that the proposed PEGASIS had high real-time performance and reduced DT delay.

Wireless Sensor Networks, referred to as WSNs, are made up of various types of sensor nodes. Recent developments in micro electro-mechanical technology have given rise to new integrated circuitry, microprocessor hardware and nano technology, wireless technology, and advanced networking routing protocols. Hospitals and health service facilities, the armed forces, and even residential customers represent a potential huge market for these devices. The problem is that existing sensor network nodes are incapable of providing the support needed to maximize usage of wireless technology. For this reason, there are many novel routing protocols for the wireless sensor networks proposed recently. One is Hierarchical or cluster-based routing. In this paper, we analyze three different types of hierarchical routing protocols: Low Energy Adaptive Clustering Hierarchy (LEACH), Power-Efficient Gathering in Sensor Information Systems (PEGASIS), and Virtual Grid Architecture (VGA). We tried to analyze the performance of these protocols, including the power consumption and overall network performance. We also compared the routing protocol together. This comparison reveals the important features that need to be taken into consideration while designing and evaluating new routing protocols for sensor networks. The simulation results, using same limited sensing range value, show that PEGASIS outperforms all other protocols while LEACH has better performance than VGA. Furthermore, the paper investigates the power consumption for all protocols. On the average, VGA has the worst power consumption when the sensing range is limited, while VGA is the best when the sensing range is increased. Using homogeneous nodes can greatly prolong sensor network’s life time. Also, The network lifetime increases as the number of clusters decreases

A large number of spatially dispersed nodes on the wireless network create Wireless Sensor Networks (WSNs) to collect and analyze the physical data from the environment. The issues that affected the network and had an impact on network energy consumption were cluster head random selection, working node redundancy, and cluster head transmission path construction. Consequently, this energy constraint also has an impact on the network lifetime and energy-efficient routing. Therefore, the primary goals of this research are to decrease energy consumption and lengthen the network’s lifespan. So, using improved optimization algorithms, this paper presents a dynamic cluster head-based energy-efficient routing system. The Improved Coyote Optimization Algorithm (ICOA), in this case, consists of three phases setup, transmission, and measurement phase. The Improved Jaya Optimization Algorithm with Levy Flight (IJO-LF) then determines the route between the BS and the CH. It selects the most effective course based on the distance, node degree, and remaining energy. The proposed approach is compared with traditional methods and the routing protocols Power-Efficient Gathering in Sensor Information Systems (PEGASIS) and Threshold sensitive Energy Efficient Sensor Network protocol (TEEN) during implementation on the MATLAB platform. Performance indicators for the suggested methodology are evaluated based on data packets collected by the BS, energy usage, alive nodes, and dead nodes. The outputs of the suggested methodology performed better than the conventional plans.

Because wireless sensor networks are limited energy environments that cannot be recharged, various routing protocols have been studied to maximize energy efficiency. One of the most energy-efficient routing protocols in this research area is PEGASIS (Power-Efficient Gathering in Sensor Information Systems), a hierarchical routing protocol of chain-based topology configuration. However, PEGASIS also has some considerable problems resulted in higher energy consumption such as (1) it does not consider the Base Station (BS) location; (2) it does not consider residual energy of Leader Nodes (LNs); (3) it needs an additional device such as Global Positioning System (GPS); and (4) its chain can become too long to keep energy efficiency. In this paper, we have suggested a new routing protocol to improve PEGASIS by getting rid of the above problems. Especially, we have used the concepts of relative distance, by which the suggested protocol does not need GPS and it allows BS to generate the location information table and construct the multi-chain topology. Furthermore, this multi-chain protocol has used the differential data transfer that aggregates only the changed values in order to reduce the amount of data transmission. Simulation results show that the suggested protocol can increase the network lifetime of WSNs compared to PEGASIS.

The Internet of Things (IoT) has introduced transformative capabilities for ecological monitoring through the acquisition of real-time sensor-based data. In this context, the Internet of Trees (IoTr) has emerged as a promising domain for monitoring trees in forest ecosystems. However, the existing literature lacks species-specific, energy-efficient, and scalable frameworks capable of supporting proactive tree health surveillance and disease detection. Current research focuses on using IoTr for tree monitoring, but primarily covers basic soil moisture, with limited integration of disease-relevant parameters and species classification. This research addresses the existing research gap by proposing IoT-Based Tree Routing for Energy-Efficient Systems (I-TREES), a novel context-aware framework for real-time monitoring of tree health, with a specific focus on ash dieback and oak decline in the United Kingdom (UK). This research first evaluates three long-range communication protocols: Narrowband IoT (NB-IoT), Long Range Wide Area Network (LoRaWAN), and Sigfox, using MATLAB simulations to compare energy efficiency, Packet Delivery Ratio (PDR), Packet Loss Ratio (PLR), delay, latency, and throughput across two node densities (100 and 300 nodes). Based on the comparative evaluation, NB-IoT was selected as the optimal protocol, and the I-TREES framework is designed and simulated in Network Simulator 3 (NS-3) using a large-scale network of 700 IoT nodes to assess its performance in forest health monitoring. The comparative benchmark against six established routing protocols Low-Energy Adaptive Clustering Hierarchy (LEACH), Power-Efficient Gathering in Sensor Information Systems (PEGASIS), Hierarchical Clustering Algorithm (HCA), Heuristic Clustering and Scheduling Algorithm (H-CSA), Event-Driven Spatio-Temporal Optimisation (ESTO), and K-Means. The results showed that I-TREES consistently outperformed in terms of scalability, throughput, latency, and energy efficiency. In the final phase, a Proof of-Concept (PoC) approach is adopted to assess the feasibility of disease classification under limited real-world data conditions. A multimodal PoC dataset was constructed by integrating IoT sensor readings with custom labelled image data of ash and oak trees. Machine Learning (ML) models, including Random Forest (RF), Convolutional Neural Networks (CNN), Long Short-Term Memory (LSTM), and hybrid (CNN-RF, CNN-LSTM) architectures, are trained for disease detection. The RF-based multimodal model, in particular, offered strong interpretability and demonstrated consistently high performance in accuracy, precision, recall, and F1 score, supporting its suitability for real world deployment. The findings verified the effectiveness of the framework as an energy efficient and scalable approach for the detection of tree diseases. The proposed I-TREES framework presents a reliable and intelligent forest health surveillance framework for tree disease detection, suitable for real-world forest applications to manage diseases sustainably and support policy-making decisions for ecological resilience in the UK and similar environments.

In Wireless Sensor Networks (WSNs), the reduction of energy consumption in the batteries of a sensor node is an important task. Sensor nodes of WSNs perform three significant functions such as data sensing, data transmitting and data relaying. Routing technique is one of the methods to enhance the sensor nodes battery lifetime. Energy optimization is done by using one of the heuristic routing methods for sensing and transmitting the data. To enhance the energy optimization mainly concentrated on data relaying. In this work stochastic hill climbing is adapted. The proposed solution for data relaying utilizes geographical routing and mobile sink technique. The sink collects the data from cluster heads and movement of the sink is routed by stochastic hill climbing. Network simulator 2 is used for experimentation purpose. This work also compares with the existing routing protocols like Energy-efficient Low Duty Cycle (ELDC), Threshold sensitive Energy Efficient sensor Network (TEEN) and Adaptive clustering protocol. The proposed work shows promising results with respect to lifetime, average energy of nodes and packet delivery ratio.

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 Network are deployed in areas where human intervention is impossible like habitat monitoring, landslide and forest fire detection etc. Fundamental issues involved in Wireless sensor networks are expanding the network lifetime and reducing energy consumption because the nodes are battery operated. To overcome these challenges, innumerous techniques were established in past few years using techniques such as network protocols, in network data fusion algorithms, energy aware routing and locating optimal sink location. This paper concentrates on energy effective unequal clustering algorithm and inter-cluster routing which equalizes the energy utilization of the network using least distance multiple hop technique and improves the network lifetime. MATLAB based simulation results have shown that the proposed method is giving higher network life and decreased energy consumption by the network. A comparison has been made between the proposed and the existing algorithm such as Low Energy Adaptive Clustering Hierarchy (LEACH), Power Efficient Gathering In Sensor Information Systems (PEGASIS) and Delay Aware Data Collection Network Structure (DADCNS) to prove the efficiency of this hybrid algorithm.

Wireless sensor networks (WSN) are a yield of advancement in information technology and the requirement of large-scale communication infrastructures. Routing of data via selected paths is a critical task in WSN as process need to be carried on under resource constraint situations. This route identification problem can be better handled by employing appropriate heuristic bio-inspired computational intelligence optimization method. The most frequently applied routing is hierarchical routing algorithm is Low Energy Adaptive Clustering Hierarchy (LEACH) algorithm which has limitations in identifying energy efficient inter and intra route communication, identification of number of cluster head (CH), an eminent node to communicate to CH and Base Station (BS), selection of CH, and computing residual energy level, etc. Hence, researchers are focusing on boosting the capability of LEACH clustering algorithm by applying heuristic bio-inspired computational intelligence optimization methods. The proposed work is an attempt in this direction through applying heuristic bio-inspired Grey Wolf Optimization algorithm (GWO) for improving the performance of LEACH algorithm. In this paper, focus is given to increase the overall network time by adapting two modifications to conventional algorithms (i) selection of vice cluster head (VCH) in addition to CH (VCH node will replace the CH when CH when CH node goes down due to unexpected reasons as sensor node work under critical and uninterruptable environments and (ii) selection of intra and inter relay nodes (intra relay node will enhance the life span during CH data gathering and inter relay node will further enhance the life span of CH by acting as a mediator between CH an BS). The Spyder-py3 tool is used to simulate the proposed algorithms, LEACH Binary Grey Wolf search based Optimization (LEACH-BGWO) and LEACH Discrete Grey Wolf search based Optimization (LEACH-DGWO) protocols. The proposed work is compared with cluster based LEACH algorithm, chain based power-efficient gathering in sensor information systems (PEGASIS) algorithm, bio-inspired GWO and Genetic Algorithm data Aggregation (GADA) LEACH protocols. The results prove that both proposed algorithms outperformed other conventional algorithms in terms of prolonged network lifespan and increased throughput. Among proposed algorithms LEACH-BGWO outperformed LEACH-DGWO

Mobile Ad hoc Network (MANET) is a group of networked mobile devices working in a cooperative manner, which are deployed in situations like fire disaster and earthquake rescue. Due to usage these devices quickly run out of battery power in critical situations thus, fail in packet transmission in an ad hoc network. The energy or lifetime of ad hoc networks has been a topical research issue, and many proposals have been put forward to address this. Power-Efficient Gathering in Sensor Information Systems (PEGASIS) and Dynamic State algorithm are two research works with unique energy efficiency concepts that if harmonized and refined, will deliver a better optimized energy efficient routing protocol for MANETs. This study therefore, proposes PEGADyn - a hybrid version of PEGASIS and Dynamic State algorithm into a new energy-efficient routing protocol for ad hoc networks. PEGADyn creates a virtual grid classification of nodes based on the current location of nodes, and this is followed by a cluster formation of nodes in each virtual grid created. In each cluster and virtual grid formed, cluster heads (CHs) and designated cluster heads (dCH) are selected based on their energy levels. CHs and dCHs are used for communication between clusters and virtual grids. The use of CHs and dCHs limits communication overheads among nodes hence, reducing the energy expended and thus, increasing the network lifetime. A simulation comparison of PEGADyn with PEGASIS and Dynamic State shows PEGADyn to be more optimal in extending network lifetime and maintaining network throughput.