Hierarchical Routing Protocol Research Articles

A comprehensive survey on LEACH-based clustering routing protocols in Wireless Sensor Networks

During the previous few years, Wireless Sensor Network (WSN) appears as an active research domain due to the wide use of this technology in several applications, such as military, health, automation, and so forth. WSN supervises physical attributes where human activity is difficult or impossible. The WSN is a set of multiple sensor nodes that are haphazardly deployed in a specific space. These nodes sense data and record values continuously and send these data to the Base Station (BS) through other sensor nodes. Several issues are encountered in the WSNs, including energy consumption, deployment of sensor nodes, routing algorithms, energy efficiency, Cluster-Head (CH) selection, robustness, etc. Numerous routing protocols have been developed by researchers to resolve these constraints, and several techniques of optimization are proposed to define the optimal road between the transmitter and the receiving node. Hierarchical routing protocols increase the network lifetime by enhancing its performance. The most popular hierarchical method is LEACH (Low Energy Adaptive Clustering Hierarchy) that grouped sensor nodes into clusters. Each cluster consists of normal nodes and is controlled by a CH, which is elected by cluster members to collect their data and send it to the BS. The LEACH protocol decreased the energy consumption in WSNs. In this survey, we provide a comprehensive study of LEACH descendant clustering protocols. This survey is the first study to classify LEACH-based routing protocols into CH selection, data transmission, and both CH selection and data transmission techniques. This survey is compared to other actual surveys. To evaluate these protocols, we look at many metrics, such as the CH selection method, communication method, the scalability, energy efficiency, mobility, localization of nodes, and so forth. According to these metrics, we propose a comparative analysis of these clustering routing protocols. This survey discusses also the strengths and limitations of each LEACH-variant protocol. Conclusively, the paper terminates with recommendations on future research fields in WSN.

Hierarchical Routing Protocols for Wireless Sensor Networks: Functional and Performance Analysis

Wireless sensor network (WSN) comprises of spatially distributed autonomous sensors to monitor physical or environmental conditions, such as temperature, sound, and pressure, and to cooperatively forward the collected information to the destination through the network infrastructure. As sensor nodes are energy constraint devices, therefore, the importance of energy efficient routing protocols has been increased. In order to minimize energy consumption, recently, a number of hierarchical routing protocols are proposed. For instance, LEACH is an elementary hierarchical routing protocol that employs clustering technique to achieve energy efficiency. A lot of research work has been performed to remove shortcomings and to improve the performance of hierarchical routing protocols. Therefore, a comprehensive review is required which can review state‐of‐the‐art technologies, analyze functional and performance aspects, and highlight hierarchical routing protocol issues and challenges in WSNs. This paper proposes a taxonomy for the classification of existing hierarchical routing protocols for WSNs and analyzes the functionality and performance of existing hierarchical routing protocols. Moreover, it compares existing routing protocols to highlight key technological differences and provides performance comparison for the selected LEACH based routing protocols. Finally, the paper spotlights issues and challenges in existing routing protocols of WSNs, which can assist in future research for the selection of appropriate research domain and provide guidance in selection of energy efficient techniques in the design of energy efficient of routing protocols for WSNs.

Hierarchical search-based routing protocol for infrastructure-based opportunistic networks

Opportunistic networks (OppNets) consist of intermittently connected devices where there is no guarantee that a predefined path from source to destination for message transmission exists. In such a sparsely connected network where nodes relay messages in an opportunistic manner, designing a routing protocol is a challenging task. In this paper, a novel routing protocol for infrastructure-based OppNets called the hierarchical search-based routing protocol (HSBRP) has been proposed. This protocol combines the benefits of both fixed and mobile routing techniques, combating the disadvantages posed by each, to give better performance on a multitude of performance metrics like, no single point of failure, fault detection and communication capacity, etc. In the proposed protocol, nodes are arranged in a hierarchical fashion and interactions between different levels of nodes are only allowed through well-defined rules that boost message delivery probability and reduce the overhead of the network.

Hierarchical smart routing protocol for wireless sensor networks

This paper proposes a new hierarchical routing protocol dedicated to Wireless Sensor Networks (WSNs). Several solutions have been proposed, but an optimal one, which can be applied in different sit...

Hierarchical smart routing protocol for wireless sensor networks

This paper proposes a new hierarchical routing protocol dedicated to Wireless Sensor Networks (WSNs). Several solutions have been proposed, but an optimal one, which can be applied in different situations, still remains non-existent. Our proposal takes advantage of existing solutions and proposed a new radial Cluster Head (CH) selection algorithm to ensure the QoS, a good load balancing and to enhance the network lifetime. A performance analysis of our proposal with LEACH, Mod_LEACH and M-GEAR protocols is presented in this paper comparing these protocols using different metrics such as network lifetime, throughput, stability and instability periods, remaining energy, network overhead, etc. The simulations show that our solution outperforms existing solutions due to the radial architecture proposed for CH selection and the use of two transmission levels for intra- and inter-cluster communication. Obtained results show that our proposal improves the network lifetime by 113% compared to LEACH protocol and optimises the energy consumption by more than 62% in comparison to M-GEAR.

Study on energy efficient routing protocols scheme in heterogeneous wireless sensor networks (network & mobility)

Because of limitations linked with the strength and parameters of Wireless Sensor Networks during network transfer, cluster-based and energy optimized routing techniques are gaining notoriety. The theme of wireless sensor networks is energy use (WSNs). WSNs have a limited lifetime so maintaining them is difficult. Routing protocols for heterogeneous wireless sensor networks (HWSNs) have recently gotten a lot of press. To boost the efficiency of HWSNs, various HWSN routing protocols have been proposed. Hierarchical HWSN routing protocols are among these protocols that can greatly increase network efficiency. We can test three hierarchical HWSNs in this article.EDFCM, MCR, and EEPCA are three new routing protocols that have recently been proposed, as well as LEACH and LEACH+. SEP. We are primarily concerned with the round at which the first node dies (also known as the secure period) and the amount of packets sent to the sink. This is an essential consideration to remember when assessing a protocol's control capabilities. We run a variety of tests and simulations on it. Matlab was used to examine the five routing protocols' results.

Efficient Energy Utilization Using Ant Lion Optimization in WSN

In wireless sensing element networks (WSNs),sensing element nodes or operated by little batteries, therefore they need restricted energy resources which require careful utilization. The planned algorithmic rule is associate degree vitality economical so as to handle trade –off between packet delay and transmission power, and delay economical we have a tendency to develop 3 ANTLION schemes supported power-delay limitations of the heterogeneous WSN. We have a tendency to devise a theoretical framework to figure the common delay and stability region for every planned theme and compare the performance of ANTLION and traditional Clustering. A new hybrid routing protocol is proposed by incorporating the routing concept of adhoc network into the hierarchical clustering routing protocol LEACH of the wireless sensor networks namely Quadrant Based LEACH (ANTLION)..

Security challenges for routing protocols in mobile ad hoc network: a systematic review and open research issues

Various targeted attacks are focused on MANET exploiting these vulnerabilities and disrupting their operations. Therefore, network optimisation can be accomplished through the maximal use of resources available and deploying proper security measures. In this study, various MANET protocols namely geographical, topology-based, hybrid, hierarchical, power-aware and multicast routing protocols, were investigated based on performance parameters (routing overhead, caching overhead, and packet delivery ratio) along with the security challenges they face. In addition to this, comparative analysis among various routing protocols and their performances were evaluated. Several topological issues namely high power consumption, low bandwidth, and high error rate, were taken into account.

Securing wake up radio for green wireless sensor networks against denial of sleep attacks

This paper proposes the distributed cooperation model (DCM) based hierarchical smart routing protocol (HSRP) to counter the denial of sleep (DoSL) attacks in Green Wireless Sensor Networks (GWSNs). DCM solution combined with the Dynamic Elliptic Curves-RSA (DECRSA) algorithm is used to provide high security level and protect Wake-Up Radio (WUR) for GWSNs against DoSL attack targeting the energy resources of sensors. The used distributed schema ensures the load balancing in the network through the selection of a new Supervisor Node at the beginning of each round based on a special equation taking into account different metrics such as the remaining energy and the number of neighbour nodes. Simulation results conducted under the NS3 simulator show that the proposed DCM helps to effectively protect the GWSNs against the DoSL attacks and improves the network lifetime by more than 60% when three malicious nodes are used. Obtained results show also that the DCM extends either the period of stability and instability to the maximum and helps to counter the fall in the number of alive nodes which cause the problem of isolated area.

Hierarchical search-based routing protocol for infrastructure-based opportunistic networks

Hierarchical search-based routing protocol for infrastructure-based opportunistic networks

Digital Media Art Communication Based on Wireless Cooperative Routing with Minimum Energy Consumption

Wireless cooperative routing algorithm transmits the data collected in the target area to users, so that users can obtain monitoring information timely and accurately. In the traditional low‐power adaptive clustering hierarchical routing protocol, the process of building clusters is random, the resources of nodes are not fully utilized, the node death speed is fast, the network life cycle is short, and the performance is not stable enough. In addition, the route maintenance process is cumbersome and will occupy a lot of bandwidth. In order to solve the problems of real‐time transmission of digital media art communication data and network lifetime optimization, a wireless cooperative routing algorithm based on minimum energy consumption is proposed. The facts of transmission strength consumption, node residual strength, and minimal information transmission extension are analyzed, a new weight feature is proposed, and a multipath statistics routing scheme is developed by using the usage of the minimal strength consumption. All digital media art propagation sensor nodes transmit data to sink nodes along multiple transmission paths. Simulation results show that the algorithm can prolong the network lifetime, reduce and balance the node energy consumption, reduce the data transmission delay, reduce the energy consumption of wireless cooperative routing based on the minimum energy consumption by 64.5%, and increase the number of compressed images by 182%.

Harvested Energy Scavenging and Transfer capabilities in Opportunistic Ring Routing

Energy conservation has always been a prominent design goal for hierarchical routing protocols supporting sink mobility. Advertising the current position of mobile sink introduces control packet overhead which ultimately results in an increase in energy consumption and shorter network lifetime. Energy harvesting through ambient sources have enabled the utilization of rechargeable devices for Wireless Sensor Networks to perpetually remain operational. The modifications in the hierarchical structure of wireless sensor networks along with energy scavenging approaches could possibly minimize the control packet overhead and also provide a significant improvement in energy conservation. In this paper, we propose a novel Harvested Energy Scavenging and Transfer capabilities in Opportunistic Ring Routing protocol which uses a distinguishing approach of hybrid (ring + cluster) topology in which the network architecture is initially supported by the formation of a virtual ring structure and then a two-tier routing topology is used in the virtual ring as an overlay by grouping nodes into clusters. The rate of energy gain from solar harvesting and radio frequency transfer is the criterion for selecting cluster heads. The role of cluster heads is exploited to advertise the mobile sink current position as well as forward the aggregated data towards mobile sink using energy transfer based opportunistic routing. The simulation results reveal that our scheme considerably outperforms the existing benchmarks in terms of control packet overhead, energy conservation, network lifetime, packet delivery ratio and average end-end delay.

Optimization of Sports Event Management System Based on Wireless Sensor Network

In recent years, wireless sensor network technology has developed rapidly and its role in managing systems for sports events has been widely used. Wireless sensor networks not only have low wiring cost, high monitoring accuracy, and good fault tolerance but also can be monitored remotely and have outstanding advantages in fault diagnosis and safety monitoring. In this paper, firstly, the wireless sensor network hierarchical routing protocol is studied and its network model and workflow are analyzed; according to the energy consumption of the wireless sensor network, the selection method of the optimal number of cluster heads is proposed to analyze the advantages and disadvantages existing in the protocol. Secondly, the improvement of the routing protocol is proposed to address the problems of uneven distribution of cluster heads and cluster head election without considering the residual energy of nodes in the protocol. When dividing clusters, the number of neighboring nodes is considered so that cluster heads are distributed more evenly in the network; when electing cluster heads, the residual energy of nodes in the cluster is considered to balance the whole network load, and when electing cluster heads, the residual energy of nodes in the cluster is considered to balance the whole network load. Finally, simulation experiments are conducted in this paper using simulation software, and the simulation results show that the data fusion algorithm is more effective than the protocol in reducing the average energy consumption of nodes and extending the network lifetime; these features make wireless sensors more beneficial for better management of sporting events as well as better optimization.

Efficient Clustering based Genetic Algorithm in Mobile Wireless Sensor Networks

—Mobile Wireless Sensor Networks (MWSNs) has significant applications that provide free moving for sensor nodes and flexible communication with each other. MWSNs perform many improvements in energy consumption, network lifetime, and channel capacity than static WSNs. The MWSNs need more sophisticated routing protocols than static WSNs due to the unfixed topology based on nodes mobility. This paperpresents an Improved Mobility based Genetic Algorithm Hierarchical routing Protocol (IMGAHP) to handle the packet delivery ratio problem in MGAHP and maximize the network stability period. The proposed protocol is based on two main points. Firstly, utilizing the optimization process (Genetic Algorithm (GA)) to detect the optimum location of Cluster Heads (CHs) and their numbers. Secondly, reassigning timeslots allocated for sensor nodes which moved out of the cluster or didn’t have data to send, to nodes registered in secondary Time Division Multiple Access (TDMA) schedule or new joined mobile nodes. Several experiments are implemented on the proposed IMGAHP protocol using the Matlab simulation program to appraise and compare it with MGAHP and other previous protocols. It is shown from the results that the proposed IMGAHP gives preferable enhancement in packet delivery ratio, energy efficiency, and network lifetime than all previous protocols.

CHEARP: Chord-based hierarchical energy-aware routing protocol for wireless sensor networks

Wireless Sensor networks (WSNs) are mostly deployed in hostile environments, where nodes may do not have any information about their location. Hence, the designed routing protocols and applications have to function independently from the nodes location. Moreover, extending lifetime in such networks is a critical and challenging issue, since they consist of miniaturized energy-constrained devices. The motivation of this paper is to design an energy efficient locationindependent routing protocol for data delivery in WSNs. Therefore, a Chord-based Hierarchical Energy-Aware Routing Protocol (CHEARP) is developed with the focus on preserving the energy consumption. In contrary to the existing DHT-based protocols that interconnect nodes independently of their physical proximity, this paper proposes an approximate logical structure to the physical one, where the aim is to minimize the average paths? length. Simulation results show that the proposed solution reduces the transmission Load, minimizes the transmission delay, and extends the network longevity.

Energy-Efficient Heterogeneous Optimization Routing Protocol for Wireless Sensor Network

A wide range of applications include in Wireless Sensor Networks (WSNs), and it is being used extensively in data collection specifically to process the mission-critical tasks. The implementation of routing protocols of energy-efficient (EE) is one of the significant challenging jobs of Sensor Networks (MC-SSN) and Mission Critical Sensors. In hierarchical routing protocols, higher EE can reach when compared to the flat routing protocols. The network’s scheduling process doesn’t support enhanced balanced Energy-efficient network-integrated super-heterogeneous (E-BEENISH), which discusses earlier. An Energy. Energy efficient Time scheduling based particle swarm optimization unequal fault tolerance clustering protocol (EE-TDMA-PSO-UFC) is proposed in this paper. Based on the distance parameter, an efficient cluster head (CH) is selected in this protocol. Owing to the unexpected failure of MCH (Master Cluster Head), an additional “CH” is chosen that is termed as Surrogate cluster head (SCH) for the restoration of network’s connectivity in the protocol of PSO-UFC. Based on TDMA (Time Division Multiple Access) protocols, the consumption of Energy. Energy is reduced with the allocation of timeslots during transmission of data. Using the technique of EE-TDMA-PSOUFC, the network’s lifespan improves than CEEC and E-BEENISH protocols according to the assessment of simulation results.

Hierarchical WSN protocol with fuzzy multi-criteria clustering and bio-inspired energy-efficient routing (FMCB-ER)

Wireless Sensors Network (WSN) is used for monitoring and recording the physical environment and to transfer the sensed data to a central location by means of widely distributed sensor nodes. One of the major issues with WSNs is limited energy of sensor nodes and high energy consumption during data relay. An energy efficient routing protocol that consumes less energy in data transmission can enhance the network lifetime to a great extent. Considering it, this paper presents, a hierarchical routing protocol Fuzzy Multi-criteria Clustering and Bio-inspired Energy-efficient Routing (FMCB-ER) to enhance network lifetime thus improving upon the operational time of WSN based applications. Here in this approach a grid-based clustering technique is used to form the robust clusters. An adaptive Fuzzy Multi-Criteria Decision-Making (AF-MCDM) that combines Fuzzy-AHP and TOPSIS is then applied for optimum cluster head (CH) selection. For the purpose, the approach considers three broad parameters namely, energy, QoS and node position along with their six sub-criteria. After CH selection, the Emperor Penguin Optimization (EPO) is used to find optimal route for data transmission from CH to sink. The proposed method is evaluated and compared with other existing routing approaches on parameters of energy consumption, lifetime, throughput, end to end delay, jitter, packet delivery ratio, latency, number of dead, alive nodes. Simulation results confirm that the proposed approach outperforms the compared approaches on above discussed parameters. Especially, the proposed approach reduces the energy consumption up to 13% and increases the network lifetime up to 8% in comparison to compared approaches.

Performance Comparison between Hierarchical Routing Protocols applying New Performance Evaluation Items

Performance Comparison between Hierarchical Routing Protocols applying New Performance Evaluation Items

Comparison of LEACH and PEGASIS Hierarchical Routing Protocols in WSN

<p>Wireless Sensor Networks is a group of sensor nodes dispatched in a geographical area for a defined objective. These sensor nodes are characterized by limited capacity of communicating, computing and especially of energy. The performance of these WSN is resting on a good routing protocol, hence the need to choose the routing protocol able to satisfy the wsn's objectives, and to satisfy the common challenge to prolong network life time.</p><p>Several routing concepts have been proposed for the WSN, hierarchical routing is one of the most used concepts. It is divided into 3 types: cluster based routing, grid based routing and chain based protocol. In this paper, we are interested to Study, analyse and compare two popular routing protocols for Wireless sensor networks (WSNs), Low-Energy Adaptive Clustering Hierarchy (LEACH) using clusters based concept and Power-Efficient Gathering in Sensor Information System (PEGASIS) with chain based concept. The both protocols are simulated with Matlab simulator, in order to evaluate its performances against the different users and the WSNs objectives defined.</p>

Comparison between Flat and Hierarchical Routing Protocols in Wireless Sensor Network

Wireless Sensor Network (WSN) has delivered the accessibility of small, tiny and low cost sensor nodes which are capable to sense various kinds of physical and environmental conditions, data processing, wireless communication and data gathering. In wireless sensor network routing protocols can be divided into two categories first is flat routing protocol and another is hierarchical routing protocol. In this paper flat and hierarchical routing protocols are evaluated and compared based on various performance parameters. In the last decade we have seen expanded enthusiasm for the potential utilization of remote wireless sensor systems (WSNs) in an extensive change of uses and it has turned into a unique research zone. So finally, in this research paper we are focusing on two different classes of routing protocols in WSN: flat routing and hierarchical or clustering routing.