US 11,800,425 B2
WSN clustering routing method based on optimization with salp swarm algorithm
Xingcheng Liu, Guangzhou (CN); and Qiang Tu, Guangzhou (CN)
Assigned to Sun Yat-sen University, Guangzhou (CN)
Filed by Sun Yat-sen University, Guangzhou (CN)
Filed on Dec. 31, 2021, as Appl. No. 17/566,735.
Claims priority of application No. 202110169675.9 (CN), filed on Feb. 7, 2021.
Prior Publication US 2022/0256431 A1, Aug. 11, 2022
Int. Cl. H04W 40/02 (2009.01); H04L 45/122 (2022.01); H04L 45/42 (2022.01); H04L 45/48 (2022.01); G06F 18/2323 (2023.01)
CPC H04W 40/02 (2013.01) [G06F 18/2323 (2023.01); H04L 45/122 (2013.01); H04L 45/42 (2013.01); H04L 45/48 (2013.01)] 9 Claims
OG exemplary drawing
 
1. A wireless sensor network (WSN) clustering routing method based on optimization with salp swarm algorithm, comprising the following steps:
S1: constructing an objective function by comprehensively considering factors as follows: node residual energy, a distance between cluster head nodes, a distance between a cluster member node and a cluster head node, a distance from a node to a base station, and a number of cluster head nodes;
S2: solving the objective function by using a salp swarm algorithm, to find an optimal clustering scheme, and thus dividing the WSN into non-uniform clusters, wherein in each cluster, the cluster member node sends data to the cluster head node in a single-hop manner;
S3: constructing a minimum spanning tree with the base station as a root node by using a routing utility function ƒ(CHi);
S4: sending, by the cluster head node, data to the base station in a single-hop and multi-hop combined manner through routing organized by the minimum spanning tree.