Dual Sink Based-Energy Aware Unequal Clustering Routing Algorithm for Continuous Monitoring Applications in Wireless Sensor Network

2018 ◽  
Author(s):  
Mukil Alagirisamy ◽  
Chee-Onn Chow ◽  
Kamarul Ariffin Bin Noordin
Keyword(s):  
Wireless Sensor Network ◽  
Sensor Network ◽  
Continuous Monitoring ◽  
Routing Algorithm ◽  
Wireless Sensor ◽  
Unequal Clustering ◽  
Energy Aware ◽  
Monitoring Applications

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 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

Sign in / Sign up

Export Citation Format

Share Document