scholarly journals A Novel Energy-Efficient Clustering Algorithm for More Sustainable Wireless Sensor Networks Enabled Smart Cities Applications

2021 ◽  
Vol 10 (3) ◽  
pp. 50
Author(s):  
Zahid Yousif ◽  
Intesab Hussain ◽  
Soufiene Djahel ◽  
Yassine Hadjadj-Aoul
Keyword(s):  
Wireless Sensor Networks ◽  
Sensor Networks ◽  
Clustering Algorithm ◽  
Smart Cities ◽  
Cluster Head ◽  
Residual Energy ◽  
Wireless Sensor ◽  
Transmission Protocol ◽  
New Variant ◽  
Head Node

Wireless Sensor Networks (WSNs) is a major sensing technology that has revolutionized the way information is collected, processed, and used in many smart cities’ applications that rely on sensing technologies for event detection and monitoring. Despite the multiple benefits that such technology offers, the quick depletion of sensors’ battery power represents a major concern, mainly due to the extensive computational tasks and communication operations performed by individual sensors. Indeed, the cost of replacing batteries can be prohibitively expensive, especially when sensors are deployed in areas where access is difficult, in urbanized cities. To extend sensors’ lifetime, this paper proposes a new variant of LEACH protocol named LEACH enhanced with probabilistic cluster head selection (LEACH-PRO). LEACH-PRO introduces several measures to extend WSNs nodes’ lifetime such as cluster head node selection using a probabilistic function based on maximum residual energy and minimum distance to the sink. The obtained simulation results have proven the supremacy of LEACH-PRO over LEACH and direct transmission protocol in terms of the achieved network lifetime and the generated traffic overhead. Most importantly, LEACH-PRO will significantly extend the sensors’ lifetime, which would make this type of deployment more viable in smart city scenarios.

A Cluster Algorithm for Wireless Sensor Networks Based on Energy Efficiency

2015 ◽  
Vol 785 ◽  
pp. 744-750
Author(s):  
Lei Gao ◽  
Qun Chen
Keyword(s):  
Energy Efficiency ◽  
Wireless Sensor Networks ◽  
Energy Consumption ◽  
Sensor Networks ◽  
Clustering Algorithm ◽  
Cluster Head ◽  
Selection Criterion ◽  
Sensor Nodes ◽  
Wireless Sensor ◽  
Head Node

In order to solve the energy limited problem of sensor nodes in the wireless sensor networks (WSN), a fast clustering algorithm based on energy efficiency for wire1ess sensor networks is presented in this paper. In the system initialization phase, the deployment region is divided into several clusters rapidly. The energy consumption ratio and degree of the node are chosen as the selection criterion for the cluster head. Re-election of the cluster head node at this time became a local trigger behavior. Because of the range of the re-election is within the cluster, which greatly reduces the complexity and computational load to re-elect the cluster head node. Theoretical analysis indicates that the timing complexity of the clustering algorithm is O(1), which shows that the algorithm overhead is small and has nothing to do with the network size n. Simulation results show that clustering algorithm based on energy efficiency can provide better load balancing of cluster heads and less protocol overhead. Clustering algorithm based on energy efficiency can reduce energy consumption and prolong the network lifetime compared with LEACH protocol.

An Improved LEACH Protocol in Wireless Sensor Networks

2015 ◽  
Vol 743 ◽  
pp. 748-752 ◽  
Author(s):  
L.F. Liu ◽  
P. Guo ◽  
J. Zhao ◽  
N. Li
Keyword(s):  
Wireless Sensor Networks ◽  
Life Cycle ◽  
Sensor Networks ◽  
Cluster Head ◽  
Network Routing ◽  
Residual Energy ◽  
Sensor Nodes ◽  
Wireless Sensor ◽  
Head Node ◽  
Leach Protocol

Wireless sensor network routing protocol is to prolong the survival time of wireless sensor networks by using the sensor nodes energy efficiently. Traditional LEACH protocol is random in the election of the cluster head, if a less energy node is first elected as a cluster head node, then the node might die soon, it will greatly reducing the lifetime of the network. In order to collect data more efficiently and prolong the network life cycle,we need better clustering protocol. Aim at the traditional LEACH protocol have some weakness,this paper improve the protocol based on traditional LEACH protocol, two influence factors which the residual energy and the number of elected cluster head of the nodes had been introduced to make the clustering more ideal. Simulation results show that compared to the traditional Leach algorithm ,the improved LEACH protocol can prolong the network life cycle more effective and reduce the energy consumption of the whole network.

scholarly journals Distributed Energy Balance Clustering Algorithm in Wireless Sensor Networks

2013 ◽  
Vol 13 (Special-Issue) ◽  
pp. 88-99 ◽  
Author(s):  
Yang Wang
Keyword(s):  
Wireless Sensor Networks ◽  
Sensor Networks ◽  
Energy Balance ◽  
Clustering Algorithm ◽  
Cluster Head ◽  
Residual Energy ◽  
Wireless Sensor ◽  
Distributed Energy ◽  
Cluster Heads ◽  
Distance Relationship

Abstract The traditional clustering algorithm of Low-Energy Adaptive Clustering Hierarchy (LEACH) does not care about the residual energy of the cluster heads and the distance relationship of each node in the wireless sensor networks (WSNs). Each new round the cluster head is changed without any concern about the residual energy of the current cluster head, and the nodes join into a new cluster head without concern about the distance factor and the residual energy factor of all nodes in WSNs. To solve these problems in LEACH, this paper puts forward a distributed energy balance clustering algorithm, which takes into full consideration the residual energy of the cluster heads and the distance relationship between the base station and the cluster heads. The experimental results indicate that the proposed distributed energy balance clustering algorithm can prolong the lifetime of the networks more than LEACH, and the number of messages for selecting a new cluster head at the same time can be greatly reduced, which proves it as more suitable for practical applications.

scholarly journals NEW CLUSTERING SCHEMES FOR WIRELESS SENSOR NETWORKS

2010 ◽  
Vol 11 (1) ◽  
pp. 51-69
Author(s):  
S. M. Mazinani ◽  
J. Chitizadeh ◽  
M. H. Yaghmaee ◽  
M. T. Honary ◽  
F. Tashtarian
Keyword(s):  
Wireless Sensor Networks ◽  
Energy Consumption ◽  
Sensor Networks ◽  
Clustering Algorithm ◽  
Cluster Head ◽  
Residual Energy ◽  
Base Station ◽  
Wireless Sensor ◽  
Cluster Heads ◽  
Clustering Protocol

In this paper, two clustering algorithms are proposed. In the first one, we investigate a clustering protocol for single hop wireless sensor networks that employs a competitive scheme for cluster head selection. The proposed algorithm is named EECS-M that is a modified version to the well known protocol EECS where some of the nodes become volunteers to be cluster heads with an equal probability.  In the competition phase in contrast to EECS using a fixed competition range for any volunteer node, we assign a variable competition range to it that is related to its distance to base station. The volunteer nodes compete in their competition ranges and every one with more residual energy would become cluster head. In the second one, we develop a clustering protocol for single hop wireless sensor networks. In the proposed algorithm some of the nodes become volunteers to be cluster heads. We develop a time based competitive clustering algorithm that the advertising time is based on the volunteer node’s residual energy. We assign to every volunteer node a competition range that may be fixed or variable as a function of distance to BS. The volunteer nodes compete in their competition ranges and every one with more energy would become cluster head. In both proposed algorithms, our objective is to balance the energy consumption of the cluster heads all over the network. Simulation results show the more balanced energy consumption and longer lifetime.

scholarly journals Energy-Efficient Unequal Chain Length Clustering for Wireless Sensor Networks in Smart Cities

2017 ◽  
Vol 2017 ◽  
pp. 1-12 ◽  
Author(s):  
Mohammad Baniata ◽  
Jiman Hong
Keyword(s):  
Wireless Sensor Networks ◽  
Sensor Networks ◽  
Chain Length ◽  
Network Lifetime ◽  
Routing Protocol ◽  
Energy Efficient ◽  
Smart Cities ◽  
Cluster Head ◽  
Sensor Nodes ◽  
Wireless Sensor

The recent advances in sensing and communication technologies such as wireless sensor networks (WSN) have enabled low-priced distributed monitoring systems that are the foundation of smart cities. These advances are also helping to monitor smart cities and making our living environments workable. However, sensor nodes are constrained in energy supply if they have no constant power supply. Moreover, communication links can be easily failed because of unequal node energy depletion. The energy constraints and link failures affect the performance and quality of the sensor network. Therefore, designing a routing protocol that minimizes energy consumption and maximizes the network lifetime should be considered in the design of the routing protocol for WSN. In this paper, we propose an Energy-Efficient Unequal Chain Length Clustering (EEUCLC) protocol which has a suboptimal multihop routing algorithm to reduce the burden on the cluster head and a probability-based cluster head selection algorithm to prolong the network lifetime. Simulation results show that the EEUCLC mechanism enhanced the energy balance and prolonged the network lifetime compared to other related protocols.

An Improved Clustering Algorithm Based on Coverage Area for Wireless Sensor Networks

2012 ◽  
Vol 542-543 ◽  
pp. 643-646
Author(s):  
Li Jun Chen
Keyword(s):  
Wireless Sensor Networks ◽  
Sensor Networks ◽  
Topology Control ◽  
Clustering Algorithm ◽  
Cluster Head ◽  
Wireless Sensor ◽  
Coverage Area ◽  
Control Approach ◽  
Cluster Heads ◽  
Network Scalability

Clustering is an effective topology control approach in wireless sensor networks, which can increase network scalability and lifetime. A clustering algorithm based on the total number of neighbor nodes is proposed to maximize the lifetime of the network. The larger amount of neighbor nodes, the more chance a node has to be selected as a cluster head. Therefore, it can ensure the minimum cluster heads in the whole network. By closing the communication parts of cluster head to avoid selecting as cluster head in next epoch, the energy of the whole system is consumed symmetrically. The simulations demonstrate the effectiveness of the algorithm.

scholarly journals Energy Balance Routing Algorithm Based on Virtual MIMO Scheme for Wireless Sensor Networks

2014 ◽  
Vol 2014 ◽  
pp. 1-7 ◽  
Author(s):  
Jianpo Li ◽  
Xue Jiang ◽  
I-Tai Lu
Keyword(s):  
Wireless Sensor Networks ◽  
Energy Consumption ◽  
Sensor Networks ◽  
Energy Balance ◽  
Network Lifetime ◽  
Routing Algorithm ◽  
Cluster Head ◽  
Wireless Sensor ◽  
Virtual Mimo ◽  
Head Node

Wireless sensor networks are usually energy limited and therefore an energy-efficient routing algorithm is desired for prolonging the network lifetime. In this paper, we propose a new energy balance routing algorithm which has the following three improvements over the conventional LEACH algorithm. Firstly, we propose a new cluster head selection scheme by taking into consideration the remaining energy and the most recent energy consumption of the nodes and the entire network. In this way, the sensor nodes with smaller remaining energy or larger energy consumption will be much less likely to be chosen as cluster heads. Secondly, according to the ratio of remaining energy to distance, cooperative nodes are selected to form virtual MIMO structures. It mitigates the uneven distribution of clusters and the unbalanced energy consumption of the whole network. Thirdly, we construct a comprehensive energy consumption model, which can reflect more realistically the practical energy consumption. Numerical simulations analyze the influences of cooperative node numbers and cluster head node numbers on the network lifetime. It is shown that the energy consumption of the proposed routing algorithm is lower than the conventional LEACH algorithm and for the simulation example the network lifetime is prolonged about 25%.

scholarly journals R-bUCRP: A Novel Reputation-Based Uneven Clustering Routing Protocol for Cognitive Wireless Sensor Networks

2016 ◽  
Vol 2016 ◽  
pp. 1-9
Author(s):  
Mingchuan Zhang ◽  
Ruijuan Zheng ◽  
Ying Li ◽  
Qingtao Wu ◽  
Liang Song
Keyword(s):  
Wireless Sensor Networks ◽  
Sensor Networks ◽  
Routing Protocol ◽  
Cluster Head ◽  
Residual Energy ◽  
Wireless Sensor ◽  
Selfish Nodes ◽  
Simulation Results ◽  
Establishment Phase ◽  
Optimal Cluster

Energy of nodes is an important factor that affects the performance of Wireless Sensor Networks (WSNs), especially in the case of existing selfish nodes, which attracted many researchers’ attention recently. In this paper, we present a reputation-based uneven clustering routing protocol (R-bUCRP) considering both energy saving and reputation assessment. In the cluster establishment phase, we adopt an uneven clustering mechanism which controls the competitive scope of cluster head candidates to save the energy of WSNs. In the cluster heads election phase, the residual energy and reputation value are used as the indexes to select the optimal cluster head, where the reputation mechanism is introduced to support reputation assessment. Simulation results show that the proposed R-bUCRP can save node energy consumption, balance network energy distribution, and prolong network lifetime.

Cluster-to-Cluster Relay Schemes in Wireless Sensor Network

2011 ◽  
Vol 179-180 ◽  
pp. 728-733
Author(s):  
Xue Fen Zhang ◽  
Fang Zhen Li
Keyword(s):  
Wireless Sensor Networks ◽  
Sensor Networks ◽  
Cooperative Communications ◽  
Cluster Head ◽  
Cooperative Transmission ◽  
Wireless Sensor ◽  
Transmission Scheme ◽  
Numerical Examples ◽  
Data Packets ◽  
Head Node

Cooperative communications is a promising technology to improve the performance of wireless sensor networks. To ensure scalability sensor networks are often partitioned into clusters, each managed by a cluster head. most of the previous research focused on the optimal communication of sensors in one cluster, very little attention has been paid to the efficiency of cooperation among the clusters .In this paper, we consider cluster-to-cluster cooperative communications where cluster head node relay data packets to nearby cluster head nodes using cooperative communications, and propose two cooperative transmission scheme and analysis on the throughput and outage probability. Finally, we demonstrate the applicability of our results through numerical examples.

Sign in / Sign up

Export Citation Format

Share Document