Energy-efficient Clustering Routing Research Articles

LEACH and Extended LEACH Protocols in Wireless Sensor Network-A Survey

Sensor Network is collection of wireless sensor nodes in which routing protocol is most challenging issue. Sensors have limited battery power. Battery extends the lifetime of sensor nodes. Energy utilization is one of the most important considerations. There are various routing techniques which increase lifetime of battery. One of the most energy efficient clustering routing protocols is LEACH. In this survey paper we represent LEACH & Extended version of LEACH routing protocol. Some issues are faced by LEACH. In this paper we represent how Extended LEACH version tackled these issues. We compare Extended LEACH Protocols with original LEACH. KeywordsHead (CH), Time division multiple access (TDMA), Cluster member (CM), Base Station (BS), Wireless Sensor Network (WSN).

An Energy-Efficient Clustering Routing Algorithm Based on Geographic Position and Residual Energy for Wireless Sensor Network

Recently wireless sensor network (WSN) has become one of the most interesting networking technologies, since it can be deployed without communication infrastructures. A sensor network is composed of a large number of sensor nodes; these nodes are responsible for supervision of the physical phenomenon and transmission of the periodical results to the base station. Therefore, improving the energy efficiency and maximizing the networking lifetime are the major challenges in this kind of networks. To deal with this, a hierarchical clustering scheme, called Location-Energy Spectral Cluster Algorithm (LESCA), is proposed in this paper. LESCA determines automatically the number of clusters in a network. It is based on spectral classification and considers both the residual energy and some properties of nodes. In fact, our approach uses theK-ways algorithm and proposes new features of the network nodes such as average energy, distance to BS, and distance to clusters centers in order to determine the clusters and to elect the cluster's heads of a WSN. The simulation results show that if the clusters are not constructed in an optimal way and/or the number of the clusters is greater or less than the optimal number of clusters, the total consumed energy of the sensor network per round is increased exponentially.

Uneven Cluster-Routing Protocol of Base on Energy for Wireless Sensor Networks

For severe energy constraint problem of wireless sensor networks, a non-uniform energy efficient clustering routing protocol (EUCRP) is proposed based on the analysis of the existing clustering routing protocol the characteristics and shortcomings. In EUCRP, we use a limiting cluster size optimization formation algorithm to produce clusters in descending order of the size of the cluster. Improved multi-hop inter-cluster data forwarding, saving energy cluster head and energy consumption of inter-cluster is balanced. Propose using “watering pot path” in the last hop to effectively solve the “hot zone” problem caused by uneven load energy. Simulation results show that the protocol can effectively reduce network energy consumption and prolong the network lifetime.

Low Probability Cluster Head Selection Energy Efficient Routing in MANET using DEEC

Adhoc Network is the prominent area of rese arch to make wireless networking more robust and reliable for packet delivery among nodes of a small or big network through wireless channel. The routing protocols are also designed to keep in mind that the energy consumption of wireless nodes should be as minimum as possible. In MANET most of the devices are battery operated and saving energy increases the lifetime of the node to transfer information over network, in such case the routing protocol plays important role to increase the network lifetime. In this paper an efficient routing methodology is proposed which significantly increases the network lifetime. Here the distributed energy efficient clustering (DEEC) routing protocol is used with low probability cluster head selection approach, which enhances the network lifetime better than simple DEEC.

Routing Algorithm with Energy-Efficient and High Quality of Clusters in Wireless Sensor Network

This paper proposes an energy-efficient clustering routing algorithm based on the node degree, relative distance between nodes and residual energy. Selecting the cluster head fully consider the node degree and their relative distance. By this way, the coverage performance of cluster head is better and the average distance between member nodes and cluster head is short, so the cost of communication in the cluster is decreased. At the same time, the nodes with low energy have less probability to become the cluster head. Therefore, it can improve the quality of cluster; prolong the life time of the network.

Energy Efficient Hierarchy-based Clustering Routing Protocol for Wireless Sensor Networks

Wireless sensor network (WSN) consisting of a large number of sensor nodes is effective for gathering data in a variety of environments. Since the sensors operate on battery of limited power, it is a challenging task to design an efficient routing scheme which can minimize the delay while offering high energy efficiency and long network lifetime. Achieving both energy efficiency and scalability at the same time is a challenging task in wireless sensor networks. In this paper a new energy efficient hierarchy-based clustering routing protocol (EEHCR) is proposed for data gathering scheme for Wireless sensor networks. This is very crucial to ensure that the system operates at minimum energy with increasing scalability and network life-time. Simulation results show that the proposed routing scheme significantly reduces energy consumption and increases the lifetime of sensor network compared to other hierarchical routing protocols.

An Energy-Heterogeneous Clustering Scheme to Avoid Energy Holes in Wireless Sensor Networks

Clustering techniques can reduce energy consumption of nodes and increase the scalability of the network. However, in uniformly deployed clustering wireless sensor networks, the uneven distribution of communication loads often causes the energy-hole problem, which means that the energy of the nodes in the hole region will be used up sooner than the nodes in other regions. In order to solve the problem, this paper theoretically analyzes the energy consumption of nodes in different network areas, gives the expression of the optimal energy distribution of heterogeneous nodes, and designs an energy-efficient clustering routing protocol. The goal of our work is to propose an energy-heterogeneous clustering scheme (EHCS) that allows the initial energy of the sensor nodes to be varied with the distance to sink. The nearer nodes from sink have more energy. Simulation results show that the method can balance the energy consumption among sensor nodes, achieve an obvious improvement on the network lifetime, and effectively avoid the energy-hole problem.

A Novel Energy Efficient Hierarchical Multi Level Cluster Routing Protocol based on LEACH

As the use of Wireless sensor networks (WSNs) has grown enormously in the past few decades, the need of scalable & energy efficient routing and data aggregation protocol for large scale deployment has also risen. LEACH is a hierarchical clustering protocol that provides an elegant solution for such protocols. One deficiency that affects the performance of the protocol is existence of very large and very small clusters in the network at the same time. This leads to decrease in lifetime of WSNs. Sensors operate on battery of limited power, so it is a great challenging aim to design an energy efficient routing protocol, which can minimize the delay while offering highenergy efficiency and long span of network lifetime. In this paper, a new protocol is proposed. The proposed protocol is energy efficient multi level cluster-based routing protocol for continuous stream queries in WSN for large network areas. We incorporate multi hop concept into LEACH [3] by dividing clusters into levels as in TL-LEACH [8] and consider a set of cluster heads, head-set, for cluster-based routing. The head-set members are responsible for control and management of the network. On rotation basis, a head-set member receives data from the neighboring nodes and from previous level, then aggregated data is transmitted to node of next level and so on, until it reaches the distant base station. For a given number of data collecting sensor nodes, the number of control and management nodes can be systematically adjusted to reduce the energy consumption, which increases network life and multi hop transmission reduces energy consumption as distance between transmitting nodes is reduced.

An efficient compressive data gathering routing scheme for large-scale wireless sensor networks

Compressive sensing based in-network compression is an efficient technique to reduce communication cost and accurately recover sensory data at the sink. Existing compressive sensing based data gathering methods require a large number of sensors to participate in each measurement gathering, and it leads to waste a lot of energy. In this paper, we present an energy efficient clustering routing data gathering scheme for large-scale wireless sensor networks. The main challenges of our scheme are how to obtain the optimal number of clusters and how to keep all cluster heads uniformly distributed. To solve the above problems, we first formulate an energy consumption model to obtain the optimal number of clusters. Second, we design an efficient deterministic dynamic clustering scheme to guarantee all cluster heads uniformly distributed approximately. With extensive simulation, we demonstrate that our scheme not only prolongs nearly 2× network’s lifetime compared with the state of the art compressive sensing based data gathering schemes, but also makes the network energy consumption very uniformly.

WCVALEACH: Weight and Coverage Based Energy Efficient Advanced Leach Algorithm

Designing a protocol stack for wireless sensor network (WSN) is a challenging task due to energy, computational, communication and storage constraints. Energy spent for communication between sensor nodes dominates the energy spent for the computation [1]. Multi -hop short range communication between wireless sensor nodes is energy efficient compared to single -hop long range communication. Hierarchical clustering is one of the possible solutions to save energy of wireless sensor nodes. LEACH [16], Advanced LEACH (ALEACH)[14] and Weight based energy efficient Advanced LEACH (WALEACH) [20] are energy efficient hierarchical clustering routing protocols. In this paper we presented Weight and Coverage based Advanced LEACH routing protocol- WCVALEACH. WCVALEACH selectsCluster Head by assigning importance (weight) to different parameters used to select Cluster Head. It also creates the non -overlapped cluster regions to cover more number of member nodes. Both of these approaches makes WCVALEACH routing protocol energy efficient and improves life time of a wireless sensor network. Simulation results shown here verify that WCVALEACH not only improves network life time compared to ALEACH, LEACH and WALEACH algorithms but Packet Reception Rate (PRR) too.

ECRPW: Energy-Efficient Clustering Routing Protocol Based on Weight for WSNs

ECRPW (energy-efficient clustering routing protocol based on weight) routing protocol is presented to avoid the characteristic of limited energy for wireless sensor networks. It takes nodes’ residual energy into consideration during the process of cluster heads being elected. The constraint of distance threshold is used to optimize cluster scheme. Furthermore, it also sets up the routing tree based on cluster heads’ weight. We simulate and analyze LEACH and ECRPW in NS2. The results show that the performance of ECRPW is better than LEACH.

Energy Efficient Clustering Routing Algorithm in Wireless Sensor Networks

A wireless sensor node can only be equipped with a limited power source due to the several hardware constraints. Moreover, for most applications, replenishment of power resources is impossible. WSN lifetime, therefore, shows a strong dependence on battery lifetime. Thus the sources that consume energy during the operation of each node should be analyzed and maintained efficiently. In this paper, we propose a energy efficient clustering routing algorithm based on LEACH (EE_LEACH), which aims to balance energy consumption in WSN through modification of the threshold and multi-hop data transmission. Simulation results show that the algorithm can save node energy consumption effectively and prolong the network lifetime.

A Energy-Efficient Clustering Routing Algorithm Based on Distance and Residual Energy for Wireless Sensor Networks

Aiming at the problem of limited energy of sensors in Wireless Sensor Network, based on the classic clustering routing algorithm LEACH, a distance-energy cluster structure algorithm considering both the distance and residual energy of nodes is presented in the dissertation, which improves the process of cluster head election and the process of data transmission. It reduces the adverse effect on the energy consumption of the cluster head, resulting from the non-uniform distribution of nodes in network and avoids the direct communication between the base station and cluster head, which may has low energy and far away from base station The results of simulation indicate that the improved algorithm effectively balances the energy consumption, prolongs 31% of the lifetime, reduces 40% of the energy consumption and has a better performance than the original LEACH protocol.

An energy efficiency clustering routing protocol for WSNs in confined area

Wireless sensor networks (WSNs) are important application for safety monitoring in underground coal mines, which are difficult to monitor due to natural conditions. Based on the characteristic of limited energy for WSNs in confined underground area such as coal face and laneway, we presents an energy-efficient clustering routing protocol based on weight (ECRPW) to prolong the lifetime of networks. ECRPW takes into consideration the nodes’ residual energy during the election process of cluster heads. The constraint of distance threshold is used to optimize cluster scheme. Furthermore, the protocol also sets up a routing tree based on cluster heads’ weight. The results show that ECRPW had better performance in energy consumption, death ratio of node and network lifetime.

Wireless Meter Reading Based Energy-Balanced Steady Clustering Routing Algorithm for Sensor Networks

According to the characteristics of wireless meter reading system, an energy-balanced and energy-efficient steady clustering routing algorithm (EBSC, Energy-Balanced Steady Clustering) ...

Energy-aware and quality of service-based routing in wireless sensor networks and vehicular ad hoc networks

Wireless Sensor Networks (WSNs) have increasingly been used for remote monitoring tasks. Limited capabilities of sensor nodes in terms of communication, computation, and storage, present challenges to protocols designed for WSNs. Due to the severe energy constraint of sensor nodes, among the major concerns is the problem of designing efficient energy-aware routing protocols. Numerous routing protocols have been proposed in the literature. Cluster-based routing protocols for large-scale WSNs have some advantages as compared to a flat network topology. Clustering results in a reduced number of messages that propagate through the network in order to accomplish a sensing task. It also offers improved power control. Quality of Service (QoS) is becoming an important feature of data routing in WSNs. QoS is required for real-time data transmission when the result of a sensing task is dependent not only on the correct sensing of the environment but also on the timely delivery of the event notification to the monitoring center, the Sink. The emergency preparedness and response class of applications, for instance, impose delay requirements on the delivery of event notification messages. Transmitting video and imaging data poses certain bandwidth, delay, and jitter requirements on the routing protocols. Vehicular Ad Hoc Networks (VANETs) are envisioned to improve intervehicle coordination and become a part of intelligent transport systems with an ultimate goal of increasing safety on the roads and improving travel comfort. VANETs may include WSNs that are placed along the sides of roads and provide monitoring of road conditions. Routing protocols for VANETs also aim at satisfying end-to-end QoS requirements. This paper first discusses energy-efficient clustering routing protocols for WSNs, followed by approaches aimed at satisfying QoS in WSNs and VANETS. Lastly, a discussion and comparison of features of the selected routing protocols and QoS-based approaches is presented.

An energy efficient clustering routing algorithm for wireless sensor networks

This article proposes an energy efficient clustering routing (EECR) algorithm for wireless sensor network. The algorithm can divide a sensor network into a few clusters and select a cluster head base on weight value that leads to more uniform energy dissipation evenly among all sensor nodes. Simulations and results show that the algorithm can save overall energy consumption and extend the lifetime of the wireless sensor network.