Modified Leach 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) are fundamental to security and surveillance applications such as military defense, disaster management, and intrusion monitoring. The performance of these networks depends largely on the efficiency of routing protocols. This paper examines the Ad hoc On-Demand Distance Vector (AODV) routing protocol in multi-hop WSN environments for target tracking, evaluating critical metrics including Packet Delivery Ratio (PDR), End-to-End Delay, Energy Consumption, and Network Lifetime. Simulation results illustrate the impact of node depletion due to transmission loss, affecting network stability and robustness in target detection. In-network detection in WSNs presents trade-offs between real-time data transmission, energy efficiency, and trajectory lifespan. Inefficient routing optimization may result in increased latency, packet loss, and premature node failure, ultimately reducing localization accuracy. While AODV’s reactive path-based approach offers manageable overhead, its performance degrades under increased energy consumption and route rediscovery delays. This study systematically evaluates AODV’s strengths and limitations in time-sensitive detection scenarios. Findings indicate that AODV ensures reliable data transmission in early network stages but suffers significant performance deterioration as node energy declines, impacting coverage and responsiveness. To enhance AODV’s target tracking capabilities, this paper proposes adaptive energy-saving techniques and hybrid routing schemes. These strategies contribute to ongoing research aimed at optimizing routing protocols to balance accuracy and node longevity for real-time WSN applications.

Wireless sensor network (WSN) is a network consist of multiple sensor nodes which sense and transmit data to a base station for data collection. Since the nodes in WSN are battery powered devices and nodes loss energy mostly due to transmission, an energy efficient routing protocol is needed to reduce the nodes energy consumption and prolong the network lifetime. However, existing routing protocols produce some drawbacks such as selection of cluster head with low residual energy and formation of different sizes of cluster which leads to uneven energy consumption among the nodes. Therefore, an Ant Colony Optimization based Low Energy Adaptive Clustering Hierarchy (LEACH-ACO) protocol for energy efficient transmission in WSN is proposed in this paper. This research aims to develop a routing protocol that utilize the existing LEACH routing protocol to improve the performance of WSN and prolong the lifetime of the network. The results showed that LEACH-ACO protocol outperformed Direct Transmission (DT) and LEACH protocol in terms of network lifetime, energy consumption and energy per transmission.

The development of various applications of wireless sensor networks has aroused great interest in using these types of networks in various fields. These networks, without infrastructure and self‐organization, are easily deployed in most environments and collect information about environmental phenomena for analysis and proper response to accidents and send them to the basic centers. They do. Wireless sensor networks are made up of some sensor nodes that both act as sensors and act as relay nodes concerning to each other. On the other hand, the lack of infrastructure in these networks has limited resources so that the nodes of the battery are fed with limited energy. Due to the location of networks in difficult and impassable areas, it is not possible to recharge or replace the node battery. Therefore, saving energy consumption in this type of network is one of the most important challenges. Since the rate of energy consumption when sensing information and receiving data packets from another node is a fixed value, so sensor nodes have the highest energy consumption when sending data. Therefore, routing methods try to reduce energy consumption based on systematic approaches. One of the most promising solutions to reduce energy consumption in wireless sensor networks is to cluster the nodes and select the threaded node based on the data transfer parameters so that the average energy consumption in the nodes is reduced and the network lifetime is increased. Therefore, in this research, a new optimization approach using multiobjective genetic algorithm and cuckoo algorithm for clustering wireless sensor networks is presented. In this study, in order to select clustered nodes from a multiobjective genetic algorithms based on reducing intracluster distances and reducing energy consumption in cluster member nodes and near‐optimal routing based on cuckoo optimization algorithm to transfer information between nodes have been used in the direction of the cavity. The implementation results show that considering the evolutionary capabilities of the multiobjective genetic algorithm and the cuckoo optimization algorithm, the proposed method in terms of energy consumption, efficiency, delivery rate, and packet transmission latency, compared to previous methods, has improved.

Wireless Sensor Network (WSN) is an exceptional network which gather information from certain area of applications. Major factor in WSNs is the reliability for transmission of data from source to destination. Constructing path for multi-hop routing and continuous updates of energy level can maximize the lifetime and improve the reliability in the network. A lot of work has been done previously in this regard but previous schemes has limited network scale which consumes more energy in reconfiguration of paths and this energy consumption leads the reduction of network lifetime which results into early death of sensor nodes. In this regard, we propose Multi-hop Advance Heuristic Path-Reconfiguration Algorithm (HPRA) for clustered-based heterogeneous WSNs. Proposed algorithm adopts the opportunistic routing by choosing the appropriate neighbor node for transmission of data packets which improves the multi-hop reliability in order to improve the reliability in each path. This new technique of path-reconfiguration reduces the number of paths and fewer paths reduce energy dissipation and also improve the network lifetime. In simulation results proposed algorithm is compared with state-of-the-art routing protocols which shows the significant performance in network lifetime, network stability, number of paths and energy consumption ratio.

Wireless Sensor Networks are the most efficient networks today, and they are used in many industrial, medical, and security applications. The major drawback of the sensor network is energy consumption due to the smaller size of the sensor node. To overcome the energy consumption, this paper proposes a new routing protocol called Multi-Layered Clustering Routing Protocol. This proposed routing protocol contributes to network’s long life and energy efficiency. During data transmission between the source and destination, the clustering approach is used in each layer. This assists in identifying the level of energy at each sensor node, which results in energy consumption reduction. Experimental results analyse the performance of the proposed routing protocol, that regulates the energy consumption and improves the network lifetime compared to the existing techniques.

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.

Restricted battery life is a crucial constraint in wireless sensor networks (WSNs). Many routing protocols have been proposed to reduce the energy consumption by extending the network lifetime. So, a new design of energy efficient routing using clustering is proposed where we use heterogeneous nodes for data transmission through the optimal path between cluster heads (CHs) and the base station (BS). This paper discusses the algorithm called Advanced-Multi-hop Low Energy Adaptive Clustering Hierarchy (LEACH) protocol with heterogeneous nodes. Multi-hop LEACH protocol changes the mode of communication to prolong the network lifetime from single hop to multi-hop between the CH and BS by reducing energy consumption. The paper tries to evaluate the performance of the network in terms of lifetime and stability by introducing the concept of optimum number of clusters and also considers the optimum number of hops in the network with heterogeneous nodes. This paper also provides the algorithm for the avoidance of the overlapping of the clusters and collisions in the network. For the evaluation and comparison of the performance of advanced single-hop and multi-hop energy efficient LEACH protocols with heterogeneous nodes, MATLAB simulations are carried out. Results show that advanced-multi-hop LEACH protocol outperforms the advanced single-hop LEACH protocol regarding energy efficiency, stability and network lifetime.

Wireless Sensor Network (WSN) is a promising approach for a variety of applications. Because of limitation of energy resource, memory space and processing capability of sensor nodes, it is very difficult to implement IP-based routing protocols in WSN. Recently, many research focus on developing special routing protocols for WSNs with the main design criteria: energy efficiency, load balance and reliability. The most well known routing protocol class is hierarchical which divides network into many clusters. Each cluster is represented by a cluster head (CH) that is responsible for receiving data from all non-CH members, aggregating these data and sending to the base station (BS). In order to balance energy consumption of the entire network, CHs are not fixed but rotated. Therefore, the hierarchical protocols can decrease and balance the energy consumption and prolong network lifetime. LEACH is one of the first cluster-based for WSN, which includes distributed cluster formation. In this paper, we propose a new hierarchical routing protocol (called EL-LEACH: Energy and Load balance LEACH) which achieves energy efficiency and load balance. Our simulation result shows that our new scheme EL-LEACH achieves better energy consumption, load balance and network life time than other well known LEACH protocols.

Increasingly, the services operations which perform data sensing and data propagation in a dynamic environment are important tasks of wireless sensor networks. Therefore, increasing the network lifetime is the main contribution of this investigation. We propose a novel power-aware chessboard-based adaptive routing (PCAR) protocol to support immobility management in wireless sensor networks. The paramount design challenge in this work is to scale-down the network energy consumption, thus maximizing the network lifetime. Our PCAR protocol utilizes vector-oriented propagation, power-consideration decision, and multi-path routing protocols to guide the propagating data to its destination. Moreover, the properties of the clusters are combined in the PCAR to form the cluster-plates in a chessboard-based clustered sensor network. The alternate usage of cluster-head nodes and sleep nodes increases energy efficiency. The opportune divide-and-conquer multi-path fusion mechanism slows down and balances energy consumption. Finally, a performance analysis shows that energy efficiency is achieved by the PCAR protocol.

Wireless sensor networks (WSNs) are one of the very active research area. They have many applications like military, health care, environmental monitoring and industrial monitoring. The sensor nodes have limited energy source. Since in many cases the nodes are deployed in unreachable areas, hence recharging or replacing the battery of the sensor nodes is not an option. Therefore, one must employ techniques to conserve the energy by reducing the energy consumption by the nodes. In this paper, we discuss about the different energy saving schemes investigated by different research community in WSNs to reduce the energy consumption of the nodes and thereby improving the lifetime of the overall network. Energy saving protocols such as duty cycle, energy efficient routing, energy efficient medium access control (MAC), data aggregation, cross layer design and error control code (ECC) are discussed. Sleep/wake up method is adopted by the duty cycle approach to reduce the active time of the nodes and conserve their energy. The routing and MAC protocols use suitable energy efficient algorithms for saving energy. The data aggregation aims to save energy by reducing the number of transmissions. On the other side, cross layer approach looks for a cross layer optimization solution to improve the energy efficiency of the network. ECC reduces energy consumption by virtue of coding gain it offers which allows lower signal-to-noise ratio (SNR) to achieve the same bit error rate (BER) as an uncoded system. Some techniques such as use of directional antennas, topology control and transmission power control which have been widely investigated for other ad-hoc networks for energy conservation are also discussed in brief in this paper.

In this paper, we aim to minimize in-body sensor node energy consumption and to prolong the network lifetime by utilizing a relay strategy based on our proposed flexible quality of service (QoS) radio frequency communication module and advanced In-to-out body path loss (PL) model. A selection algorithm is derived and investigated in which the relay nodes with lower energy consumption and minimum distance to the coordinator will be chosen in each round. In this way, time division multiple access (TDMA) can be investigated to schedule data transmission from implants to the corresponding relays, and thus minimize the overall length of communication links. Moreover, a linear programming network lifetime model is proposed along with various subjective functions. Followed by constraints, simulations are conducted on a proposed topology network assuming two commercial transceivers. Results show that the existing two-relay based protocol achieves higher transmission data rates due to the availability of redundant communication pathways. However, our proposed incremental relay-based cooperative routing protocol outperforms the existing two-relay based scheme regarding total network lifetime, overall throughput, average power consumption and propagation delay.

Mobile Ad hoc Network (MANET) has mobile and battery operated nodes which can provide communication facility to users irrespective of any infrastructure and centralized control. It is a self-deployed and self-operated communication network having typical applications such as disaster relief, information exchange at conference or classroom and battle field communication etc. MANETs have many challenges such as limited battery power, lack of centralized control and security, the need for special routing protocols etc. Due to highly dynamic and dispersed nature of MANETs, routing becomes one of the important concerns in MANET. The network can get partitioned due to mobility and/or exhaustion of the nodes. Therefore, energy efficient routing is of great importance for the MANETs. This paper presents a simulation study of existing MANET routing protocols like AODV, DSR, and DSDV based on various metrics like packet delivery ratio (PDR), energy consumption, throughput, overheads, network lifetime and end to end delay to select a suitable protocol for further modification in order to improve the energy efficiency of the nodes. The simulation results show that the DSR protocol performs better than that of AODV and DSDV. Hence DSR protocol is modified based on an algorithm that considers the nodes' residual energy to extend the network lifetime. Implementation of modified protocol shows 22 % increase in the network lifetime and 13 % reduction in energy consumption.

An energy-efficient cross-layer-based opportunistic routing protocol and partially informed sparse autoencoder for data transfer in wireless sensor network