Determining whether nodes can be uniquely localized, called localizability detection, is a concomitant problem of network localization. Localizability under traditional Non-Linear Localization (NLL) schema has been well explored, whereas localizability under the emerging Barycentric coordinate-based Linear Localization (BLL) schema has not been well touched. In this paper, we investigate the deficiency of existing localizability theories and algorithms in BLL, and then propose a necessary condition and a sufficient condition for BLL node localizability. Based on these two conditions, an efficient iterative maximum flow (IMF) algorithm is designed to identify BLL localizable nodes. Finally, our algorithms are validated by both theoretical analysis and experimental evaluations.

翻译：确定节点是否具有独特的局部性,称为可定位性探测,是网络本地化的一个附带问题。传统的非本地化非本地化(NLL)模式下的本地化已经得到了很好的探索,而新出现的巴里中心协调基于线性线性定位(BLL)模式下的本地化则尚未被很好地触及。在本文中,我们调查了现有本地化理论和算法在BLL中的缺陷,然后提出了BLL节点可本地化的必要条件和充分的条件。根据这两个条件,设计了一个高效的迭代最大流动(IMF)算法,以确定BLL可本地化节点。最后,我们的算法得到了理论分析和实验性评估的验证。