Adaptive and Energy Efficient Clustering Algorithm for Event-Driven Application in Wireless Sensor Networks (AEEC)

The emergence of wireless sensor network (WSN) makes the communication between people and things more extensive, and provides a new way for people to obtain information and more accurate real‐time communication. However, the regional distance in WSN is still a big problem. This method can not only optimize the cluster structure, but also reduce the number of member nodes in the cluster, the cluster head receiving energy, and reduce the data transmission distance between nodes. At the same time, the number of packets received by the base station increases, so that more sensing information can be obtained. The simulation results showed that compared with the smart Ethernet protection (SEP) protocol and the low energy adaptive clustering hierarchy (LEACH) protocol, the number of first node deaths (FND) of the grey wolf optimizer (GWO) algorithm was 153 and 233 times different from those of the SEP and LEACH protocols respectively at 100m*100m. In the case of 200m*200m, compared with that of SEP and LEACH, the number of FND of GWO was 152 and 200 times different. Finally, in the case of 300m*300m, compared with that of SEP and LEACH, the number of FND of GWO was 142 and 158 times different. The GWO algorithm has a higher node ARE ratio in a wider region. In the same 1000 rounds, the node ARE of GWO was 61%, while the node ARE of SEP and LEACH protocols were 7% and 3%, respectively. From the above results, it can be found that the GWO algorithm has been greatly improved in terms of network energy efficiency, network lifetime, etc., and can still work normally under larger scale monitoring. The innovation of this article lies in the localization problem of fixed node mobile sensor networks, proposing a mobile sensor network localization method based on mobile error nodes. This can optimize the distance between nodes and improve the positioning accuracy of the algorithm in both distributed and centralized situations. This article is protected by copyright. All rights reserved.

A wireless sensor network consists of spatially distributed autonomous devices using sensors to monitor physical or environmental conditions. A WSN system incorporates a gateway that provides wireless connectivity back to the wired world and distributed nodes. Energy efficiency and data gathering is a major concern in many applications of Wireless Sensor Networks (WSNs). Data aggregation algorithm is used to gather and aggregate data in an energy efficient manner so that network lifetime is enhanced. Low Energy Adaptive Clustering Hierarchy (LEACH) is a cluster based protocol for micro sensor networks which achieves energy efficient, scalable routing and fair media access for sensor nodes. Energy Efficient Clustering and Data Aggregation(EECDA) protocol combines the ideas of energy efficient cluster based routing and data aggregation to achieve a better performance in terms of lifetime and stability. This paper compares the two protocols in terms of lifetime and the energies of the nodes.

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 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) 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

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.

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.

The present study compared the newly proposed fault tolerance multipath routing protocol (MRP-FT) under the particle swarm optimization-based fault tolerant routing (PSO-FT) technique to the existing low-energy adaptive clustering hierarchy (LEACH) protocol applied in different combinations of inter-node numbers (N ) ranging from 100 to 300 nodes (N100−300) in wireless sensor networks (WSNs) with different area sizes (Xm × Ym) of 100–1000 m2 (WSN100−1000) to enhance energy efficiency and reliability of WSNs. The implementation of MRP-FT protocol significantly decreased the packet overhead by 36.0–69.5%, delay by 40.4–52.9%, and energy consumption by 35.9–52.9%, while increasing reliability by 97.0–104.1%, compared to the existing LEACH protocol. For instance, at N100−200, the LEACH simulated packet overhead increased from 76-89 packets at t = 500 s with an increase in WSN size from 100 to 1000. At N300 + WSN100, the packet overhead showed the highest decrease of ca. 69.5% with MRP-FT over the LEACH protocol. The implementation of the MRP-FT protocol reduced energy consumption by 35–123 J over the LEACH protocol.

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 (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.

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.

Wireless sensor network comprises of small sensor nodes with limited resources. Typical applications of sensor network are Weather monitoring, Civil Applications, Battle field monitoring, Intrusion Detection etc. These sensor networks have limitations of system resources like battery power, communication range and processing capability. Low processing power and wireless connectivity make such networks vulnerable to various types of network attacks. Sensor network uses Low Energy Adaptive Clustering Hierarchy (LEACH), which is a TDMA based MAC protocol that balances the clustering energy, hence the network lifetime is prolonged. As the Cluster-heads are selected randomly so there are some disadvantages regarding LEACH protocol such as if once the CH dies the whole network fails. Hence we propose a new approach in cluster-head selection. In our approach, a modified cluster-head selection algorithm has been proposed based on remaining battery life and distance and detection of malicious nodes in an effective way so that no attack can ruin the normal network operation.

The requirement for operation with low energy consumption is one of the major constraints that guide the de- sign of routing protocol in Wireless Sensor Networks (WSN) because each node is powered by a limited and generally an irreplaceable source of energy. In this context, we would like to propose a new protocol which respects the energy constraints, nodes' life duration and packets reception. This work is based on the protocol LEACH-C (Low Energy Adaptive Clustering Hierarchy) which uses a centralized architecture to select clus- ter-heads while involving the base station and the sensors' local information. It addresses the isolation problem of remote nodes that fail to communicate their information (coordinates and residual energies) to the base station. This results in an ineffi- cient group formation that leads to a huge loss of data and there- fore the network loses its performance. For this, we propose a solution that takes into account the remote nodes during the formation of groups. This new protocol, called LEACH-CKM, uses the K-means classification method to group the nodes and Minimum Transmission Energy routing protocol (MTE) to route information from remote nodes. Keywords—WSN; Routing Protocol; Energy Optimization; Clustering.