An efficient clustering algorithm for wireless sensor networks

2015 ◽  
Vol 11 (3) ◽  
pp. 302-322 ◽  
Author(s):  
Mariam Alnuaimi ◽  
Khaled Shuaib ◽  
Klaithem Alnuaimi ◽  
Mohammed Abed-Hafez
Keyword(s):  
Network Lifetime ◽  
Duty Cycle ◽  
Energy Efficient ◽  
Clustering Algorithm ◽  
Cluster Head ◽  
Base Station ◽  
Energy Threshold ◽  
Content Type ◽  
Cluster Heads ◽  
Node Ranking

Purpose – This paper aims to propose a new node energy-efficient algorithm with energy threshold to replace cluster heads. The proposed algorithm uses node ranking to elect cluster heads based on energy levels and positions of the nodes in reference to the base station (BS) used as a sink for gathered information. Because the BS calculates the number of rounds a cluster head can remain for as a cluster head in advance, this reduces the amount of energy wasted on replacing cluster heads each round which is the case in most existing algorithms, thus prolonging the network lifetime. In addition, a hybrid redundant nodes duty cycle is used for nodes to take turn in covering the monitored area is shown to improve the performance further. Design/methodology/approach – Authors designed and implemented the proposed algorithm in MATLAB. The performance of the proposed algorithm was compared to other well-known algorithms using different evaluation metrics. The performance of the proposed algorithm was enhanced over existing ones by incorporating different mechanisms such as the use of an energy-based threshold value to replace CHs and the use of a hybrid duty-cycle on nodes. Findings – Through simulation, the authors showed how the proposed algorithm outperformed PEGASIS by 15 per cent and LEACH by almost 70 per cent for the network life-time criterion. They found that using a fixed pre-defined energy threshold to replace CHs improved the network lifetime by almost 15 per cent. They also found that the network lifetime can be further improved by almost 7 per cent when incorporating a variable energy threshold instead of a fixed value. In addition to that, using hybrid-redundant nodes duty-cycle has improved the network lifetime by an additional 8 per cent. Originality/value – The authors proposed an energy-efficient clustering algorithm for WSNs using node ranking in electing CHs and energy threshold to replace CHs instead of being replaced every round.

An Algorithm with Efficiently Collecting and Aggregating Data for Wireless Sensor Networks

2021 ◽  
Author(s):  
Peng Xiong ◽  
Qinggang Su
Keyword(s):  
Wireless Sensor Network ◽  
Sensor Network ◽  
Network Lifetime ◽  
Energy Efficient ◽  
Cluster Head ◽  
Residual Energy ◽  
Base Station ◽  
Wireless Sensor ◽  
Cluster Heads ◽  
Battery Capacity

Due to the resource constraint, in wireless sensor network, the node processing ability, wireless bandwidth and battery capacity and other resources are scarcer. For improving the energy efficient and extend the lifetime of the network, this paper proposes a novel algorithm with the distributed and energy-efficient for collecting and aggregating data of wireless sensor network. In the proposed protocol, nodes can autonomously compete for the cluster head based on its own residual energy and the signal strength of its neighbouring nodes. To reduce the energy overhead of cluster head nodes, with a multi-hop way among cluster heads, the collected data from cluster heads is sent to a designated cluster head so as to further send these data to a base station. For improving the performance of the proposed protocol, a new cluster coverage method is proposed to fit the proposed protocol so that when the node density increases, network lifetime can be increased linearly as the number of nodes is increased. Simulations experiments show that network lifetime adopting the proposed protocol is sharply increased. And, the proposed protocol makes all the nodes die (network lifetime is defined as the death of last one node) in the last 40 rounds so that networks adopting the proposed protocol have higher reliability than networks adopting compared protocols.

scholarly journals Optimization of Energy Efficient Advance Leach Protocol

2021 ◽  
Vol 9 (5) ◽  
pp. 07-16
Author(s):  
Sandeep Kaur ◽  
Dr. Rajeev Bedi ◽  
Mohit Marwaha
Keyword(s):  
Wireless Sensor Networks ◽  
Energy Conservation ◽  
Network Lifetime ◽  
Energy Efficient ◽  
Sensor Node ◽  
Cluster Head ◽  
Base Station ◽  
Wireless Sensor ◽  
Cluster Head Selection ◽  
Leach Protocol

In WSNs, the only source to save life for the node is the battery consumption. During communication with other area nodes or sensing activities consumes a lot of power energy in processing the data and transmitting the collected/selected data to the sink. In wireless sensor networks, energy conservation is directly to the network lifetime and energy plays an important role in the cluster head selection. A new threshold has been formulated for cluster head selection, which is based on remaining energy of the sensor node and the distance from the base station. Proposed approach selects the cluster head nearer to base station having maximum remaining energy than any other sensor node in multi-hop communication. The multi hop approach minimizing the inter cluster communication without effecting the data reliability.

(SET) Smart Energy Management and Throughput Maximization

2017 ◽  
pp. 1-28 ◽  
Author(s):  
Hassan El Alami ◽  
Abdellah Najid
Keyword(s):  
Energy Management ◽  
Routing Protocols ◽  
Clustering Algorithm ◽  
Cluster Formation ◽  
Clustering Algorithms ◽  
Cluster Head ◽  
Base Station ◽  
Throughput Maximization ◽  
Cluster Heads ◽  
Smart Energy Management

Energy efficiency and throughput are critical factors in the design routing protocols of WSNs. Many routing protocols based on clustering algorithm have been proposed. Current clustering algorithms often use cluster head selection and cluster formation to reduce energy consumption and maximize throughput in WSNs. In this chapter, the authors present a new routing protocol based on smart energy management and throughput maximization for clustered WSNs. The main objective of this protocol is to solve the constraint of closest sensors to the base station which consume relatively more energy in sensed information traffics, and also decrease workload on CHs. This approach divides network field into free area which contains the closest sensors to the base station that communicate directly with, and clustered area which contains the sensors that transmit data to the base station through cluster head. So due to the sensors that communicate directly to the base station, the load on cluster heads is decreased. Thus, the cluster heads consume less energy causing the increase of network lifetime.

scholarly journals WSN Clustering Based on EECI (Energy Efficient Clustering using Interconnection) Method

2019 ◽  
Vol 9 (1) ◽  
Keyword(s):  
Energy Efficiency ◽  
Energy Consumption ◽  
Network Lifetime ◽  
Energy Efficient ◽  
Clustering Algorithm ◽  
Cluster Head ◽  
Sensor Data ◽  
Main Technique ◽  
Energy Efficient Clustering ◽  
Selection Of

in WSN, clustering gives an effective way to enhance the network lifetime. Moreover It has been observed that the clustering algorithm utilizes the two main technique first is selection of cluster head and cycling it periodically in order to distribute the energy among the clusters and this in terms increases the lifetime of network. Another challenge comes with this is minimize the energy consumption. In past several algorithm has been proposed to increase the lifetime of the network and energy consumption, however these methodologies lacks from efficiency. In this paper, we have proposed a methodologies named as EE-CI (Energy Efficient Clustering using Interconnection), along with the random updation. Here the networks are parted into different clusters, the cluster updation are done based on the CHC scheme. Moreover, in proposed methodology cluster updation and data sample is determined through the change in sensor data. Here we propose a method for sampling sensor and CHC for selecting the cluster head to balance the energy and improvise the energy efficiency. Moreover, the proposed methodology is evaluated and the result is demonstrated by considering the Leach as existing methodology, experiments results shows that the proposed methodology outperforms the existing methodology.

Distance Based Clustering Algorithm for Energy Efficiency in Wireless Sensor Networks

2014 ◽  
Vol 626 ◽  
pp. 20-25
Author(s):  
K. Kalaiselvi ◽  
G.R. Suresh
Keyword(s):  
Wireless Sensor Networks ◽  
Energy Consumption ◽  
Sensor Networks ◽  
Energy Efficient ◽  
Clustering Algorithm ◽  
Cluster Head ◽  
Base Station ◽  
Wireless Sensor ◽  
Cluster Head Selection ◽  
Energy Efficient Routing

In wireless sensor networks Energy-efficient routing is an important issue due to the limited battery power within the network, Energy consumption is one of the important performance factors. Specifically for the election of cluster head selection and distance between the cluster head node and base station. The main objective of this proposed system is to reduce the energy consumption and prolong the network lifetime. This paper introduces a new clustering algorithm for energy efficient routing based on a cluster head selection

Clustering Algorithm to Reduce Power Consumptions for Wireless Sensor Networks

2012 ◽  
Vol 433-440 ◽  
pp. 5228-5232
Author(s):  
Mohammad Ahmadi ◽  
Hamid Faraji ◽  
Hossien Zohrevand
Keyword(s):  
Wireless Sensor Networks ◽  
Sensor Networks ◽  
Clustering Algorithm ◽  
Cluster Head ◽  
Life Time ◽  
Base Station ◽  
Sensor Nodes ◽  
Wireless Sensor ◽  
Cluster Head Selection ◽  
Cluster Heads

A sensor network has many sensor nodes with limited energy. One of the important issues in these networks is the increase of the life time of the network. In this article, a clustering algorithm is introduced for wireless sensor networks that considering the parameters of distance and remaining energy of each node in the process of cluster head selection. The introduced algorithm is able to reduce the amount of consumed energy in the network. In this algorithm, the nodes that have more energy and less distance from the base station more probably will become cluster heads. Also, we use algorithm for finding the shortest path between cluster heads and base station. The results of simulation with the help of Matlab software show that the proposed algorithm increase the life time of the network compared with LEACH algorithm.

scholarly journals Implementation of Energy HEED (ER-HEED) Protocol Using Super Cluster Head for WSN

2018 ◽  
Vol 7 (S1) ◽  
pp. 119-122
Author(s):  
G. Pattabirani ◽  
K. Selvakumar
Keyword(s):  
Energy Consumption ◽  
Network Lifetime ◽  
Energy Efficient ◽  
Clustering Algorithm ◽  
Clustering Algorithms ◽  
Cluster Head ◽  
Hybrid Energy ◽  
Almost All ◽  
Energy Efficient Clustering ◽  
Super Cluster Head

Wireless Sensor Network (WSN) is used in almost all applications in developing environment. This is due to their ability and easy implementation through several applications. The most important criteria in WSN are to minimize the energy consumption and improve the network lifetime. Clustering algorithms are considered as one of the effective way to improve the network lifetime in WSN. Hybrid, Energy-Efficient and Distributed (HEED) clustering approach uses energy-efficient clustering algorithm. This paper proposes an Enhanced Rotational HEED (ER-HEED) protocol using super cluster head for minimizing energy consumption and to improve the network lifetime. The proposed work is carried out in two stages, first stage, super cluster head is introduced. In second stage, the node with maximum threshold is chosen as a cluster head on rotation within in the cluster. The results show that the ER-HEED performs well when compared with HEED and LEACH.

scholarly journals Threshold Driven Energy-Efficient and Scalable Dual Cluster Head Protocol

2019 ◽  
Vol 9 (1) ◽  
pp. 6207-6216
Keyword(s):  
Energy Dissipation ◽  
Data Transmission ◽  
Minimum Energy ◽  
Cluster Head ◽  
Base Station ◽  
Energy Threshold ◽  
Threshold Values ◽  
Major Step ◽  
Cluster Heads ◽  
Energy Thresholds

In WSN cluster-based routing approach is a major step in the direction of energy efficiency. However, research shows that energy dissipation in a cluster-based approach predominantly occurs in two cases; first during data transmission to the base station and second during data fusion/aggregation. Eventually, this leads to sizable energy dissipation, the early death of CHs and results in lower network lifetime. Moreover, in most of the recent proposed works, it is never assured that an individual node selected as a Cluster-Head would perform all the assigned tasks without dying in the process. Thus to address these problems, a new approach is proposed in this paper, where two cluster-heads (CHs) in every cluster are selected; first cluster-head being used for data aggregation (Primary-CH) and second for data transmission (Secondary-CH), which assists in reducing the burden of a single Cluster Head. Along with the dual Cluster-Heads, another key feature adopted in this paper is the Energy Threshold values for PCH and SCH. These Energy Thresholds for different CHs calculates the minimum energy required by a node to perform all the tasks assigned to it when elected as CH. So, while electing Primary Cluster-Head (PCH) and Secondary Cluster-Head (SCH) along with other criterions energy threshold values for PCH (EPO) and energy threshold values for SCH (ESO) are also used. Any node with remaining energy less than that of energy thresholds would never be considered for Cluster-Heads. Therefore, by employing the above-mentioned criterions, this article proposes a new protocol that uses dual heads and assists in enhancing the network life of a network as compared to LEACH protocol.

An energy efficient load balanced cluster-based routing using ant colony optimization for WSN

2018 ◽  
Vol 14 (3/4) ◽  
pp. 233-246 ◽  
Author(s):  
Kalpna Guleria ◽  
Anil Kumar Verma
Keyword(s):  
Ant Colony Optimization ◽  
Network Lifetime ◽  
Energy Efficient ◽  
Cluster Head ◽  
Ant Colony ◽  
Cluster Head Selection ◽  
Content Type ◽  
Cluster Based Routing ◽  
Optimal Cluster ◽  
Load Balanced

Purpose Wireless sensor networks (WSNs) have emerged as one of the most promising technology in our day-to-day life. Limited network lifetime and higher energy consumption are two most critical issues in WSNs. The purpose of this paper is to propose an energy-efficient load balanced cluster-based routing protocol using ant colony optimization (LB-CR-ACO) which ultimately results in enhancement of the network lifetime of WSNs. Design/methodology/approach The proposed protocol performs optimal clustering based on cluster head selection weighing function which leads to novel cluster head selection. The cluster formation uses various parameters which are remaining energy of the nodes, received signal strength indicator (RSSI), node density and number of load-balanced node connections. Priority weights are also assigned among these metrics. The cluster head with the highest probability will be selected as an optimal cluster head for a particular round. LB-CR-ACO also performs a dynamic selection of optimal cluster head periodically which conserves energy, thereby using network resources in an efficient and balanced manner. ACO is used in steady state phase for multi-hop data transfer. Findings It has been observed through simulation that LB-CR-ACO protocol exhibits better performance for network lifetime in sparse, medium and dense WSN deployments than its peer protocols. Originality/value The proposed paper provides a unique energy-efficient LB-CR-ACO for WSNs. LB-CR-ACO performs novel cluster head selection using optimal clustering and multi-hop routing which utilizes ACO. The proposed work results in achieving higher network lifetime than its peer protocols.

Distributed Energy-Efficient Unequal Clustering Mechanism for Wireless Sensor Networks

2011 ◽  
Vol 186 ◽  
pp. 225-229
Author(s):  
Chang Jiang Jiang ◽  
Wei Ren Shi ◽  
Min Xiang
Keyword(s):  
Wireless Sensor Networks ◽  
Sensor Networks ◽  
Energy Efficient ◽  
Clustering Algorithm ◽  
Base Station ◽  
Wireless Sensor ◽  
Distributed Energy ◽  
Unequal Clustering ◽  
Multihop Routing ◽  
Cluster Heads

Unequal clustering mechanism, in combination with inter-cluster multihop routing, provides a new effective way to balance the energy dissipation among nodes and prolong the lifetime of wireless sensor networks. In this paper, a distributed energy-efficient unequal clustering mechanism (DEEUC) is proposed and evaluated. By a time based competitive clustering algorithm, DEEUC partitions all nodes into clusters of unequal size, in which the clusters closer to the base station have smaller size. The cluster heads of these clusters can preserve some more energy for the inter-cluster relay traffic and the “hot-spots” problem can be avoided. For inter-cluster communication, DEEUC adopts an energy-aware multihop routing to reduce the energy consumption of the cluster heads. Simulation results demonstrate that the protocol can efficiently decrease the dead speed of the nodes and prolong the network lifetime

Sign in / Sign up

Export Citation Format

Share Document