Location information is one of the basic elements of the Internet of Things (IoT), which is also an important research direction in the application of wireless sensor networks (WSNs). Aiming at addressing the TOA positioning problem in the low anchor node density deployment environment, the traditional cooperative localization method will reduce the positioning accuracy due to excessive redundant information. In this regard, this paper proposes a location source optimization algorithm based on fuzzy comprehensive evaluation. First, each node calculates its own time-position distribute conditional posterior Cramer-Rao lower bound (DCPCRLB) and transfers it to neighbor nodes. Then collect the DCPCRLB, distance measurement, azimuth angle and other information from neighboring nodes to form a fuzzy evaluation factor set and determine the final preferred location source after fuzzy change. The simulation results show that the method proposed in this paper has better positioning accuracy about 33.9% with the compared method in low anchor node density scenarios when the computational complexity is comparable.

Localization estimation and clock synchronization are important research directions in the application of wireless sensor networks. Aiming at the problems of low positioning accuracy and slow convergence speed in localization estimation methods based on message passing, this paper proposes a low-complexity distributed cooperative joint estimation method suitable for dynamic networks called multi-Gaussian variational message passing (M-VMP). The proposed method constrains the message to be a multi-Gaussian function superposition form to reduce the information loss in the variational message passing algorithm (VMP). Only the mean, covariance and weight of each message need to be transmitted in the network, which reduces the computational complexity while ensuring the information completeness. The simulation results show that the proposed method is superior to the VMP algorithm in terms of position accuracy and convergence speed and is close to the sum-product algorithm over a wireless network (SPAWN) based on non-parametric belief propagation, but the computational complexity and communication load are significantly reduced.