Abstract

Aiming at high network energy consumption and data delay induced by mobile sink in wireless sensor networks (WSNs), this paper proposes a cluster-based energy optimization algorithm called Cluster-Based Energy Optimization with Mobile Sink (CEOMS). CEOMS algorithm constructs the energy density function of network nodes firstly and then assigns sensor nodes with higher remaining energy as cluster heads according to energy density function. Meanwhile, the directivity motion performance function of mobile sink is constructed to enhance the probability of remote sensor nodes being assigned as cluster heads. Secondly, based on Low Energy Adaptive Clustering Hierarchy Protocol (LEACH) architecture, the energy density function and the motion performance function are introduced into the cluster head selection process to avoid random assignment of cluster head. Finally, an adaptive adjustment function is designed to improve the adaptability of cluster head selection by percentage of network nodes death and the density of all surviving nodes of the entire network. The simulation results show that the proposed CEOMS algorithm improves the cluster head selection self-adaptability, extends the network life, reduces the data delay, and balances the network load.

Highlights

  • Wireless Sensor Networks (WSNs) are composed of thousands of sensor nodes, which are characterized by small size, low cost and low power consumption

  • This paper used some indicators including survival time of network nodes, total remaining energy, and the balance of network energy consumption to verify the feasibility and effectiveness of the proposed Cluster-Based Energy Optimization with Mobile Sink (CEOMS) algorithm by comparative experiment related to some algorithms such as the improved LEACH protocol (ILEACH) algorithm [23], Distance Based Cluster Head (DBCH) algorithm [24] and Low Energy Adaptive Clustering Hierarchy Protocol (LEACH)-DT

  • Some factors including remaining energy and density within the neighborhood radius of sensor nodes, the location and velocity of mobile sink and the number of dead nodes may impact on energy balance of WSNs

Read more

Summary

Introduction

Wireless Sensor Networks (WSNs) are composed of thousands of sensor nodes, which are characterized by small size, low cost and low power consumption. Since nodes with limited energy nearby the static sink node may be assigned as cluster head frequently, leading to high energy consumption of those nodes, may cause premature death of those sensor nodes. The Low Energy Adaptive Clustering Hierarchy Protocol (LEACH) proposed by Heinzelman et al [14,15] is the most classic hierarchical routing algorithm. This algorithm divided network nodes into different clusters firstly, and used periodically replacing cluster heads to balance network Energy consumption, leading to network life cycle prolongation. A Hybrid, Energy-Efficient, Distributed Clustering Approach (HEED) [16], A Stable Election Protocol for Clustered (SEP) [17], and LEACH-Centralized (LEACH-C) [18] have been proposed to reduce energy consumption, balance network resources, and extend the network life cycle

Related Work
Contributions
Paper Organization
Network Model
Motion Model of Mobile Sink
CEOMS Algorithm
Construction of Sensor Node Neighborhood Set
Construction of Energy Density Function
Construction of Motion Performance Function
Data Transmission
Construction of Adaptive Adjustment Function Based on Node Death Percentage
Experimental Parameters
Simulation Results and Analysis
Survival Time Analysis of Network Nodes
Analysis of Total Remaining Energy of Nodes
Comparative Analysis of Remaining Energy Distribution of Network Nodes
Analysis of Variance of Nodes Remaining Energy
Applicability Analysis of Network Lifetime
Conclusions
Full Text
Published version (Free)

Talk to us

Join us for a 30 min session where you can share your feedback and ask us any queries you have

Schedule a call