Cluster Based Routing Protocol Research Articles

Soft Computing Techniques Aware Clustering-Based Routing Protocols in Vehicular Ad Hoc Networks: A Review

The vehicular ad hoc network is an emerging area of technology that provides intelligent transportation systems with vast advantages and applications. Frequent disconnections between the vehicular nodes due to high-velocity vehicles impact network performance. This can be addressed by efficient clustering techniques. Several recent studies have attempted to develop optimal clustering algorithms to improve network performance metrics using soft computing techniques. Although sufficient work on soft computing techniques has been carried out, it seems less commonplace to find an analysis of various algorithms’ network parameters together. This paper provides a systematic analysis of the clustering-based routing protocols used in vehicular networks that are aware of soft computing techniques. The categorization is performed according to various soft computing techniques: particle swarm optimization, k-means, neural networks, artificial bee colony, genetic algorithm, firefly algorithm, and fuzzy logic. A comparative study of soft computing strategies is also provided in the survey with a focus on their objectives, along with their strengths and limitations. This survey makes it easier for researchers to pick the required soft computing technique used in vehicular networks in order to improve metrics such as packet delivery ratio, end-to-end delay, throughput, cluster lifetime, and message overhead.

Hybrid cluster made content forwarding and light weight sign encryption IoT based Named Data Network using African Buffalo optimization algorithm

Information Centric Network (ICN) is a newer technology in handling web content distribution that has recently emerged in order to tackle the risk of data security. For handling content distribution, ICN provides data security via a name-based approach. Named Data Networking (NDN) is an ongoing ICN realisation that was incorporated recently. Named Data Networking (NDN) has recently grown in popularity and significance as a new internet design that solves certain limitations in traditional internet communications. NDN is perfectly adapted for the Internet of Things (IoT), which is today dominated by huge, and emerging applications. In this work, we propose an IoT enabled hybrid cluster-based routing protocol with mitigation of content poisoning attack for information-centric Wireless Sensor Network (WSN)-NDN. In this method, hybrid K-medoids clustering is used with African Buffalo Optimization Algorithm (ABOA), which is to find an optimal shortest path between the cluster heads, and light weight encryption. It is developed by using Hyperelliptic Curve Cryptography (HCC) to mitigate content poisoning. Our proposed system has effective data security as it has encrypted data in the cluster head. The smart health care monitoring system has been used for our proposed method. The proposed method has been subjected to extensive analysis by comparing with other existing methods that should improve performance justified in terms of several metrics by introducing the malicious nodes (10%, 20%, and 30%).

A Cluster-Based Routing Protocol for WSN Based on Mahalanobis Distance and AODV Protocol

Wireless Sensor Network (WSN) has huge amount of sensor nodes that randomly deployed in the interested region to monitor the environment. In WSN, the energy efficiency is considered as a challenging task during data transmission. The mahalanobis distance based cluster head selection is proposed to solve the issues related to the energy constraint. Next, ad hoc on-demand distance vector routing protocol is used to find the optimal path between the source to base station via cluster heads. The performance of this mahalanobis method is analyzed in terms of energy consumption, throughput, packet loss ratio, End to End Delay (EED) and average delay ratio. The mahalanobis method is compared with Weighted Energy-efficient Clustering with Robust Routing (WECRR), improved Artificial Bee Colony (iABC), Adaptive Energy aware Cluster-based Routing (AECR), Evolutionary Multipath Energy-Efficient Routing (EMEER), K-means algorithm and Energy-aware Cluster-based Routing Protocol (ECRP). The energy consumption of the mahalanobis method is 0.641 J for 75 nodes, it is lesser than the existing methods.

A Novel Data Aggregation Mechanism using Reinforcement Learning for Cluster Heads in Wireless Multimedia Sensor Networks

Wireless multimedia sensor networks (WMSNs) are getting used in numerous applications nowadays. Many robust energy-efficient routing protocols have been proposed to handle multimedia traffic-intensive data like images and videos in WMSNs. It is a common trend in the literature to facilitate a WMSN with numerous sinks allowing cluster heads (CHs) to distribute the collected data to the adjacent sink node for delivery overhead mitigation. Using multiple sink nodes can be expensive and may incur high complexity in routing. There are many single-sink cluster-based routing protocols for WMSNs that lack in introducing optimal path selection among CHs. As a result, they suffer from transmission and queueing delay due to high data volume. To address these two conflicting issues, we propose a data aggregation mechanism based on reinforcement learning (RL) for CHs (RL-CH) in WMSN. The proposed method can be integrated to any of the cluster-based routing protocol for intelligent data transmission to sink node via cooperative CHs. Proposed RL-CH protocol performs better in terms of energy-efficiency, end-to-end delay, packet delivery ratio, and network lifetime. It gains 17.6% decrease in average end-to-end delay and 7.7% increase in PDR along with a network lifetime increased to 3.2% compared to the evolutionary game-based routing protocol which has been used as baseline.

UAV Communication Network Modeling and Energy Consumption Optimization Based on Routing Algorithm.

Topological information is provided, and research on the design of routing protocols for UAV self-assembling networks is conducted, in order to enable fleet communication transfer between UAVs and UAVs and enhance their communication transmission rate in the self-assembling network. A new routing protocol is proposed through greedy forwarding and peripheral forwarding of UAV self-assembling network communication data, UAV self-assembling network planarization processing, dynamic adjustment of routing mode based on topological information, and routing protocol decision content generation. The proposed network is described using stochastic geometry theory, with the UAV and building locations modeled as two independently distributed Poisson point processes and the building shape modeled as a rectangular body with height obeying the Rayleigh distribution. An estimated equation for typical user coverage is produced using this model. The simulation results show that the approximate expression matches with the simulation results with reduced computational complexity, which verifies the validity of the approximate analysis. By comparing it with the clustering-based routing protocol, it is concluded that the new routing protocol conditions for UAV self-assembly network can realize the communication transmission between UAVs and drones and further promote their communication transmission rate.

A novel energy aware cluster based routing protocol for emergency message dissemination in vehicular adhoc networks

In Vehicular Adhoc Network (VANET), the typical topology variations produced by the highly mobile nature of vehicle poses major issues in data transmission. The mobility and location based data dissemination techniques could satisfy the requirements of emergency message (EM) dissemination. It faces several issues in highway as well as urban roadways like minimum latency, highly secure, and scalable, which needs to be resolved. Generally, broadcasting protocols for VANET make use of beacon signals, which are distributed amongst the vehicles to attain information about the neighboring vehicles. With this motivation, this paper presents an energy aware cluster based routing protocol for the critical message dissemination (EAC-RPCMD) technique for VANET. The goal of the EAC-RPCMD technique aims to disseminate the EMs in the cluster based VANET environment. The EAC-RPCMD technique primarily designs an equilibrium optimizer based clustering (EOC) technique for the organization of vehicles into clusters. Besides, the manta ray foraging optimization (MRFO) algorithm based route selection (RS) technique, named MRFO-RS technique for optimal choice of routes to destination. Moreover, the EM dissemination scheme is also employed in the VANET. The performance validation of the EAC-RPCMD technique takes place and the results are inspected under several aspects.

Development and Performance Evaluation of a New Energy-Efficient Double Cluster-Head Routing (EEDCR) Protocol for Wireless Sensor Networks

Utilization of energy and the lifetime increment are the big issues in designing of routing algorithms for wireless sensor networks (WSNs). Many routing algorithms have been developed by various researchers to achieve energy efficiency and to improve the lifetime of the network. But, the way to route the information from the sensor node (SN) to the base station (BS) and vice versa is an important issue, because of resource constraints. In this paper, we have proposed a low energy consumed, cluster-based routing protocol named an energy-efficient and double cluster-head routing (EEDCR) protocol, to increase the network lifetime and minimize the end-to-end delay. Selection of the cluster head (CH) is depending on random selection method, energy method, the total number of nodes, and its energy level. The performances of developed protocol were assessed using simulations and found that it provides successful outcomes in terms of energy-efficient and lifetime increment in routing for WSNs.

Cluster-Based Routing Protocol with Static Hub (CRPSH) for WSN-Assisted IoT Networks

The Internet of Things (IoT) is an evolving concept that has achieved prominence in the modern era. An autonomous sensor-equipped device is the major component of WSN-assisted IoT infrastructure. These devices intelligently sense the environment, automatically collect the data, and deliver the information to paired devices. However, in WSN-assisted IoT networks, energy depletion and hardware faults might result in device failures. Additionally, this might affect data transmission. A reliable route significantly reduces data retransmissions, which can help in congestion reduction and energy conservation. Generally, the sensor devices are typically deployed densely throughout the WSN-assisted IoT networks. A high number of sensor devices covering a monitoring area might result in duplicate data. The clustering method can be used to overcome this problem. The clustering technique reduces network traffic, whereas the multipath technique ensures path reliability. In CRPSH, we used the clustering technique to reduce the duplicate data. Moreover, the multipath approach can increase the reliability of the proposed protocol. CRPSH is intended to minimize the overhead associated with control packets and extend the network’s lifetime. The complete set of simulations is carried out using the Castalia simulator. The proposed protocol is found to reduce energy consumption and increase the lifetime of IoT infrastructure networks.

Performance analysis of communication model on position based routing protocol : review analysis

Research on the Vanet system always has its own challenges and obstacles. The communication system between nodes is certainly the main problem that is always faced. The communication model and concept in the routing protocol process is a very decisive choice to get good communication quality. Four categories in vanet system topology, namely position based routing protocols, broadcast based routing protocols, cluster based routing protocols and multicast/geocast routing protocols, have fundamental differences, especially in the concept of sending data and information between nodes. For this reason, in this study, the selection of standardization and integration of data delivery between nodes is of particular concern and is certainly an interesting thing to study more deeply. The ability to send data properly in busy and fast traffic conditions has its own challenges. For this, there are many variables that must be considered, so that communication between nodes will be better.

TEZEM: A new energy-efficient routing protocol for next-generation wireless sensor networks

The design and implementation of energy-efficient routing protocols for next-generation wireless sensor networks is always a challenge due to limited power resource capabilities. Hierarchical (clustering) routing protocols appeared to be a remarkable solution for extending the lifetime of wireless sensor networks, particularly in application-aware (threshold-sensitive) and heterogeneity-aware cluster-based routing protocols. In this article, we propose a protocol, namely, Threshold-based Energy-aware Zonal Efficiency Measuring hierarchical routing protocol. It is a heterogeneity-aware and threshold-based protocol that provides a better solution to existing problems in next-generation wireless sensor networks. During execution, the Threshold-based Energy-aware Zonal Efficiency Measuring hierarchical routing protocol splits the entire network area into several zones to manage network traffic efficiently. In the first step, Threshold-based Energy-aware Zonal Efficiency Measuring hierarchical routing protocol is designed for a homogeneous network where the initial energy of all the nodes is the same. Thereafter, we bring in heterogeneity in the Threshold-based Energy-aware Zonal Efficiency Measuring hierarchical routing protocol execution environment to optimize its energy consumption. By investigating the performance of the various numbers of divisions, it is proved that the Threshold-based Energy-aware Zonal Efficiency Measuring hierarchical routing protocol with 9 zonal divisions has higher stability and throughput. The performance of the proposed Threshold-based Energy-aware Zonal Efficiency Measuring hierarchical routing protocol is compared with those of Stable Election Protocol, Low-Energy Adaptive Clustering Hierarchy, Modified Low-Energy Adaptive Clustering Hierarchy, and Gateway-Based Energy-Efficient Routing Protocol through computer simulations. Simulation results verify the improved performance of the proposed Threshold-based Energy-aware Zonal Efficiency Measuring hierarchical routing protocol in terms of network stability, lifetime, and throughput.

Energy-Aware Threshold Sensitive Stable Election Protocol (EATSEP) for Wireless Sensor Networks

In most of the traditional cluster-based hierarchical routing protocols, the cluster head (CH) selection is made on a random basis. As a result, some unlucky sensor nodes (SNs) become dead quickly; thereby, network lifetime reduces drastically. To overcome this problem, in this paper, a new cluster-based routing protocol- Energy-Aware Threshold Sensitive Stable Election Protocol (EATSEP) is presented for wireless sensor networks (WSNs). In the EATSEP protocol, the CH selection is an optimum process where the initial and residual energy of each SNs are considered within a heterogeneous SNs energy environment. Additionally, our proposed EATSEP protocol has managed to reduce long-distance transmission by routing data among CHs to the base station. In our present study, we have simulated the EATSEP protocol through MATLAB to compare its performance with other popular protocols under some well-known performance metrics. The experimental results indicate that the network stability of the EATSEP protocol improves by 80.81, 66.41, and 27.06 %, respectively, compared to the low-energy adaptive clustering hierarchy (LEACH), Stable Election Protocol (SEP), and Threshold Sensitive SEP under a particular setting. In terms of energy consumption and network throughput, the EATSEP is also superior to other protocols.

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.

Fast-converging chain-cluster-based routing protocols using the Red-Deer Algorithm in Wireless Sensor Networks

PurposeThe performance of Wireless Sensor Networks (WSNs) applications is bounded by the limited resources of battery-enabled Sensor Nodes (SNs), which include energy and computational power; the combination of which existing research seldom focuses on. Although bio-inspired algorithms provide a way to control energy usage by finding optimal routing paths, those which converge slower require even more computational power, which altogether degrades the overall lifetime of SNs.Design/methodology/approachHence, two novel routing protocols are proposed using the Red-Deer Algorithm (RDA) in a WSN scenario, namely Horizontal PEG-RDA Equal Clustering and Horizontal PEG-RDA Unequal Clustering, to address the limited computational power of SNs. Clustering, data aggregation and multi-hop transmission are also integrated to improve energy usage. Unequal clustering is applied in the second protocol to mitigate the hotspot problem in Horizontal PEG-RDA Equal Clustering.FindingsComparisons with the well-founded Ant Colony Optimisation (ACO) algorithm reveal that RDA converges faster by 85 and 80% on average when the network size and node density are varied, respectively. Furthermore, 33% fewer packets are lost using the unequal clustering approach which also makes the network resilient to node failures. Improvements in terms of residual energy and overall network lifetime are also observed.Originality/valueProposal of a bio-inspired algorithm, namely the RDA to find optimal routing paths in WSN and to enhance convergence rate and execution time against the well-established ACO algorithm. Creation of a novel chain cluster-based routing protocol using RDA, named Horizontal PEG-RDA Equal Clustering. Design of an unequal clustering equivalent of the proposed Horizontal PEG-RDA Equal Clustering protocol to tackle the hotspot problem, which enhances residual energy and overall network lifetime, as well as minimises packet loss.

Predictive preemptive certificate transfer in Cluster-Based Certificate Chain

Mobile ad hoc networks are a set of nodes that cooperate and communicate wirelessly. This kind of networks in easy to deploy because there is no need of any pre-existing infrastructure. Security in Manets is a very important issue and it is hard to use conventional security techniques. Many approaches have been proposed to secure communication in Manets; most of them are based of public-key certifications which create a multitude of trust communication model.In this paper, we propose an amelioration of a distributed certificate chain that relies on the cluster based routing protocol. In our scheme, after forming clusters, the cluster-head node issue certificates for other nodes within its cluster. When a member node want migrates to an adjacent cluster, the cluster-head sends the node’s certificate to surrounding cluster-heads via gateway nodes. The protocol was doted by a preemptive predictive module to predict migration intention of member nodes. This approach has been evaluated by detailed simulation study. Simulation results show that this approach is scalable and generate lower certification overhead.

Secure Routing Optimization in Hierarchical Cluster-Based Wireless Sensor Networks

Popularity of wireless sensor networks (WSNs) is increasing continuously in different domains of daily life, as they provide efficient method of collecting valuable data from the surroundings for use in different applications. Routing in WSNs is the vital functionality that allows the flow of information generated by sensor nodes to the base station, while considering the severe energy constraint and the limitations of computational and storage resources. Indeed, this functionality may be vulnerable and must be in itself secured, since conventional routing protocols in WSNs provide efficient routing techniques with low power consumption, but they do not take into account the possible attacks. As sensor nodes may be easily captured and compromised, the classical cryptographic solutions become insufficient to provide optimal routing security, especially, for cluster-based WSNs, where cluster heads can be still among the compromised nodes. In this work, we propose a hierarchical, robust and well-adapted intrusion detection system, named THIDS, which is intended to be integrated into the secure hierarchical cluster-based routing protocols. We have chosen the protocol RLEACH to be equipped with the proposed IDS. The results of simulation performed under NS2 simulator show that the resulting protocol ORLEACH is much more resistant to compromised nodes exercising the most dangerous attacks.

A REVIEW ON DESCENDANTS OF LEACH PROTOCOL - A PRAGMATIC APPROACH

A Wireless Sensor Networks (WSN) is a Wireless Networks comprising of spatially disseminated independent sensors to screen physical or natural circumstances. The battery power in these sensor nodes assumes a significant part in expanding the life expectancy of the nodes. Hierarchical routing protocols are the most popular protocols to limit the energy utilization when compared to Flat Routing. Low-Energy Adaptive Clustering Hierarchy (LEACH) is a traditional Cluster based routing protocol for WSNs having great execution, energy productivity, and successful in elongating the lifetime of the network life time by consuming a little level of the complete disseminated energy in the framework. This paper reviews the condition of craft of various progressed, enhanced routing protocols that have been created from the LEACH. This paper features a portion of the downsides and issues of LEACH how these issues are vanquished by the relatives of LEACH. Appraisal of descendants of LEACH routing protocols in advised with regards to versatility, self-association, and conveyance of nodes, network control, Hop count, energy proficiency, and utilization of data.

Adaptive coding clustered routing protocol for energy efficient and reliable WSN

In Wireless Sensor Networks (WSNs), the sensor nodes are expected to remain autonomous for a long time and the communication must be successful. So, energy efficiency and communication reliability are the main challenges for WSN. Routing protocols and, in particular, clustering is the key to energy constraints in WSNs. In a loss milieu, data shared between nodes is susceptible to corruption by errors caused by signal fading, random noise, and some other forces. For this reason, channel coding is necessary to assure efficient and reliable transmission. Therefore, energy efficiency and reliability of communications are the most crucial factors in the design of an efficient cluster-based routing protocol. In this context, to raise the reliability of the communication link and minimize the necessary transmission energy, a new adaptive coding routing protocol is proposed, which implements RS and LDPC codes to a routing protocol. Simulation results show that our proposed protocol improves energy consumption, network lifetime, stability, and throughput compared to LEACH and BRE-LEACH. In addition, it reaches a good BER performance and coding gain by using the LDPC code.

Particle swarm optimization and artificial bee colony algorithm for clustering and mobile based software-defined wireless sensor networks

With the development of the internet of things, people pay more and more attention to wireless sensor networks. Designing the energy efficient routing is an essential objective for wireless sensor networks. Cluster routing is one of the most popular routing protocols to enhance the network lifetime. However, hotspot problem always exists in cluster-based routing protocol. The task of this study is designing a cluster routing protocol with mobile base station which aims at balancing the energy consumption and prolonging the network lifetime. In this article, we design a particle swarm optimization and artificial bee colony algorithm for clustering and mobile based software-defined wireless sensor networks. The software defined network architecture is used to reduce the energy overhead and computation overhead in sensor nodes. Particle swarm optimization-based cluster routing algorithm is used to calculate the cluster heads and the sojourn locations of base station. Artificial bee colony algorithm-based traversal path algorithm is used to design the move path of the base station. Comparing with relevant protocols, the proposed protocol reduces the energy consumption, enhances the network lifetime and reduces the control overhead.

An improved routing protocol for raw data collection in multihop wireless sensor networks

Wireless sensor networks (WSNs) are an effective and efficient method for collecting data from a target area, and prolonging the lifetime of WSNs has been a focus of scientific research due to the limited energy of sensor nodes. However, traditional studies of WSNs are based on the assumption that WSNs collect aggregated data with redundant sensor nodes in an ideal radio environment. These assumptions may not be acceptable in practical applications. To address this problem, this paper introduces a novel application scenario for WSNs in which raw data are collected by a multihop network without redundant sensor nodes, and a new hybrid tree-based and cluster-based routing protocol for raw data collection (HTC-RDC) is proposed to prolong the lifetime of WSNs that can work in novel application scenarios. The experimental results demonstrate that the proposed HTC-RDC enables the WSNs to achieve their expected functions and prolongs the network lifetime by an average of 11.4% compared to the existing protocols in the explored application scenario.

An Empirical Analysis of cluster-based routing protocols in wireless sensor network.

Wireless Sensor Networks (WSNs) are utilized for condition monitoring, developing the board, following animals or goods, social protection, transportation, and house frameworks. WSNs are revolutionizing research. A WSN includes a large number of sensor nodes, or bits, in the application. Bits outfitted with the application's sensors acquire nature data and send it to at least one sink center (in like manner called base stations). This article simulates energy-efficient network initialization strategies using simulation models. First, an overview of network initiation and exploration procedures in wireless ad-hoc networks is provided. The clustering-based routing strategy was selected since it's best for ad-hoc sensor networks. The clustering-based routing techniques used for this study are described below. LEACH, SEP, and Z-SEP are used. MATLAB was used to implement and simulate all routing protocols. All protocols were simulated with various parameters like Number of CHs, Number of Alive Nodes, Number of Dead Nodes, Number of packets to BS, and circumstances to show their functioning and to determine their behavior in different sensor networks.