A Greedy Heuristic Based Beacons Selection for Localization

摘要

Wi-Fi based localization technology is a hot issue in recent indoor localization research. Due to the exist of obstacles and signal fluctuation in indoor environment, RSSI measurements from beacons are often noisy. To solve this problem, this paper first proposes a greedy heuristic algorithm to choose optimal beacons involved in localization. During the localization process, the reference points in the area covered by the selected beacons form triangles. The gravity centers of the triangles jointly determine the target's location. Finally, a comprehensive set of simulations are provided to invalidate the performance of the proposed algorithm.