{"id":"https://openalex.org/W4387869674","doi":"https://doi.org/10.1109/icc45041.2023.10278851","title":"Connectivity Repair Heuristics for Stationary Wireless Sensor Networks","display_name":"Connectivity Repair Heuristics for Stationary Wireless Sensor Networks","publication_year":2023,"publication_date":"2023-05-28","ids":{"openalex":"https://openalex.org/W4387869674","doi":"https://doi.org/10.1109/icc45041.2023.10278851"},"language":"en","primary_location":{"id":"doi:10.1109/icc45041.2023.10278851","is_oa":false,"landing_page_url":"https://doi.org/10.1109/icc45041.2023.10278851","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"ICC 2023 - IEEE International Conference on Communications","raw_type":"proceedings-article"},"type":"article","indexed_in":["crossref"],"open_access":{"is_oa":true,"oa_status":"green","oa_url":"https://hal.science/hal-04065704/document","any_repository_has_fulltext":true},"authorships":[{"author_position":"first","author":{"id":"https://openalex.org/A5000306800","display_name":"Khaoula Zaimen","orcid":"https://orcid.org/0000-0002-6901-369X"},"institutions":[],"countries":[],"is_corresponding":false,"raw_author_name":"Khaoula Zaimen","raw_affiliation_strings":["CESI LINEACT UR 7527,Strasbourg,France","CESI LINEACT UR 7527, Strasbourg, France","IRIMAS UR 7499, MULHOUSE Cedex, France"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"CESI LINEACT UR 7527,Strasbourg,France","institution_ids":[]},{"raw_affiliation_string":"CESI LINEACT UR 7527, Strasbourg, France","institution_ids":[]},{"raw_affiliation_string":"IRIMAS UR 7499, MULHOUSE Cedex, France","institution_ids":[]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5055546112","display_name":"Laurent Moalic","orcid":"https://orcid.org/0000-0003-3749-3227"},"institutions":[{"id":"https://openalex.org/I4210100912","display_name":"Institut de Sciences des Mat\u00e9riaux de Mulhouse","ror":"https://ror.org/012wxdw12","country_code":"FR","type":"facility","lineage":["https://openalex.org/I1294671590","https://openalex.org/I1294671590","https://openalex.org/I2800745255","https://openalex.org/I4210100912","https://openalex.org/I4210128300"]}],"countries":["FR"],"is_corresponding":false,"raw_author_name":"Laurent Moalic","raw_affiliation_strings":["IRIMAS UR 7499,MULHOUSE Cedex,France,68093"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"IRIMAS UR 7499,MULHOUSE Cedex,France,68093","institution_ids":["https://openalex.org/I4210100912"]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5047634425","display_name":"Mohamed\u2010el\u2010Amine Brahmia","orcid":"https://orcid.org/0000-0003-0114-210X"},"institutions":[],"countries":[],"is_corresponding":false,"raw_author_name":"Mohamed-el-Amine Brahmia","raw_affiliation_strings":["CESI LINEACT UR 7527,Strasbourg,France","CESI LINEACT UR 7527, Strasbourg, France"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"CESI LINEACT UR 7527,Strasbourg,France","institution_ids":[]},{"raw_affiliation_string":"CESI LINEACT UR 7527, Strasbourg, France","institution_ids":[]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5086192057","display_name":"Abdelhafid Aboua\u00efssa","orcid":"https://orcid.org/0000-0003-0459-8081"},"institutions":[{"id":"https://openalex.org/I4210100912","display_name":"Institut de Sciences des Mat\u00e9riaux de Mulhouse","ror":"https://ror.org/012wxdw12","country_code":"FR","type":"facility","lineage":["https://openalex.org/I1294671590","https://openalex.org/I1294671590","https://openalex.org/I2800745255","https://openalex.org/I4210100912","https://openalex.org/I4210128300"]}],"countries":["FR"],"is_corresponding":false,"raw_author_name":"Abdelhafid Abouaissa","raw_affiliation_strings":["IRIMAS UR 7499,MULHOUSE Cedex,France,68093"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"IRIMAS UR 7499,MULHOUSE Cedex,France,68093","institution_ids":["https://openalex.org/I4210100912"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5077151661","display_name":"Lhassane Idoumghar","orcid":"https://orcid.org/0000-0001-8853-3968"},"institutions":[{"id":"https://openalex.org/I4210100912","display_name":"Institut de Sciences des Mat\u00e9riaux de Mulhouse","ror":"https://ror.org/012wxdw12","country_code":"FR","type":"facility","lineage":["https://openalex.org/I1294671590","https://openalex.org/I1294671590","https://openalex.org/I2800745255","https://openalex.org/I4210100912","https://openalex.org/I4210128300"]}],"countries":["FR"],"is_corresponding":false,"raw_author_name":"Lhassane Idoumghar","raw_affiliation_strings":["IRIMAS UR 7499,MULHOUSE Cedex,France,68093"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"IRIMAS UR 7499,MULHOUSE Cedex,France,68093","institution_ids":["https://openalex.org/I4210100912"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":1,"corresponding_author_ids":[],"corresponding_institution_ids":[],"apc_list":null,"apc_paid":null,"fwci":0.3531,"has_fulltext":true,"cited_by_count":2,"citation_normalized_percentile":{"value":0.5979406,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":{"min":90,"max":95},"biblio":{"volume":null,"issue":null,"first_page":"4804","last_page":"4809"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T10080","display_name":"Energy Efficient Wireless Sensor Networks","score":1.0,"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":1.0,"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/T10246","display_name":"Mobile Ad Hoc Networks","score":0.9966999888420105,"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/T11392","display_name":"Energy Harvesting in Wireless Networks","score":0.9966999888420105,"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/heuristics","display_name":"Heuristics","score":0.79362952709198},{"id":"https://openalex.org/keywords/wireless-sensor-network","display_name":"Wireless sensor network","score":0.7663434743881226},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.735286295413971},{"id":"https://openalex.org/keywords/dijkstras-algorithm","display_name":"Dijkstra's algorithm","score":0.7032211422920227},{"id":"https://openalex.org/keywords/disjoint-sets","display_name":"Disjoint sets","score":0.6192194819450378},{"id":"https://openalex.org/keywords/heuristic","display_name":"Heuristic","score":0.5319668650627136},{"id":"https://openalex.org/keywords/distributed-computing","display_name":"Distributed computing","score":0.48601585626602173},{"id":"https://openalex.org/keywords/network-topology","display_name":"Network topology","score":0.4352797269821167},{"id":"https://openalex.org/keywords/computer-network","display_name":"Computer network","score":0.33938854932785034},{"id":"https://openalex.org/keywords/topology","display_name":"Topology (electrical circuits)","score":0.32201236486434937},{"id":"https://openalex.org/keywords/graph","display_name":"Graph","score":0.29154765605926514},{"id":"https://openalex.org/keywords/shortest-path-problem","display_name":"Shortest path problem","score":0.27514588832855225},{"id":"https://openalex.org/keywords/theoretical-computer-science","display_name":"Theoretical computer science","score":0.20225754380226135},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.14910036325454712},{"id":"https://openalex.org/keywords/artificial-intelligence","display_name":"Artificial intelligence","score":0.09576252102851868}],"concepts":[{"id":"https://openalex.org/C127705205","wikidata":"https://www.wikidata.org/wiki/Q5748245","display_name":"Heuristics","level":2,"score":0.79362952709198},{"id":"https://openalex.org/C24590314","wikidata":"https://www.wikidata.org/wiki/Q336038","display_name":"Wireless sensor network","level":2,"score":0.7663434743881226},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.735286295413971},{"id":"https://openalex.org/C173870130","wikidata":"https://www.wikidata.org/wiki/Q8548","display_name":"Dijkstra's algorithm","level":4,"score":0.7032211422920227},{"id":"https://openalex.org/C45340560","wikidata":"https://www.wikidata.org/wiki/Q215382","display_name":"Disjoint sets","level":2,"score":0.6192194819450378},{"id":"https://openalex.org/C173801870","wikidata":"https://www.wikidata.org/wiki/Q201413","display_name":"Heuristic","level":2,"score":0.5319668650627136},{"id":"https://openalex.org/C120314980","wikidata":"https://www.wikidata.org/wiki/Q180634","display_name":"Distributed computing","level":1,"score":0.48601585626602173},{"id":"https://openalex.org/C199845137","wikidata":"https://www.wikidata.org/wiki/Q145490","display_name":"Network topology","level":2,"score":0.4352797269821167},{"id":"https://openalex.org/C31258907","wikidata":"https://www.wikidata.org/wiki/Q1301371","display_name":"Computer network","level":1,"score":0.33938854932785034},{"id":"https://openalex.org/C184720557","wikidata":"https://www.wikidata.org/wiki/Q7825049","display_name":"Topology (electrical circuits)","level":2,"score":0.32201236486434937},{"id":"https://openalex.org/C132525143","wikidata":"https://www.wikidata.org/wiki/Q141488","display_name":"Graph","level":2,"score":0.29154765605926514},{"id":"https://openalex.org/C22590252","wikidata":"https://www.wikidata.org/wiki/Q1058754","display_name":"Shortest path problem","level":3,"score":0.27514588832855225},{"id":"https://openalex.org/C80444323","wikidata":"https://www.wikidata.org/wiki/Q2878974","display_name":"Theoretical computer science","level":1,"score":0.20225754380226135},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.14910036325454712},{"id":"https://openalex.org/C154945302","wikidata":"https://www.wikidata.org/wiki/Q11660","display_name":"Artificial intelligence","level":1,"score":0.09576252102851868},{"id":"https://openalex.org/C114614502","wikidata":"https://www.wikidata.org/wiki/Q76592","display_name":"Combinatorics","level":1,"score":0.0},{"id":"https://openalex.org/C111919701","wikidata":"https://www.wikidata.org/wiki/Q9135","display_name":"Operating system","level":1,"score":0.0}],"mesh":[],"locations_count":2,"locations":[{"id":"doi:10.1109/icc45041.2023.10278851","is_oa":false,"landing_page_url":"https://doi.org/10.1109/icc45041.2023.10278851","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"ICC 2023 - IEEE International Conference on Communications","raw_type":"proceedings-article"},{"id":"pmh:oai:HAL:hal-04065704v1","is_oa":true,"landing_page_url":"https://hal.science/hal-04065704","pdf_url":"https://hal.science/hal-04065704/document","source":{"id":"https://openalex.org/S4306402512","display_name":"HAL (Le Centre pour la Communication Scientifique Directe)","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"host_organization":"https://openalex.org/I1294671590","host_organization_name":"Centre National de la Recherche Scientifique","host_organization_lineage":["https://openalex.org/I1294671590"],"host_organization_lineage_names":[],"type":"repository"},"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"IEEE International Conference on Communications, May 2023, Rome, Italy. pp.4804-4809, &#x27E8;10.1109/ICC45041.2023.10278851&#x27E9;","raw_type":"info:eu-repo/semantics/conferenceObject"}],"best_oa_location":{"id":"pmh:oai:HAL:hal-04065704v1","is_oa":true,"landing_page_url":"https://hal.science/hal-04065704","pdf_url":"https://hal.science/hal-04065704/document","source":{"id":"https://openalex.org/S4306402512","display_name":"HAL (Le Centre pour la Communication Scientifique Directe)","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"host_organization":"https://openalex.org/I1294671590","host_organization_name":"Centre National de la Recherche Scientifique","host_organization_lineage":["https://openalex.org/I1294671590"],"host_organization_lineage_names":[],"type":"repository"},"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"IEEE International Conference on Communications, May 2023, Rome, Italy. pp.4804-4809, &#x27E8;10.1109/ICC45041.2023.10278851&#x27E9;","raw_type":"info:eu-repo/semantics/conferenceObject"},"sustainable_development_goals":[{"display_name":"Affordable and clean energy","id":"https://metadata.un.org/sdg/7","score":0.8100000023841858}],"awards":[],"funders":[],"has_content":{"pdf":true,"grobid_xml":false},"content_urls":{"pdf":"https://content.openalex.org/works/W4387869674.pdf"},"referenced_works_count":9,"referenced_works":["https://openalex.org/W1968468326","https://openalex.org/W2065293852","https://openalex.org/W2074472645","https://openalex.org/W2088863134","https://openalex.org/W2560536178","https://openalex.org/W2586336785","https://openalex.org/W2779655155","https://openalex.org/W4224255199","https://openalex.org/W4312558627"],"related_works":["https://openalex.org/W2280422768","https://openalex.org/W3143197806","https://openalex.org/W3177062893","https://openalex.org/W3125143773","https://openalex.org/W2007032764","https://openalex.org/W803550684","https://openalex.org/W2483226803","https://openalex.org/W4352977312","https://openalex.org/W1536056491","https://openalex.org/W2041180560"],"abstract_inverted_index":{"Wireless":[0],"sensor":[1,30,67],"network":[2,12,35],"connectivity":[3,15,63],"is":[4,108,137,159],"a":[5,21,40,47,106,119],"crucial":[6],"parameter":[7],"since":[8],"it":[9],"keeps":[10],"the":[11,34,60,91,99,103,111,129,132,149,170,173],"operative.":[13],"Network":[14],"may":[16],"be":[17,37],"lost":[18],"due":[19],"to":[20,89,114,127,139,177],"variety":[22],"of":[23,42,49,62,72,94,131,172],"factors,":[24],"such":[25],"as":[26],"energy":[27],"depletion":[28],"and":[29,84,142],"node":[31],"failure.":[32],"Therefore,":[33],"will":[36],"partitioned":[38],"into":[39],"set":[41],"disjoint":[43,74,116],"sets,":[44],"resulting":[45],"in":[46,70,110,122],"loss":[48],"data":[50],"collected":[51],"by":[52],"isolated":[53],"sets.":[54],"In":[55],"this":[56],"paper,":[57],"we":[58],"address":[59],"problem":[61],"repair":[64],"for":[65,162],"stationary":[66],"networks":[68],"(WSNs)":[69],"case":[71],"multiple":[73],"partitions.":[75],"We":[76],"propose":[77],"two":[78,104],"heuristics":[79],"based":[80],"on":[81],"Dijkstra":[82,154],"algorithm":[83],"minimum":[85,92],"Steiner":[86],"tree":[87],"respectively,":[88],"deploy":[90],"number":[93],"additional":[95],"nodes":[96],"while":[97],"preserving":[98],"initial":[100],"topology.":[101],"For":[102],"heuristics,":[105],"procedure":[107],"executed":[109],"first":[112,135],"stage":[113],"merge":[115],"sets":[117],"having":[118],"shared":[120],"zone":[121],"their":[123],"neighboring":[124],"deployment":[125],"zones":[126],"reduce":[128],"complexity":[130],"solution.":[133],"The":[134,156],"heuristic":[136,158],"adapted":[138],"free-obstacle":[140],"areas":[141,143,163],"with":[144,164],"few":[145],"obstacles.":[146,166],"It":[147],"connects":[148],"less":[150],"distant":[151],"segments":[152],"using":[153],"algorithm.":[155],"second":[157],"rather":[160],"appropriate":[161],"opaque":[165],"Simulation":[167],"experiments":[168],"validate":[169],"effectiveness":[171],"proposed":[174],"methods":[175],"compared":[176],"existing":[178],"approaches.":[179]},"counts_by_year":[{"year":2025,"cited_by_count":1},{"year":2024,"cited_by_count":1}],"updated_date":"2026-07-02T09:51:11.867554","created_date":"2025-10-10T00:00:00"}
