Energy-efficient Clustering Routing Research Articles

Hybrid Boosted Chameleon and modified Honey Badger optimization algorithm-based energy efficient cluster routing protocol for cognitive radio sensor network

Single clustering protocols cannot meet the event-driven and time-triggered traffic requirements of Cognitive Radio Sensor Networks (CRSNs). The long wait between the completion of events and the process of clustering and searching for accessible routes results in increased time for information transmission. This paper proposed a Hybrid Boosted Chameleon and Modified Honey Badge optimization Algorithm-based Energy Efficient cluster routing protocol (HBCMHBOA) for handling the issues of traffic driven information transfer with energy efficiency in the CRSNs. This HBCMHBOA is proposed as one among few event-driven and time-triggered clustering protocol for the requirements of CRSNs. The integration of Boosted Chameleon and Modified Honey Badge optimization Algorithm is adopted for determining optimal number of clusters and constructs the structure of primitive clusters in an automated way to serve the time-triggered traffic in a periodic manner. It adopted priority-based schedule and its associated frame structure for guaranteeing reliable event-driven information delivery. It leveraged the merits of time-triggering for the construction of clustering architecture and confirmed than none of the cluster construction and selection of routes are facilitated after the emergent events. This characteristic helps in permitting only the nodes and their associated Cluster Heads (CHs) of CRSNs to discover emergent events. It facilitates the coverage of a fewer nodes, especially when sink is positioned in a corner to minimize the delay and node energy consumption. The simulation results of the proposed HBCMHBOA confirmed a reduction in total energy consumption and number of covered nodes on an average of 34.12 %, and 26.89 % than the prevailing studies.

Enhanced centroid-based energy-efficient clustering routing protocol for serverless based wireless sensor networks

Serverless computing is a new concept as cloud computing, which dynamically manages the networks and is applied in Serverless Wireless Sensor Networks (SWSN) to help the networks. These networks are becoming famous for monitoring various physical and environmental factors. Serverless computing also facilitates the networks by offering an extensive range of applications. Different applications have been designed for monitoring purposes where the sensor nodes sense the data and transmit it to the base station through single or multi-hop routing. However, existing routing protocols cannot manage the sensor nodes’ energy issues because of the complex routing processes and depleted their power before their time. Because of these limitations, the nodes close to BS continuously rely on the network for data forwarding. As a result, these nodes cause energy consumption and lead to a useless state. This paper proposes a serverless architecture and designs an Enhanced Centroid-based Energy Efficient Clustering (ECEEC) protocol for SWSN networks. The proposed serverless architecture provides automated scalability, cost-effective services, and stateless execution. In addition, the proposed protocol offers the cluster head selection and its rotation to maximize the energy efficiency in the network. Furthermore, gateway nodes are chosen in every cluster to overcome the load on the cluster head. Simulation results indicated the excellent performance of the proposed protocol as compared to the existing routing protocols concerning network lifetime and energy consumption. The proposed protocol shows better reliability with nodes failing at 650 rounds compared to 600 rounds, especially with 5 % and 10 % Cluster Heads. The proposed protocol exhibits superior energy efficiency consumption of SNs under varying CH percentages, indicating the protocol’s consistent performance across different scenarios.

Energy efficient cluster routing protocol for wireless sensor networks using hybrid metaheuristic approache’s

The development of wireless sensor networks (WSNs) has been particularly notable in the context of smart computing, where various application areas have been identified. These networks consist of self-configured, small sensor nodes with battery power. However, sensors have limited energy and resources at their disposal. When unbalanced nodes exist within the network, it adversely affects the network’s lifetime due to increased power consumption. Designing efficient routing for wireless sensor networks remains a challenging task, particularly in terms of energy efficiency. Optimal solutions to address these challenges involve reducing node energy consumption through the implementation of clustering techniques. The current clustering schemes do not take into account node energy balancing, node density, and scalability when selecting low-energy nodes as cluster heads. The existing system is limited to exploring global opportunities within specified search zones. To enhance the performance of WSNs, a hybrid approach combining artificial bee colony (ABC) and ant colony optimization (ACO) has been developed. This approach helps in selecting an ideal cluster head from a group of terminals. Several factors are considered in the cluster head election, including residual energy at the nodes, distance to neighbors, distance to the base station, node degree, and node centrality. ACO determines the path between the cluster leader and the base station (BS) by selecting the most efficient route in terms of distance, remaining power, and node degrees. The performance of this proposed methodology has been analyzed in terms of energy consumption, network lifetime, and data packets at the base station. A comparison has been made between the outputs of the proposed methods and traditional benchmarking methods. The results reveal a substantial improvement in the average network lifetime, showcasing an increase of 40.50%, 33.17%, 25.00%, and 15.49% when compared to LEACH, Beecluster, iABC, and BeeSensor, respectively. In terms of alive nodes, our solution surpasses LEACH, Beecluster, iABC, and BeeSensor by 28.7%, 22.51%, 20.95%, and 12.47%, respectively. Additionally, the energy consumption of our approach proves to be significantly lower than LEACH, Beecluster, iABC, and BeeSensor, recording reductions of 47.25%, 32.40%, 27.38%, and 22.20%, respectively.

An Energy Efficient Clustering Routing Protocol Based on Arithmetic Progression for Underwater Acoustic Sensor Networks

An Energy Efficient Clustering Routing Protocol Based on Arithmetic Progression for Underwater Acoustic Sensor Networks

Priority based energy efficient hybrid cluster routing protocol for underwater wireless sensor network

<p class="Affiliation"><span lang="EN-US">A little change in the environment that goes unnoticed in an underwater communication network might lead to calamity. A little alteration in the environment must also be adequately analyzed in order to deal with a potential crisis. A priority-based routing protocol is required to ensure that the vital data perceived by the sensor about the environment changes. The priority-based routing system guarantees that vital data packets are delivered at a quicker pace to the destination or base station for further processing. In this work, we present a priority-based routing protocol based on the energy efficient hybrid cluster routing protocol (EEHRCP) algorithm. The suggested approach keeps two distinct queues for lower and higher priority data packets. In order to ensure that these packets get at their destination without any information loss and at a quicker rate, all of the crucial sensed data is passed through a higher priority queue. Test findings show that the suggested technique increases throughput, delivery percentage, and reduces latency for the crucial data packets.</span></p>

GM-WOA: a hybrid energy efficient cluster routing technique for SDN-enabled WSNs

GM-WOA: a hybrid energy efficient cluster routing technique for SDN-enabled WSNs

Energy Efficient Multi-Hop Multipath Sub Clustering Routing Protocol for Wireless Sensor Network

The aim of this paper is to design Energy Efficient Multi-Hop Multipath Sub Clustering Routing Protocol for Wireless Sensor Networks. This paper presented a routing protocol for heterogenous WSN for the selection of cluster head based on the highest remaining residual energy in a node by using the optimal probabilistic equation. The heterogenous technique contains the multi-hoping of inter clustering communication and connectivity of remaining sensor nodes by using sub clustering technique. The sensor nodes with high residual energy will become cluster head and sends data packets to the base station. After successive simulations of this routing protocol on to MATLAB 2022b software, it was consequently found out that it improves the number of alive nodes, number of data packets transmitted to the sink in a network and also improves the network lifetime by 75%-80% in comparison with other protocols. The simulation results were carried out by comparing the proposed method with O LEACH, EEE LEACH, Z-SEP, LEACH. The result shows that, our proposed method is more stable and energy efficient than the other routing protocols.

A survey of energy-efficient clustering routing protocols for wireless sensor networks based on metaheuristic approaches

A survey of energy-efficient clustering routing protocols for wireless sensor networks based on metaheuristic approaches

IACRA: Lifetime Optimization by Invulnerability-Aware Clustering Routing Algorithm Using Game-Theoretic Approach for Wsns.

Energy limitation is one of the intrinsic shortcomings of wireless sensor networks (WSNs), although it has been widely applied in disaster response, battlefield surveillance, wildfire monitoring, radioactivity detection, etc. Due to the large amount of energy consumed for data transmission, how to prolong the network lifespan by designing various hierarchical routing protocols has attracted more and more attention. As a result, numerous achievements have emerged successively. However, these presented mechanisms can rarely guarantee the satisfactory quality of service (QoS), while lowering the energy cost level of WSNs. Meanwhile, invulnerability is undoubtedly an excellent quantitative index to assess QoS. Therefore, it is critical to develop a practical routing method to optimize network lifetime by considering both invulnerability and energy efficiency. Game theory is suitable for such a critical problem as it can be used in node or at network level to encourage the decision-making capabilities of WSNs. In this paper, a novel invulnerability-aware clustering routing algorithm (IACRA) using game-theoretic method is proposed to solve the predicament. The core features of the addressed game-theory-based routing protocol include integral invulnerability awareness, optimal cluster head selection in hierarchical routing, distance-aware cluster head discovery, and cluster rotation update mechanism for lifetime optimization. Particularly, the integral network invulnerability based on weighted fusion is constructed for further defining the profit model by combining the invulnerability indicators used to evaluate the local and whole network. Meanwhile, the optimal probability function of every node elected as CH in per cluster is established through the game between invulnerability and node energy consumption. In addition, the cluster update mechanism base on cluster rotation is proposed to avoid the rapid death of nodes with large energy consumption for maximizing network lifetime. The experimental results indicated a significant improvement in energy balance as well as in invulnerability compared with the other three kinds of well-known clustering routing protocols including GEEC (Game-theory-based energy efficient clustering routing protocol), HGTD (Hybrid, game-theory-based distributed clustering protocol), and EEGC (Efficient energy-aware and game-theory-based clustering protocol). Concretely, at the 400 communication rounds, the invulnerability of IACRA was higher than that of GEEC, HGTD, and EEGC by 77.56%, 29.45% and 15.90%, respectively, and the average residual energy of IACRA was 8.61%, 18.35% and 6.36% larger than that of GEEC, HGTD, and EEGC, respectively. Based on these results, the proposed protocol can be utilized to increase the capability of WSNs against deterioration of QoS and energy constraints.

Energy efficient clustering routing protocol using novel admission allotment scheme (AAS) based intra-cluster communication for Wireless Sensor Network

Energy efficient clustering routing protocol using novel admission allotment scheme (AAS) based intra-cluster communication for Wireless Sensor Network

A Hybrid Mayfly-Aquila Optimization Algorithm Based Energy-Efficient Clustering Routing Protocol for Wireless Sensor Networks.

In recent times, Wireless Sensor Networks (WSNs) are becoming more and more popular and are making significant advances in wireless communication thanks to low-cost and low-power sensors. However, since WSN nodes are battery-powered, they lose all of their autonomy after a certain time. This energy restriction impacts the network’s lifetime. Clustering can increase the lifetime of a network while also lowering energy use. Clustering will bring several similar sensors to one location for data collection and delivery to the Base Station (BS). The Cluster Head (CH) uses more energy when collecting and transferring data. The life of the WSNs can be extended, and efficient identification of CH can minimize energy consumption. Creating a routing algorithm that considers the key challenges of lowering energy usage and maximizing network lifetime is still challenging. This paper presents an energy-efficient clustering routing protocol based on a hybrid Mayfly-Aquila optimization (MFA-AOA) algorithm for solving these critical issues in WSNs. The Mayfly algorithm is employed to choose an optimal CH from a collection of nodes. The Aquila optimization algorithm identifies and selects the optimum route between CH and BS. The simulation results showed that the proposed methodology achieved better energy consumption by 10.22%, 11.26%, and 14.28%, and normalized energy by 9.56%, 11.78%, and 13.76% than the existing state-of-art approaches.

Design of an enhanced threshold sensitive distributed energy efficient clustering routing protocol for WSN-based IoT

ABSTRACT Internet of Things (IoT) is a smart technology that allows communication between humans and all things that contain sensors, actuators, embedded electronics, software, or storage via the internet. As a result, IoT should be seen as a part of the overall Internet of the future, which is likely to be very different from what we are using today. Despite the advantages of IoT, energy efficiency is still considered one of the main challenges in IoT. There are many algorithms that have been proposed to solve the energy efficiency problem. Unfortunately, most of them have some drawbacks. As a result, an Enhanced Threshold Sensitive Distributed Energy-Efficient Clustering routing protocol (ETSDEEC) for WSN-based IoT was proposed in this paper. Hard and soft thresholds are used in the proposed protocol to determine whether nodes are allowed to send their sensed data. From the simulation, we found that the proposed ETSDEEC protocol performs better than EDEEC and TDEEC protocols in terms of network lifetime, energy dissipationand throughput. It is also found that the proposed ETSDEEC can improve the lifetime by 59.8% in comparison to EDEEC and about 37.7% in comparison to TDEEC protocols.

Distributed energy-efficient clustering routing protocol for wireless sensor networks using affinity propagation and fuzzy logic

Organizing nodes into clusters and forwarding data to the base station (BS) in clustering routing protocols have been widely utilized to improve the energy efficiency, scalability and stability of wireless sensor networks. Making decisions on how many clusters are formed, which nodes are selected as cluster heads (CHs) and who become the relay nodes significantly impact the network performance. Therefore, a distributed clustering routing protocol combined affinity propagation (AP) with fuzzy logic called DAPFL is proposed in this paper, which considers not only energy efficiency but also energy balance to extend the network lifetime. In DAPFL, AP is firstly used to determine the number of clusters and select the best CHs simultaneously based on residual energy, distance between nodes. Then, the optimal next-hop CHs are chosen by using fuzzy logic system with residual energy, data length and distance to BS as descriptors. Simulations in different scenarios are carried out to verify the effectiveness of DAPFL, and the results show that DAPFL exhibits the promising performance in terms of network energy consumption, standard deviation of residual energy, network throughput and lifetime, compared with the up-to-date distributed clustering routing protocols EEFUC, EEFRP, LEACH-AP and APSA.

An improved Aquila optimization with fuzzy model based energy efficient cluster routing protocol for wireless sensor networks

Due to the latest advances in microelectronics, wireless sensor networking (WSN) has been introduced in many applications. The flow of event data in WSN applications requires timely and reliable distribution so that immediate response and appropriate action can be taken. However, the limited power supply to the sensor terminal causes a transmission between the delay on the way to the base station and the power consumption. Clustering techniques are essential in developing the WSN routing algorithm that improves network operating time and power efficiency. However, due to the unbalanced power consumption between the terminals, the WSN is the optimal, energy efficient routing. In this work, we propose an energy efficient cluster based routing protocol (EEC-HO) for WSN using hybrid optimization algorithm. We introduce an improved Aquila optimization with fuzzy (IAO-Fuzzy) model for optimal and efficient cluster formation and cluster head (CH) computation. The main objective of proposed IAO-Fuzzy model used to compute the trust degree of each node, the highest trust node is considered as CH. After that, the hybrid beetle search induced decision making (BSDM) algorithm for optimal path selection to transfer data transfer between two nodes. Finally, the simulation results of proposed EEC-HO routing protocol is compared with the existing routing protocols. For the impact of sensor node density case, we observed that the effectiveness of proposed EEC-HO routing protocol is 45.887%, 30.666%, 56.666%, 17.629% and 41.666% efficient than existing protocols in terms of energy consumption, network lifetime, average hop count, throughput and dead nodes respectively. For the impact of simulation rounds case, we observed that the effectiveness of proposed EEC-HO routing protocol is 21.216%, 35.417%, 41.667%, 18.568% and 40.000% efficient than existing protocols in terms of energy consumption, network lifetime, average hop count, throughput and number of dead nodes respectively.

Chaotic Search-and-Rescue-Optimization-Based Multi-Hop Data Transmission Protocol for Underwater Wireless Sensor Networks.

Underwater wireless sensor networks (UWSNs) have applications in several fields, such as disaster management, underwater navigation, and environment monitoring. Since the nodes in UWSNs are restricted to inbuilt batteries, the effective utilization of available energy becomes essential. Clustering and routing approaches can be employed as energy-efficient solutions for UWSNs. However, the cluster-based routing techniques developed for conventional wireless networks cannot be employed for a UWSN because of the low bandwidth, spread stay, underwater current, and error probability. To resolve these issues, this article introduces a novel chaotic search-and-rescue-optimization-based multi-hop data transmission (CSRO-MHDT) protocol for UWSNs. When using the CSRO-MHDT technique, cluster headers (CHs) are selected and clusters are prearranged, rendering a range of features, including remaining energy, intracluster distance, and intercluster detachment. Additionally, the chaotic search and rescue optimization (CSRO) algorithm is discussed, which is created by incorporating chaotic notions into the classic search and rescue optimization (SRO) algorithm. In addition, the CSRO-MHDT approach calculates a fitness function that takes residual energy, distance, and node degree into account, among other factors. A distinctive aspect of the paper is demonstrated by the development of the CSRO algorithm for route optimization, which was developed in-house. To validate the success of the CSRO-MHDT method, a sequence of tests were carried out, and the results showed the CSRO-MHDT method to have a packet delivery ratio (PDR) of 88%, whereas the energy-efficient clustering routing protocol (EECRP), the fuzzy C-means and moth–flame optimization (FCMMFO), the fuzzy scheme and particle swarm optimization (FBCPSO), the energy-efficient grid routing based on 3D cubes (EGRC), and the low-energy adaptive clustering hierarchy based on expected residual energy (LEACH-ERE) methods have reached lesser PDRs of 83%, 81%, 78%, 77%, and 75%, respectively, for 1000 rounds. The CSRO-MHDT technique resulted in higher values of number of packets received (NPR) under all rounds. For instance, with 50 rounds, the CSRO-MHDT technique attained a higher NPR of 3792%.

POWER: probabilistic weight-based energy-efficient cluster routing for large-scale wireless sensor networks

POWER: probabilistic weight-based energy-efficient cluster routing for large-scale wireless sensor networks

An Energy-Efficient Clustering Routing for Wireless Sensor Networks Based on Energy Consumption Optimization

In order to alleviate energy consumption of wireless sensor networks (WSNs), energy consumption optimization-based clustering routing (ECOR) is proposed in this paper. In ECOR, network is gridding by hexagon. And there is only a cluster head (CH) in each hexagon, which makes the distribution of CHs more even. Residual energy of nodes and distance from the centroid of hexagon are used to elect CHs. For any a CH, dynamic time slot allocation strategy is adopted to allocate time slot for its cluster members. According to status of cluster members, the duration of time slot is dynamically adjusted. In intercluster communication, the Dijkstra algorithm is used to construct the shortest path between CHs in order to shorten the distance of transmitting data. Simulation results show that the ECOR algorithm outperforms the improved-Low Energy Adaptive Clustering Hierarchy (I-LEACH) algorithm in terms of distribution of CHs and energy consumption.

F2SO: An Energy Efficient Cluster Based Routing Protocol Using Fuzzy Firebug Swarm Optimization Algorithm in WSN

AbstractThe most important design concern associated with wireless sensor networks is energy efficiency that mostly deals with routing and clustering techniques. The major aim of this study is to provide energy efficient cluster routing protocols for wireless sensor network. Initially, we used a Honey Badger Algorithm for cluster heads selection. Honey Badger Algorithm is used to choose the distance to the base station, residual energy, distance to its neighbors, node degree node and centrality with the optimal cluster head among all sensors. The routing between base stations and cluster heads is performed through Fuzzy Firebug Swarm Optimization algorithm. Hence, the fuzzy decision module automatically adjusts the search behavior of firebug swarm optimization. Fuzzy rules are used with the node degree, residual energy and distance to the base station to address the firebug swarm optimization algorithm’s constraints during routing. Finally, cluster maintenance is done which is the major step to eliminate the failure nodes. This process assists to improve the network lifetime during data transmission by eliminating the faulty nodes and establish an efficient path between the source node and the base station. Wide experimentation is accomplished to assess the efficiency of the proposed protocol using different evaluation measures. The proposed methodology offers improved end-to-end delay, increased packet delivery ratio, higher throughput, low packet drop ratio and minimizes energy consumption when compared with the existing wireless sensor network routing protocols.

Routing strategy of reducing energy consumption for underwater data collection

Underwater Wireless Sensor Networks (UWSNs) are widely used in many fields, such as regular marine monitoring and disaster warning. However, UWSNs are still subject to various limitations and challenges: ocean interferences and noises are high, bandwidths are narrow, and propagation delays are high. Sensor batteries have limited energy and are difficult to be replaced or recharged. Accordingly, the design of routing protocols is one of the solutions to these problems. Aiming at reducing and balancing network energy consumption and effectively extending the life cycle of UWSNs, this paper proposes a Hierarchical Adaptive Energy-efficient Clustering Routing (HAECR) strategy. First, this strategy divides hierarchical regions based on the depth of the sensor node in a three dimensional (3D) space. Second, sensor nodes form different competition radii based on their own relevant attributes and remaining energy. Nodes in the same layer compete freely to form clusters of different sizes. Finally, the transmission path between clusters is determined according to comprehensive factors, such as link quality, and then the optimal route is planned. The simulation experiment is conducted in the monitoring range of the 3D space. The simulation results prove that the HAECR clustering strategy is superior to LEACH and UCUBB in terms of balancing and reducing energy consumption, extending the network lifetime, and increasing the number of data transmissions.

Underwater Wireless Sensor Networks: An Energy-Efficient Clustering Routing Protocol Based on Data Fusion and Genetic Algorithms

Due to the limited battery energy of underwater wireless sensor nodes and the difficulty in replacing or recharging the battery underwater, it is of great significance to improve the energy efficiency of underwater wireless sensor networks (UWSNs). We propose a novel energy-efficient clustering routing protocol based on data fusion and genetic algorithms (GAs) for UWSNs. In the clustering routing protocol, the cluster head node (CHN) gathers the data from cluster member nodes (CMNs), aggregates the data through an improved back propagation neural network (BPNN), and transmits the aggregated data to a sink node (SN) through a multi-hop scheme. The effective multi-hop transmission path between the CHN and the SN is determined through the enhanced GA, thereby improving transmission efficiency and reducing energy consumption. This paper presents the GA based on a specific encoding scheme, a particular crossover operation, and an enhanced mutation operation. Additionally, the BPNN employed for data fusion is improved by adopting an optimized momentum method, which can reduce energy consumption through the elimination of data redundancy and the decrease of the amount of transferred data. Moreover, we introduce an optimized CHN selecting scheme considering residual energy and positions of nodes. The experiments demonstrate that our proposed protocol outperforms its competitors in terms of the energy expenditure, the network lifespan, and the packet loss rate.