{"id":"https://openalex.org/W2040057778","doi":"https://doi.org/10.1109/glocom.2012.6503165","title":"An effective and scalable connectivity restoration heuristic for Mobile Sensor/Actor Networks","display_name":"An effective and scalable connectivity restoration heuristic for Mobile Sensor/Actor Networks","publication_year":2012,"publication_date":"2012-12-01","ids":{"openalex":"https://openalex.org/W2040057778","doi":"https://doi.org/10.1109/glocom.2012.6503165","mag":"2040057778"},"language":"en","primary_location":{"id":"doi:10.1109/glocom.2012.6503165","is_oa":false,"landing_page_url":"https://doi.org/10.1109/glocom.2012.6503165","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"2012 IEEE Global Communications Conference (GLOBECOM)","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/A5027591910","display_name":"Izzet F. Senturk","orcid":"https://orcid.org/0000-0002-1550-563X"},"institutions":[{"id":"https://openalex.org/I110378019","display_name":"Southern Illinois University Carbondale","ror":"https://ror.org/049kefs16","country_code":"US","type":"education","lineage":["https://openalex.org/I110378019","https://openalex.org/I2801502357"]}],"countries":["US"],"is_corresponding":true,"raw_author_name":"Izzet F. Senturk","raw_affiliation_strings":["Department of Computer Science, Southern Illinois University, Carbondale, 62901 USA","Department of Computer Science, Southern Illinois University, Carbondale 62901 USA.#TAB#"],"affiliations":[{"raw_affiliation_string":"Department of Computer Science, Southern Illinois University, Carbondale, 62901 USA","institution_ids":["https://openalex.org/I110378019"]},{"raw_affiliation_string":"Department of Computer Science, Southern Illinois University, Carbondale 62901 USA.#TAB#","institution_ids":["https://openalex.org/I110378019"]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5078029373","display_name":"Kemal Akkaya","orcid":"https://orcid.org/0000-0002-7103-4545"},"institutions":[{"id":"https://openalex.org/I110378019","display_name":"Southern Illinois University Carbondale","ror":"https://ror.org/049kefs16","country_code":"US","type":"education","lineage":["https://openalex.org/I110378019","https://openalex.org/I2801502357"]}],"countries":["US"],"is_corresponding":false,"raw_author_name":"Kemal Akkaya","raw_affiliation_strings":["Department of Computer Science, Southern Illinois University, Carbondale, 62901 USA","Department of Computer Science, Southern Illinois University, Carbondale 62901 USA.#TAB#"],"affiliations":[{"raw_affiliation_string":"Department of Computer Science, Southern Illinois University, Carbondale, 62901 USA","institution_ids":["https://openalex.org/I110378019"]},{"raw_affiliation_string":"Department of Computer Science, Southern Illinois University, Carbondale 62901 USA.#TAB#","institution_ids":["https://openalex.org/I110378019"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5011990085","display_name":"Fatih Senel","orcid":"https://orcid.org/0000-0003-1918-7277"},"institutions":[{"id":"https://openalex.org/I79272384","display_name":"University of Maryland, Baltimore County","ror":"https://ror.org/02qskvh78","country_code":"US","type":"education","lineage":["https://openalex.org/I79272384"]}],"countries":["US"],"is_corresponding":false,"raw_author_name":"Fatih Senel","raw_affiliation_strings":["Department of Computer Science, University of Maryland Baltimore County, 21250 USA"],"affiliations":[{"raw_affiliation_string":"Department of Computer Science, University of Maryland Baltimore County, 21250 USA","institution_ids":["https://openalex.org/I79272384"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":3,"corresponding_author_ids":["https://openalex.org/A5027591910"],"corresponding_institution_ids":["https://openalex.org/I110378019"],"apc_list":null,"apc_paid":null,"fwci":3.546,"has_fulltext":false,"cited_by_count":19,"citation_normalized_percentile":{"value":0.93155591,"is_in_top_1_percent":false,"is_in_top_10_percent":true},"cited_by_percentile_year":{"min":89,"max":98},"biblio":{"volume":null,"issue":null,"first_page":"518","last_page":"523"},"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.9998999834060669,"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.9998999834060669,"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/T11896","display_name":"Opportunistic and Delay-Tolerant Networks","score":0.9987000226974487,"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.9986000061035156,"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/relay","display_name":"Relay","score":0.7873687744140625},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.7309252023696899},{"id":"https://openalex.org/keywords/heuristic","display_name":"Heuristic","score":0.6965238451957703},{"id":"https://openalex.org/keywords/scalability","display_name":"Scalability","score":0.6686825156211853},{"id":"https://openalex.org/keywords/network-partition","display_name":"Network partition","score":0.6219990849494934},{"id":"https://openalex.org/keywords/partition","display_name":"Partition (number theory)","score":0.582499623298645},{"id":"https://openalex.org/keywords/computer-network","display_name":"Computer network","score":0.5475824475288391},{"id":"https://openalex.org/keywords/node","display_name":"Node (physics)","score":0.539061427116394},{"id":"https://openalex.org/keywords/wireless-sensor-network","display_name":"Wireless sensor network","score":0.5217338800430298},{"id":"https://openalex.org/keywords/distributed-computing","display_name":"Distributed computing","score":0.5094690918922424},{"id":"https://openalex.org/keywords/network-topology","display_name":"Network topology","score":0.4653084874153137},{"id":"https://openalex.org/keywords/set","display_name":"Set (abstract data type)","score":0.4388183057308197},{"id":"https://openalex.org/keywords/greedy-algorithm","display_name":"Greedy algorithm","score":0.4346424341201782},{"id":"https://openalex.org/keywords/topology","display_name":"Topology (electrical circuits)","score":0.36647990345954895},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.12861651182174683},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.12856680154800415},{"id":"https://openalex.org/keywords/engineering","display_name":"Engineering","score":0.11079376935958862},{"id":"https://openalex.org/keywords/artificial-intelligence","display_name":"Artificial intelligence","score":0.10263898968696594}],"concepts":[{"id":"https://openalex.org/C2778156585","wikidata":"https://www.wikidata.org/wiki/Q174053","display_name":"Relay","level":3,"score":0.7873687744140625},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.7309252023696899},{"id":"https://openalex.org/C173801870","wikidata":"https://www.wikidata.org/wiki/Q201413","display_name":"Heuristic","level":2,"score":0.6965238451957703},{"id":"https://openalex.org/C48044578","wikidata":"https://www.wikidata.org/wiki/Q727490","display_name":"Scalability","level":2,"score":0.6686825156211853},{"id":"https://openalex.org/C2780860992","wikidata":"https://www.wikidata.org/wiki/Q16887485","display_name":"Network partition","level":2,"score":0.6219990849494934},{"id":"https://openalex.org/C42812","wikidata":"https://www.wikidata.org/wiki/Q1082910","display_name":"Partition (number theory)","level":2,"score":0.582499623298645},{"id":"https://openalex.org/C31258907","wikidata":"https://www.wikidata.org/wiki/Q1301371","display_name":"Computer network","level":1,"score":0.5475824475288391},{"id":"https://openalex.org/C62611344","wikidata":"https://www.wikidata.org/wiki/Q1062658","display_name":"Node (physics)","level":2,"score":0.539061427116394},{"id":"https://openalex.org/C24590314","wikidata":"https://www.wikidata.org/wiki/Q336038","display_name":"Wireless sensor network","level":2,"score":0.5217338800430298},{"id":"https://openalex.org/C120314980","wikidata":"https://www.wikidata.org/wiki/Q180634","display_name":"Distributed computing","level":1,"score":0.5094690918922424},{"id":"https://openalex.org/C199845137","wikidata":"https://www.wikidata.org/wiki/Q145490","display_name":"Network topology","level":2,"score":0.4653084874153137},{"id":"https://openalex.org/C177264268","wikidata":"https://www.wikidata.org/wiki/Q1514741","display_name":"Set (abstract data type)","level":2,"score":0.4388183057308197},{"id":"https://openalex.org/C51823790","wikidata":"https://www.wikidata.org/wiki/Q504353","display_name":"Greedy algorithm","level":2,"score":0.4346424341201782},{"id":"https://openalex.org/C184720557","wikidata":"https://www.wikidata.org/wiki/Q7825049","display_name":"Topology (electrical circuits)","level":2,"score":0.36647990345954895},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.12861651182174683},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.12856680154800415},{"id":"https://openalex.org/C127413603","wikidata":"https://www.wikidata.org/wiki/Q11023","display_name":"Engineering","level":0,"score":0.11079376935958862},{"id":"https://openalex.org/C154945302","wikidata":"https://www.wikidata.org/wiki/Q11660","display_name":"Artificial intelligence","level":1,"score":0.10263898968696594},{"id":"https://openalex.org/C77088390","wikidata":"https://www.wikidata.org/wiki/Q8513","display_name":"Database","level":1,"score":0.0},{"id":"https://openalex.org/C66938386","wikidata":"https://www.wikidata.org/wiki/Q633538","display_name":"Structural engineering","level":1,"score":0.0},{"id":"https://openalex.org/C62520636","wikidata":"https://www.wikidata.org/wiki/Q944","display_name":"Quantum mechanics","level":1,"score":0.0},{"id":"https://openalex.org/C163258240","wikidata":"https://www.wikidata.org/wiki/Q25342","display_name":"Power (physics)","level":2,"score":0.0},{"id":"https://openalex.org/C121332964","wikidata":"https://www.wikidata.org/wiki/Q413","display_name":"Physics","level":0,"score":0.0},{"id":"https://openalex.org/C199360897","wikidata":"https://www.wikidata.org/wiki/Q9143","display_name":"Programming language","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}],"mesh":[],"locations_count":1,"locations":[{"id":"doi:10.1109/glocom.2012.6503165","is_oa":false,"landing_page_url":"https://doi.org/10.1109/glocom.2012.6503165","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"2012 IEEE Global Communications Conference (GLOBECOM)","raw_type":"proceedings-article"}],"best_oa_location":null,"sustainable_development_goals":[{"id":"https://metadata.un.org/sdg/17","display_name":"Partnerships for the goals","score":0.4399999976158142}],"awards":[],"funders":[],"has_content":{"pdf":false,"grobid_xml":false},"content_urls":null,"referenced_works_count":15,"referenced_works":["https://openalex.org/W1585140492","https://openalex.org/W1978699935","https://openalex.org/W2025396617","https://openalex.org/W2056246189","https://openalex.org/W2059015379","https://openalex.org/W2074472645","https://openalex.org/W2107951442","https://openalex.org/W2119432433","https://openalex.org/W2131227675","https://openalex.org/W2136928898","https://openalex.org/W2145854207","https://openalex.org/W2154451182","https://openalex.org/W2155984879","https://openalex.org/W2165483462","https://openalex.org/W2171371095"],"related_works":["https://openalex.org/W2388364837","https://openalex.org/W2793369131","https://openalex.org/W1549987457","https://openalex.org/W3197085788","https://openalex.org/W2500353301","https://openalex.org/W1992093253","https://openalex.org/W3014059774","https://openalex.org/W2388365985","https://openalex.org/W1998080522","https://openalex.org/W4372292342"],"abstract_inverted_index":{"Due":[0],"to":[1,12,77,110,125,167,226],"inhospitable":[2],"environments,":[3],"the":[4,18,24,27,40,46,49,58,70,97,102,106,115,118,122,127,132,162,169,181,183,192,201,206,210,218,235],"actors/sensors":[5,43],"in":[6,114,161,191],"Mobile":[7],"Sensor/Actor":[8],"Networks":[9],"are":[10,164,194,241],"subject":[11],"various":[13],"damages":[14,25],"which":[15,75],"can":[16,54,108,134,156],"disrupt":[17],"data":[19],"delivery":[20],"and":[21,30,208],"cooperation.":[22],"Typically,":[23],"affect":[26],"existing":[28],"routes":[29],"may":[31],"even":[32],"cause":[33,188],"network":[34,59,93],"partitioning.":[35],"In":[36,80],"such":[37],"a":[38,52,139,150,174,227],"case,":[39],"set":[41,141,204],"of":[42,48,69,101,121,129,142,205,237],"disconnected":[44],"from":[45,180],"rest":[47],"network,":[50],"namely":[51],"partition,":[53],"be":[55,78],"re-connected":[56],"with":[57],"through":[60],"topology":[61],"adjustment":[62],"by":[63,148,199],"exploiting":[64],"node":[65,152],"mobility.":[66],"However,":[67],"movement":[68,99],"nodes":[71,107,133,160,179,184,238],"consumes":[72],"significant":[73],"energy":[74],"needs":[76],"minimized.":[79],"this":[81,137],"paper,":[82],"we":[83],"propose":[84],"an":[85],"effective":[86],"yet":[87],"scalable":[88],"heuristic":[89,123,154],"approach":[90,220],"for":[91],"restoring":[92],"connectivity":[94],"while":[95],"minimizing":[96],"total":[98],"distance":[100],"nodes.":[103,212],"Given":[104],"that":[105,155,185,217],"move":[109],"infinitely":[111],"many":[112],"locations":[113,130],"damaged":[116],"area,":[117],"basic":[119],"motivation":[120],"is":[124,145,197],"reduce":[126],"number":[128,236],"where":[131],"move.":[135],"For":[136],"purpose,":[138],"minimum":[140],"relay":[143,151,170],"points":[144,171],"identified":[146],"first":[147],"running":[149],"placement":[153],"ensure":[157],"connectivity.":[158],"Existing":[159],"partitions":[163,240],"then":[165],"used":[166],"fill":[168],"based":[172],"on":[173],"greedy":[175],"heuristic.":[176],"When":[177],"selecting":[178],"partitions,":[182],"do":[186],"not":[187,221],"further":[189],"disconnectivity":[190],"partition":[193,207],"picked.":[195],"This":[196],"done":[198],"determining":[200],"connected":[202],"dominating":[203],"identifying":[209],"dominatee":[211],"The":[213],"experiment":[214],"results":[215],"show":[216],"proposed":[219],"only":[222],"performs":[223],"very":[224],"close":[225],"near-optimal":[228],"solution":[229],"but":[230],"also":[231],"scales":[232],"well":[233],"when":[234],"or":[239],"increased.":[242]},"counts_by_year":[{"year":2024,"cited_by_count":1},{"year":2022,"cited_by_count":1},{"year":2021,"cited_by_count":1},{"year":2019,"cited_by_count":1},{"year":2017,"cited_by_count":2},{"year":2016,"cited_by_count":3},{"year":2015,"cited_by_count":4},{"year":2014,"cited_by_count":4},{"year":2013,"cited_by_count":2}],"updated_date":"2025-11-06T03:46:38.306776","created_date":"2025-10-10T00:00:00"}