{"id":"https://openalex.org/W2903883543","doi":"https://doi.org/10.1109/ssd.2018.8570484","title":"Optimized Minimum Spanning Tree for Border Nodes Selection in Wireless Sensor Networks","display_name":"Optimized Minimum Spanning Tree for Border Nodes Selection in Wireless Sensor Networks","publication_year":2018,"publication_date":"2018-03-01","ids":{"openalex":"https://openalex.org/W2903883543","doi":"https://doi.org/10.1109/ssd.2018.8570484","mag":"2903883543"},"language":"en","primary_location":{"id":"doi:10.1109/ssd.2018.8570484","is_oa":false,"landing_page_url":"https://doi.org/10.1109/ssd.2018.8570484","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"2018 15th International Multi-Conference on Systems, Signals &amp; Devices (SSD)","raw_type":"proceedings-article"},"type":"conference-paper","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/A5073462277","display_name":"Marwa Khedher","orcid":null},"institutions":[{"id":"https://openalex.org/I4210086032","display_name":"Institut Sup\u00e9rieur des \u00c9tudes Technologiques de Gafsa","ror":"https://ror.org/00cvp0686","country_code":"TN","type":"education","lineage":["https://openalex.org/I4210086032"]}],"countries":["TN"],"is_corresponding":false,"raw_author_name":"Marwa Khedher","raw_affiliation_strings":["Department of electrical engineering, Higher Institute of Technological Studies of Djerba Sousse, Tunisia"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Department of electrical engineering, Higher Institute of Technological Studies of Djerba Sousse, Tunisia","institution_ids":["https://openalex.org/I4210086032"]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5049190018","display_name":"Hend Liouane","orcid":null},"institutions":[{"id":"https://openalex.org/I166928557","display_name":"University of Monastir","ror":"https://ror.org/00nhtcg76","country_code":"TN","type":"education","lineage":["https://openalex.org/I166928557"]},{"id":"https://openalex.org/I4391012590","display_name":"Ecole Nationale d'Ing\u00e9nieurs de Monastir","ror":"https://ror.org/045yr8682","country_code":null,"type":"education","lineage":["https://openalex.org/I166928557","https://openalex.org/I4391012590"]}],"countries":["TN"],"is_corresponding":false,"raw_author_name":"Hend Liouane","raw_affiliation_strings":["Department of electrical engineering, National engineering school of Monastir, Monastir, Tunisia"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Department of electrical engineering, National engineering school of Monastir, Monastir, Tunisia","institution_ids":["https://openalex.org/I166928557","https://openalex.org/I4391012590"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5043900706","display_name":"Ali Douik","orcid":"https://orcid.org/0000-0002-0178-501X"},"institutions":[{"id":"https://openalex.org/I8636806","display_name":"University of Sousse","ror":"https://ror.org/00dmpgj58","country_code":"TN","type":"education","lineage":["https://openalex.org/I8636806"]}],"countries":["TN"],"is_corresponding":false,"raw_author_name":"Ali Douik","raw_affiliation_strings":["Department of applied informatics, National engineering school of Sousse, Sousse, Tunisia"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Department of applied informatics, National engineering school of Sousse, Sousse, Tunisia","institution_ids":["https://openalex.org/I8636806"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":4,"corresponding_author_ids":[],"corresponding_institution_ids":[],"apc_list":null,"apc_paid":null,"fwci":0.4524,"has_fulltext":false,"cited_by_count":2,"citation_normalized_percentile":{"value":0.56366098,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":{"min":94,"max":96},"biblio":{"volume":null,"issue":null,"first_page":"660","last_page":"665"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T10080","display_name":"Energy Efficient Wireless Sensor Networks","score":0.9988999962806702,"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/T10080","display_name":"Energy Efficient Wireless Sensor Networks","score":0.9988999962806702,"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/T10100","display_name":"Metaheuristic Optimization Algorithms Research","score":0.9934999942779541,"subfield":{"id":"https://openalex.org/subfields/1702","display_name":"Artificial Intelligence"},"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/T11392","display_name":"Energy Harvesting in Wireless Networks","score":0.9869999885559082,"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"}}],"keywords":[{"id":"https://openalex.org/keywords/bottleneck","display_name":"Bottleneck","score":0.690041184425354},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.6724153161048889},{"id":"https://openalex.org/keywords/wireless-sensor-network","display_name":"Wireless sensor network","score":0.6588006615638733},{"id":"https://openalex.org/keywords/distributed-minimum-spanning-tree","display_name":"Distributed minimum spanning tree","score":0.6397092342376709},{"id":"https://openalex.org/keywords/spanning-tree","display_name":"Spanning tree","score":0.6341869831085205},{"id":"https://openalex.org/keywords/network-topology","display_name":"Network topology","score":0.610275387763977},{"id":"https://openalex.org/keywords/minimum-spanning-tree","display_name":"Minimum spanning tree","score":0.5630462169647217},{"id":"https://openalex.org/keywords/tree","display_name":"Tree (set theory)","score":0.5315356850624084},{"id":"https://openalex.org/keywords/routing","display_name":"Routing (electronic design automation)","score":0.45246008038520813},{"id":"https://openalex.org/keywords/distributed-computing","display_name":"Distributed computing","score":0.4177852272987366},{"id":"https://openalex.org/keywords/population","display_name":"Population","score":0.4148682951927185},{"id":"https://openalex.org/keywords/mathematical-optimization","display_name":"Mathematical optimization","score":0.38345009088516235},{"id":"https://openalex.org/keywords/computer-network","display_name":"Computer network","score":0.3220808506011963},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.24194124341011047},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.187260240316391}],"concepts":[{"id":"https://openalex.org/C2780513914","wikidata":"https://www.wikidata.org/wiki/Q18210350","display_name":"Bottleneck","level":2,"score":0.690041184425354},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.6724153161048889},{"id":"https://openalex.org/C24590314","wikidata":"https://www.wikidata.org/wiki/Q336038","display_name":"Wireless sensor network","level":2,"score":0.6588006615638733},{"id":"https://openalex.org/C65949645","wikidata":"https://www.wikidata.org/wiki/Q5283163","display_name":"Distributed minimum spanning tree","level":3,"score":0.6397092342376709},{"id":"https://openalex.org/C64331007","wikidata":"https://www.wikidata.org/wiki/Q831672","display_name":"Spanning tree","level":2,"score":0.6341869831085205},{"id":"https://openalex.org/C199845137","wikidata":"https://www.wikidata.org/wiki/Q145490","display_name":"Network topology","level":2,"score":0.610275387763977},{"id":"https://openalex.org/C13743678","wikidata":"https://www.wikidata.org/wiki/Q240464","display_name":"Minimum spanning tree","level":2,"score":0.5630462169647217},{"id":"https://openalex.org/C113174947","wikidata":"https://www.wikidata.org/wiki/Q2859736","display_name":"Tree (set theory)","level":2,"score":0.5315356850624084},{"id":"https://openalex.org/C74172769","wikidata":"https://www.wikidata.org/wiki/Q1446839","display_name":"Routing (electronic design automation)","level":2,"score":0.45246008038520813},{"id":"https://openalex.org/C120314980","wikidata":"https://www.wikidata.org/wiki/Q180634","display_name":"Distributed computing","level":1,"score":0.4177852272987366},{"id":"https://openalex.org/C2908647359","wikidata":"https://www.wikidata.org/wiki/Q2625603","display_name":"Population","level":2,"score":0.4148682951927185},{"id":"https://openalex.org/C126255220","wikidata":"https://www.wikidata.org/wiki/Q141495","display_name":"Mathematical optimization","level":1,"score":0.38345009088516235},{"id":"https://openalex.org/C31258907","wikidata":"https://www.wikidata.org/wiki/Q1301371","display_name":"Computer network","level":1,"score":0.3220808506011963},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.24194124341011047},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.187260240316391},{"id":"https://openalex.org/C149923435","wikidata":"https://www.wikidata.org/wiki/Q37732","display_name":"Demography","level":1,"score":0.0},{"id":"https://openalex.org/C144024400","wikidata":"https://www.wikidata.org/wiki/Q21201","display_name":"Sociology","level":0,"score":0.0},{"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/C114614502","wikidata":"https://www.wikidata.org/wiki/Q76592","display_name":"Combinatorics","level":1,"score":0.0},{"id":"https://openalex.org/C149635348","wikidata":"https://www.wikidata.org/wiki/Q193040","display_name":"Embedded system","level":1,"score":0.0}],"mesh":[],"locations_count":1,"locations":[{"id":"doi:10.1109/ssd.2018.8570484","is_oa":false,"landing_page_url":"https://doi.org/10.1109/ssd.2018.8570484","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"2018 15th International Multi-Conference on Systems, Signals &amp; Devices (SSD)","raw_type":"proceedings-article"}],"best_oa_location":null,"sustainable_development_goals":[{"score":0.44999998807907104,"id":"https://metadata.un.org/sdg/17","display_name":"Partnerships for the goals"}],"awards":[],"funders":[],"has_content":{"grobid_xml":false,"pdf":false},"content_urls":null,"referenced_works_count":13,"referenced_works":["https://openalex.org/W1595159159","https://openalex.org/W1966931974","https://openalex.org/W1992913497","https://openalex.org/W2015450786","https://openalex.org/W2052478271","https://openalex.org/W2115021652","https://openalex.org/W2121706841","https://openalex.org/W2123747410","https://openalex.org/W2141170393","https://openalex.org/W2149554935","https://openalex.org/W2169798749","https://openalex.org/W2345765464","https://openalex.org/W2541092144"],"related_works":["https://openalex.org/W2418231958","https://openalex.org/W4380840098","https://openalex.org/W2381121915","https://openalex.org/W2099915933","https://openalex.org/W2390742649","https://openalex.org/W2387385213","https://openalex.org/W1703428550","https://openalex.org/W3116169590","https://openalex.org/W2360026231","https://openalex.org/W2353822696"],"abstract_inverted_index":{"Group-based":[0],"topologies":[1],"offer":[2],"good":[3],"performance":[4],"in":[5,37,121],"wireless":[6],"sensor":[7],"networks":[8],"(WSNs)":[9],"by":[10],"avoiding":[11],"the":[12,21,38,53,74,87,95,100,105,123,135,139],"bottleneck":[13],"issues,":[14],"reducing":[15],"points":[16],"of":[17,97,107],"failure":[18],"and":[19,99,129],"simplifying":[20],"management.":[22],"Border":[23],"nodes":[24,32,46],"collaboration":[25],"is":[26,47,56,65,92],"an":[27,59,112,127],"important":[28],"issue":[29],"as":[30,58],"those":[31,45,108],"play":[33],"a":[34,83,130],"critical":[35],"role":[36],"inter-group":[39],"routing.":[40],"An":[41],"efficient":[42,113],"scheme":[43],"between":[44],"then":[48],"required.":[49],"In":[50],"this":[51],"paper,":[52],"overall":[54],"problem":[55,137],"formulated":[57],"optimization":[60],"problem.":[61],"The":[62,90],"search":[63],"process":[64],"based":[66],"on":[67],"two":[68],"evolutionary":[69],"algorithms":[70],"combined":[71],"separately":[72],"with":[73],"Minimum":[75],"Spanning":[76],"tree":[77,115],"(MST)":[78],"algorithm.":[79,142],"It":[80],"iteratively":[81],"evolve":[82],"population":[84],"until":[85],"finding":[86],"best":[88],"solutions.":[89],"aim":[91],"to":[93,110,133,138],"minimize":[94],"number":[96],"links":[98],"communication":[101],"cost.":[102],"Simulations":[103],"confirm":[104],"potential":[106],"mechanisms":[109],"find":[111],"optimized":[114],"which":[116],"relates":[117],"all":[118],"border":[119],"nodes,":[120],"particular,":[122],"logic-gate-based":[124],"algorithm":[125],"presents":[126],"original":[128],"competent":[131],"procedure":[132],"solve":[134],"considered":[136],"Differential":[140],"Evolution":[141]},"counts_by_year":[{"year":2019,"cited_by_count":2}],"updated_date":"2026-07-29T14:22:42.915294","created_date":"2025-10-10T00:00:00"}
