{"id":"https://openalex.org/W7134190505","doi":"https://doi.org/10.1016/j.jpdc.2026.105254","title":"Optimal landmark placement in cluster-based networks","display_name":"Optimal landmark placement in cluster-based networks","publication_year":2026,"publication_date":"2026-03-08","ids":{"openalex":"https://openalex.org/W7134190505","doi":"https://doi.org/10.1016/j.jpdc.2026.105254"},"language":"en","primary_location":{"id":"doi:10.1016/j.jpdc.2026.105254","is_oa":true,"landing_page_url":"https://doi.org/10.1016/j.jpdc.2026.105254","pdf_url":null,"source":{"id":"https://openalex.org/S157146593","display_name":"Journal of Parallel and Distributed Computing","issn_l":"0743-7315","issn":["0743-7315","1096-0848"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310320990","host_organization_name":"Elsevier BV","host_organization_lineage":["https://openalex.org/P4310320990"],"host_organization_lineage_names":["Elsevier BV"],"type":"journal"},"license":"cc-by","license_id":"https://openalex.org/licenses/cc-by","version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Journal of Parallel and Distributed Computing","raw_type":"journal-article"},"type":"article","indexed_in":["crossref"],"open_access":{"is_oa":true,"oa_status":"hybrid","oa_url":"https://doi.org/10.1016/j.jpdc.2026.105254","any_repository_has_fulltext":true},"authorships":[{"author_position":"first","author":{"id":"https://openalex.org/A5039225561","display_name":"Akbar Davoodi","orcid":"https://orcid.org/0000-0001-6403-5091"},"institutions":[],"countries":[],"is_corresponding":false,"raw_author_name":"Akbar Davoodi","raw_affiliation_strings":[],"raw_orcid":"https://orcid.org/0000-0001-6403-5091","affiliations":[]},{"author_position":"last","author":{"id":"https://openalex.org/A5023307368","display_name":"Mohsen Jannesari","orcid":null},"institutions":[],"countries":[],"is_corresponding":false,"raw_author_name":"Mohsen Jannesari","raw_affiliation_strings":[],"raw_orcid":"https://orcid.org/0000-0002-4178-6973","affiliations":[]}],"institutions":[],"countries_distinct_count":0,"institutions_distinct_count":0,"corresponding_author_ids":[],"corresponding_institution_ids":[],"apc_list":{"value":3250,"currency":"USD","value_usd":3250},"apc_paid":{"value":3250,"currency":"USD","value_usd":3250},"fwci":0.0,"has_fulltext":false,"cited_by_count":0,"citation_normalized_percentile":{"value":0.22175312,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":null,"biblio":{"volume":"212","issue":null,"first_page":"105254","last_page":"105254"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T10064","display_name":"Complex Network Analysis Techniques","score":0.3276999890804291,"subfield":{"id":"https://openalex.org/subfields/3109","display_name":"Statistical and Nonlinear Physics"},"field":{"id":"https://openalex.org/fields/31","display_name":"Physics and Astronomy"},"domain":{"id":"https://openalex.org/domains/3","display_name":"Physical Sciences"}},"topics":[{"id":"https://openalex.org/T10064","display_name":"Complex Network Analysis Techniques","score":0.3276999890804291,"subfield":{"id":"https://openalex.org/subfields/3109","display_name":"Statistical and Nonlinear Physics"},"field":{"id":"https://openalex.org/fields/31","display_name":"Physics and Astronomy"},"domain":{"id":"https://openalex.org/domains/3","display_name":"Physical Sciences"}},{"id":"https://openalex.org/T10720","display_name":"Complexity and Algorithms in Graphs","score":0.1266999989748001,"subfield":{"id":"https://openalex.org/subfields/1703","display_name":"Computational Theory and Mathematics"},"field":{"id":"https://openalex.org/fields/17","display_name":"Computer Science"},"domain":{"id":"https://openalex.org/domains/3","display_name":"Physical Sciences"}},{"id":"https://openalex.org/T11502","display_name":"Facility Location and Emergency Management","score":0.05869999900460243,"subfield":{"id":"https://openalex.org/subfields/1407","display_name":"Organizational Behavior and Human Resource Management"},"field":{"id":"https://openalex.org/fields/14","display_name":"Business, Management and Accounting"},"domain":{"id":"https://openalex.org/domains/2","display_name":"Social Sciences"}}],"keywords":[{"id":"https://openalex.org/keywords/landmark","display_name":"Landmark","score":0.744700014591217},{"id":"https://openalex.org/keywords/key","display_name":"Key (lock)","score":0.24979999661445618},{"id":"https://openalex.org/keywords/field","display_name":"Field (mathematics)","score":0.24230000376701355},{"id":"https://openalex.org/keywords/artificial-neural-network","display_name":"Artificial neural network","score":0.24089999496936798}],"concepts":[{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.8237000107765198},{"id":"https://openalex.org/C2780297707","wikidata":"https://www.wikidata.org/wiki/Q4895393","display_name":"Landmark","level":2,"score":0.744700014591217},{"id":"https://openalex.org/C154945302","wikidata":"https://www.wikidata.org/wiki/Q11660","display_name":"Artificial intelligence","level":1,"score":0.40849998593330383},{"id":"https://openalex.org/C31972630","wikidata":"https://www.wikidata.org/wiki/Q844240","display_name":"Computer vision","level":1,"score":0.35019999742507935},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.3183000087738037},{"id":"https://openalex.org/C79403827","wikidata":"https://www.wikidata.org/wiki/Q3988","display_name":"Real-time computing","level":1,"score":0.2890999913215637},{"id":"https://openalex.org/C26517878","wikidata":"https://www.wikidata.org/wiki/Q228039","display_name":"Key (lock)","level":2,"score":0.24979999661445618},{"id":"https://openalex.org/C9652623","wikidata":"https://www.wikidata.org/wiki/Q190109","display_name":"Field (mathematics)","level":2,"score":0.24230000376701355},{"id":"https://openalex.org/C50644808","wikidata":"https://www.wikidata.org/wiki/Q192776","display_name":"Artificial neural network","level":2,"score":0.24089999496936798},{"id":"https://openalex.org/C121684516","wikidata":"https://www.wikidata.org/wiki/Q7600677","display_name":"Computer graphics (images)","level":1,"score":0.2401999980211258}],"mesh":[],"locations_count":2,"locations":[{"id":"doi:10.1016/j.jpdc.2026.105254","is_oa":true,"landing_page_url":"https://doi.org/10.1016/j.jpdc.2026.105254","pdf_url":null,"source":{"id":"https://openalex.org/S157146593","display_name":"Journal of Parallel and Distributed Computing","issn_l":"0743-7315","issn":["0743-7315","1096-0848"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310320990","host_organization_name":"Elsevier BV","host_organization_lineage":["https://openalex.org/P4310320990"],"host_organization_lineage_names":["Elsevier BV"],"type":"journal"},"license":"cc-by","license_id":"https://openalex.org/licenses/cc-by","version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Journal of Parallel and Distributed Computing","raw_type":"journal-article"},{"id":"pmh:oai:sdu.dk:openaire/4c1933bb-edde-4e04-8628-1cd0aa967c54","is_oa":true,"landing_page_url":"https://portal.findresearcher.sdu.dk/da/publications/4c1933bb-edde-4e04-8628-1cd0aa967c54","pdf_url":null,"source":{"id":"https://openalex.org/S4306400423","display_name":"University of Southern Denmark Research Portal (University of Southern Denmark)","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"host_organization":"https://openalex.org/I177969490","host_organization_name":"University of Southern Denmark","host_organization_lineage":["https://openalex.org/I177969490"],"host_organization_lineage_names":[],"type":"repository"},"license":"cc-by","license_id":"https://openalex.org/licenses/cc-by","version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Davoodi, A & Jannesari, M 2026, 'Optimal landmark placement in cluster-based networks', Journal of Parallel and Distributed Computing, vol. 212, 105254. https://doi.org/10.1016/j.jpdc.2026.105254","raw_type":"info:eu-repo/semantics/article"}],"best_oa_location":{"id":"doi:10.1016/j.jpdc.2026.105254","is_oa":true,"landing_page_url":"https://doi.org/10.1016/j.jpdc.2026.105254","pdf_url":null,"source":{"id":"https://openalex.org/S157146593","display_name":"Journal of Parallel and Distributed Computing","issn_l":"0743-7315","issn":["0743-7315","1096-0848"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310320990","host_organization_name":"Elsevier BV","host_organization_lineage":["https://openalex.org/P4310320990"],"host_organization_lineage_names":["Elsevier BV"],"type":"journal"},"license":"cc-by","license_id":"https://openalex.org/licenses/cc-by","version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Journal of Parallel and Distributed Computing","raw_type":"journal-article"},"sustainable_development_goals":[],"awards":[],"funders":[{"id":"https://openalex.org/F4320325957","display_name":"Novo Nordisk Fonden","ror":"https://ror.org/04txyc737"}],"has_content":{"pdf":false,"grobid_xml":false},"content_urls":null,"referenced_works_count":37,"referenced_works":["https://openalex.org/W1968927530","https://openalex.org/W1973911938","https://openalex.org/W2005275654","https://openalex.org/W2019020998","https://openalex.org/W2019825609","https://openalex.org/W2023570253","https://openalex.org/W2026014023","https://openalex.org/W2037298352","https://openalex.org/W2045744171","https://openalex.org/W2048592031","https://openalex.org/W2073490544","https://openalex.org/W2074389465","https://openalex.org/W2103905945","https://openalex.org/W2105232761","https://openalex.org/W2106474670","https://openalex.org/W2108442028","https://openalex.org/W2119307154","https://openalex.org/W2124637492","https://openalex.org/W2125005237","https://openalex.org/W2126308485","https://openalex.org/W2142530712","https://openalex.org/W2895230703","https://openalex.org/W2963394749","https://openalex.org/W2963621023","https://openalex.org/W2963925192","https://openalex.org/W2964035583","https://openalex.org/W2980945783","https://openalex.org/W3000103272","https://openalex.org/W3106492650","https://openalex.org/W3158015396","https://openalex.org/W4392898200","https://openalex.org/W4394013015","https://openalex.org/W4403165802","https://openalex.org/W4404056577","https://openalex.org/W4405439589","https://openalex.org/W4405861568","https://openalex.org/W4412105881"],"related_works":[],"abstract_inverted_index":{"Modern":[0],"network":[1,250],"architectures,":[2],"such":[3,29,140],"as":[4,88],"wireless":[5,253],"sensor":[6,254],"networks":[7,31,255],"and":[8,66,112,152,178,232,242,257,260,264,274],"cluster-based":[9],"communication":[10],"systems,":[11],"demand":[12],"a":[13,47,61,72,100,167,233],"seamless":[14],"integration":[15],"of":[16,104,122,136,175,226],"robust":[17],"local":[18,57,244],"connectivity":[19],"with":[20,55,199,268],"reliable":[21],"global":[22],"interconnectivity.":[23],"In":[24,79,191],"this":[25,80],"paper,":[26],"we":[27,143,165,205,222],"model":[28],"layered":[30],"via":[32],"the":[33,51,67,119,133,160,187,194,207],"Cartesian":[34],"product":[35],"Fm\u25a1Kn.":[36,283],"The":[37],"friendship":[38],"graph":[39,63,69],"Fm,":[40],"formed":[41],"by":[42,170,282],"joining":[43],"m":[44],"triangles":[45],"at":[46],"common":[48],"vertex,":[49],"captures":[50],"localized,":[52],"hub-and-spoke":[53],"clustering":[54],"enhanced":[56],"interconnectivity,":[58],"beyond":[59],"what":[60],"star":[62],"can":[64],"offer,":[65],"complete":[68],"Kn":[70],"represents":[71],"uniformly":[73],"interconnected":[74],"backbone":[75,240,258,279],"linking":[76],"these":[77],"clusters.":[78],"setting,":[81],"landmarks":[82],"(or":[83],"resolving":[84,137],"sets)":[85],"are":[86,215],"crucial":[87],"they":[89],"uniquely":[90],"identify":[91],"every":[92],"node":[93],"based":[94],"solely":[95],"on":[96,271],"its":[97],"distances":[98],"to":[99],"carefully":[101],"chosen":[102],"subset":[103],"reference":[105],"nodes,":[106],"thereby":[107,128],"facilitating":[108],"efficient":[109],"routing,":[110],"localization,":[111],"fault":[113],"detection.We":[114],"establish":[115],"exact":[116,208],"values":[117],"for":[118,124,139,193,277],"metric":[120,176,189,227],"dimension":[121],"Fm\u25a1Kn":[123],"any":[125],"parameter":[126,219],"regime,":[127],"providing":[129],"direct":[130],"insights":[131],"into":[132],"optimal":[134],"selection":[135],"sets":[138],"architectures.":[141],"Specifically,":[142],"prove":[144],"that":[145,237],"if":[146,153],"(Formula":[147,150,154,157,163,197,210],"presented),":[148,151,155,164,198],"then":[149,156,179],"presented).":[158],"For":[159],"intermediate":[161,195],"case,":[162],"develop":[166],"refined":[168],"analysis":[169],"first":[171],"deriving":[172],"structural":[173],"properties":[174],"bases":[177,228],"formulating":[180],"an":[181],"optimization":[182],"problem":[183],"whose":[184],"solution":[185],"yields":[186],"desired":[188],"dimension.":[190],"particular,":[192],"regime":[196],"(m,":[200],"n)":[201],"\u2260":[202],"(3,":[203],"4),":[204],"obtain":[206],"value":[209],"presented)":[211],".All":[212],"our":[213],"proofs":[214],"constructive":[216],"across":[217],"all":[218,230],"regimes.":[220],"Moreover,":[221],"give":[223],"linear-time":[224],"constructions":[225],"in":[229],"regimes":[231],"backbone-assisted":[234],"distributed":[235],"rollout":[236],"uses":[238],"O(n)":[239],"messages":[241],"O(|W|)":[243],"notifications.":[245],"These":[246],"results":[247],"support":[248],"layered/clustered":[249],"designs,":[251],"including":[252],"(WSNs)":[256],"topologies,":[259],"provide":[261],"explicit":[262],"formulas":[263],"minimal-landmark":[265],"constructions,":[266],"together":[267],"corresponding":[269],"bounds":[270],"control":[272],"traffic":[273],"per-node":[275],"state,":[276],"clustered":[278],"architectures":[280],"modeled":[281]},"counts_by_year":[],"updated_date":"2026-08-21T09:56:20.448147","created_date":"2026-03-09T00:00:00"}