A Co-evolutionary Algorithm-based Enhanced Grey Wolf Optimizer for the Routing of Wireless Sensor Networks

Wireless networks are frequently installed in arduous environments, heightening the importance of their consistent operation. To achieve this, effective strategies must be implemented to extend the lifespan of nodes. Energy-conserving routing protocols have emerged as the most prevalent methodology, as they strive to elongate the network\u27s lifetime while guaranteeing reliable data routing with minimal latency. In this paper, a plethora of studies have been done with the purpose of improving network routing, such as the integration of clustering techniques, heterogeneity, and swarm intelligence-inspired approaches. A comparative investigation was conducted on a variety of swarm-based protocols, including a new coevolutionary binary grey wolf optimizer (Co-BGWO), a BGWO, a binary whale optimization, and a binary Salp swarm algorithm. The objective was to optimize cluster heads (CHs) positions and their number during the initial stage of both two-level and three-level heterogeneous networks. The study concluded that these newly developed protocols are more reliable, stable, and energy-efficient than the standard SEP and EDEEC heterogeneous protocols. Specifically, in 150 m2 area of interest, the Co-BGWO and BGWO protocols of two levels were found the most efficient, with over than 33% increase in remaining energy percentage compared to SEP, and over 24% more than EDEEC in three-level networks

Metaheuristics Techniques for Cluster Head Selection in WSN: A Survey

In recent years, Wireless sensor communication is growing expeditiously on the capability to gather information, communicate and transmit data effectively. Clustering is the main objective of improving the network lifespan in Wireless sensor network. It includes selecting the cluster head for each cluster in addition to grouping the nodes into clusters. The cluster head gathers data from the normal nodes in the cluster, and the gathered information is then transmitted to the base station. However, there are many reasons in effect opposing unsteady cluster head selection and dead nodes. The technique for selecting a cluster head takes into factors to consider including residual energy, neighbors’ nodes, and the distance between the base station to the regular nodes. In this study, we thoroughly investigated by number of methods of selecting a cluster head and constructing a cluster. Additionally, a quick performance assessment of the techniques' performance is given together with the methods' criteria, advantages, and future directions

A Differential Evolution-Based Routing Algorithm for Environmental Monitoring Wireless Sensor Networks

The traditional Low Energy Adaptive Cluster Hierarchy (LEACH) routing protocol is a clustering-based protocol. The uneven selection of cluster heads results in premature death of cluster heads and premature blind nodes inside the clusters, thus reducing the overall lifetime of the network. With a full consideration of information on energy and distance distribution of neighboring nodes inside the clusters, this paper proposes a new routing algorithm based on differential evolution (DE) to improve the LEACH routing protocol. To meet the requirements of monitoring applications in outdoor environments such as the meteorological, hydrological and wetland ecological environments, the proposed algorithm uses the simple and fast search features of DE to optimize the multi-objective selection of cluster heads and prevent blind nodes for improved energy efficiency and system stability. Simulation results show that the proposed new LEACH routing algorithm has better performance, effectively extends the working lifetime of the system, and improves the quality of the wireless sensor networks

Extending the Lifetime of Wireless Sensor Networks Based on an Improved Multi-objective Artificial Bees Colony Algorithm

Reducing the sensors\u27 energy expenditure to prolong the network lifespan as long as possible remains a fundamental problem in the field of wireless networks. Particularly in applications with inaccessible environments, which impose crucial constraints on sensor replacement. It is, therefore, necessary to design adaptive routing protocols, taking into account the environmental constraints and the limited energy of sensors. To have an energy-efficient routing protocol, a new cluster heads’ (CHs) selection strategy using a modified multi-objective artificial bees colony (MOABC) optimization is defined. The modified MOABC is based on the roulette wheel selection over non-dominated solutions of the repository (hyper-cubes) in which a rank is assigned to each hypercube based on its density in dominated solutions of the current iteration and then a random food source is elected by roulette from the densest hypercube. The proposed work aims to find the optimal set of CHs based on their residual energies to ensure an optimal balance between the nodes\u27 energy consumption. The achieved results proved that the proposed MOABC-based protocol considerably outperforms recent studies and well-known energy-efficient protocols, namely: LEACH, C-LEACH, SEP, TSEP, DEEC, DDEEC, and EDEEC in terms of energy efficiency, stability, and network lifespan extension

On-demand fuzzy clustering and ant-colony optimisation based mobile data collection in wireless sensor network

In a wireless sensor network (WSN), sensor nodes collect data from the environment and transfer this data to an end user through multi-hop communication. This results in high energy dissipation of the devices. Thus, balancing of energy consumption is a major concern in such kind of network. Appropriate cluster head (CH) selection may provide to be an efficient way to reduce the energy dissipation and prolonging the network lifetime in WSN. This paper has adopted the concept of fuzzy if-then rules to choose the cluster head based on certain fuzzy descriptors. To optimise the fuzzy membership functions, Particle Swarm Optimisation (PSO) has been used to improve their ranges. Moreover, recent study has confirmed that the introduction of a mobile collector in a network which collects data through short-range communications also aids in high energy conservation. In this work, the network is divided into clusters and a mobile collector starts from the static sink or base station and moves through each of these clusters and collect data from the chosen cluster heads in a single-hop fashion. Mobility based on Ant-Colony Optimisation (ACO) has already proven to be an efficient method which is utilised in this work. Additionally, instead of performing clustering in every round, CH is selected on demand. The performance of the proposed algorithm has been compared with some existing clustering algorithms. Simulation results show that the proposed protocol is more energy-efficient and provides better packet delivery ratio as compared to the existing protocols for data collection obtained through Matlab Simulations

Optimal leach protocol with improved bat algorithm in wireless sensor networks

© 2019, Korean Society for Internet Information. All rights reserved. A low-energy adaptive clustering hierarchy (LEACH) protocol is a low-power adaptive cluster routing protocol which was proposed by MIT’s Chandrakasan for sensor networks. In the LEACH protocol, the selection mode of cluster-head nodes is a random selection of cycles, which may result in uneven distribution of nodal energy and reduce the lifetime of the entire network. Hence, we propose a new selection method to enhance the lifetime of network, in this selection function, the energy consumed between nodes in the clusters and the power consumed by the transfer between the cluster head and the base station are considered at the same time. Meanwhile, the improved FTBA algorithm integrating the curve strategy is proposed to enhance local and global search capabilities. Then we combine the improved BA with LEACH, and use the intelligent algorithm to select the cluster head. Experiment results show that the improved BA has stronger optimization ability than other optimization algorithms, which the method we proposed (FTBA-TC-LEACH) is superior than the LEACH and LEACH with standard BA (SBA-LEACH). The FTBA-TC-LEACH can obviously reduce network energy consumption and enhance the lifetime of wireless sensor networks (WSNs)

A multi-hop routing protocol for an energy-efficient in wireless sensor network

The low-energy adaptive clustering hierarchy (LEACH) protocol has been developed to be implemented in wireless sensor networks (WSNs) systems such as healthcare and military systems. LEACH protocol depends on clustering the employed sensors and electing one cluster head (CH) for each cluster. The CH nodes are changed periodically to evenly distribute the energy load among sensors. Updating the CH node requires electing different CH and re-clustering sensors. This process consumes sensors’ energy due to sending and receiving many broadcast and unicast messages thus reduces the network lifetime, which is regarded as a significant issue in LEACH. This research develops a new approach based on modifying the LEACH protocol to minimize the need of updating the cluster head. The proposal aims to extend the WSN’s lifetime by maintaining the sensor nodes’ energy. The suggested approach has been evaluated and shown remarkable efficiency in comparison with basic LEACH protocol and not-clustered protocol in terms of extending network lifetime and reducing the required sent messages in the network reflected by 15%, and, in addition, reducing the need to reformatting the clusters frequently and saving network resources

Trust And Energy-Aware Routing Protocol for Wireless Sensor Networks Based on Secure Routing

Wireless Sensor Network (WSN) is a network area that includes a large number of nodes and the ability of wireless transmission. WSNs are frequently employed for vital applications in which security and dependability are of utmost concern. The main objective of the proposed method is to design a WSN to maximize network longevity while minimizing power usage. In a WSN, trust management is employed to encourage node collaboration, which is crucial for achieving dependable transmission. In this research, a novel Trust and Energy Aware Routing Protocol (TEARP) in wireless sensors networks is proposed, which use blockchain technology to maintain the identity of the Sensor Nodes (SNs) and Aggregator Nodes (ANs). The proposed TEARP technique provides a thorough trust value for nodes based on their direct trust values and the filtering mechanisms generate the indirect trust values. Further, an enhanced threshold technique is employed to identify the most appropriate clustering heads based on dynamic changes in the extensive trust values and residual energy of the networks. Lastly, cluster heads should be routed in a secure manner using a Sand Cat Swarm Optimization Algorithm (SCSOA). The proposed method has been evaluated using specific parameters such as Network Lifetime, Residual Energy, Throughpu,t Packet Delivery Ratio, and Detection Accuracy respectively. The proposed TEARP method improves the network lifetime by 39.64%, 33.05%, and 27.16%, compared with Energy-efficient and Secure Routing (ESR), Multi-Objective nature-inspired algorithm based on Shuffled frog-leaping algorithm and Firefly Algorithm (MOSFA) , and Optimal Support Vector Machine (OSVM)

Particle Swarm Optimization for the Clustering of Wireless Sensors

Clustering is necessary for data aggregation, hierarchical routing, optimizing sleep patterns, election of extremal sensors, optimizing coverage and resource allocation, reuse of frequency bands and codes, and conserving energy. Optimal clustering is typically an NP-hard problem. Solutions to NP-hard problems involve searches through vast spaces of possible solutions. Evolutionary algorithms have been applied successfully to a variety of NP-hard problems. We explore one such approach, Particle Swarm Optimization (PSO), an evolutionary programming technique where a \u27swarm\u27 of test solutions, analogous to a natural swarm of bees, ants or termites, is allowed to interact and cooperate to find the best solution to the given problem. We use the PSO approach to cluster sensors in a sensor network. The energy efficiency of our clustering in a data-aggregation type sensor network deployment is tested using a modified LEACH-C code. The PSO technique with a recursive bisection algorithm is tested against random search and simulated annealing; the PSO technique is shown to be robust. We further investigate developing a distributed version of the PSO algorithm for clustering optimally a wireless sensor network