HREF: a highest remaining energy first adaptive clustering algorithm for wireless sensor/mesh networks

2018 ◽  
Vol 41 (1) ◽  
pp. 40-50
Author(s):  
Chie Dou ◽  
Yan-Tong Liu
Keyword(s):  
Clustering Algorithm ◽  
Mesh Networks ◽  
Wireless Sensor ◽  
Adaptive Clustering

scholarly journals A Modified LEACH Protocol for Increasing Lifetime of the Wireless Sensor Network

2016 ◽  
Vol 16 (3) ◽  
pp. 154-164 ◽  
Author(s):  
S. Ananda Kumar ◽  
P. Ilango ◽  
Grover Harsh Dinesh
Keyword(s):  
Wireless Sensor Network ◽  
Sensor Network ◽  
Network Performance ◽  
Clustering Algorithm ◽  
High Reliability ◽  
Cluster Head ◽  
Life Time ◽  
Wireless Sensor ◽  
Average Value ◽  
Adaptive Clustering

Abstract Many studies have been proposed on clustering protocols for various applications in Wireless Sensor Network (WSN). The main objective of the clustering algorithm is to minimize the energy consumption, deployment of nodes, latency, and fault tolerance in network. In short high reliability, robustness and scalability can be achieved. Clustering techniques are mainly used to extend the lifetime of wireless sensor network. The first and foremost clustering algorithm for wireless sensor network was Low Energy Adaptive Clustering Hierarchy (LEACH). As per LEACH, some Cluster Head (CH) may have more nodes, some other may have less nodes, which affects the network performance. The proposed method MaximuM-LEACH provides a solution by load balancing the number of nodes equally by fixing the average value N, so the life time of the network is increased.

An Improved Clustering Algorithm for Wireless Sensor Networks

2014 ◽  
Vol 926-930 ◽  
pp. 2654-2657
Author(s):  
Xi Yi Zhou ◽  
Li Qiang Liu ◽  
Ge Zhang
Keyword(s):  
Clustering Algorithm ◽  
Wireless Sensor ◽  
Local Network ◽  
Transmission Power ◽  
Network Nodes ◽  
Network Information ◽  
Adaptive Clustering ◽  
On Demand ◽  
Information Interaction ◽  
Current Energy

An on-demand weighed clustering algorithm is proposed against the limitation of wireless sensor network nodes with limited energy. This algorithm obtains more local network information by means of information interaction between nodes, and by comprehensively considering such factors as the current energy value, degree and transmission power, etc. of nodes, it makes different clustering decisions as per different application backgrounds of networks. Simulation results show that this algorithm has a more rational clustering by reducing energy consumption and lengthening network lifetime, compared to Low Energy Adaptive Clustering Hierarchy, a representative clustering algorithm.

Improvement of Clustering Algorithm for WSNs

2014 ◽  
Vol 665 ◽  
pp. 745-750
Author(s):  
Qi Gong Chen ◽  
Yong Zhi Wang ◽  
Li Sheng Wei ◽  
Wen Gen Gao
Keyword(s):  
Wireless Sensor Networks ◽  
Energy Consumption ◽  
Sensor Networks ◽  
Clustering Algorithm ◽  
Cluster Head ◽  
Optimal Number ◽  
Low Energy ◽  
Experimental Results ◽  
Wireless Sensor ◽  
Adaptive Clustering

Energy consumption is a hot issue in WSNs (Wireless Sensor Networks). In this paper, we present an improved clustering algorithm. By changing the order of traditional WSNs clustering algorithm, this algorithm uses k-means clustering firstly base on optimal number of cluster head is determined; Then selects cluster head by an improved LEACH (Low Energy Adaptive Clustering Hierarchy) algorithm; Finally, Our experimental results demonstrate that this approach can reduces energy consumption and increases the lifetime of the WSNs.

Sign in / Sign up

Export Citation Format

Share Document