scholarly journals An Energy-Balanced Mechanism for Hierarchical Routing in Wireless Sensor Networks

2015 ◽  
Vol 2015 ◽  
pp. 1-10 ◽  
Author(s):  
Zhenjiang Zhang ◽  
Yanan Wang ◽  
Fuxing Song ◽  
Wenyu Zhang
Keyword(s):  
Wireless Sensor Networks ◽  
Sensor Networks ◽  
Energy Balance ◽  
Cluster Head ◽  
Residual Energy ◽  
Sensor Nodes ◽  
Wireless Sensor ◽  
Sink Node ◽  
Hierarchical Routing ◽  
Cluster Heads

In wireless sensor networks (WSNs), energy-constrained sensor nodes are always deployed in hazardous and inaccessible environments, making energy management a key problem for network design. The mechanism of RNTA (redundant node transmission agents) lacks an updating mechanism for the redundant nodes, causing an unbalanced energy distribution among sensor nodes. This paper presents an energy-balanced mechanism for hierarchical routing (EBM-HR), in which the residual energy of redundant nodes is quantified and made hierarchic, so that the cluster head can dynamically select the redundant node with the highest residual energy grade as a relay to complete the information transmission to the sink node and achieve an intracluster energy balance. In addition, the network is divided into several layers according to the distances between cluster heads and the sink node. Based on the energy consumption of the cluster heads, the sink node will decide to recluster only in a certain layer so as to achieve an intercluster energy balance. Our approach is evaluated by a simulation comparing the LEACH algorithm to the HEED algorithm. The results demonstrate that the BEM-HR mechanism can significantly boost the performance of a network in terms of network lifetime, data transmission quality, and energy balance.

scholarly journals Qualification of Cluster Header and Cluster Member in Wireless Sensor Networks

2019 ◽  
Vol 8 (2S6) ◽  
pp. 101-105
Keyword(s):  
Wireless Sensor Networks ◽  
Sensor Networks ◽  
Data Transmission ◽  
Sensor Node ◽  
Data Transfer ◽  
Cluster Head ◽  
Residual Energy ◽  
Sensor Nodes ◽  
Wireless Sensor ◽  
Sink Node

Many researches have been proposed for efficiency of data transmission from sensor nodes to sink node for energy efficiency in wireless sensor networks. Among them, cluster-based methods have been preferred In this study, we used the angle formed with the sink node and the distance of the cluster members to calculate the probability of cluster head. Each sensor node sends measurement values to header candidates, and the header candidate node measures the probability value of the header with the value received from its candidate member nodes. To construct the cluster members, the data transfer direction is considered. We consider angle, distance, and direction as cluster header possibility value. Experimental results show that data transmission is proceeding in the direction of going to the sink node. We calculated and displayed the header possibility value of the neighbor nodes of the sensor node and confirmed the candidates of the cluster header for data transfer as the value. In this study, residual energy amount of each sensor node is not considered. In the next study, we calculate the value considering the residual energy amount of the node when measuring the header possibility value of the cluster.

scholarly journals Distributed Energy Balance Clustering Algorithm in Wireless Sensor Networks

2013 ◽  
Vol 13 (Special-Issue) ◽  
pp. 88-99 ◽  
Author(s):  
Yang Wang
Keyword(s):  
Wireless Sensor Networks ◽  
Sensor Networks ◽  
Energy Balance ◽  
Clustering Algorithm ◽  
Cluster Head ◽  
Residual Energy ◽  
Wireless Sensor ◽  
Distributed Energy ◽  
Cluster Heads ◽  
Distance Relationship

Abstract The traditional clustering algorithm of Low-Energy Adaptive Clustering Hierarchy (LEACH) does not care about the residual energy of the cluster heads and the distance relationship of each node in the wireless sensor networks (WSNs). Each new round the cluster head is changed without any concern about the residual energy of the current cluster head, and the nodes join into a new cluster head without concern about the distance factor and the residual energy factor of all nodes in WSNs. To solve these problems in LEACH, this paper puts forward a distributed energy balance clustering algorithm, which takes into full consideration the residual energy of the cluster heads and the distance relationship between the base station and the cluster heads. The experimental results indicate that the proposed distributed energy balance clustering algorithm can prolong the lifetime of the networks more than LEACH, and the number of messages for selecting a new cluster head at the same time can be greatly reduced, which proves it as more suitable for practical applications.

scholarly journals A Cluster-Head Rotating Election Routing Protocol for Energy Consumption Optimization in Wireless Sensor Networks

Complexity ◽  
2020 ◽  
Vol 2020 ◽  
pp. 1-13
Author(s):  
Jun Wang ◽  
Zhuangzhuang Du ◽  
Zhengkun He ◽  
Xunyang Wang
Keyword(s):  
Wireless Sensor Networks ◽  
Energy Consumption ◽  
Sensor Networks ◽  
Routing Protocol ◽  
Cluster Head ◽  
Residual Energy ◽  
Base Station ◽  
Wireless Sensor ◽  
Cluster Heads ◽  
Cluster Head Election

Balancing energy consumption using the clustering routing algorithms is one of the most practical solutions for prolonging the lifetime of resource-limited wireless sensor networks (WSNs). However, existing protocols cannot adequately minimize and balance the total network energy dissipation due to the additional tasks of data acquisition and transmission of cluster heads. In this paper, a cluster-head rotating election routing protocol is proposed to alleviate the problem. We discovered that the regular hierarchical clustering method and the scheme of cluster-head election area division had positive effects on reducing the energy consumption of cluster head election and intracluster communication. The election criterion composed of location and residual energy factor was proved to lower the probability of premature death of cluster heads. The chain multihop path of intercluster communication was performed to save the energy of data aggregation to the base station. The simulation results showed that the network lifetime can be efficiently extended by regulating the adjustment parameters of the protocol. Compared with LEACH, I-LEACH, EEUC, and DDEEC, the algorithm demonstrated significant performance advantages by using the number of active nodes and residual energy of nodes as the evaluation indicators. On the basis of these results, the proposed routing protocols can be utilized to increase the capability of WSNs against energy constraints.

An Improved LEACH Protocol in Wireless Sensor Networks

2015 ◽  
Vol 743 ◽  
pp. 748-752 ◽  
Author(s):  
L.F. Liu ◽  
P. Guo ◽  
J. Zhao ◽  
N. Li
Keyword(s):  
Wireless Sensor Networks ◽  
Life Cycle ◽  
Sensor Networks ◽  
Cluster Head ◽  
Network Routing ◽  
Residual Energy ◽  
Sensor Nodes ◽  
Wireless Sensor ◽  
Head Node ◽  
Leach Protocol

Wireless sensor network routing protocol is to prolong the survival time of wireless sensor networks by using the sensor nodes energy efficiently. Traditional LEACH protocol is random in the election of the cluster head, if a less energy node is first elected as a cluster head node, then the node might die soon, it will greatly reducing the lifetime of the network. In order to collect data more efficiently and prolong the network life cycle,we need better clustering protocol. Aim at the traditional LEACH protocol have some weakness,this paper improve the protocol based on traditional LEACH protocol, two influence factors which the residual energy and the number of elected cluster head of the nodes had been introduced to make the clustering more ideal. Simulation results show that compared to the traditional Leach algorithm ,the improved LEACH protocol can prolong the network life cycle more effective and reduce the energy consumption of the whole network.

Clustering Algorithm to Reduce Power Consumptions for Wireless Sensor Networks

2012 ◽  
Vol 433-440 ◽  
pp. 5228-5232
Author(s):  
Mohammad Ahmadi ◽  
Hamid Faraji ◽  
Hossien Zohrevand
Keyword(s):  
Wireless Sensor Networks ◽  
Sensor Networks ◽  
Clustering Algorithm ◽  
Cluster Head ◽  
Life Time ◽  
Base Station ◽  
Sensor Nodes ◽  
Wireless Sensor ◽  
Cluster Head Selection ◽  
Cluster Heads

A sensor network has many sensor nodes with limited energy. One of the important issues in these networks is the increase of the life time of the network. In this article, a clustering algorithm is introduced for wireless sensor networks that considering the parameters of distance and remaining energy of each node in the process of cluster head selection. The introduced algorithm is able to reduce the amount of consumed energy in the network. In this algorithm, the nodes that have more energy and less distance from the base station more probably will become cluster heads. Also, we use algorithm for finding the shortest path between cluster heads and base station. The results of simulation with the help of Matlab software show that the proposed algorithm increase the life time of the network compared with LEACH algorithm.

Improvement of Cluster-Head Selection Mechanism Based on LEACH Protocol in Wireless Sensor Networks

2014 ◽  
Vol 989-994 ◽  
pp. 4273-4276
Author(s):  
Shi Ping Fan ◽  
Xiao Di Zhang ◽  
Hai Li Wang
Keyword(s):  
Wireless Sensor Networks ◽  
Sensor Networks ◽  
Cluster Head ◽  
Premature Death ◽  
Residual Energy ◽  
Wireless Sensor ◽  
Cluster Head Selection ◽  
Selection Mechanism ◽  
Cluster Heads ◽  
Leach Protocol

In order to prolong the lifetime of wireless sensor networks, improvement of cluster-head selection mechanism based on LEACH protocol is proposed. To make the energy distribution more uniform, we consider the relationship of the density of nodes, residual energy of nodes and distance between nodes and Sink node. It eliminates the defect of energy consumption imbalance in the network caused by random position of cluster-heads and the problem of premature death of nodes caused by low energy nodes becoming cluster-heads. Simulation results show that compared with LEACH algorithm, the improved algorithm extend the network lifetime.

Optimization of Energy Conservation in Wireless Sensor Networks

2020 ◽  
Vol 17 (6) ◽  
pp. 2658-2663
Author(s):  
Anju Rani ◽  
Amit Kumar Bindal
Keyword(s):  
Wireless Sensor Networks ◽  
Sensor Networks ◽  
Cluster Head ◽  
Energy Utilization ◽  
Sensor Nodes ◽  
Wireless Sensor ◽  
Adaptive Clustering ◽  
Cluster Heads ◽  
Heterogeneous Wireless Sensor Network ◽  
Stable Election Protocol

Presently, Wireless Sensor Networks (WSNs) is quickest developing technology which broadly embracing for different application services including; climate observing, traffic expectation, reconnaissance, research and scholastic fields and so on. As the sensor nodes are haphazardly conveyed in remote condition, security measurements turns out to be most encouraging test where correspondence wirelesses systems confronting today. The Stable Election Protocol (SEP) is an enhanced algorithm of Adaptive Clustering Hierarchy (LEACH) with low energy in heterogeneous Wireless Sensor Network (WSN) for improving the life cycle. Be that as it may, the unequal energy circulation of cluster heads and nodes would diminish the lifetime. From one perspective, adding node vitality to cluster head selection to decrease the energy utilization of cluster heads; on the contrary, decline the energy utilization of nodes in cluster through not directly transmitted by interlude nodes. SEP, a protocol of heterogeneous-aware to drag out the time interim before the passing of the first node (we allude to as steady period), which is essential for some applications where the input from the sensor arrange must be solid. SEP depends on weighted election decision probabilities of every node to turn into cluster head as indicated by the rest of the energy in every node. The outcomes show that the E-SEP protocol functions admirably in adjusting the vitality utilization for improving the lifetime looking at LEACH and SEP protocol with enhanced SEP along with proposed E-SEP algorithm using MATLAB.

scholarly journals Energy-Efficient Cluster Management Using a Mobile Charger for Solar-Powered Wireless Sensor Networks

Sensors ◽  
2020 ◽  
Vol 20 (13) ◽  
pp. 3668 ◽  
Author(s):  
Youngjae Son ◽  
Minjae Kang ◽  
Younghyun Kim ◽  
Ikjune Yoon ◽  
Dong Kun Noh
Keyword(s):  
Wireless Sensor Networks ◽  
Sensor Networks ◽  
Mobile Sink ◽  
Sensor Nodes ◽  
Wireless Sensor ◽  
Sink Node ◽  
Energy Imbalance ◽  
Cluster Heads ◽  
Imbalance Problem ◽  
Solar Powered

In solar-powered wireless sensor networks (SP-WSNs), sensor nodes can continuously harvest energy to relieve the energy constraint problem in battery-powered WSNs. With the advent of wireless power transmission (WPT) technology, the nodes can be charged remotely if the energy harvested is insufficient. However, even in SP-WSNs with WPT, an energy imbalance problem is observed, in which the energy consumption of the nodes around a sink node increases abnormally if the sink node is stationary. To solve this problem, recent studies have been conducted using a mobile sink node instead of a stationary one. Generally, a clustering scheme is used for the efficient utilization of a mobile sink. However, even in the case of mobile sinks, it is still necessary to minimize the energy burden of the cluster heads and their surrounding nodes. In this study, we propose a scheme that mitigates the energy imbalance problem of SP-WSNs by using a WPT-capable mobile sink and an efficient clustering scheme. In the proposed scheme, the energy imbalance is minimized by electing the cluster heads effectively after considering the energy state of the nodes, and by enabling the sink node to charge the energy of the cluster heads while collecting data from them. Consequently, this scheme allows the sink node to collect more data with fewer blackouts of the sensor nodes.

scholarly journals Energy-Efficient Routing Protocol Based on Zone for Heterogeneous Wireless Sensor Networks

2021 ◽  
Vol 2021 ◽  
pp. 1-9
Author(s):  
Jia Yanfei ◽  
Chen Guangda ◽  
Zhao Liquan
Keyword(s):  
Wireless Sensor Networks ◽  
Sensor Networks ◽  
Routing Protocol ◽  
Cluster Head ◽  
Residual Energy ◽  
Base Station ◽  
Wireless Sensor ◽  
Energy Efficient Routing ◽  
Cluster Heads ◽  
Heterogeneous Wireless Sensor Networks

In heterogeneous wireless sensor networks, sensor nodes are randomly distributed in some regions. In some applications, they may be randomly distributed in different regions. Besides, nodes with the same type have almost the same probability to be selected as cluster head. The cluster head will consume much more energy to receive and transmit data than the other nodes. If nodes with little residual energy have been elected as cluster heads, it will affect the efficiency of the network due to its early death. An improved energy-efficient routing protocol is proposed for heterogeneous wireless sensor networks. Firstly, it supposes that the different types of nodes are distributed in different zones. Secondly, by improving the threshold, nodes with large residual energy have a greater possibility of becoming cluster heads. In the end, it designs a mixed data transmission method. The cluster heads of supper nodes and advance nodes directly transmit data to the base station. The normal nodes adopt single hops and multiple hops mixed methods to transmit data. This can minimize the energy of the communication from cluster head to base station. Simulation results show that this algorithm has achieved a longer lifetime for the wireless sensor network than stable election protocol and threshold-sensitive stable election protocol algorithm.

scholarly journals Tree-Based Multihop Routing Method for Energy Efficiency of Wireless Sensor Networks

2021 ◽  
Vol 2021 ◽  
pp. 1-14
Author(s):  
Jin Yong ◽  
Zhou Lin ◽  
Wei Qian ◽  
Bai Ke ◽  
Wang Chen ◽  
...  
Keyword(s):  
Wireless Sensor Networks ◽  
Energy Consumption ◽  
Sensor Networks ◽  
Cluster Head ◽  
Residual Energy ◽  
Base Station ◽  
Sensor Nodes ◽  
Wireless Sensor ◽  
Network Resources ◽  
Multihop Routing

In wireless sensor networks (WSNs), due to the limited energy of sensor nodes, how to design efficient hierarchical routing algorithms to balance network resources and extend network life is an important problem to be solved. Aiming at the problems such as random selection of cluster head, redundancy of working node, and construction of cluster head transmission path, which affect network energy consumption, this paper proposes a multihop routing algorithm based on path tree (MHRA-PT) to optimize the network energy. Firstly, some nodes are those close to the base station and have large remaining energy which are selected to construct a cluster head set. Then, after clustering, each cluster is divided into different regions, and in each region, nodes with residual energy greater than the average residual energy of the cluster are selected as a working node. Finally, the cluster heads are sorted according to their distance from base station, and the next hop node is selected for each cluster head in turn until a path tree rooted at base station is formed completely, leading to data transmission from working node to base station. Simulation results show that the proposed algorithm can effectively reduce network energy consumption, balance network resources, and prolong network life cycle.

Sign in / Sign up

Export Citation Format

Share Document