Computer Science > Networking and Internet Architecture
[Submitted on 14 Feb 2021 (v1), last revised 8 Oct 2021 (this version, v3)]
Title:IMF: Iterative Max-Flow for Node Localizability Detection in Barycentric Linear Localization
View PDFAbstract: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.
Submission history
From: Haodi Ping [view email][v1] Sun, 14 Feb 2021 08:23:41 UTC (199 KB)
[v2] Thu, 29 Jul 2021 09:19:18 UTC (2,106 KB)
[v3] Fri, 8 Oct 2021 02:06:56 UTC (2,106 KB)
References & Citations
Bibliographic and Citation Tools
Bibliographic Explorer (What is the Explorer?)
Litmaps (What is Litmaps?)
scite Smart Citations (What are Smart Citations?)
Code, Data and Media Associated with this Article
CatalyzeX Code Finder for Papers (What is CatalyzeX?)
DagsHub (What is DagsHub?)
Gotit.pub (What is GotitPub?)
Papers with Code (What is Papers with Code?)
ScienceCast (What is ScienceCast?)
Demos
Recommenders and Search Tools
Influence Flower (What are Influence Flowers?)
Connected Papers (What is Connected Papers?)
CORE Recommender (What is CORE?)
arXivLabs: experimental projects with community collaborators
arXivLabs is a framework that allows collaborators to develop and share new arXiv features directly on our website.
Both individuals and organizations that work with arXivLabs have embraced and accepted our values of openness, community, excellence, and user data privacy. arXiv is committed to these values and only works with partners that adhere to them.
Have an idea for a project that will add value for arXiv's community? Learn more about arXivLabs.