3D WSN clustering routing algorithm based on IHBA optimized fuzzy C-means

Aiming at the problem that clustering routing algorithm in a three-dimensional (3D) scene has high energy consumption and short network lifetime, a clustering routing algorithm IFCRA for 3D wireless sensor networks based on improved honey badger algorithm optimized fuzzy C-means was proposed.The net...

Full description

Saved in:
Bibliographic Details
Main Authors: Jing YANG, Biyang XU, Weizheng LI, Wei LI, Zhaoqiang ZHU, Tao QIN
Format: Article
Language:zho
Published: Editorial Department of Journal on Communications 2023-12-01
Series:Tongxin xuebao
Subjects:
Online Access:http://www.joconline.com.cn/zh/article/doi/10.11959/j.issn.1000-436x.2023236/
Tags: Add Tag
No Tags, Be the first to tag this record!
Description
Summary:Aiming at the problem that clustering routing algorithm in a three-dimensional (3D) scene has high energy consumption and short network lifetime, a clustering routing algorithm IFCRA for 3D wireless sensor networks based on improved honey badger algorithm optimized fuzzy C-means was proposed.The network clustering, cluster head election, and data transmission stages were optimized respectively.Firstly, the improved honey badger algorithm was used to optimize the fuzzy C-means algorithm, solving the problem of fuzzy C-means easily falling into local optima, and the topological structure was divided based on the distance and energy characteristics of nodes.Secondly, the optimal cluster head function was constructed by combining the energy and relative distance of nodes within the cluster to balance the cluster head load.Finally, an adaptive transmission mechanism was used to search for relay nodes, and the optimal transmission path function was constructed by combining node distance and energy.The improved honey badger algorithm was used to optimize the data transmission energy consumption.Simulation results show that IFCRA has reasonable clustering, balanced energy consumption, and long lifespan in a 3D heterogeneous scene.
ISSN:1000-436X