scholarly journals Multiple layers uneven clustering algorithm based on residual energy for wireless sensor networks

2018 ◽  
Vol 2018 (16) ◽  
pp. 1555-1560
Author(s):  
Jing Liu ◽  
Shoubao Su ◽  
Yuhua Lu ◽  
Jun Dong
Keyword(s):  
Wireless Sensor Networks ◽  
Sensor Networks ◽  
Clustering Algorithm ◽  
Residual Energy ◽  
Wireless Sensor

A Clustering Algorithm for Wireless Sensor Networks Basing on Distance and Distribution

2011 ◽  
Vol 474-476 ◽  
pp. 1221-1227
Author(s):  
Ying Liao ◽  
Wei Xu Hao
Keyword(s):  
Wireless Sensor Networks ◽  
Sensor Networks ◽  
Network Topology ◽  
Clustering Algorithm ◽  
Clustering Algorithms ◽  
Residual Energy ◽  
Sensor Nodes ◽  
Wireless Sensor ◽  
Hierarchical Network ◽  
The Common

Wireless sensor networks (WSNs) detect and monitor the outside physical state by the sensor nodes organizing automatically. Utilizing clustering algorithm to form hierarchical network topology is the common method which implements managing network and aggregating data in WSNs. Different from the previous clustering algorithms, this article proposes a clustering algorithm for WSNs based on distance and distribution to generate clusters considering residual energy of nods in WSNs with inhomogeneous distribution. The simulation result indicates that the algorithm can establish more balanceable clustering structure effectively and enhance the network life cycle obviously.<b></b>

scholarly journals Clustering Algorithm of Wireless Sensor Networks Based on Residual Energy

2012 ◽  
Vol 6-7 ◽  
pp. 831-835
Author(s):  
Chang Lin Ma ◽  
Yuan Ruan
Keyword(s):  
Energy Efficiency ◽  
Wireless Sensor Networks ◽  
Sensor Networks ◽  
Clustering Algorithm ◽  
Residual Energy ◽  
Sensor Nodes ◽  
Wireless Sensor ◽  
Energy Factor ◽  
Leach Protocol ◽  
Limited Power

In order to improve the lifetime and throughput of wireless sensor networks under the limited power, an improved clustering algorithm is proposed in this paper on the basis of LEACH protocol. The energy factor is considered in this algorithm. The residual energy of all sensor nodes is referred to select cluster-heads of wireless sensor networks. The new clustering algorithm effectively improves the energy efficiency, throughput and lifetime of wireless sensor networks. The results are proved by simulations.

scholarly journals An Efficient Mobile Data Gathering Method with Tree Clustering Algorithm in Wireless Sensor Networks Balanced and Unbalanced Topologies

2021 ◽  
Author(s):  
Meriem MEDDAH ◽  
Rim HADDAD ◽  
Tahar EZZEDDINE
Keyword(s):  
Wireless Sensor Networks ◽  
Energy Consumption ◽  
Sensor Networks ◽  
Clustering Algorithm ◽  
Residual Energy ◽  
Sensor Nodes ◽  
Wireless Sensor ◽  
Mobile Data ◽  
Data Collector ◽  
Mobile Data Collector

Abstract Mobile Data Collector device (MDC) is adopted to reduce the energy consumption in Wireless Sensor Networks. This device travels the network in order to gather the collected data from sensor nodes. This paper presents a new Tree Clustering algorithm with Mobile Data Collector in Wireless Sensor Networks, which establishes the shortest travelling path passing throw a subset of Cluster Heads (CH). To select CHs, we adopt a competitive scheme, and the best sensor nodes are elected according to the number of packets forwarded between sensor nodes, the number of hops to the tree’s root, the residual energy, and the distance between the node and the closest CH. In simulation results, we adopt the balanced and unbalanced topologies and prove the efficiently of our proposed algorithm considering the network lifetime, the fairness index and the energy consumption in comparison with the existing mobile data collection algorithms.

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.

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 A New Clustering Routing Protocol for Homogeneous Wireless Sensor Networks Powered by Renewable Energy Sources

2020 ◽  
Vol 21 (4) ◽  
pp. 637-648
Author(s):  
Chirine Bassil ◽  
Hussein EL GHOR ◽  
Jawad Khalife ◽  
Nizar Hamadeh
Keyword(s):  
Wireless Sensor Networks ◽  
Sensor Networks ◽  
Energy Harvesting ◽  
Routing Protocol ◽  
Clustering Algorithm ◽  
Renewable Energy Sources ◽  
Residual Energy ◽  
Wireless Sensor ◽  
Distributed Clustering ◽  
Great Progress

The technology of wireless sensor networks (WSNs) is in constant development and it made great progress in many applications. One of the most popular problems in WSNs is the limited energy storage power at every sensor node. This paper aims to propose and develop a new distributed clustering algorithm for energy harvesting wireless sensor networks denoted by DEH-WSN (Energy Harvesting for Distributed Clustering Wireless Sensor Networks Protocol) that relies on matching between clustering and energy harvesting in a distributed topology. DEH-WSN uses initial and residual energy capacity of the nodes to choose cluster heads. Simulation results prove that the proposed method increases network lifetime and the effective throughput.

Sign in / Sign up

Export Citation Format

Share Document