Research On Node Location Algorithm Of Wireless Sensor Network Based On RSSI

Wireless sensor networks(WSNs)is widely used in people’s real life due to its low cost and strong adaptability.The fields involved in WSNs include military strike,medical construction,smart transportation management,and smart home furnishings.WSNs includes many important technologies,including node localization technology,data fusion technology,and time synchronization technology.Among them,node localization technology is the key technology of WSNs.In most WSNs applications,if specific node location information cannot be obtained,other information obtained will be meaningless.RSSI-based wireless sensor networks node localization algorithm has become the focus of research from all walks of life due to its low cost and good flexibility.However,due to the existence of unfavorable factors such as noise and obstacles,the accuracy is low.Therefore,the main content of this thesis is to improve the accuracy of the node localization algorithm based on RSSI-based wireless sensor networks.The research content is as follows:Firstly,based on the existing literature,the architecture,characteristics,application scenarios,and key technologies of the wireless sensor network are introduced,and the node localization technology of WSNS has elaborated in detail.The relevant performance evaluation indicators of the node localization algorithm are introduced.Secondly,in order to solve the problem of a single-choice strategy in the classic trilateral localization algorithm,this article proposes a trilateral localization algorithm based on the reference geometry of reference triangle(GRT).This algorithm combines the reference geometry of reference triangle and point in triangle(PIT)criteria in the anchor node selection stage to eliminate the geometry shape within the communication range of the unknown node and the combination of anchor nodes that are relatively poor with the unknown nodes,and then uses the screening node to be measured by trilateration to obtain an estimated coordinate of the unknown nodes in the n group,and then the average absolute distance difference between the unknown node estimation coordinate of the unknown node of the group of n is calculated to get the coordinates of the unknown node,compared to classic trilateral localization algorithms and GRT trilateral localization algorithms,it improves localization accuracy and efficiency.Thirdly,the traditional centroid localization algorithm usually uses the combination of anchor nodes in the unknown node communication range to form polygon,and uses its quality heart as an estimated coordinate.In the actual localization environment,if an unknown node is located in the position area of the positioning border or the area formed by anchor nodes is too large,it will lead to the lower accuracy of the centroid localization.Therefore,in response to the above unfavorable situation,this article proposes the iterative centroid estimation localization algorithm based on the improved remora optimization algorithms.The core idea of the improved localization algorithm is using the Min-Max algorithm to reduce the localization area,and then using iterative idea to further reduce the Min-Max localization area,and finally using the improved remora optimization algorithm to calculate the location of the unknown node,compared to the classic Min Max algorithm,ICE algorithm,and CPSCFO algorithm,it improves positioning accuracy.