{"id":"https://openalex.org/W2759815009","doi":"https://doi.org/10.1504/ijssc.2017.10008018","title":"Leader election and computation of a spanning tree in dynamic distributed networks using local computations and mobile agents","display_name":"Leader election and computation of a spanning tree in dynamic distributed networks using local computations and mobile agents","publication_year":2017,"publication_date":"2017-01-01","ids":{"openalex":"https://openalex.org/W2759815009","doi":"https://doi.org/10.1504/ijssc.2017.10008018","mag":"2759815009"},"language":"en","primary_location":{"id":"doi:10.1504/ijssc.2017.10008018","is_oa":false,"landing_page_url":"https://doi.org/10.1504/ijssc.2017.10008018","pdf_url":null,"source":{"id":"https://openalex.org/S2764966908","display_name":"International Journal of Space-Based and Situated Computing","issn_l":"2044-4893","issn":["2044-4893","2044-4907"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":null,"host_organization_name":null,"host_organization_lineage":[],"host_organization_lineage_names":[],"type":"journal"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"International Journal of Space-Based and Situated Computing","raw_type":"journal-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/A5085852000","display_name":"Mouna Ktari","orcid":"https://orcid.org/0000-0001-7100-2271"},"institutions":[{"id":"https://openalex.org/I142899784","display_name":"University of Sfax","ror":"https://ror.org/04d4sd432","country_code":"TN","type":"education","lineage":["https://openalex.org/I142899784"]}],"countries":["TN"],"is_corresponding":false,"raw_author_name":"Mouna Ktari","raw_affiliation_strings":["ReDCAD Laboratory, University of Sfax, FSEGS 3018 Sfax, Tunisia"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"ReDCAD Laboratory, University of Sfax, FSEGS 3018 Sfax, Tunisia","institution_ids":["https://openalex.org/I142899784"]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5067540221","display_name":"Mohamed Mosbah","orcid":"https://orcid.org/0000-0001-6031-4237"},"institutions":[{"id":"https://openalex.org/I1294671590","display_name":"Centre National de la Recherche Scientifique","ror":"https://ror.org/02feahw73","country_code":"FR","type":"government","lineage":["https://openalex.org/I1294671590"]},{"id":"https://openalex.org/I15057530","display_name":"Universit\u00e9 de Bordeaux","ror":"https://ror.org/057qpr032","country_code":"FR","type":"education","lineage":["https://openalex.org/I15057530"]},{"id":"https://openalex.org/I4210142254","display_name":"Laboratoire Bordelais de Recherche en Informatique","ror":"https://ror.org/03adqg323","country_code":"FR","type":"facility","lineage":["https://openalex.org/I1294671590","https://openalex.org/I1294671590","https://openalex.org/I15057530","https://openalex.org/I4210142254","https://openalex.org/I4210159245","https://openalex.org/I4210160189"]},{"id":"https://openalex.org/I4210160189","display_name":"Institut Polytechnique de Bordeaux","ror":"https://ror.org/054qv7y42","country_code":"FR","type":"education","lineage":["https://openalex.org/I4210160189"]}],"countries":["FR"],"is_corresponding":false,"raw_author_name":"Mohamed Mosbah","raw_affiliation_strings":["LaBRI Laboratory, CNRS, Bordeaux INP, University of Bordeaux, F-33405 Talence, France"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"LaBRI Laboratory, CNRS, Bordeaux INP, University of Bordeaux, F-33405 Talence, France","institution_ids":["https://openalex.org/I1294671590","https://openalex.org/I15057530","https://openalex.org/I4210142254","https://openalex.org/I4210160189"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5017872312","display_name":"Hadj Kacem Ahmed","orcid":null},"institutions":[{"id":"https://openalex.org/I142899784","display_name":"University of Sfax","ror":"https://ror.org/04d4sd432","country_code":"TN","type":"education","lineage":["https://openalex.org/I142899784"]}],"countries":["TN"],"is_corresponding":false,"raw_author_name":"Hadj Kacem Ahmed","raw_affiliation_strings":["ReDCAD Laboratory, University of Sfax, FSEGS 3018 Sfax, Tunisia"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"ReDCAD Laboratory, University of Sfax, FSEGS 3018 Sfax, Tunisia","institution_ids":["https://openalex.org/I142899784"]}]}],"institutions":[],"countries_distinct_count":2,"institutions_distinct_count":5,"corresponding_author_ids":[],"corresponding_institution_ids":[],"apc_list":null,"apc_paid":null,"fwci":0.9804,"has_fulltext":false,"cited_by_count":5,"citation_normalized_percentile":{"value":0.81538315,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":{"min":89,"max":98},"biblio":{"volume":"7","issue":"2","first_page":"57","last_page":"57"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T10742","display_name":"Peer-to-Peer Network Technologies","score":0.996399998664856,"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"}},"topics":[{"id":"https://openalex.org/T10742","display_name":"Peer-to-Peer Network Technologies","score":0.996399998664856,"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"}},{"id":"https://openalex.org/T10772","display_name":"Distributed systems and fault tolerance","score":0.9958999752998352,"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"}},{"id":"https://openalex.org/T12203","display_name":"Mobile Agent-Based Network Management","score":0.9940999746322632,"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/correctness","display_name":"Correctness","score":0.8095874190330505},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.7564306259155273},{"id":"https://openalex.org/keywords/computation","display_name":"Computation","score":0.711513340473175},{"id":"https://openalex.org/keywords/distributed-minimum-spanning-tree","display_name":"Distributed minimum spanning tree","score":0.7063955664634705},{"id":"https://openalex.org/keywords/distributed-algorithm","display_name":"Distributed algorithm","score":0.6965867280960083},{"id":"https://openalex.org/keywords/leader-election","display_name":"Leader election","score":0.6889029145240784},{"id":"https://openalex.org/keywords/spanning-tree","display_name":"Spanning tree","score":0.6381568312644958},{"id":"https://openalex.org/keywords/rewriting","display_name":"Rewriting","score":0.6168195009231567},{"id":"https://openalex.org/keywords/distributed-computing","display_name":"Distributed computing","score":0.58537358045578},{"id":"https://openalex.org/keywords/theoretical-computer-science","display_name":"Theoretical computer science","score":0.5356302857398987},{"id":"https://openalex.org/keywords/graph","display_name":"Graph","score":0.5125546455383301},{"id":"https://openalex.org/keywords/tree","display_name":"Tree (set theory)","score":0.4869581162929535},{"id":"https://openalex.org/keywords/minimum-spanning-tree","display_name":"Minimum spanning tree","score":0.4095362424850464},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.30216601490974426},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.16301476955413818},{"id":"https://openalex.org/keywords/discrete-mathematics","display_name":"Discrete mathematics","score":0.08431100845336914}],"concepts":[{"id":"https://openalex.org/C55439883","wikidata":"https://www.wikidata.org/wiki/Q360812","display_name":"Correctness","level":2,"score":0.8095874190330505},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.7564306259155273},{"id":"https://openalex.org/C45374587","wikidata":"https://www.wikidata.org/wiki/Q12525525","display_name":"Computation","level":2,"score":0.711513340473175},{"id":"https://openalex.org/C65949645","wikidata":"https://www.wikidata.org/wiki/Q5283163","display_name":"Distributed minimum spanning tree","level":3,"score":0.7063955664634705},{"id":"https://openalex.org/C130120984","wikidata":"https://www.wikidata.org/wiki/Q2835898","display_name":"Distributed algorithm","level":2,"score":0.6965867280960083},{"id":"https://openalex.org/C53480672","wikidata":"https://www.wikidata.org/wiki/Q1424189","display_name":"Leader election","level":2,"score":0.6889029145240784},{"id":"https://openalex.org/C64331007","wikidata":"https://www.wikidata.org/wiki/Q831672","display_name":"Spanning tree","level":2,"score":0.6381568312644958},{"id":"https://openalex.org/C154690210","wikidata":"https://www.wikidata.org/wiki/Q1668499","display_name":"Rewriting","level":2,"score":0.6168195009231567},{"id":"https://openalex.org/C120314980","wikidata":"https://www.wikidata.org/wiki/Q180634","display_name":"Distributed computing","level":1,"score":0.58537358045578},{"id":"https://openalex.org/C80444323","wikidata":"https://www.wikidata.org/wiki/Q2878974","display_name":"Theoretical computer science","level":1,"score":0.5356302857398987},{"id":"https://openalex.org/C132525143","wikidata":"https://www.wikidata.org/wiki/Q141488","display_name":"Graph","level":2,"score":0.5125546455383301},{"id":"https://openalex.org/C113174947","wikidata":"https://www.wikidata.org/wiki/Q2859736","display_name":"Tree (set theory)","level":2,"score":0.4869581162929535},{"id":"https://openalex.org/C13743678","wikidata":"https://www.wikidata.org/wiki/Q240464","display_name":"Minimum spanning tree","level":2,"score":0.4095362424850464},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.30216601490974426},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.16301476955413818},{"id":"https://openalex.org/C118615104","wikidata":"https://www.wikidata.org/wiki/Q121416","display_name":"Discrete mathematics","level":1,"score":0.08431100845336914},{"id":"https://openalex.org/C134306372","wikidata":"https://www.wikidata.org/wiki/Q7754","display_name":"Mathematical analysis","level":1,"score":0.0},{"id":"https://openalex.org/C199360897","wikidata":"https://www.wikidata.org/wiki/Q9143","display_name":"Programming language","level":1,"score":0.0}],"mesh":[],"locations_count":1,"locations":[{"id":"doi:10.1504/ijssc.2017.10008018","is_oa":false,"landing_page_url":"https://doi.org/10.1504/ijssc.2017.10008018","pdf_url":null,"source":{"id":"https://openalex.org/S2764966908","display_name":"International Journal of Space-Based and Situated Computing","issn_l":"2044-4893","issn":["2044-4893","2044-4907"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":null,"host_organization_name":null,"host_organization_lineage":[],"host_organization_lineage_names":[],"type":"journal"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"International Journal of Space-Based and Situated Computing","raw_type":"journal-article"}],"best_oa_location":null,"sustainable_development_goals":[],"awards":[],"funders":[],"has_content":{"grobid_xml":false,"pdf":false},"content_urls":null,"referenced_works_count":0,"referenced_works":[],"related_works":["https://openalex.org/W2418231958","https://openalex.org/W2099915933","https://openalex.org/W2381121915","https://openalex.org/W4380840098","https://openalex.org/W2390742649","https://openalex.org/W2387385213","https://openalex.org/W1703428550","https://openalex.org/W2360026231","https://openalex.org/W8653221","https://openalex.org/W4297934114"],"abstract_inverted_index":{"Leader":[0],"election":[1],"problem":[2],"is":[3,154],"among":[4],"the":[5,18,77,87,90,97,102,142,145],"important":[6],"problems":[7],"in":[8,108,123,128],"distributed":[9,15,19,40,112],"computing.":[10],"The":[11],"continued":[12],"evolution":[13],"of":[14,24,64,79,89,137,147,167],"systems":[16],"keeps":[17],"computing":[20],"an":[21],"open":[22],"area":[23],"research.":[25],"Distributed":[26,52],"algorithms":[27,53],"are":[28,54],"hard":[29],"to":[30,35,155],"design":[31],"and":[32,101,118,144,149],"much":[33],"harder":[34],"prove.":[36],"To":[37],"make":[38],"designing":[39],"algorithm":[41,113],"easier,":[42],"we":[43,106,140],"model":[44,100],"this":[45,109],"latter":[46],"with":[47],"a":[48,61,73,83,111,116,120,124,135,158,161,165],"local":[49,67,98],"computations":[50,68,99],"model.":[51],"formally":[55],"presented":[56],"by":[57,76,86,134,160],"rewriting":[58],"rules.":[59],"Beyond":[60],"formal":[62],"presentation":[63],"these":[65],"algorithms,":[66],"theory":[69],"proposes":[70],"not":[71],"only":[72],"correctness":[74],"proof":[75,85],"use":[78,88],"invariants":[80],"but":[81],"also":[82],"termination":[84],"graph":[91],"mathematical":[92],"tool-box.":[93],"Based":[94],"on":[95],"both,":[96],"mobile":[103],"agent":[104],"paradigms,":[105],"present":[107],"paper":[110],"that":[114],"elects":[115],"leader":[117,163],"computes":[119],"spanning":[121],"tree":[122,159],"dynamic":[125,129],"graph.":[126],"Computations":[127],"graphs":[130],"can":[131],"be":[132],"affected":[133],"set":[136],"topological":[138],"events:":[139],"address":[141],"appearance":[143],"disappearance":[146],"places":[148],"communication":[150],"channels.":[151],"Our":[152],"goal":[153],"always":[156],"maintain":[157],"single":[162],"or":[164],"forest":[166],"sub-trees":[168],"where":[169],"each":[170],"one":[171],"has":[172],"its":[173],"own":[174],"leader.":[175]},"counts_by_year":[{"year":2020,"cited_by_count":1},{"year":2018,"cited_by_count":4}],"updated_date":"2026-07-22T07:51:19.307946","created_date":"2025-10-10T00:00:00"}