Hybrid Metaheuristic Aided Energy Efficient Cluster Head Selection in Wireless Sensor Network

Clustering techniques in wireless sensor networks (WSNs) compare to random selection techniques is less costly due to the saving of time in journeys, reduction in number of transmissions and receptions at each node, identification, contacts, etc., which are valuable for increasing the overall network life, scalability of WSNs. Clustering sensor nodes is an effective and efficient technique for achieving the requirement. The maximizing lifetime of network by minimizing energy consumption poses a challenge in design of protocols. Therefore, proper organization of clustering and orientation of nodes within the cluster becomes one of the important issues to extend the lifetime of the whole sensor network through Cluster Head (CH). We investigate the problem of energy consumption in CH rotation in WSNs. In this paper, CH selection algorithm has been proposed from an unequal cluster. The total energy and expected number of packet retransmissions in delivering a packet from the sensor node to other nodes have been mathematically derived. In this paper, we applied the approach for producing energy-aware unequal clusters with optimal selection of CH and discussed several aspects of the network mathematically and statistically. The simulation results demonstrate that our approach of re-clustering in terms of energy consumption and lifetime parameters.

Wireless sensor networks are battery-powered ad hoc networks in which sensor nodes that are scattered over a region connect to each other and form multi-hop networks. Since these networks consist of sensors that are battery operated, care has to be taken so that these sensors use energy efficiently. This paper proposes an optimized hierarchical routing technique which aims to reduce the energy consumption and prolong network lifetime. In this technique, the selection of optimal cluster head (CHs) locations is based on artificial fish swarm algorithm that applies various behaviors such as preying, swarming, and following to the formulated clusters and then uses a fitness function to compare the outputs of these behaviors to select the best CHs locations. To prove the efficiency of the proposed technique, its performance is analyzed and compared to two other well-known energy efficient routing techniques: low-energy adaptive clustering hierarchy (LEACH) technique and particle swarm optimized (PSO) routing technique. Simulation results show the stability and efficiency of the proposed technique. Simulation results show that the proposed method outperforms both LEACH and PSO in terms of energy consumption, number of alive nodes, first node die, network lifetime, and total data packets received by the base station. This may be due to considering residual energies of nodes and their distance from base station , and alternating the CH role among cluster's members. Alternating the CH role balances energy consumption and saves more energy in nodes.

Energy efficiency has become a primary issue in wireless sensor networks (WSN). The sensor networks are powered by battery and thus they turn out to be dead after a particular interval. Hence, enhancing the data dissipation in energy efficient manner remains to be more challenging for increasing the life span of sensor devices. It has been already proved that the clustering method could improve or enhance the life span of WSNs. In the clustering model, the selection of cluster head (CH) in each cluster regards as the capable method for energy efficient routing, which minimizes the transmission delay in WSN. However, the main problem dealt with the selection of optimal CH that makes the network service prompt. Till now, more research works have been processing on solving this issue by considering different constraints. Under this scenario, this paper attempts to develop a new clustering model with optimal cluster head selection by considering four major criteria like energy, delay, distance, and security. Further, for selecting the optimal CHs, this paper proposes a new hybrid algorithm that hybridizes the concept of dragon fly and firefly algorithm algorithms, termed fire fly replaced position update in dragonfly. Finally, the performance of the proposed work is carried out by comparing with other conventional models in terms of number of alive nodes, network energy, delay and risk probability.

Energy minimization in sensor nodes is the problem in wireless sensor networks (WSNs). The most widely accepted method to preserve energy of sensor nodes is clustering. In cluster based networks, energy consumption is higher in the nodes which are closer to the sink as compared to the nodes which are located farther away from base station (BS). Various unequal clustering algorithms were proposed in the past to correct this issue. The major drawbacks in the findings are that the nodes, which join a specific cluster head, cause overburdening of the cluster head. In this paper, we present an algorithm namely energy efficient unequal sector clustering (EUSC) using multi-sector and unequal clustering approaches which improve the network’s energy efficiency. EUSC divides the network into multiple sectors based on nodes distances from BS. Selection of cluster heads in each sector is based on nodes distances to BS, residual energy and neighbor nodes proximities in that sector. Selection of a relay cluster head for data transmission is also based on residual energy, nodes distances to BS and queue length of nodes. In this paper, we have carried out some theoretical analysis of the nodes energy consumption in each sector and derived an expression for optimal number of clusters in each sector to minimize nodes energy consumption. Various simulations were carried out with MATLAB package to differentiate the competency of the proposed EUSC algorithm with that of the existing protocols ECHA and ‘PSO based protocol’. Simulation results in different network scenarios indicate that EUSC has given much improved performance than ECHA and ‘PSO based protocol’ in terms of number of clusters formed during each round, network lifetime and energy efficiency.

SummaryWireless sensor networks are significantly used for data sensing and aggregating dusts from a remote area environment in order to utilize them in a diversified number of engineering applications. The data transfer among the sensor nodes is attained through the inclusion of energy efficient routing protocols. These energy efficient routing necessitates optimal cluster head selection procedure for handling the challenge of energy consumption to extend the stability and lifetime in the sensor networks. The implementation of energy efficient routing is still complicated even when the process of clustering is enhanced through the cluster head selection. The majority of the existing cluster head selection schemes suffer from the issues of poor selection accuracy, increased computation, and duplicate nodes' selection. In this paper, hybrid shuffled frog leaping and improved biogeography‐based optimization algorithm (HSFLBOA) for optimal cluster head selection is proposed for resolving issues that are common in cluster head selection schemes. This proposed HSFLBOA used the objective function that used the parameters of node energy, data packet transmission delay, cluster traffic density, and internode distance in the cluster. The simulation results of the proposed HSFLBOA is determined to be significant in achieving superior throughput and network energy compared to benchmarked metaheuristic optimal cluster head schemes.

Multi-objective cluster head using self-attention based progressive generative adversarial network for secured data aggregation

An adaptive cellular automata scheme for diagnosis of fault tolerance and connectivity preserving in wireless sensor networks

Prolonged network lifetime, scalability and efficient load balancing are essential for optimal performance of a wireless sensor network. Clustering provides an effective way of extending the lifetime of a sensor network. Clustering is the process that divides sensor networks into smaller localized group (called clusters) of members with a cluster head. Clustering protocols need to elect optimal number of clusters in hierarchically structured wireless sensor networks. Any clustering scheme that elects clusters uniformly (irrespective of the distance from Base Station) incurs excessive energy usage on clusters proximal and distant to Base Station. In single hop networks a gradual increment in the energy depletion rate is observed as the distance from the cluster head increases[17]. This work focuses on the analysis of wasteful energy consumption within a uniform cluster head election model (EPEM) and provides an analytical solution to reduce the overall consumption of energy usage amongst the clusters elected in a wireless sensor network. A circular model of sensor network is considered, where the sensor nodes are deployed around a centrally located Base Station. The sensor network is divided into several concentric rings centred at the Base Station. A model, Unequal Probability Election Model (UEPEM), which elects cluster heads non-uniformly is proposed. The probability of cluster head election depends on the distance from the Base Station. UEPEM reduces the overall energy usage by about 21% over EPEM. The performance of UEPEM improves as the number of rings is increased.

SummaryThe arbitrary distribution of sensor nodes and irregularity of the routing path led to unordered data, which is complex to handle in a wireless sensor network (WSN). To increase WSN lifetime, data aggregation models are developed to minimize energy consumption or ease the computational burden of nodes. The compressive sensing (CS) provides a new technique for prolonging the WSN lifetime. A hybrid optimized model is devised for cluster head (CH) selection and CS‐based data aggregation in WSN. The method aids to balance the energy amidst different nodes and elevated the lifetime of the network. The hybrid golden circle inspired optimization (HGCIO) is considered for cluster head (CH) selection, which aids in selecting the CH. The CH selection is done based on fitness functions like distance, energy, link quality, and delay. The routing is implemented with HGCIO to transmit the data projections using the CH to sink and evenly disperse the energy amidst various nodes. After that, compressive sensing is implemented with the Bayesian linear model. The convolutional neural network‐long short term memory (CNN‐LSTM) is employed for the data aggregation process. The proposed HGCIO‐based CNN‐LSTM provided the finest efficiency with a delay of 0.156 s, an energy of 0.353 J, a prediction error of 0.044, and a packet delivery ratio (PDR) of 76.309%.

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.

Simultaneous data gathering is an application that exploits the unique advantages of wireless sensor networks. Because many sensor nodes access a channel, co-channel interference (CCI) limits the number of nodes who can access it. To suppress CCI, a frequency spectrum (or channel) is required to obtain large diversity and spreading gains. Cognitive radio (CR) with transmit power control exploits available channels because, in this approach, the CCI on the primary system (PS) is suppressed and spectrum sharing between the PS and a secondary system is possible. Prolonging a node's life is also important in wireless sensor networks. However, in simultaneous data gathering, the power consumed by the relay station (cluster head) is quite high. In this paper, a method for constructing a cluster head selection and rotation that is optimal for increasing the number of available channels and prolonging the life of the node is proposed. In simultaneous data gathering, the link with the minimum number of available channels is the bottleneck. Our proposed technique achieves the maximum number of available channels and extends the life of the nodes because of the cluster head rotation. In addition, the optimal number of clusters is also determined.

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

The present cluster head selection is fixed as a static node, so the cluster head becomes malicious the entire cluster communication is discarded in wireless sensor networks (WSNs). As per our new approach, the cluster heads are using fault tolerance schemes supports for selection cluster head through the game theory. This process may take additional energy to detect malicious cluster heads and to recover the network communication in the cluster. This article proposes fault-tolerant backup cluster head (BCH) selection influenced by game theory in wireless sensor networks WSNs by utilizing less energy. In WSNs, the malicious cluster heads can be exhibited efficiently using game theory through the different network conditions such as scalability, mobility, and energy utilization. Due to scalable WSNs, the cluster node is increasing in the cluster head becomes malicious thus network lifetime is reduced. So, the fault-tolerant BCH technique is incorporated to increase the lifetime of WSNs. So, the efficiency of the sensor network is reduced due to the cooperation of malicious and normal nodes. The malicious cluster heads being detected based on node parameters and the clustered network operations are carried out through fault-tolerant backup cluster head in WSNs. The simulation results have obtained for the proposed scheme compared with the network parameters such as dead nodes, alive nodes, and average energy of active nodes in the network.KeywordsWireless sensor networkGame theoryFault-tolerant networkCluster head selectionBackup cluster head

Hybrid based cluster head selection for maximizing network lifetime and energy efficiency in WSN

In smart Wireless Sensor Networks (WSNs), clustering is one of the most power efficient techniques which minimize the transmission ranges of sensor nodes. Instead of sending packets directly to the BS with high power levels, sensor nodes in the sensing filed can be organized in groups (i.e. clusters), where Cluster Heads (CHs) manage the transmission by aggregating the whole group of packets and retransmit them to the Base Station (BS). Therefore, the clustering technique solve the problem that nodes close to the BS consume a large amount of power due to the need to be active most of the time to retransmit packets to the BS (i.e. sink hole problem). In this paper, we propose a novel Raining Energy Cluster Head Selection (RECHS) protocol which is based on a simple Statistical Discrimination (SD) metric which detects collided packets before decoding as well as the Multi-Dimensional Slotted ALOHA (MDSA) MAC protocol which organizes the access to the communication channel. Hence, both reception and transmission power consumption will be minimized remarkably. In addition, in RECHS protocol, a simple Cluster Head (CH) selection algorithm is proposed which is based on the ratio between the remaining energy of every member (node) in a cluster and the initial (start-up) energy as well as the minimum distance between the CH and the sink node. In this paper, we will show how the proposed CH selection mechanism in RECHS protocol along with the SD technique and the MDSA MAC protocol overcomes some well-known protocols such as LEACH where a CH is selected in a distributed (i.e. random) fashion and the MAC protocol is TDMA. In particular, we will show how the performance of RECHS protocol overcomes LEACH protocol in terms of the percentage of alive nodes, the average number of successfully arrived packets to the BS (i.e. the throughput), and the average residual energy of the network per simulation round.