Energy Efficient Hierarchical Routing Protocol Research Articles

Trust management-based and energy efficient hierarchical routing protocol in wireless sensor networks

The single planar routing protocol has a slow convergence rate in the large-scale Wireless Sensor Network (WSN). Although the hierarchical routing protocol can effectively cope with large-scale application scenarios, how to elect a secure cluster head and balance the network load becomes an enormous challenge. In this paper, a Trust Management-based and ​Low Energy Adaptive Clustering Hierarchy protocol (LEACH-TM) is proposed. In LEACH-TM, by using the number of dynamic decision cluster head nodes, residual energy and density of neighbor nodes, the size of the cluster can be better constrained to improve energy efficiency, and avoid excessive energy consumption of a node. Simultaneously, the trust management scheme is introduced into LEACH-TM to defend against internal attacks. The simulation results show that, compared with LEACH-SWDN protocol and LEACH protocol, LEACH-TM outperforms in prolonging the network lifetime and balancing the energy consumption, and can effectively mitigate the influence of malicious nodes on cluster head selection, which can greatly guarantee the security of the overall network.

Energy-efficient hierarchical routing in wireless sensor networks based on fog computing

Wireless sensor networks (WSNs) have been recognized as one of the most essential technologies of the twenty-first century. The applications of WSNs are rapidly increasing in almost every sector because they can be deployed in areas where cable and power supply are difficult to use. In the literature, different methods have been proposed to minimize the energy consumption of sensor nodes to prolong WSNs utilization. In this article, we propose an efficient routing protocol for data transmission in WSNs; it is called energy-efficient hierarchical routing protocol for wireless sensor networks based on fog computing. Fog computing is integrated into the proposed scheme due to its capability to optimize the limited power source of WSNs and its ability to scale up to the requirements of the Internet of things applications. In addition, we propose an improved ant colony optimization algorithm that can be used to construct an optimal path for efficient data transmission for sensor nodes. The performance of the proposed scheme is evaluated in comparison with P-SEP, EDCF, and RABACO schemes. The results of the simulations show that the proposed approach can minimize sensor nodes’ energy consumption, data packet losses, and extends the network lifetime. We are aware that in WSNs, the certainty of the sensed data collected by a sensor node can vary due to many reasons such as environmental factors, drained energy, and hardware failures.

Determination of the K-optimal number of chains-based routing protocol formed by the K-Means algorithm for the WSN

<span>Wireless sensor networks comprise of a large number of lightweight and relatively low-cost computational nodes which their main task is to sense the surrounding environment and collect the information to send it wirelessly to a central point to take the appropriate actions. Although these networks had been used in various applications, achieving this task is challenging due to the many constraints of sensor nodes including their limited processing power, communication bandwidth, and power supply. Therefore, an energy efficient routing protocols had to be developed specifically for sensor networks to insure longer lifetime and reasonable performance of the network. In this work, we propose an energy efficient hierarchical routing protocol using chain-based clustering. <span>By simulation on MATLAB, the proposed protocol proved to enhance the performance as it prolongs the lifetime of the network and decreases the energy consumption, the transmission delay, and the overhead compared to other existing protocols as it depends on some advanced methods including dynamic selection of number of chains method, k-means clustering method, advanced greedy chain construction method, and multi-factor based leader selection method.</span></span>

EODC: An Energy Optimized Dynamic Clustering Protocol for Wireless Sensor Network using PSO approach

Wireless Sensor Network comprises of a number of small wireless nodes whose role is to sense, gather, process and communicate. One of the primary concerns of the network is to optimize the energy consumption and extend the network lifespan. Sensor nodes can be clustered to increase the network lifespan. This is done by selecting the cluster head for every cluster and by performing data fusion on the cluster head. The proposed system is using an energy efficient hierarchical routing protocol named Energy Optimized Dynamic Clustering (EODC) for clustering large ad-hoc WSN and route the data towards the sink. The sink receives the data collected from the set of cluster heads after every round. The cluster head was selected using Particle Swarm Optimization (PSO) approach and the cluster members are allocated based on Manhattan distance. The metrics used to find the fitness function are location, link quality, energy of active node and energy of inactive node. The system employs shortest path approach to communicate between the cluster heads till it reaches the base station. By this, we have increased the energy efficiency and lifetime of the network. The analysis and outcomes show that the EODC was found to outperform the existing protocol which compares with this algorithm.

Comprehensive review for energy efficient hierarchical routing protocols on wireless sensor networks

In recent years, wireless sensor networks (WSNs) have played a major role in applications such as tracking and monitoring in remote environments. Designing energy efficient protocols for routing of data events is a major challenge due to the dynamic topology and distributed nature of WSNs. Main aim of the paper is to discuss hierarchical routing protocols in order to improve the energy efficiency and network lifetime. This paper provides a discussion about hierarchical energy efficient routing protocols based on classical and swarm intelligence approach. The routing protocols belonging to both categories can be summarized according to energy efficiency, data aggregation, location awareness, QoS, scalability, load balancing, fault tolerance, query based and multipath. A systematic literature review has been conducted for hierarchical energy efficient routing protocols reported from 2012 to 2017. This survey provides a technical direction for researchers on how to develop routing protocols. Finally, research gaps in the reviewed protocols and the potential future aspects have been discussed.

Energy-Efficient Hierarchical Routing for Wireless Sensor Networks: A Swarm Intelligence Approach

Energy efficient routing in wireless sensor networks (WSNs) require non-conventional paradigm for design and development of power aware protocols. Swarm intelligence (SI) based metaheuristic can be applied for optimal routing of data, in an energy constraint WSNs environment. In this paper, we present BeeSwarm, a SI based energy-efficient hierarchical routing protocol for WSNs. Our protocol consists of three phases: (1) Set-up phase-BeeCluster, (2) Route discovery phase-BeeSearch and (3) Data transmission phase-BeeCarrier. Integration of three phases for clustering, data routing and transmission, is the key aspect of our proposed protocol, which ultimately contributes to its robustness. Evaluation of simulation results show that BeeSwarm perform better in terms of packet delivery, energy consumption and throughput with increased network life compared to other SI based hierarchical routing protocols.

Energy Efficient Hierarchical ClusteringBased Routing Protocol with TDMA forWireless Sensor Networks

A Wireless Sensor Network (WSN) is built from a network of devices referred to as nodes, which can sense the environment and are used to communicate the required information collected from monitored fields. The communication and collection of information is done with the help of wireless links, where each node is linked to one or a number of sensors. The nodes in turn are deployed in large numbers depending upon the application where it is used. In modern days the process is bidirectional where the sensor activity can be monitored. The longevity in network lifetime is necessary as they have limited battery power which is to be used efficiently. This has led to new horizons upon energy saving and reduced power consumption among sensor nodes. Hierarchical cluster-based routing protocols are considered as one of the most efficient routing protocols in wireless sensor networks (WSN) due to its higher energy efficiency, network scalability, and lower data retransmission. An energy efficient hierarchical routing protocol LEACH-EN based on LEACH-C is designed by introducing the concept of TDMA scheduling along with compression of data from each node using LZW compression technique. The proposed LEACH-EN seems to perform well as collision is avoided using TDMA and hence data can be transmitted faster.

REVIEW ON HIERARCHICAL ROUTING IN WIRELESS SENSOR NETWORKS

The Wireless Sensor Network(WSN) has become an interesting field of research of the 21st century. It is a type of the wireless ad-hoc network. This has brought about developing low cost, low-power and multi-function sensor nodes. The network life for wireless sensor network plays an important role in survivability. Energy efficiency is one of the critical concerns for wireless sensor networks. Sensor nodes are strictly constrained in terms of storage, board energy and processing capacity. For these reasons, many new protocols have been proposed for the purpose of data routing in sensor networks. These protocols can be classified into three main categories: data-centric, location-based and hierarchical. This paper mainly deals with some of the major Energy-efficient hierarchical routing protocols for wireless sensor networks. First we will discuss the energy-efficient Hierarchical routing protocols in brief along with their important features, objectives, drawbacks and area of application. Finally, we provide a comparison of these various protocols.

An Improved LEACH Routing Protocol for Energy-Efficiency of Wireless Sensor Networks

A wireless sensor network (WSN) is a wireless network consisting of a base station (BS) and multiple micro-sensor nodes. The micro-sensor nodes run on batteries that are not recharged during the network’s lifetime. Therefore, prolonging WSN lifetime is a significant problem. There are some energy-efficient hierarchical routing protocols designed especially for WSNs, such as sensor protocols for information negotiation (SPIN), low-energy adaptive clustering hierarchy (LEACH) and LEACH-centralized (LEACH-C). In this article, we propose an improvement on the LEACH routing protocol to decrease energy consumption and prolong network lifetime. LEACHDistance Energy (LEACH-DE) selects a cluster head node not only by considering residual energy of the node greater than the average residual energy level of nodes in network, but also by examining the geometric distance between the candidate node to the BS as a key parameter. The results of simulation show our proposed algorithm outperforms LEACH and LEACH-C in terms of conserving energy and prolonging WSN lifetime.

Energy and Throughput Analysis of Hierarchical Routing Protocol 'LEACH' for Wireless Sensor Network

ABSTRACT Wireless sensor networks (WSNs) have gained increasing attention from both the research community and actual users. The efficient utilization of energy source in a sensor node is very important criteria to prolong the life time of wireless sensor network. Wireless sensor networks have explored to many new protocols specifically designed for sensor networks where energy consideration is very crucial. Most of importance, given to hierarchical routing protocols based on clustering has better scalability. As sensor nodes are generally battery-powered devices, the critical aspects to face concern how to reduce the energy consumption of nodes, so that the network lifetime can be extended to reasonable times. There are several energy efficient hierarchical routing protocols among this LEACH is famous protocol, we have simulated LEACH in NS2 and analyzed performance of LEACH in terms of energy, throughput and lifetime. Keywords : LEACH, Hierarchical Routing Algorithms, clustering, wireless sensor networks.