Node localization algorithm for wireless sensor networks based on static anchor node location selection strategy

To better solve the contradiction between the localization accuracy, localization coverage, and the location of anchor nodes in wireless sensor networks, a node localization algorithm for wireless sensor networks based on static anchor node location selection strategy is proposed in this paper. Firstly, collect the signal strength between wireless sensor network nodes, judge whether there is a connection between nodes according to the set signal strength threshold, and convert the node distribution diagram into the node connection relationship diagram, that is, the topology diagram. Then, the closeness centrality value of each node is calculated by using the closeness centrality algorithm, and the obtained closeness centrality values are sorted in descending order, the node with the largest closeness centrality value is the first anchor node, the closeness centrality values are traversed at equal intervals, and the optimal equal interval is selected by using the quick sort algorithm, and the selected nodes are used as the other anchor nodes. Finally, other unknown nodes in the network are located according to the location of anchor nodes. Simulation results show that the proposed algorithm is superior to the existing typical algorithms in localization accuracy and localization coverage.