A Cluster Heads Selection Algorithm of Wireless Sensor Network Based on Cluster Notes Number

2021 ◽  
pp. 1250-1259
Author(s):  
Jing Liu ◽  
Shoubao Su
Keyword(s):  
Wireless Sensor Network ◽  
Sensor Network ◽  
Wireless Sensor ◽  
Selection Algorithm ◽  
Cluster Heads

scholarly journals Estimation of Optimum Rendezvous Point for Mobile Sink (ORP-MS) in WSN

2018 ◽  
Vol 7 (3.12) ◽  
pp. 1322 ◽  
Author(s):  
Vrince Vimal ◽  
Madhav J Nigam
Keyword(s):  
Energy Efficiency ◽  
Wireless Sensor Network ◽  
Sensor Network ◽  
High Throughput ◽  
Mobile Sink ◽  
Base Station ◽  
Wireless Sensor ◽  
Cluster Heads ◽  
Rendezvous Point ◽  
Coverage Holes

Clustering of the sensors in wireless sensor network is done to achieve energy efficiency. The nodes, which are unable to join any cluster, are referred to as isolated nodes and tend to transfer information straight to the base station. It is palpable that isolated nodes and cluster heads communicate with the base station and tend to exhaust their energy leaving behind coverage holes. In this paper, we propose the innovative clustering scheme using mobile sink approach to extend networks lifetime. The proposed (ORP-MS) algorithm is implemented in MATLAB 2017a and the results revealed that the proposed algorithm outdid the existing algorithms in terms networks lifetime and energy efficiency simultaneously achieved high throughput.  

scholarly journals An Enhanced Clustering Method for Extending Sensing Lifetime of Wireless Sensor Network

2021 ◽  
pp. 67-82
Author(s):  
Yakubu Abdul-Wahab Nawusu ◽  
Alhassan Abdul-Barik ◽  
Salifu Abdul-Mumin
Keyword(s):  
Wireless Sensor Network ◽  
Sensor Network ◽  
Network Performance ◽  
Rank Order ◽  
Cluster Head ◽  
Residual Energy ◽  
Base Station ◽  
Wireless Sensor ◽  
Cluster Heads ◽  
Heterogeneous Wireless Sensor Network

Extending the lifetime of a wireless sensor network is vital in ensuring continuous monitoring functions in a target environment. Many techniques have appeared that seek to achieve such prolonged sensing gains. Clustering and improved selection of cluster heads play essential roles in the performance of sensor network functions. Cluster head in a hierarchical arrangement is responsible for transmitting aggregated data from member nodes to a base station for further user-specific data processing and analysis. Minimising the quick dissipation of cluster heads energy requires a careful choice of network factors when selecting a cluster head to prolong the lifetime of a wireless sensor network. In this work, we propose a multi-criteria cluster head selection technique to extend the sensing lifetime of a heterogeneous wireless sensor network. The proposed protocol incorporates residual energy, distance, and node density in selecting a cluster head. Each factor is assigned a weight using the Rank Order Centroid based on its relative importance. Several simulation tests using MATLAB 7.5.0 (R2007b) reveal improved network lifetime and other network performance indicators, including stability and throughput, compared with popular protocols such as LEACH and the SEP. The proposed scheme will be beneficial in applications requiring reliable and stable data sensing and transmission functions.

scholarly journals A Cross Unequal Clustering Routing Algorithm for Sensor Network

2013 ◽  
Vol 13 (4) ◽  
pp. 200-205 ◽  
Author(s):  
Wang Tong ◽  
Wu Jiyi ◽  
Xu He ◽  
Zhu Jinghua ◽  
Charles Munyabugingo
Keyword(s):  
Energy Consumption ◽  
Wireless Sensor Network ◽  
Energy Loss ◽  
Sensor Network ◽  
Routing Algorithm ◽  
High Energy ◽  
Wireless Sensor ◽  
Unequal Clustering ◽  
Long Distance ◽  
Cluster Heads

In the routing protocol for wireless sensor network, the cluster size is generally fixed in clustering routing algorithm for wireless sensor network, which can easily lead to the “hot spot” problem. Furthermore, the majority of routing algorithms barely consider the problem of long distance communication between adjacent cluster heads that brings high energy consumption. Therefore, this paper proposes a new cross unequal clustering routing algorithm based on the EEUC algorithm. In order to solve the defects of EEUC algorithm, this algorithm calculating of competition radius takes the node’s position and node’s remaining energy into account to make the load of cluster heads more balanced. At the same time, cluster adjacent node is applied to transport data and reduce the energy-loss of cluster heads. Simulation experiments show that, compared with LEACH and EEUC, the proposed algorithm can effectively reduce the energy-loss of cluster heads and balance the energy consumption among all nodes in the network and improve the network lifetime

A Distributed and Local-World Topology Evolution Model for Wireless Sensor Network

2015 ◽  
Vol 7 (2) ◽  
pp. 45-55
Author(s):  
Changlun Zhang ◽  
Chao Li ◽  
Haibing Mu
Keyword(s):  
Wireless Sensor Network ◽  
Sensor Network ◽  
Power Law ◽  
Degree Distribution ◽  
Fixed Number ◽  
Evolution Model ◽  
Wireless Sensor ◽  
Distribution Analysis ◽  
Cluster Heads ◽  
Law Degree

In this paper, a new evolution model based on complex network among the cluster heads in wireless sensor network is proposed. The evolution model considered distributed and local-world mechanism during the evolving process. The theoretical analysis of this model exhibits a power-law degree distribution with mean-field theory, which provides good fault-tolerance. The degree exponent is not a fixed number, which changes with the distribution of the cluster heads and the energy as well as the communication radius. Furthermore, the degree exponent can lead to an upper limit -2 when the distribution of the cluster heads and the energy are both uniform distribution. Analysis and simulation show that the network exhibits well robustness and a power-law degree distribution.

Sign in / Sign up

Export Citation Format

Share Document