Low energy adaptive clustering hierarchy with deterministic cluster-head selection

2003 ◽  
Author(s):  
M.J. Handy ◽  
M. Haase ◽  
D. Timmermann
Keyword(s):  
Cluster Head ◽  
Low Energy ◽  
Cluster Head Selection ◽  
Adaptive Clustering

Grid-Based Cluster Head Selection Algorithm in Wireless Sensor Networks

2013 ◽  
Vol 427-429 ◽  
pp. 1497-1501
Author(s):  
Cun Xiang Chen ◽  
Zun Wen He ◽  
Jing Ming Kuang ◽  
Hong Mei Sun
Keyword(s):  
Clustering Algorithm ◽  
Cluster Head ◽  
Residual Energy ◽  
Cluster Head Selection ◽  
Network Coverage ◽  
Distributed Clustering ◽  
Position Information ◽  
Adaptive Clustering ◽  
Short Lifecycle ◽  
Grid Based

Although low-energy adaptive clustering hierarchy (LEACH) protocol adopts distributed clustering algorithm and randomized rotation of Cluster Heads (CHs) mechanism to reduce energy consumption, election of CHs without residual energy and position information of each nodes brings about irregular distribution of CH, low network coverage and short lifecycle. In order to avoid these shortcomings, a Grid-based Cluster Head Selection (GCHS) is proposed. Referring to sensing distance, network is divided into several grids equivalent to independent clusters which can meet network coverage and connectivity. Furthermore, CH is selected ground on residual energy level of each node. Simulation taking full advantage of concept mentioned above manifests that it achieves a significant improvement in network coverage and lifecycle.

scholarly journals Consumption of Energy and Routing Protocols in Wireless Sensor Network

2016 ◽  
Vol 8 (3) ◽  
pp. 76 ◽  
Author(s):  
Ridha Azizi
Keyword(s):  
Energy Consumption ◽  
Wireless Sensor Network ◽  
Sensor Network ◽  
Routing Protocols ◽  
Cluster Head ◽  
Low Energy ◽  
Wireless Sensor ◽  
Simulation Tool ◽  
New Approach ◽  
Adaptive Clustering

Extend the life of a wireless sensor network (WSN) is a fundamental challenge, as they have a limited supply. Multiple protocols and approaches have been proposed to minimize power consumption. Routing protocols and especially the hierarchical approach is one of the techniques used to minimize energy consumption and to improve the duration of network life. In this paper we propose a new approach to transfer and select the CH (Cluster Head). ART-LEACH (Advanced Routing Transfer- Low-Energy Adaptive Clustering Hierarchy) is a self-organizing protocol based on clustering. Our approach is to use energy more evenly the selected nodes as CH. We evaluated the performance of LEACH (Low-Energy Adaptive Clustering Hierarchy) and IB-LEACH (Improved and Balanced Low Energy Adaptive Clustering Hierarchy) protocol with the proposed new approach using MATLAB as a simulation tool. The simulation results showed that our proposal provides a reduction in energy consumption and increase the duration of network life.

Research on Low Power Routing Protocol for WSNs

2014 ◽  
Vol 610 ◽  
pp. 927-932
Author(s):  
Ahmed Rouaba ◽  
Nouamane Soualmi ◽  
He Zun Wen
Keyword(s):  
Energy Source ◽  
Routing Protocol ◽  
Routing Protocols ◽  
Communication Systems ◽  
Cluster Head ◽  
Life Time ◽  
Low Energy ◽  
Wireless Sensor ◽  
Adaptive Clustering ◽  
Save Energy

A wireless sensor network (WSN) consists of large number of autonomous sensors nodes; these nodes communicate with each other in dispersed manner to observe the environment. WSNs become one of the most important researches in modern communication systems. The energy source of nodes is limited and practically it is impossible to change or charge the battery. In order to save energy and increases the life time of battery in WSNs. Many energy routing protocols using the clustering were proposed in the literature. Low Energy Adaptive Clustering Hierarchy (LEACH) is the most famous routing protocol. In this paper we propose a new algorithm to choose the cluster head which has the highest energy. We shared the network to four regions, between them 90° for each part we find the powerful sensor between the sensors groups, and this last will be the cluster head of this round. Each sensor sends its data to the nearest cluster head and this last will send it to the sink. The same work for five and six clusters heads with sink in the center and in the corner (100, 0) is done.

Sign in / Sign up

Export Citation Format

Share Document