An Algorithm of Weighted Monte Carlo Localization Based on Smallest Enclosing Circle

To meet the needs of node mobility of Internet of thing (IOT), a localization algorithm named Weighted Monte Carlo Localization based on Smallest Enclosing Circle is proposed, which is based on the classic Monte Carlo Localization algorithm, aiming to solve the localization problem of mobile nodes. The algorithm uses the hops of anchor nodes and generates the smallest enclosing circle of anchor nodes to assist localizing, thus effectively inhibited the unevenness of anchor nodes caused by the Monte Carlo localization algorithm and reflects impact of the anchor nodes on unknown nodes. The simulation results show that the algorithm effectively reduces the sampling area and the sampling frequency, eventually increase the accuracy of localized nodes.