{"id":"https://openalex.org/W2078718813","doi":"https://doi.org/10.1109/icc.2014.6883311","title":"Multihop range-free localization with approximate shortest path in anisotropic networks","display_name":"Multihop range-free localization with approximate shortest path in anisotropic networks","publication_year":2014,"publication_date":"2014-06-01","ids":{"openalex":"https://openalex.org/W2078718813","doi":"https://doi.org/10.1109/icc.2014.6883311","mag":"2078718813"},"language":"en","primary_location":{"id":"doi:10.1109/icc.2014.6883311","is_oa":false,"landing_page_url":"https://doi.org/10.1109/icc.2014.6883311","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"2014 IEEE International Conference on Communications (ICC)","raw_type":"proceedings-article"},"type":"article","indexed_in":["crossref"],"open_access":{"is_oa":false,"oa_status":"closed","oa_url":null,"any_repository_has_fulltext":false},"authorships":[{"author_position":"first","author":{"id":"https://openalex.org/A5100436186","display_name":"Sang\u2010Woo Lee","orcid":"https://orcid.org/0000-0002-0642-5064"},"institutions":[{"id":"https://openalex.org/I4575257","display_name":"Hanyang University","ror":"https://ror.org/046865y68","country_code":"KR","type":"education","lineage":["https://openalex.org/I4575257"]}],"countries":["KR"],"is_corresponding":true,"raw_author_name":"Sangwoo Lee","raw_affiliation_strings":["Department of Electronics and Computer Engineering, Hanyang University, Seoul, Korea","[Dept. of Electron. & Comput. Eng., Hanyang Univ., Seoul, South Korea]"],"affiliations":[{"raw_affiliation_string":"Department of Electronics and Computer Engineering, Hanyang University, Seoul, Korea","institution_ids":["https://openalex.org/I4575257"]},{"raw_affiliation_string":"[Dept. of Electron. & Comput. Eng., Hanyang Univ., Seoul, South Korea]","institution_ids":["https://openalex.org/I4575257"]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5105365056","display_name":"Jaehoon Choi","orcid":null},"institutions":[{"id":"https://openalex.org/I4575257","display_name":"Hanyang University","ror":"https://ror.org/046865y68","country_code":"KR","type":"education","lineage":["https://openalex.org/I4575257"]}],"countries":["KR"],"is_corresponding":false,"raw_author_name":"Jaehoon Choi","raw_affiliation_strings":["Department of Electronics and Computer Engineering, Hanyang University, Seoul, Korea","[Dept. of Electron. & Comput. Eng., Hanyang Univ., Seoul, South Korea]"],"affiliations":[{"raw_affiliation_string":"Department of Electronics and Computer Engineering, Hanyang University, Seoul, Korea","institution_ids":["https://openalex.org/I4575257"]},{"raw_affiliation_string":"[Dept. of Electron. & Comput. Eng., Hanyang Univ., Seoul, South Korea]","institution_ids":["https://openalex.org/I4575257"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5100733417","display_name":"Sunwoo Kim","orcid":"https://orcid.org/0000-0002-7055-6587"},"institutions":[{"id":"https://openalex.org/I4575257","display_name":"Hanyang University","ror":"https://ror.org/046865y68","country_code":"KR","type":"education","lineage":["https://openalex.org/I4575257"]}],"countries":["KR"],"is_corresponding":false,"raw_author_name":"Sunwoo Kim","raw_affiliation_strings":["Department of Electronics and Computer Engineering, Hanyang University, Seoul, Korea","[Dept. of Electron. & Comput. Eng., Hanyang Univ., Seoul, South Korea]"],"affiliations":[{"raw_affiliation_string":"Department of Electronics and Computer Engineering, Hanyang University, Seoul, Korea","institution_ids":["https://openalex.org/I4575257"]},{"raw_affiliation_string":"[Dept. of Electron. & Comput. Eng., Hanyang Univ., Seoul, South Korea]","institution_ids":["https://openalex.org/I4575257"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":3,"corresponding_author_ids":["https://openalex.org/A5100436186"],"corresponding_institution_ids":["https://openalex.org/I4575257"],"apc_list":null,"apc_paid":null,"fwci":0.0,"has_fulltext":false,"cited_by_count":0,"citation_normalized_percentile":{"value":0.11918706,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":null,"biblio":{"volume":null,"issue":null,"first_page":"154","last_page":"159"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T10326","display_name":"Indoor and Outdoor Localization Technologies","score":1.0,"subfield":{"id":"https://openalex.org/subfields/2208","display_name":"Electrical and Electronic Engineering"},"field":{"id":"https://openalex.org/fields/22","display_name":"Engineering"},"domain":{"id":"https://openalex.org/domains/3","display_name":"Physical Sciences"}},"topics":[{"id":"https://openalex.org/T10326","display_name":"Indoor and Outdoor Localization Technologies","score":1.0,"subfield":{"id":"https://openalex.org/subfields/2208","display_name":"Electrical and Electronic Engineering"},"field":{"id":"https://openalex.org/fields/22","display_name":"Engineering"},"domain":{"id":"https://openalex.org/domains/3","display_name":"Physical Sciences"}},{"id":"https://openalex.org/T11192","display_name":"Underwater Vehicles and Communication Systems","score":0.9988999962806702,"subfield":{"id":"https://openalex.org/subfields/2212","display_name":"Ocean Engineering"},"field":{"id":"https://openalex.org/fields/22","display_name":"Engineering"},"domain":{"id":"https://openalex.org/domains/3","display_name":"Physical Sciences"}},{"id":"https://openalex.org/T10080","display_name":"Energy Efficient Wireless Sensor Networks","score":0.9947999715805054,"subfield":{"id":"https://openalex.org/subfields/1705","display_name":"Computer Networks and Communications"},"field":{"id":"https://openalex.org/fields/17","display_name":"Computer Science"},"domain":{"id":"https://openalex.org/domains/3","display_name":"Physical Sciences"}}],"keywords":[{"id":"https://openalex.org/keywords/shortest-path-problem","display_name":"Shortest path problem","score":0.8075990676879883},{"id":"https://openalex.org/keywords/euclidean-shortest-path","display_name":"Euclidean shortest path","score":0.6704694032669067},{"id":"https://openalex.org/keywords/range","display_name":"Range (aeronautics)","score":0.6346200704574585},{"id":"https://openalex.org/keywords/euclidean-distance","display_name":"Euclidean distance","score":0.5766246318817139},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.5600806474685669},{"id":"https://openalex.org/keywords/path","display_name":"Path (computing)","score":0.5357818603515625},{"id":"https://openalex.org/keywords/node","display_name":"Node (physics)","score":0.4995579719543457},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.49424484372138977},{"id":"https://openalex.org/keywords/constrained-shortest-path-first","display_name":"Constrained Shortest Path First","score":0.435740202665329},{"id":"https://openalex.org/keywords/average-path-length","display_name":"Average path length","score":0.42812785506248474},{"id":"https://openalex.org/keywords/shortest-path-faster-algorithm","display_name":"Shortest Path Faster Algorithm","score":0.42129093408584595},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.3651650547981262},{"id":"https://openalex.org/keywords/k-shortest-path-routing","display_name":"K shortest path routing","score":0.3570171892642975},{"id":"https://openalex.org/keywords/topology","display_name":"Topology (electrical circuits)","score":0.3378550410270691},{"id":"https://openalex.org/keywords/mathematical-optimization","display_name":"Mathematical optimization","score":0.3221712112426758},{"id":"https://openalex.org/keywords/artificial-intelligence","display_name":"Artificial intelligence","score":0.214376300573349},{"id":"https://openalex.org/keywords/theoretical-computer-science","display_name":"Theoretical computer science","score":0.1726515293121338},{"id":"https://openalex.org/keywords/combinatorics","display_name":"Combinatorics","score":0.12587708234786987},{"id":"https://openalex.org/keywords/computer-network","display_name":"Computer network","score":0.09734949469566345},{"id":"https://openalex.org/keywords/physics","display_name":"Physics","score":0.07473242282867432},{"id":"https://openalex.org/keywords/engineering","display_name":"Engineering","score":0.06973478198051453}],"concepts":[{"id":"https://openalex.org/C22590252","wikidata":"https://www.wikidata.org/wiki/Q1058754","display_name":"Shortest path problem","level":3,"score":0.8075990676879883},{"id":"https://openalex.org/C170836113","wikidata":"https://www.wikidata.org/wiki/Q5406126","display_name":"Euclidean shortest path","level":5,"score":0.6704694032669067},{"id":"https://openalex.org/C204323151","wikidata":"https://www.wikidata.org/wiki/Q905424","display_name":"Range (aeronautics)","level":2,"score":0.6346200704574585},{"id":"https://openalex.org/C120174047","wikidata":"https://www.wikidata.org/wiki/Q847073","display_name":"Euclidean distance","level":2,"score":0.5766246318817139},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.5600806474685669},{"id":"https://openalex.org/C2777735758","wikidata":"https://www.wikidata.org/wiki/Q817765","display_name":"Path (computing)","level":2,"score":0.5357818603515625},{"id":"https://openalex.org/C62611344","wikidata":"https://www.wikidata.org/wiki/Q1062658","display_name":"Node (physics)","level":2,"score":0.4995579719543457},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.49424484372138977},{"id":"https://openalex.org/C178067994","wikidata":"https://www.wikidata.org/wiki/Q1128278","display_name":"Constrained Shortest Path First","level":5,"score":0.435740202665329},{"id":"https://openalex.org/C91886571","wikidata":"https://www.wikidata.org/wiki/Q432520","display_name":"Average path length","level":4,"score":0.42812785506248474},{"id":"https://openalex.org/C168451585","wikidata":"https://www.wikidata.org/wiki/Q7502159","display_name":"Shortest Path Faster Algorithm","level":5,"score":0.42129093408584595},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.3651650547981262},{"id":"https://openalex.org/C70266271","wikidata":"https://www.wikidata.org/wiki/Q6343044","display_name":"K shortest path routing","level":4,"score":0.3570171892642975},{"id":"https://openalex.org/C184720557","wikidata":"https://www.wikidata.org/wiki/Q7825049","display_name":"Topology (electrical circuits)","level":2,"score":0.3378550410270691},{"id":"https://openalex.org/C126255220","wikidata":"https://www.wikidata.org/wiki/Q141495","display_name":"Mathematical optimization","level":1,"score":0.3221712112426758},{"id":"https://openalex.org/C154945302","wikidata":"https://www.wikidata.org/wiki/Q11660","display_name":"Artificial intelligence","level":1,"score":0.214376300573349},{"id":"https://openalex.org/C80444323","wikidata":"https://www.wikidata.org/wiki/Q2878974","display_name":"Theoretical computer science","level":1,"score":0.1726515293121338},{"id":"https://openalex.org/C114614502","wikidata":"https://www.wikidata.org/wiki/Q76592","display_name":"Combinatorics","level":1,"score":0.12587708234786987},{"id":"https://openalex.org/C31258907","wikidata":"https://www.wikidata.org/wiki/Q1301371","display_name":"Computer network","level":1,"score":0.09734949469566345},{"id":"https://openalex.org/C121332964","wikidata":"https://www.wikidata.org/wiki/Q413","display_name":"Physics","level":0,"score":0.07473242282867432},{"id":"https://openalex.org/C127413603","wikidata":"https://www.wikidata.org/wiki/Q11023","display_name":"Engineering","level":0,"score":0.06973478198051453},{"id":"https://openalex.org/C146978453","wikidata":"https://www.wikidata.org/wiki/Q3798668","display_name":"Aerospace engineering","level":1,"score":0.0},{"id":"https://openalex.org/C132525143","wikidata":"https://www.wikidata.org/wiki/Q141488","display_name":"Graph","level":2,"score":0.0},{"id":"https://openalex.org/C62520636","wikidata":"https://www.wikidata.org/wiki/Q944","display_name":"Quantum mechanics","level":1,"score":0.0}],"mesh":[],"locations_count":1,"locations":[{"id":"doi:10.1109/icc.2014.6883311","is_oa":false,"landing_page_url":"https://doi.org/10.1109/icc.2014.6883311","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"2014 IEEE International Conference on Communications (ICC)","raw_type":"proceedings-article"}],"best_oa_location":null,"sustainable_development_goals":[],"awards":[],"funders":[],"has_content":{"pdf":false,"grobid_xml":false},"content_urls":null,"referenced_works_count":14,"referenced_works":["https://openalex.org/W609322199","https://openalex.org/W2052627089","https://openalex.org/W2090743253","https://openalex.org/W2100796177","https://openalex.org/W2101804784","https://openalex.org/W2103496751","https://openalex.org/W2104782624","https://openalex.org/W2118900483","https://openalex.org/W2119362555","https://openalex.org/W2149259182","https://openalex.org/W2154020241","https://openalex.org/W2158528164","https://openalex.org/W2170207829","https://openalex.org/W6663682837"],"related_works":["https://openalex.org/W2156431668","https://openalex.org/W2161960576","https://openalex.org/W2357391150","https://openalex.org/W2366342492","https://openalex.org/W2018146256","https://openalex.org/W2030169809","https://openalex.org/W2347831319","https://openalex.org/W2388051136","https://openalex.org/W1992129517","https://openalex.org/W2370345607"],"abstract_inverted_index":{"This":[0],"paper":[1],"presents":[2],"a":[3,13,39],"multihop":[4],"range-free":[5,82,105],"localization":[6,83,94,106],"algorithm":[7,87],"that":[8],"tolerates":[9],"network":[10],"anisotropy":[11],"with":[12],"small":[14],"number":[15],"of":[16,38,71,74],"anchors.":[17],"A":[18,42],"detoured":[19],"path":[20,53,57],"detection":[21],"is":[22,47],"proposed":[23,86],"which":[24],"measures":[25],"the":[26,29,33,51,56,69,72,75,85],"deviation":[27,58],"in":[28,96],"hop":[30],"count":[31],"between":[32],"direct":[34],"and":[35,59],"shortest":[36,52,77],"paths":[37],"node":[40],"pair.":[41],"novel":[43],"distance":[44,64],"estimation":[45],"method":[46],"introduced":[48],"to":[49,60,80],"approximate":[50,76],"based":[54],"on":[55],"estimate":[61],"their":[62],"Euclidean":[63],"by":[65],"taking":[66],"into":[67],"account":[68],"extent":[70],"detour":[73],"path.":[78],"Compared":[79],"other":[81],"algorithms,":[84],"requires":[88],"fewer":[89],"anchors":[90],"while":[91],"achieving":[92],"higher":[93],"accuracy":[95],"anisotropic":[97],"networks.":[98],"We":[99],"demonstrated":[100],"its":[101],"superiority":[102],"over":[103],"existing":[104],"algorithms":[107],"through":[108],"extensive":[109],"computer":[110],"simulations.":[111]},"counts_by_year":[],"updated_date":"2025-11-06T03:46:38.306776","created_date":"2025-10-10T00:00:00"}