{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,1,23]],"date-time":"2026-01-23T09:05:25Z","timestamp":1769159125346,"version":"3.49.0"},"reference-count":41,"publisher":"Association for Computing Machinery (ACM)","issue":"1","license":[{"start":{"date-parts":[[2023,10,19]],"date-time":"2023-10-19T00:00:00Z","timestamp":1697673600000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.acm.org\/publications\/policies\/copyright_policy#Background"}],"funder":[{"DOI":"10.13039\/501100001809","name":"National Natural Science Foundation of China","doi-asserted-by":"crossref","award":["61972404, 12071478"],"award-info":[{"award-number":["61972404, 12071478"]}],"id":[{"id":"10.13039\/501100001809","id-type":"DOI","asserted-by":"crossref"}]},{"name":"Public Computing Cloud, Renmin University of China"},{"name":"Blockchain Laboratory"},{"name":"Metaverse Research Center"},{"DOI":"10.13039\/501100004260","name":"Renmin University of China","doi-asserted-by":"crossref","id":[{"id":"10.13039\/501100004260","id-type":"DOI","asserted-by":"crossref"}]}],"content-domain":{"domain":["dl.acm.org"],"crossmark-restriction":true},"short-container-title":["ACM Trans. Sen. Netw."],"published-print":{"date-parts":[[2024,1,31]]},"abstract":"<jats:p>\n            Ranging-based localization is a fundamental problem in the Internet of Things and unmanned aerial vehicle networks. However, the nodes\u2019 limited-ranging scope and users\u2019 broad coverage purpose inevitably cause network sparsity or subnetwork sparsity. The performances of existing localization algorithms are extremely unsatisfactory in sparse networks. A crucial way to deal with the sparsity is to exploit the hidden knowledge provided by the unmeasured edges, which inspires this work to propose a hypothesis-based Joint Edge Inference and Localization algorithm called\n            <jats:italic>InferLoc<\/jats:italic>\n            . InferLoc mines the Unmeasured but Inferable Edges (UIEs). Each UIE is an unmeasured edge, but it is restricted through other edges in the network to be inside a rigid component, so it has only a limited number of possible lengths. We propose an efficient method to detect UIEs and geometric approaches to infer possible lengths for UIEs in 2D and 3D networks. The inferred possible lengths of UIEs are then treated as multiple hypotheses to determine the node locations and the lengths of UIEs simultaneously through a joint graph optimization process. In the joint graph optimization model, to make the 0\/1 decision variables for hypotheses selection differentiable, differentiable functions are proposed to relax the 0\/1 selections, and rounding is applied to select the final length after the optimization converges. We also prove the condition when a UIE can contribute to sparse localization. Extensive experiments show remarkably better accuracy and efficiency performances of InferLoc than the state-of-the-art network localization algorithms. In particular, it reduces the localization errors by more than 90% and speeds up the convergence time more than 100 times than that of the widely used G2O-based methods in sparse networks.\n          <\/jats:p>","DOI":"10.1145\/3608477","type":"journal-article","created":{"date-parts":[[2023,7,12]],"date-time":"2023-07-12T11:46:35Z","timestamp":1689162395000},"page":"1-28","update-policy":"https:\/\/doi.org\/10.1145\/crossmark-policy","source":"Crossref","is-referenced-by-count":3,"title":["InferLoc: Hypothesis-Based Joint Edge Inference and Localization in Sparse Sensor Networks"],"prefix":"10.1145","volume":"20","author":[{"ORCID":"https:\/\/orcid.org\/0000-0001-6113-609X","authenticated-orcid":false,"given":"Xuewei","family":"Bai","sequence":"first","affiliation":[{"name":"Renmin University of China, People\u2019s Republic of China"}]},{"ORCID":"https:\/\/orcid.org\/0000-0002-4197-2258","authenticated-orcid":false,"given":"Yongcai","family":"Wang","sequence":"additional","affiliation":[{"name":"Renmin University of China, People\u2019s Republic of China"}]},{"ORCID":"https:\/\/orcid.org\/0000-0002-7947-7826","authenticated-orcid":false,"given":"Haodi","family":"Ping","sequence":"additional","affiliation":[{"name":"Renmin University of China, People\u2019s Republic of China"}]},{"ORCID":"https:\/\/orcid.org\/0000-0001-9949-9451","authenticated-orcid":false,"given":"Xiaojia","family":"Xu","sequence":"additional","affiliation":[{"name":"Renmin University of China, People\u2019s Republic of China"}]},{"ORCID":"https:\/\/orcid.org\/0000-0002-7748-5427","authenticated-orcid":false,"given":"Deying","family":"Li","sequence":"additional","affiliation":[{"name":"Renmin University of China, People\u2019s Republic of China"}]},{"ORCID":"https:\/\/orcid.org\/0000-0002-6720-1646","authenticated-orcid":false,"given":"Shuo","family":"Wang","sequence":"additional","affiliation":[{"name":"Renmin University of China, People\u2019s Republic of China"}]}],"member":"320","published-online":{"date-parts":[[2023,10,19]]},"reference":[{"key":"e_1_3_2_2_2","doi-asserted-by":"publisher","DOI":"10.1109\/TVT.2020.3017162"},{"key":"e_1_3_2_3_2","doi-asserted-by":"publisher","DOI":"10.1109\/JSAC.2023.3242708"},{"key":"e_1_3_2_4_2","doi-asserted-by":"publisher","DOI":"10.3390\/s23052399"},{"key":"e_1_3_2_5_2","doi-asserted-by":"publisher","DOI":"10.1109\/JSAC.2018.2864374"},{"key":"e_1_3_2_6_2","doi-asserted-by":"publisher","DOI":"10.1109\/INFCOM.2009.5062166"},{"key":"e_1_3_2_7_2","doi-asserted-by":"publisher","DOI":"10.1109\/TAC.2015.2404253"},{"key":"e_1_3_2_8_2","doi-asserted-by":"publisher","DOI":"10.1109\/ICASSP.2009.4960017"},{"key":"e_1_3_2_9_2","doi-asserted-by":"publisher","DOI":"10.1109\/ICRA.2011.5979949"},{"key":"e_1_3_2_10_2","doi-asserted-by":"publisher","DOI":"10.1109\/ICCCN49398.2020.9209620"},{"key":"e_1_3_2_11_2","doi-asserted-by":"publisher","DOI":"10.1145\/3083201.3083206"},{"key":"e_1_3_2_12_2","doi-asserted-by":"publisher","DOI":"10.1109\/TNET.2010.2072965"},{"key":"e_1_3_2_13_2","doi-asserted-by":"publisher","DOI":"10.1109\/TNET.2018.2866597"},{"key":"e_1_3_2_14_2","doi-asserted-by":"publisher","DOI":"10.1145\/1777406.1777414"},{"issue":"4","key":"e_1_3_2_15_2","first-page":"613","article-title":"A survey and evaluation of graph realization algorithms","volume":"46","author":"Sun Tianyuan","year":"2020","unstructured":"Tianyuan Sun, Yongcai Wang, and Deying Li. 2020. A survey and evaluation of graph realization algorithms. Acta Automatica Sinica 46, 4 (2020), 613\u2013630.","journal-title":"Acta Automatica Sinica"},{"key":"e_1_3_2_16_2","doi-asserted-by":"publisher","DOI":"10.1016\/j.adhoc.2011.06.016"},{"key":"e_1_3_2_17_2","doi-asserted-by":"publisher","DOI":"10.1109\/TMC.2011.122"},{"key":"e_1_3_2_18_2","doi-asserted-by":"publisher","DOI":"10.1145\/2240092.2240093"},{"key":"e_1_3_2_19_2","doi-asserted-by":"publisher","DOI":"10.1016\/0012-365X(90)90358-O"},{"key":"e_1_3_2_20_2","article-title":"Avoiding the flip ambiguities in 2D wireless sensor localization by using unit disk graph property","author":"Cagirici Onur","year":"2016","unstructured":"Onur Cagirici. 2016. Avoiding the flip ambiguities in 2D wireless sensor localization by using unit disk graph property. arXiv preprint arXiv:1604.03396 (2016).","journal-title":"arXiv preprint arXiv:1604.03396"},{"key":"e_1_3_2_21_2","doi-asserted-by":"publisher","DOI":"10.1109\/TMC.2020.3015480"},{"key":"e_1_3_2_22_2","doi-asserted-by":"publisher","DOI":"10.1007\/s11276-011-0333-z"},{"key":"e_1_3_2_23_2","doi-asserted-by":"publisher","DOI":"10.1109\/TVT.2010.2040850"},{"key":"e_1_3_2_24_2","doi-asserted-by":"crossref","unstructured":"David Moore John Leonard Daniela Rus and Seth Teller. 2004. Robust distributed network localization with noisy range measurements. In Proceedings of the 2nd International Conference on Embedded Networked Sensor Systems (SenSys\u201904) . 50\u201361.","DOI":"10.1145\/1031495.1031502"},{"key":"e_1_3_2_25_2","doi-asserted-by":"publisher","DOI":"10.1016\/j.jctb.2004.11.002"},{"key":"e_1_3_2_26_2","doi-asserted-by":"publisher","DOI":"10.1109\/TMC.2018.2865462"},{"key":"e_1_3_2_27_2","volume-title":"Improved Robustness of Topology Control and Routing Algorithms for Ad-Hoc Wireless Sensor Networks","author":"Lillis Kevin M.","year":"2008","unstructured":"Kevin M. Lillis. 2008. Improved Robustness of Topology Control and Routing Algorithms for Ad-Hoc Wireless Sensor Networks. The University of Iowa."},{"key":"e_1_3_2_28_2","doi-asserted-by":"publisher","DOI":"10.1007\/s11390-010-9324-2"},{"key":"e_1_3_2_29_2","doi-asserted-by":"publisher","DOI":"10.1109\/SAHCN.2008.16"},{"key":"e_1_3_2_30_2","doi-asserted-by":"publisher","DOI":"10.1109\/ICCCN.2018.8487361"},{"key":"e_1_3_2_31_2","doi-asserted-by":"publisher","DOI":"10.1504\/IJAHUC.2011.041627"},{"key":"e_1_3_2_32_2","doi-asserted-by":"publisher","DOI":"10.1109\/ICT.2014.6845109"},{"key":"e_1_3_2_33_2","doi-asserted-by":"publisher","DOI":"10.1016\/j.jpdc.2016.06.012"},{"key":"e_1_3_2_34_2","doi-asserted-by":"publisher","DOI":"10.1088\/0305-4470\/31\/31\/012"},{"key":"e_1_3_2_35_2","doi-asserted-by":"publisher","DOI":"10.1007\/s00454-004-1124-4"},{"key":"e_1_3_2_36_2","doi-asserted-by":"publisher","DOI":"10.1109\/INFCOM.2004.1354686"},{"key":"e_1_3_2_37_2","doi-asserted-by":"publisher","DOI":"10.1109\/INFCOM.2005.1497902"},{"key":"e_1_3_2_38_2","doi-asserted-by":"publisher","DOI":"10.1006\/jcph.1997.5809"},{"key":"e_1_3_2_39_2","doi-asserted-by":"publisher","DOI":"10.1137\/0202012"},{"key":"e_1_3_2_40_2","doi-asserted-by":"publisher","DOI":"10.1109\/ICDE.2019.00014"},{"key":"e_1_3_2_41_2","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-319-67361-5_40"},{"key":"e_1_3_2_42_2","unstructured":"Jan De Leeuw. 2005. Applications of Convex Analysis to Multidimensional Scaling . University of California Los Angeles."}],"container-title":["ACM Transactions on Sensor Networks"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/3608477","content-type":"unspecified","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/dl.acm.org\/doi\/pdf\/10.1145\/3608477","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,6,18]],"date-time":"2025-06-18T22:29:45Z","timestamp":1750285785000},"score":1,"resource":{"primary":{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/3608477"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2023,10,19]]},"references-count":41,"journal-issue":{"issue":"1","published-print":{"date-parts":[[2024,1,31]]}},"alternative-id":["10.1145\/3608477"],"URL":"https:\/\/doi.org\/10.1145\/3608477","relation":{},"ISSN":["1550-4859","1550-4867"],"issn-type":[{"value":"1550-4859","type":"print"},{"value":"1550-4867","type":"electronic"}],"subject":[],"published":{"date-parts":[[2023,10,19]]},"assertion":[{"value":"2022-11-06","order":0,"name":"received","label":"Received","group":{"name":"publication_history","label":"Publication History"}},{"value":"2023-06-20","order":1,"name":"accepted","label":"Accepted","group":{"name":"publication_history","label":"Publication History"}},{"value":"2023-10-19","order":2,"name":"published","label":"Published","group":{"name":"publication_history","label":"Publication History"}}]}}