WSN Clustering Routing Algorithm Combining Sine Cosine Algorithm and Lévy Mutation

Directed against the disadvantages of relatively short life-cycle and unbalanced energy utilization among nodes in WSN, a clustering routing algorithm combining sine cosine algorithm and Lévy mutation is developed. During the cluster head election stage, the amount of cluster heads is dynamically ca...

Full description

Saved in:
Bibliographic Details
Published in:IEEE access Vol. 11; pp. 22654 - 22663
Main Authors: Guo, Xiaoling, Ye, Yongfei, Li, Ling, Wu, Renjie, Sun, Xinghua
Format: Journal Article
Language:English
Published: Piscataway IEEE 2023
The Institute of Electrical and Electronics Engineers, Inc. (IEEE)
Subjects:
Algorithms
Clustering
Clustering algorithm
Clustering algorithms
Data communication
Data transmission
Elections
energy balance
Energy utilization
Fitness
Heuristic algorithms
Hierarchies
life cycle
Lévy mutation
Mutation
Nodes
Relays
Routing
sine cosine algorithm
Trigonometric functions
Voting
Wireless sensor networks
WSN
ISSN:2169-3536, 2169-3536
Online Access:Get full text
Tags: Add Tag
No Tags, Be the first to tag this record!
Description
Summary:Directed against the disadvantages of relatively short life-cycle and unbalanced energy utilization among nodes in WSN, a clustering routing algorithm combining sine cosine algorithm and Lévy mutation is developed. During the cluster head election stage, the amount of cluster heads is dynamically calculated according to the surviving nodes for keeping it at a reasonable value; taking full account of the current energy of nodes, only nodes with high energy can be candidate cluster heads; the fitness function is constructed according to intra-cluster distance, so that the distribution structure within the cluster are relatively uniform; the Sine Cosine Algorithm with improved step size search factor is used for cluster head election, and Lévy mutation is introduced to realize the variation of population. The group of individuals with the lowest fitness function value is used as final election scheme for current round. In the data transmission phase, for the sake of avoiding long-distance transmission, the relay node is designed to forward data. The proposed algorithm effectively extends network life-cycle and well equalizes the load of network nodes.
Bibliography:ObjectType-Article-1
SourceType-Scholarly Journals-1
ObjectType-Feature-2
content type line 14
ISSN:2169-3536
2169-3536
DOI:10.1109/ACCESS.2023.3252027