scholarly journals A Cross Unequal Clustering Routing Algorithm for Sensor Network

2013 ◽  
Vol 13 (4) ◽  
pp. 200-205 ◽  
Author(s):  
Wang Tong ◽  
Wu Jiyi ◽  
Xu He ◽  
Zhu Jinghua ◽  
Charles Munyabugingo
Keyword(s):  
Energy Consumption ◽  
Wireless Sensor Network ◽  
Energy Loss ◽  
Sensor Network ◽  
Routing Algorithm ◽  
High Energy ◽  
Wireless Sensor ◽  
Unequal Clustering ◽  
Long Distance ◽  
Cluster Heads

In the routing protocol for wireless sensor network, the cluster size is generally fixed in clustering routing algorithm for wireless sensor network, which can easily lead to the “hot spot” problem. Furthermore, the majority of routing algorithms barely consider the problem of long distance communication between adjacent cluster heads that brings high energy consumption. Therefore, this paper proposes a new cross unequal clustering routing algorithm based on the EEUC algorithm. In order to solve the defects of EEUC algorithm, this algorithm calculating of competition radius takes the node’s position and node’s remaining energy into account to make the load of cluster heads more balanced. At the same time, cluster adjacent node is applied to transport data and reduce the energy-loss of cluster heads. Simulation experiments show that, compared with LEACH and EEUC, the proposed algorithm can effectively reduce the energy-loss of cluster heads and balance the energy consumption among all nodes in the network and improve the network lifetime

WN-LEACH: A Weighted Residual Energy Based Cluster-Heads Selection Algorithm for Wireless Sensor Network

2013 ◽  
Vol 765-767 ◽  
pp. 980-984
Author(s):  
Xi Rong Bao ◽  
Jia Hua Xie ◽  
Shuang Long Li
Keyword(s):  
Energy Consumption ◽  
Wireless Sensor Network ◽  
Sensor Network ◽  
Routing Algorithm ◽  
Cluster Head ◽  
Residual Energy ◽  
Base Station ◽  
Wireless Sensor ◽  
Cumulative Number ◽  
Cluster Heads

This article focused on the energy limit property of Wireless Sensor Network, and proposed a residual energy based algorithm WN-LEACH, with the classic network mode of LEACH routing algorithm. The algorithm combines the proportion of residual energy in the total energy with the cumulative number of the normal nodes supported by the cluster heads as a cluster selection reference. In order to balance the energy consumption of each cluster-head, the algorithm took both the different positions of the base station and the initial energy of the network into consideration, and weighted the two factors to balance the energy consumption between transmitting the signals and data fusion. Simulation results show that the algorithm can promote the lifetime of the uneven energy network and does not impair the effects of the LEACH algorithm.

A New Clustering Routing Algorithm of Wireless Sensor Network

2014 ◽  
Vol 986-987 ◽  
pp. 2095-2098
Author(s):  
Li Qiang Chen
Keyword(s):  
Energy Efficiency ◽  
Energy Consumption ◽  
Wireless Sensor Network ◽  
Sensor Network ◽  
Network Lifetime ◽  
Routing Algorithm ◽  
Wireless Sensor ◽  
Large Area ◽  
Cluster Heads

In wireless sensor network, node’s energy is limited. The energy consumption of transmission a bit is larger than that of handle a bit. If it adopt effective routing algorithm, it can greatly improve the energy efficiency of wireless sensor network. In order to improve the energy efficiency of wireless sensor network in the large area, we propose a clustering routing algorithm based on energy, the algorithm realize the multi-hops communication between cluster heads by dividing the WSN area into concentric rings, and reduce the size of radius of the clusters gradually when the nodes’ energy is decreasing slowly. The results of simulation show that the algorithm can effectively prolong the network lifetime.

scholarly journals Load-balanced routing algorithm based on cluster heads optimization for wireless sensor networks

2018 ◽  
Vol 232 ◽  
pp. 04050
Author(s):  
Yong-wen Du ◽  
Zhang-min Wang ◽  
Gang Cai ◽  
Jun-hui Gong
Keyword(s):  
Wireless Sensor Networks ◽  
Energy Consumption ◽  
Wireless Sensor Network ◽  
Sensor Networks ◽  
Sensor Network ◽  
Routing Algorithm ◽  
Residual Energy ◽  
Base Station ◽  
Wireless Sensor ◽  
Cluster Heads

In order to solve the problem of unbalanced load consumption of nodes for wireless sensor networks (WSNs), this paper proposes a load-balanced routing algorithm based on cluster heads optimization for wireless sensor network. The proposed algorithm first applies first-order wireless transmission model to calculate the optimal number of clusters, then calculate nodes competitiveness rating by fuzzy algorithm considering the residual energy of node and distance from the node to base station, cluster head selection uses unequal clustering algorithm according to the competitiveness of nodes. By node competitiveness and energy management mechanism which cooperate with each other to select the best cluster heads. Use connected optimization between clusters to search multi-hop paths base station for reducing energy consumption of node, and consider transmission energy consumption, residual energy, transmission distance and other factors. The experimental results show that the proposed algorithm compared with LEACH and UCDP algorithm, can balance loading and effectively extend the life cycle of wireless sensor network.

An Energy Efficient Routing Protocol Based on LEACH for WSN

2014 ◽  
Vol 563 ◽  
pp. 316-319 ◽  
Author(s):  
Yong Chao Liu ◽  
Yue Xia Zhang
Keyword(s):  
Energy Consumption ◽  
Wireless Sensor Network ◽  
Sensor Network ◽  
Energy Efficient ◽  
Routing Algorithm ◽  
Wireless Sensor ◽  
Energy Efficient Routing ◽  
Cluster Heads ◽  
Leach Protocol ◽  
High Possibility

Reducing the network energy consumption and increasing the lifetime of network are important content for wireless sensor network. LEACH is an adaptive routing algorithm with low consumption for wireless sensor network. However there are many shortcomings in LEACH routing algorithm such as too much energy consumption of cluster heads and uneven clustering each round. This paper puts forward a new improved algorithm named H-LEACH to solve the problem above. It lets the nodes holding more energy have the high possibility to become cluster-heads through a threshold and constraints the number of clusters each round at the same time so that it can balance the energy distribution and reduce energy cost. Simulation results show that H-LEACH is more energy-efficient than LEACH protocol.

scholarly journals System Lifetime and Performance Improvement in Wireless Sensor Networks by having Improved Energy Distributed Unequal Clustering Protocol

2021 ◽  
Author(s):  
Ashok T ◽  
Prabakaran R
Keyword(s):  
Energy Consumption ◽  
Wireless Sensor Network ◽  
Sensor Network ◽  
Network Lifetime ◽  
Clustering Algorithms ◽  
Base Station ◽  
Sensor Nodes ◽  
Wireless Sensor ◽  
Unequal Clustering ◽  
Cluster Heads

Abstract Wireless Sensor Network (WSN) is becoming a very important area of research in today’s world and contributes a lot in the field of technology. Reducing energy consumption and improving the network lifetime is the key factor to be considered.Clustering provides an effective way for prolonging the lifetime of a wireless sensor network. Current clustering algorithms usually utilize two techniques, selecting cluster heads with more residual energy and rotating cluster heads periodically, to distribute the energy consumption among nodes in each cluster and extend the network lifetime. Also, it comprises various sensor nodes to detect different parameters. Among those non-replaceable batteries plays a greater part. Hence the system with such networks is essential that the sensor nodes consume as little energy as possible.To address the problem, we propose anovel model namely enhanced energy distributed unequal clustering which is mainly utilized for tackling energy consumption issues in multi-hop remote sensor systems. In the proposed method with an area of base station and energy are given significance as clustering parameters. Because of these parameters, diverse nodes are assigned. Here, another methodology has been proposed to enhance the working of EDUC, by electing cluster heads considering several nodes in the neighborhood. The incorporation of the area data for calculation of the opposition radii gives better adjusting of energy in correlation with the current methodology. The technique utilized is of holding similar bunches for a couple of rounds and is successful in decreasing the clustering overhead. The execution of the proposed convention has been assessed under three distinct scenarios and contrasted and existing conventions through reenactments. The outcomes demonstrate that the proposed plan beats the current conventions regarding system lifetime and performances in all the scenarios in terms of delay, energy consumption, packet loss ratio, and packet received ratio.

scholarly journals Unequal Clustering Multipath Routing Algorithm for Wireless Sensor Network based on Clustering and Ant Colony

2021 ◽  
Vol 3 (3) ◽  
pp. 156-160
Author(s):  
Jin Yong-xian
Keyword(s):  
Wireless Sensor Network ◽  
Sensor Network ◽  
Routing Algorithm ◽  
Multipath Routing ◽  
Cluster Head ◽  
Optimal Number ◽  
Wireless Sensor ◽  
Unequal Clustering ◽  
Selection Probability ◽  
Factor Node

To improve the energy efficiency of the wireless sensor network (WSN), and extend the network life. This paper proposes an improved unequal clustering multipath routing algorithm (UCMRA). The algorithm improves the formula of cluster head selection probability and competition radius, and considers the energy factor, node density, optimal number of cluster heads, etc. Experimental results show that, compared with the traditional algorithm, UCMRA has more stable cluster head distribution, less energy consumption and longer network lifetime.

scholarly journals An improved cluster formation process in wireless sensor network to decrease energy consumption

2020 ◽  
Author(s):  
Hamid Reza Farahzadi ◽  
Mostafa Langarizadeh ◽  
Mohammad Mirhosseini ◽  
Seyed Ali Fatemi Aghda
Keyword(s):  
Energy Consumption ◽  
Wireless Sensor Network ◽  
Sensor Network ◽  
Information Transfer ◽  
Cluster Head ◽  
High Energy ◽  
Residual Energy ◽  
Base Station ◽  
Wireless Sensor ◽  
Death Time

AbstractWireless sensor network has special features and many applications, which have attracted attention of many scientists. High energy consumption of these networks, as a drawback, can be reduced by a hierarchical routing algorithm. The proposed algorithm is based on the Low Energy Adaptive Clustering Hierarchy (LEACH) and Quadrant Cluster based LEACH (Q-LEACH) protocols. To reduce energy consumption and provide a more appropriate coverage, the network was divided into several regions and clusters were formed within each region. In selecting the cluster head (CH) in each round, the amount of residual energy and the distance from the center of each node were calculated by the base station (including the location and residual energy of each node) for all living nodes in each region. In this regard, the node with the largest value had the highest priority to be selected as the CH in each network region. The base station calculates the CH due to the lack of energy constraints and is also responsible for informing it throughout the network, which reduces the load consumption and tasks of nodes in the network. The information transfer steps in this protocol are similar to the LEACH protocol stages. To better evaluate the results, the proposed method was implemented with LEACH LEACH-SWDN, and Q-LEACH protocols using MATLAB software. The results showed better performance of the proposed method in network lifetime, first node death time, and the last node death time.

A Wireless Sensor Network Routing Algorithm Based on Zigbee

2014 ◽  
Vol 513-517 ◽  
pp. 1845-1849
Author(s):  
Hua Rui Wu ◽  
Li Zhu
Keyword(s):  
Energy Consumption ◽  
Wireless Sensor Network ◽  
Sensor Network ◽  
Large Scale ◽  
Routing Algorithm ◽  
Network Routing ◽  
Routing Algorithms ◽  
Wireless Sensor ◽  
Quantitative Relation ◽  
Analysis Model

Routing strategy with effective and saving energy is an important problem in the research on the application of wireless sensor network into the farmland micro climate and soil moisture monitoring,it analyzed the disadvantage of the layered tree routing algorithm and ZigBee routing algorithms in energy saving, combined with ZigBee network topology,establishing an optimal node analysis model based on fuzzy decision, bringing forward a new routing algorithm which is suitable for large-scale farmland gradient environment, this new algorithm find out the quantitative relation between energy consumption and routing node selecting strategy,which can greatly decrease the route hop number by routing discovery mechanism and create an optimum goal group. Simulation results showed that compared with the layered tree and ZigBee routing algorithms,the new routing algorithms can significantly reduce the energy consumption of routing process.

scholarly journals An Election Energy Threshold Based Multi-Hop Routing Protocol in a Grid-Clustered Wireless Sensor Network

2018 ◽  
pp. 327-336 ◽  
Author(s):  
Funom Samuel Dadah ◽  
Ajayi Ore-Ofe ◽  
Aliyu D Usman ◽  
Y A Mshelia ◽  
M O Babatunde
Keyword(s):  
Energy Consumption ◽  
Wireless Sensor Network ◽  
Sensor Network ◽  
Routing Protocol ◽  
Energy Efficient ◽  
Routing Algorithm ◽  
Base Station ◽  
Energy Threshold ◽  
Wireless Sensor ◽  
Data Packets

Owing to the limited energy of sensor nodes (SNs) in a wireless sensor network (WSN), it is important to reduce and balance the energy consumption of the SNs in order to extend the WSN lifetime. Clustering mechanism is a highly efficient and effective mechanism for minimizing the amount of energy that SNs consume during the transmission of data packets. In this paper, an election energy threshold based multi-hop routing protocol (mEEMRP) is presented. In order to minimize energy consumption, this routing protocol uses grid clustering, where the network field is divided into grid clusters. SNs in each grid cluster select a cluster head (CH) based on a weight factor that takes the node location, node’s residual energy (RE) as well as the node’s distance from the base station into consideration. An energy efficient multi-hop routing algorithm is adopted during the transmission of data packets from the cluster heads (CHs) to the base station (BS). This multi-hop routing algorithm uses an election energy threshold value, T­nhCH that takes into consideration the RE of CHs as well as the distance between CHs. Simulation results show a 1.77% and 10.65% improvement in terms of network lifetime for two network field scenarios over Energy Efficient Multi-hop Routing Protocol (EEMRP).

Sign in / Sign up

Export Citation Format

Share Document