| Summary: | Min-Max algorithm was widely used as a simple received signal strength (RSS-) based algorithm for indoor localization due to its easy implementation. However, the original Min-Max algorithm only achieves coarse estimation in which the target node (TN) is regarded as the geometric centroid of the area of interest determined by measured RSS values. Although extended Min-Max (E-Min-Max) methods using weighted centroid instead of geometric centroid were recently proposed to cope with this problem, the improvement in the localization accuracy is still limited. In this paper, an improved Min-Max algorithm with area partition strategy (Min-Max-APS) is proposed to achieve better localization performance. In the proposed algorithm, the area of interest is first partitioned into four subareas, each of which contains a vertex of the original area of interest. Moreover, a minimum range difference criterion is designed to determine the target affiliated subarea whose vertex is “closest” to the target node. Then the target node’s location is estimated as the weighted centroid of the target affiliated subarea. Since the target affiliated subarea is smaller than the original area of interest, the weighted centroid of the target affiliated subarea will be more accurate than that of the original area of interest. Simulation results show that the localization error (LE) of the proposed Min-Max-APS algorithm can drop below 0.16 meters, which is less than one-half of that of the E-Min-Max algorithm, and is also less than one-seventh of that of the original Min-Max algorithm. Moreover, for the proposed Min-Max-APS, 90% of the LE are smaller than 0.38 meters, while the same percentage of the LE are as high as 0.49 meters for the E-Min-Max and 1.12 meters for the original Min-Max, respectively.
|
|---|
