Range-Free Location Estimation Algorithms for Wireless Networks

In this paper, we describe a suite of new range-free location estimation algorithms. With these algorithms, a blindfolded node is first located within some probable regions by comparing the measured received signal strength between nodes. Then the location of the blindfolded node is narrowed down by overlapping all the probable regions. Finally the geographic center of the overlapped region is calculated as the location estimate of the blindfolded node. Location estimation accuracy can be further improved when a blindfolded node that has already been located serves as additional reference node to determine the positions of other blindfolded nodes within its communication range. When compared with other range-free algorithms, results show improved location estimation accuracy with similar or less computation complexity.