An Energy-Balanced Cluster-Based Protocol for Wireless Sensor Networks

2013 ◽  
Vol 8 (3) ◽  
pp. 50-63 ◽  
Author(s):  
Eyad Taqieddin ◽  
Moad Mowafi ◽  
Fahed Awad ◽  
Omar Banimelhem ◽  
Hani Maher
Keyword(s):  
Wireless Sensor Networks ◽  
Sensor Networks ◽  
Energy Efficient ◽  
Clustering Algorithm ◽  
Sensor Nodes ◽  
Wireless Sensor ◽  
Clustering Protocol ◽  
Virtual Forces ◽  
Virtual Field ◽  
Energy Efficient Clustering

This paper proposes a novel energy-efficient clustering protocol for wireless sensor networks. It combines the benefits of using the k-means clustering algorithm with the, recently developed, LEACH with virtual forces (LEACH-VF) protocol. In this work, the k-means algorithm is employed to determine k centroids around which the clusters will be formed. After that, the virtual field force method is applied to these clusters to determine the most suitable positions for each node. The main target of such an approach is to improve the energy balance in the network and to extend the network lifetime. Simulation results show that the proposed protocol extends the time before the first node death, minimizes the variance of the average node energy, and reduces the distance that the sensor nodes travel within their respective clusters.

An Energy-Efficient Multilevel Clustering Algorithm for Heterogeneous Wireless Sensor Networks

2011 ◽  
Vol 3 (3) ◽  
pp. 62-79
Author(s):  
Surender Soni ◽  
Vivek Katiyar ◽  
Narottam Chand
Keyword(s):  
Wireless Sensor Networks ◽  
Sensor Networks ◽  
Energy Efficient ◽  
Clustering Algorithm ◽  
Sensor Nodes ◽  
Wireless Sensor ◽  
Large Area ◽  
Topology Management ◽  
Clustering Protocol ◽  
Heterogeneous Wireless Sensor Networks

Wireless Sensor Networks (WSNs) are generally believed to be homogeneous, but some sensor nodes of higher energy can be used to prolong the lifetime and reliability of WSNs. This gives birth to the concept of Heterogeneous Wireless Sensor Networks (HWSNs). Clustering is an important technique to prolong the lifetime of WSNs and to reduce energy consumption as well, by topology management and routing. HWSNs are popular in real deployments (Corchado et al., 2010), and have a large area of coverage. In such scenarios, for better connectivity, the need for multilevel clustering protocols arises. In this paper, the authors propose an energy-efficient protocol called heterogeneous multilevel clustering and aggregation (HMCA) for HWSNs. HMCA is simulated and compared with existing multilevel clustering protocol EEMC (Jin et al., 2008) for homogeneous WSN. Simulation results demonstrate that the proposed protocol performs better.

An Energy-Efficient Multilevel Clustering Algorithm for Heterogeneous Wireless Sensor Networks

2012 ◽  
pp. 286-305
Author(s):  
Surender Soni ◽  
Vivek Katiyar ◽  
Narottam Chand
Keyword(s):  
Wireless Sensor Networks ◽  
Sensor Networks ◽  
Energy Efficient ◽  
Clustering Algorithm ◽  
Sensor Nodes ◽  
Wireless Sensor ◽  
Large Area ◽  
Topology Management ◽  
Clustering Protocol ◽  
Heterogeneous Wireless Sensor Networks

Wireless Sensor Networks (WSNs) are generally believed to be homogeneous, but some sensor nodes of higher energy can be used to prolong the lifetime and reliability of WSNs. This gives birth to the concept of Heterogeneous Wireless Sensor Networks (HWSNs). Clustering is an important technique to prolong the lifetime of WSNs and to reduce energy consumption as well, by topology management and routing. HWSNs are popular in real deployments (Corchado et al., 2010), and have a large area of coverage. In such scenarios, for better connectivity, the need for multilevel clustering protocols arises. In this paper, the authors propose an energy-efficient protocol called heterogeneous multilevel clustering and aggregation (HMCA) for HWSNs. HMCA is simulated and compared with existing multilevel clustering protocol EEMC (Jin et al., 2008) for homogeneous WSN. Simulation results demonstrate that the proposed protocol performs better.

scholarly journals Game Theory-Based Energy-Efficient Clustering Algorithm for Wireless Sensor Networks

Sensors ◽  
2022 ◽  
Vol 22 (2) ◽  
pp. 478
Author(s):  
Xiao Yan ◽  
Cheng Huang ◽  
Jianyuan Gan ◽  
Xiaobei Wu
Keyword(s):  
Game Theory ◽  
Wireless Sensor Networks ◽  
Sensor Networks ◽  
Network Lifetime ◽  
Energy Efficient ◽  
Sensor Node ◽  
Clustering Algorithm ◽  
Sensor Nodes ◽  
Wireless Sensor ◽  
Energy Efficient Clustering

Energy efficiency is one of the critical challenges in wireless sensor networks (WSNs). WSNs collect and transmit data through sensor nodes. However, the energy carried by the sensor nodes is limited. The sensor nodes need to save energy as much as possible to prolong the network lifetime. This paper proposes a game theory-based energy-efficient clustering algorithm (GEC) for wireless sensor networks, where each sensor node is regarded as a player in the game. According to the length of idle listening time in the active state, the sensor node can adopt favorable strategies for itself, and then decide whether to sleep or not. In order to avoid the selfish behavior of sensor nodes, a penalty mechanism is introduced to force the sensor nodes to adopt cooperative strategies in future operations. The simulation results show that the use of game theory can effectively save the energy consumption of the sensor network and increase the amount of network data transmission, so as to achieve the purpose of prolonging the network lifetime.

A Novel Energy-Efficient Clustering Protocol Using Two-Stage Genetic Algorithm for Improving the Lifetime of Wireless Sensor Networks

2020 ◽  
Vol 19 (03) ◽  
pp. 2050019
Author(s):  
Ali Mahani ◽  
Ebrahim Farahmand ◽  
Saeide Sheikhpour ◽  
Nooshin Taheri-Chatrudi
Keyword(s):  
Genetic Algorithm ◽  
Wireless Sensor Networks ◽  
Sensor Networks ◽  
Energy Efficient ◽  
Base Station ◽  
Sensor Nodes ◽  
Wireless Sensor ◽  
Clustering Protocol ◽  
New Energy ◽  
Energy Efficient Clustering

Wireless sensor networks (WSNs) are beginning to be deployed at an accelerated pace, and they have attracted significant attention in a broad spectrum of applications. WSNs encompass a large number of sensor nodes enabling a base station (BS) to sense and transmit data over the area where WSN is spread. As most sensor nodes have a limited energy capacity and at the same time transmit critical information, enhancing the lifetime and the reliability of WSNs are essential factors in designing these networks. Among many approaches, clustering of sensor nodes has proved to be an effective method of reducing energy consumption and increasing lifetime of WSNs. In this paper, a new energy-efficient clustering protocol is implemented using a two-step Genetic Algorithm (GA). In the first step of GA, cluster heads (CHs) are selected, and in the second step, cluster members are chosen based on their distance to the selected CHs. Compared to other clustering protocols, the lifetime of WSNs in the proposed clustering is improved. This improvement is the consequence of the fact that this clustering considers energy efficient parameters in clustering protocol.

scholarly journals GAECH: Genetic Algorithm Based Energy Efficient Clustering Hierarchy in Wireless Sensor Networks

2015 ◽  
Vol 2015 ◽  
pp. 1-8 ◽  
Author(s):  
B. Baranidharan ◽  
B. Santhi
Keyword(s):  
Genetic Algorithm ◽  
Wireless Sensor Networks ◽  
Sensor Networks ◽  
Energy Efficient ◽  
Clustering Algorithm ◽  
Fitness Function ◽  
Sensor Nodes ◽  
Wireless Sensor ◽  
The Stability ◽  
Energy Efficient Clustering

Clustering the Wireless Sensor Networks (WSNs) is the major issue which determines the lifetime of the network. The parameters chosen for clustering should be appropriate to form the clusters according to the need of the applications. Some of the well-known clustering techniques in WSN are designed only to reduce overall energy consumption in the network and increase the network lifetime. These algorithms achieve increased lifetime, but at the cost of overloading individual sensor nodes. Load balancing among the nodes in the network is also equally important in achieving increased lifetime. First Node Die (FND), Half Node Die (HND), and Last Node Die (LND) are the different metrics for analysing lifetime of the network. In this paper, a new clustering algorithm, Genetic Algorithm based Energy efficient Clustering Hierarchy (GAECH) algorithm, is proposed to increase FND, HND, and LND with a novel fitness function. The fitness function in GAECH forms well-balanced clusters considering the core parameters of a cluster, which again increases both the stability period and lifetime of the network. The experimental results also clearly indicate better performance of GAECH over other algorithms in all the necessary aspects.

Sign in / Sign up

Export Citation Format

Share Document