Secondary Cluster Head Research Articles

Secondary cluster head based SEP in heterogeneous WSNs for IoT applications

AbstractA wireless sensor network (WSN) consists of specialized sensor nodes that perform sensing services for Internet of Things devices with limited battery power. As the replacement or recharging of batteries is not possible, energy consumption becomes the most important design issue in WSNs. The energy‐efficient routing protocol gets the most priority in such energy‐constrained networks. The utilization of clustering‐based routing protocols like stable election protocol (SEP) has gained much attention as the network's lifetime is significantly improved due to the clustering of sensor nodes. Moreover, the inclusion of a secondary CH (SCH) is beneficial when the member node with the most remaining energy performs data aggregation and reduces the energy burden of the CH. This article characterizes SEP and Prolong SEP (P‐SEP) protocols and then extends them by incorporating SCH, which ensures balanced energy consumption. The performance of the proposed Extended SEP and Extended P‐SEP protocols has been analysed regarding stability period, network lifetime, energy usage and throughput. The simulation results demonstrate that the proposed protocols outperform state‐of‐the‐art protocols like P‐SEP, Modified SEP (M‐SEP) and SEP. In particular, the stability period of Extended SEP and Extended P‐SEP has improved up to 42% and 89%, respectively, compared to M‐SEP.

Congestion-Free Cluster Formation and Energy Efficient Path Selection in Wireless Sensor Networks using ButPCNN

Today, network congestion is a common occurrence that needs to be focused on and effectively addressed, particularly in Wireless Sensor Networks (WSN) for packed type networks. The main causes of congestion in WSN are a lack of channel capacity and energy waste. This study's major goal is to develop Energy Efficient Congestion Free Path Selection Protocol (ECFPSP) protocol, which aims to reduce network congestion. By selecting the most appropriate main cluster head (PCH) and secondary cluster head (SCH), the ECFPSP protocol is proposed to decrease end-to-end delay time and extend the network lifetime. The suggested protocol implements a routing protocol that provides security by avoiding hostile nodes and reducing data loss. It also routes the nodes. Hence, a Congestion-Free Cluster Formation is provided to increase the lifetime of the network by proposed ButPCNN approach. To decrease packet loss and conserve energy, this research also uses brand-new cluster-based WSNs. In comparison to other standard protocols, the simulation results reveal that ButPCNN has a reduced packet drop rate, which increases the ratio of packet distribution, network life, and residual energy. As a result, the suggested method enhances congestion control performance while using less energy and a recently developed strategy is suggested to successfully enhance network performance. The proposed ButPCNN gives 25 percent improvement to optimize traffic on overloaded node than the other traditional approaches.

Certain Investigation on Improved Cluster Protocol with Trust security for Wireless Sensor Networks

Immense development of Micro Electro Mechanical Systems (MEMS) made an incredible advancement in wireless technology. The Wireless Sensor Network (WSN) has created many opportunities for the development of various applications in the fields of military, research, medical, engineering, etc. In this research article, a novel trust-based energy-aware clustering protocol is proposed. The clustering algorithm concentrates on reducing the time spent on cluster formation, controlling redundant data forwarding, and prolonging the network's lifespan. In this model, clustered nodes are classified into three levels like Cluster heads (CH), secondary CHs, and sensor nodes (SN) are used to sense the environmental changes and report to the Base Station (BS). An extension of the lifetime of a WSN is possible by the use of secure multi-hop routing with an aggregation technique to forward data from a cluster to the BS. Compared to relevant works on clustering with the routing protocol, the simulation result showed improved energy efficiency and network lifetime.

Distance and energy aware extended LEACH using secondary cluster head for wireless sensor networks

Sensor node's energy consumption is a crucial consideration for designing a wireless sensor network (WSN) as the node is battery powered with limited energy that significantly affects the network lifetime. An efficient design of routing protocol can play an important role to ensure optimum use of node's energy to increase the scalability and lifetime of the network. A clustering-based routing protocol like low energy adaptive clustering hierarchical (LEACH) has attracted much attention in recent years as the network lifetime is effectively increased due to the formation of clusters using sensor nodes. However, the protocol shows the limited performance when the cluster head (CH) selection uses the node having low energy level and far distance from the base station (BS). Here, the selection of secondary cluster head (2CH) is useful, where the member node having the highest residual energy can act as a relay node for data aggregation and ensure the optimum utilization of available energy. In this article, two LEACH protocols namely E-LEACH and DE-LEACH are characterized and further extended by adding the secondary cluster heads, which eventually ensure the optimum choice of CH for sustaining more energy in the network. The proposed Extended E-LEACH and Extended DE-LEACH protocols are analyzed using the network lifetime and total energy consumption and the results show an improved system performance compared to existing 2CH based routing protocols like FLEACH and FLEACH-E. The Extended DE-LEACH shows the best results among all the protocols. In particular, total energy consumption for Extended DE-LEACH is improved by a maximum of 5%, 11% and 21% as compared to Extended E-LEACH, FLEACH-E and FLEACH respectively.

Performance Analysis and Evaluation of a Multi-Hop Routing Protocol for Wireless Multimedia Sensor Networks

Researchers in wireless multimedia sensor networks (WMSNs) are constantly interested in designing and developing energy-efficient routing protocols. Numerous clustering routing protocols have been developed in recent years to overcome the limitation of consuming less energy and prolong the lifetime of sensor nodes in homogeneous and heterogeneous WMSNs. Existing approaches depend on single-hope communication, in which sensor nodes consume more energy and die faster. Inter-communication nodes can play an important role in reducing energy by transmitting data in a multi-hope fashion to the sink. An energy-efficient multi-path clustering with load balancing routing protocol for wireless multimedia sensor networks (EEMCL) is proposed in this study. In this protocol, the main cluster heads (MCHs) are preselected in each network cluster and filled with more energy than normal sensor nodes. The two secondary cluster heads (SCHs) with the highest energy nodes will be selected by the main cluster head algorithm. Moreover, inter-cluster multi-hop routing with the help of MCHs can enhance the network lifetime when the sink is located at the corner of the sensing field. The simulation results verify that the proposed multi-hop technique provides better performance than existing LEACH, LEACH-C, SEEN, and IEE-LEACH routing protocols in scenario 1 and when compared with CPMA in scenario 2. The last node dead (LND) for the proposed protocol is at round 5721, 2225 for LEACH, 2300 for LEACH-C, 2900 for SEEN, and 3160 for IEE−LEACH in scenario 1, while in scenario 2, the LND for the proposed protocol is at round 3820 and 435 for the CPMA routing protocol.

Energy Efficient Mobile Harvesting Scheme for Clustered SDWSN with Beamforming Technique

Software Defined Wireless Sensor Networks (SDWSN) provides a centralized scheduling algorithm to decrease energy consumption compared to WSN. The sensor nodes have a finite battery capacity in the SDWSN that reduces the lifetime of the nodes. To harvest energy for energy depleted nodes without interfering with the eventful data transfer in the clustered SDWSN, an energy efficient mobile harvesting scheme with the Multiple Input Single Output (MISO) beamforming technique is proposed. The mobile harvesting scheme transfer the energy to the energy starving node and the beamforming algorithm which transmits the energy in the desired direction increases the lifetime of the nodes. The Secondary Cluster Head (SCH) node in a cluster is selected based on Particle Swarm Optimization (PSO) with the distance between mobile harvester and sensor node, the energy consumption rate of a node and lifetime of a nodes constraints for harvesting energy without interrupting data transfer to sink node in clustered SDWSN. The distributed scheduling algorithm and efficient path planning decrease the energy consumption of mobile harvester in the network. The optimization problem is formulated with Signal to Noise Ratio (SNR) and transmit power constraints to increase the harvested energy for sensor nodes in the network. The simulation results show the enhanced performance of the proposed algorithm compared to the existing algorithm in terms of residual energy, end to end delay, throughput, travel distance, service time and charging delay.

Enhancing the Lifetime of Wireless Sensor Networks Using Fuzzy Logic LEACH Technique-Based Particle Swarm Optimization

Wireless sensor networks (WSNs) have attracted significant attention because of their widespread use in health care, habitat tracking, disaster prevention, agriculture, monitoring areas, fire tracking, and other real-life applications. The lifetime of WSNs must be prolonged to increase their use for various applications. One of the most effective methods for improving the network’s lifetime is clustering with the optimal cluster head (CH). This study proposes a fuzzy Logic (FL) low-energy adaptive clustering hierarchy (LEACH) technique-based particle swarm optimization (PSO). It employs hybrid PSO and a K-means clustering algorithm for cluster formation. It selects the primary CH (PCH) and secondary CH (SCH) using FL. Extensive simulations were conducted using a simulation program to validate the proposed protocol’s performance. Furthermore, the proposed protocol was compared with traditional algorithms, such as fuzzy c-means (FCM) clustering and FLS-based CH selection to enhance the sustainability of WSNs for environmental monitoring applications, LEACH-Fuzzy clustering protocol, and LEACH based on energy consumption equilibrium. The results confirmed that the proposed protocol efficiently balances energy consumption to improve wireless sensor network performance and to maximize throughput. The simulated results indicated that network lifetime was improved by more than 46% and packet transmission by 17.6%.

EETSP: Energy‐efficient two‐stage routing protocol for wireless sensor network‐assisted Internet of Things

SummaryWireless sensor network (WSN) is a key technology that can support Industrial Revolution 4.0. The sensor nodes (SNs) are the important component of WSN. Recharge or repair of batteries of SNs is impossible, and thus, energy is the most valuable resource of WSN. Over the years, many methods have been proposed to conserve the precious energy resource of WSN. The most important concern in WSN is how much of the energy of the SNs can be saved, which can contribute to the better network life of WSN. WSN‐assisted IoT output is reduced when a wide region of the network is deployed. Energy‐efficient routing is one of the ways to reduce power consumption in WSNs. Therefore, a novel energy‐efficient two‐stage routing protocol (EETSP) has been proposed to reduce the energy used in WSN and extend the stability period as well as the network lifetime of WSN. Through this protocol, the number of packets communicated to the base station (BS) is significantly improved, and the cluster heads (CHs) and secondary cluster heads (SCHs) reduce the energy utilization in the network. SCH works as a backup CH. EETSP consists of two stages. The selection of CH and SCH is made in the primary stage, based on the input parameters. Intercluster routing and intracluster routing are performed in the second stage. The improvements of EETSP are examined against LEACH and Z‐SEP, and obtained results indicate that the EETSP is better in terms of stability period, throughput and network lifetime.

Cluster Formation and Maintenance Techniques for Mobile Adhoc Networks with Improved Quality of Service

— In an Adhoc Network, every node is mobile and self-contained. As these networks lack infrastructure, highly adaptive algorithms are required to deal with frequent mobility changes by member nodes as well as Cluster Head (CH) nodes. The weighted clustering algorithms contribute significantly to cluster-based routing. In these algorithms, the selection of cluster heads is the most important task. In weighted clustering methods, the selected CH did their best to serve the network. However, the CH may become overloaded due to the arrival of nodes greater than their desired threshold value. In this case, the CH can become a bottleneck as it is unable to cope with rapidly increasing loads which ultimately degrade the network performance. In this paper, we address three network issues (i) Member Node movement (ii) Cluster head Node movement, and (iii) Overload at the Cluster head node caused due to mobility of nodes. Our proposed method Cluster Formation and Maintenance Techniques for Mobile Adhoc Networks with Improved Quality of Service (CFMIQS) include various adaptive algorithms to provide solutions to deal with these network issues and improve network Quality of Service (QoS). The Simulated Results are compared with the K-means AODV algorithm, the results showed better Packet Delivery Fraction (PDF) and Throughput values. Keywords— Cluster partition, MANET, Primary Cluster head, QoS, Secondary Cluster head

Pegasis Double Cluster Head Hybrid Congestion Control in Wireless Sensor Networks

Wireless sensor network (WSN) is the fastest growing technology that dominates the future world into wireless communication. It is a collection of a number of self-governing sensor nodes responsible to sense, process and manipulate the nodes. The sensor nodes are regulated by a battery where the network gets failed if the battery is dead. Thus, energy is an important factor to be efficiently used. Furthermore, congestion occurs in WSN when the incoming traffic load exceeds the capacity of the network. The major factors that lead to congestion are buffer overflow, varying rates of transmission, packet collision, and many-to-one data transmission. Due to these, the network suffers from packet loss, queuing delay, end-to-end delay, decrease in network lifetime, and increase in energy consumption. Hence, a clustering-based routing protocol is introduced in this paper to improve the performance of the network and reduce congestion. In the proposed method, Power-Efficient Gathering in Sensor Information Systems (PEGASIS) double cluster head with artificial neural network (ANN) is utilized to analyze the overall network lifetime. The proposed technique is comprised of four phases: clustering the network nodes, cluster head (CH) selection, chain formation, and secondary CH (SCH) selection. The sensor nodes are initially clustered with the firefly algorithm in which the cluster heads of each node are elected via an artificial neural network. Meanwhile, chain formation is processed by PEGASIS double cluster head (PDCH) and the SCH is selected through grey wolf optimizer (GWO) to afford equivalent energy utilization between the sensor nodes. The simulation outcomes proved that the proposed method efficiently increases the lifetime of the network and reduces congestion level in WSN.

A clustering algorithm based on nonuniform partition for WSNs

Abstract Wireless sensor networks (WSNs) have great application potential in partition parameter observation, such as forest fire detection. Due to the limited battery capacity of sensor nodes, how to reduce energy consumption is an important technical challenge. In this paper, we propose an energy efficient routing algorithm of adaptive double cluster head (CH) based on nonuniform partition for WSN. Firstly, according to the distance information from the base station (BS) to every sensor node, the network is divided into several uneven partitions. Secondly, CH is selected for each partition as the primary cluster head (PCH). Because of the cluster-level routing, the CHs close to the BS need to forward more data than the CHs in other areas, which consumes more energy. Therefore, an adaptive double CH method can be used to generate a secondary cluster head (SCH) in the cluster near the BS according to the parameters. Finally, the PCH is responsible for data collection, data integration, and data transmission. while the SCH is in charge of data routing. Simulation results show that the proposed algorithm can reduce the energy consumption and extend the life of the WSNs, compared with LEACH protocol and the HEED protocol.

E-MODLEACH: An Extended MODLEACH Protocol for Wireless Sensor Network

Wireless Sensor Network (WSN) is becoming an important issue in the modern communication system. Though many sectors of this networking system are still under research, many of them have high potential in everyday life. Lots of research are done and many of them are waiting to be modified. This research work studied on cluster-based routing wireless networks precisely. In this paper, we have proposed E-MODLEACH (Extended MODLEACH) which is an improved version of MODLEACH by introducing a secondary cluster head with the parallel of the main Cluster head. The secondary cluster head handover the cluster operation in case of failure of a cluster head by aiming to improve the system lifetime and network throughput. The simulation result indicates that our E-MODLEACH, in comparison with MODLEACH outperforms in terms of network life, data loss and packet transferred to the base station.

An AUV-Assisted Data Gathering Scheme Based on Clustering and Matrix Completion for Smart Ocean

The oceans cover more than 71% of the Earth’s surface and have a surging amount of data. It is of great significance to seek energy-effective and ultrareliable communication and transmission mechanism for effectively gathering abundant maritime data. In this article, we propose an autonomous underwater vehicle (AUV)-assisted data gathering scheme based on clustering and matrix completion (ACMC) to improve the data gathering efficiency in the underwater wireless sensor network (UWSN). Specifically, we first improve the $K$ -means algorithm by adopting the Elbow method to determine the optimal $K$ and setting a distance threshold to select the separate initial cluster centers. Then, we introduce a two-phase AUV trajectory optimization mechanism to effectively reduce the trajectory length of the AUV. In the first phase, the optimized trajectory of the AUV is planned by adopting the greedy algorithm. In the second phase, the ordinary nodes close to the AUV trajectory are selected as secondary cluster heads to share the workload of cluster heads. Finally, we present an in-cluster data collection mechanism based on matrix completion. An extensive experiment validates the effectiveness of our proposed scheme in terms of energy and data collection delay.

Routing Clustering Protocol for 3D Wireless Sensor Networks Based on Fragile Collection Ant Colony Algorithm

Compared with two-dimensional wireless sensor networks (2DWSNs), three-dimensional wireless sensor networks (3DWSNs) have higher node energy consumption and weaker load balancing. To alleviate these problems, we propose a new multi-hop routing clustering protocol for a wide range of 3DWSNs. In terms of clustering, nodes will run for cluster head (CH) by timing broadcast based on their remaining energy and their average distance from surrounding nodes. Two new identity nodes are added between the CH and the member nodes, the load transfer node responsible for transferring the energy consumption of the CH, and the secondary cluster head node (SCH) acting as the CH for the next round. In order to reduce energy consumption in key node areas, we also enable key nodes to communicate directly with the sink node. In the aspect of routing construction, SN generates the routing table corresponding to each CH through our proposed fragile ant colony algorithm. Because CH and SCH exist at the same time and have a certain replacement order, the SN only needs to obtain the location of each CH when the network is first clustered, and can continuously generate a new routing table corresponding to the CH, which reduces the energy consumption of the network in the routing path construction. We simulate this protocol, LEACH protocol, AZ-SEP protocol, and UCNPD protocol in a three-dimensional environment. The results show that this protocol is better than the other three protocols in terms of network lifetime and network load balance, respectively.

Two-level distributed clustering routing algorithm based on unequal clusters for large-scale Internet of Things networks

According to the recent advancements in communication technologies and the widespread use of smart devices, our environment can be transforming into the Internet of Things (IoT) because it can connect the physical, cyber, and biological world via smart sensors for different purposes. Wireless sensor networks are considered as one of the main infrastructures in the IoT systems. Therefore, decreasing the total energy consumption of sensor nodes and prolonging the network longevity are two important challenges that should be considered. To increase energy efficiency and to improve the network longevity, a two-level distributed clustering routing algorithm based on unequal clusters has been proposed for large-scale IoT systems. The main idea is to decrease the data transmission distances between member nodes and cluster heads to mitigate the hot spot problem by distributing two cluster heads in each cluster, which in turn leads to energy conservation and load balancing. The clustering method is two level due to the benefits it offers for the sensor nodes. First, each node can transfer its data to the nearest cluster head because a primary cluster head and a secondary cluster head have been considered for each cluster. Therefore, the nodes far from the primary cluster head can be organized based on their distances to the closest cluster head to reduce their data transmission distances to the cluster heads. Second, two cluster heads can be replaced with each other in different circumstances. This reduces the overhead of the cluster head selection algorithm in the proposed scheme. Third, the sensor nodes can benefit from the primary and secondary cluster heads to transfer the data to the sink through different paths with the minimum energy consumption. Simulation results indicate that the proposed algorithm has better performance in terms of total energy consumption, total network energy, and network longevity compared to previous similar schemes.

Latency and Power Aware Reliable Intrusion Detection System for Ensuring Network Security in Military Applications

Intrusion detection system is a most concerned research area which needs to be detected earlier to avoid the unwanted network errors and problems. The accurate and reliable intrusion detection is a most focused research problem in various domains which is found to be more difficult issue. This is focused and resolved in the previous research work namely Prioritization Based Delay Avoided Secured and Reliable Data Transmission Method (PBDASRDT). However, this research method doesn’t focus on the energy conservation parameters. And also previous work doesn’t discuss about the security provisioning methods. This is focused and resolved in this research method by introducing the method namely Latency and Power aware Reliable Intrusion Detection System (LP-RIDS). In this research method latency and power consumption of servers in which intrusion detection is performed is reduced considerably by introducing the secondary cluster head selection process. This secondary cluster head can perform the energy management of IDS servers optimally between the nodes and gateway. And then security of the intrusion detection system is enhanced by introducing the dynamic key based encryption technique. Here the dynamic key generation process is done in the secondary cluster head and the encryption is done by using AES technique. This methodology can improve the network performance considerably by detecting the attacks more accurately with reduced latency and delay. The overall evaluation of the research method is done in the NS2 simulation environment from which it is proved that the proposed research method leads to ensure the enhanced outcome than the existing research methods. This method proved to provide the protection from the denial of service attacks in the efficient way, thus ensuring security with reduced computational cost

Threshold Driven Energy-Efficient and Scalable Dual Cluster Head Protocol

In WSN cluster-based routing approach is a major step in the direction of energy efficiency. However, research shows that energy dissipation in a cluster-based approach predominantly occurs in two cases; first during data transmission to the base station and second during data fusion/aggregation. Eventually, this leads to sizable energy dissipation, the early death of CHs and results in lower network lifetime. Moreover, in most of the recent proposed works, it is never assured that an individual node selected as a Cluster-Head would perform all the assigned tasks without dying in the process. Thus to address these problems, a new approach is proposed in this paper, where two cluster-heads (CHs) in every cluster are selected; first cluster-head being used for data aggregation (Primary-CH) and second for data transmission (Secondary-CH), which assists in reducing the burden of a single Cluster Head. Along with the dual Cluster-Heads, another key feature adopted in this paper is the Energy Threshold values for PCH and SCH. These Energy Thresholds for different CHs calculates the minimum energy required by a node to perform all the tasks assigned to it when elected as CH. So, while electing Primary Cluster-Head (PCH) and Secondary Cluster-Head (SCH) along with other criterions energy threshold values for PCH (EPO) and energy threshold values for SCH (ESO) are also used. Any node with remaining energy less than that of energy thresholds would never be considered for Cluster-Heads. Therefore, by employing the above-mentioned criterions, this article proposes a new protocol that uses dual heads and assists in enhancing the network life of a network as compared to LEACH protocol.

Quality-based LEACH protocol with enhanced cluster-head selection for wireless sensor networks

In Wireless Sensor Networks (WSNs), the main challenge is the design of an efficient routing protocol which has a major impact on the reduction of energy consumption. In this paper, the proposed routing protocol is based on Signal to Noise Ratio (SNR) to improve the performance of WSNs. In the proposed routing protocol, the residual energy is used to elect the Primary Cluster Head (P-CH), while the SNR of received signal, residual energy and the distance from a node to a sink are used to elect Secondary Cluster Head(S-CH). This proposed election mechanism helps the S-CH to use a better-quality RF channel and provides a good packet delivery ratio with minimum energy consumption. The simulation results demonstrate in static mode and Gauss-Markov Mobility Model (GMMM) as, mobile mode. The proposed routing protocol extends the network lifetime by decreasing the energy consumption and reduces overhead data. Also, it compares with C-LEACH, TL-LEACH, and A-TEEN protocols.

Malicious Cluster Head Detection Mechanism in Wireless Sensor Networks

In wireless ad hoc network, all nodes participate for the transmission of data within the network and responsible for designing network topology. Suspicious and malicious activities can be detected by different techniques like IDS that is dynamic in nature. In clustering environment all the communication is carried out through cluster heads, we are having two cluster heads a primary cluster head (PCH) and secondary cluster heads (SCH) where SCHs communicate via PCH and if one of the secondary cluster head is compromised the entire network will be affected so malfunctioning of cluster head must be detected and identified. To handle this issue, we proposed a secure mechanism that provides security by minimum utilization of the resources after detection and identification the malicious Cluster Head. The proposed mechanism based on two level thresholds for the detection and identification of malicious cluster head that is dropping packets because of some attack. We used watchdog technique for initial monitoring. An agent is launched for detection and identification of the packets dropping problem. It is specially designed for secure UDP traffic transmission and fake report detection done by any of the malicious SCH to PCH.

A New Heuristic Clustering Algorithm Based on RSU for Internet of Vehicles

The emergence of the Internet of Things has led to the evolution of conventional Vehicular Ad-hoc NETworks (VANETs) toward a new paradigm called the Internet of Vehicles (IoV). This latter has recently received the attention of many researchers. In order to overcome the different challenges, such as high mobility, the number of connected vehicles and the big data, clustering, as an important technique used in a VANET, has significantly improved the performance of numerous applications. In this regard, the present work proposes a new heuristic clustering algorithm based on RSU called HCAR for IoV, which entails the centralization of a clustering algorithm at distributed RSUs. This latter is responsible for performing the cluster formation phase based on a simple heuristic algorithm, using graph theory concepts, such as node degree and adjacency matrix. In addition, HCAR uses a new mechanism to recover the problem of the unavailability of cluster head (CH), through the election of a secondary CH using a weighted mechanism. Moreover, HCAR takes care of the maintenance phase to keep clusters’ stability and structure. The efficiency of the proposed scheme is proven theoretically, and the simulation results, in the NS-2 and VanetMobiSim integrated environment, show its performance advantages.