{"id":"https://openalex.org/W1971792602","doi":"https://doi.org/10.1109/glocom.2011.6134478","title":"Maximum Lifetime Data Regeneration for Persistent Storage in Wireless Sensor Networks","display_name":"Maximum Lifetime Data Regeneration for Persistent Storage in Wireless Sensor Networks","publication_year":2011,"publication_date":"2011-12-01","ids":{"openalex":"https://openalex.org/W1971792602","doi":"https://doi.org/10.1109/glocom.2011.6134478","mag":"1971792602"},"language":"en","primary_location":{"id":"doi:10.1109/glocom.2011.6134478","is_oa":false,"landing_page_url":"https://doi.org/10.1109/glocom.2011.6134478","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"2011 IEEE Global Telecommunications Conference - GLOBECOM 2011","raw_type":"proceedings-article"},"type":"article","indexed_in":["crossref"],"open_access":{"is_oa":true,"oa_status":"green","oa_url":"https://zenodo.org/record/1268976","any_repository_has_fulltext":true},"authorships":[{"author_position":"first","author":{"id":"https://openalex.org/A5065248577","display_name":"Soji Omiwade","orcid":null},"institutions":[{"id":"https://openalex.org/I44461941","display_name":"University of Houston","ror":"https://ror.org/048sx0r50","country_code":"US","type":"education","lineage":["https://openalex.org/I44461941"]}],"countries":["US"],"is_corresponding":true,"raw_author_name":"S. Omiwade","raw_affiliation_strings":["Department of Computer Science, University of Houston, Houston, TX, USA","Dept. of Comput. Sci., Univ. of Houston, Houston, TX, USA#TAB#"],"affiliations":[{"raw_affiliation_string":"Department of Computer Science, University of Houston, Houston, TX, USA","institution_ids":["https://openalex.org/I44461941"]},{"raw_affiliation_string":"Dept. of Comput. Sci., Univ. of Houston, Houston, TX, USA#TAB#","institution_ids":["https://openalex.org/I44461941"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5056442083","display_name":"Rong Zheng","orcid":"https://orcid.org/0000-0003-4070-075X"},"institutions":[{"id":"https://openalex.org/I44461941","display_name":"University of Houston","ror":"https://ror.org/048sx0r50","country_code":"US","type":"education","lineage":["https://openalex.org/I44461941"]}],"countries":["US"],"is_corresponding":false,"raw_author_name":"Rong Zheng","raw_affiliation_strings":["Department of Computer Science, University of Houston, Houston, TX, USA","Dept. of Comput. Sci., Univ. of Houston, Houston, TX, USA#TAB#"],"affiliations":[{"raw_affiliation_string":"Department of Computer Science, University of Houston, Houston, TX, USA","institution_ids":["https://openalex.org/I44461941"]},{"raw_affiliation_string":"Dept. of Comput. Sci., Univ. of Houston, Houston, TX, USA#TAB#","institution_ids":["https://openalex.org/I44461941"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":2,"corresponding_author_ids":["https://openalex.org/A5065248577"],"corresponding_institution_ids":["https://openalex.org/I44461941"],"apc_list":null,"apc_paid":null,"fwci":0.7392,"has_fulltext":false,"cited_by_count":2,"citation_normalized_percentile":{"value":0.71831005,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":{"min":89,"max":94},"biblio":{"volume":null,"issue":null,"first_page":null,"last_page":null},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T11478","display_name":"Caching and Content Delivery","score":0.9997000098228455,"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/T11478","display_name":"Caching and Content Delivery","score":0.9997000098228455,"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/T11181","display_name":"Advanced Data Storage Technologies","score":0.9994999766349792,"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.9993000030517578,"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/cardinality","display_name":"Cardinality (data modeling)","score":0.7526556849479675},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.7183582782745361},{"id":"https://openalex.org/keywords/wireless-sensor-network","display_name":"Wireless sensor network","score":0.7050579190254211},{"id":"https://openalex.org/keywords/heuristic","display_name":"Heuristic","score":0.5569583177566528},{"id":"https://openalex.org/keywords/distributed-computing","display_name":"Distributed computing","score":0.5193566083908081},{"id":"https://openalex.org/keywords/erasure","display_name":"Erasure","score":0.49538862705230713},{"id":"https://openalex.org/keywords/erasure-code","display_name":"Erasure code","score":0.45419859886169434},{"id":"https://openalex.org/keywords/bandwidth","display_name":"Bandwidth (computing)","score":0.44324150681495667},{"id":"https://openalex.org/keywords/computer-network","display_name":"Computer network","score":0.4344242811203003},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.32141339778900146},{"id":"https://openalex.org/keywords/data-mining","display_name":"Data mining","score":0.11637604236602783}],"concepts":[{"id":"https://openalex.org/C87117476","wikidata":"https://www.wikidata.org/wiki/Q362383","display_name":"Cardinality (data modeling)","level":2,"score":0.7526556849479675},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.7183582782745361},{"id":"https://openalex.org/C24590314","wikidata":"https://www.wikidata.org/wiki/Q336038","display_name":"Wireless sensor network","level":2,"score":0.7050579190254211},{"id":"https://openalex.org/C173801870","wikidata":"https://www.wikidata.org/wiki/Q201413","display_name":"Heuristic","level":2,"score":0.5569583177566528},{"id":"https://openalex.org/C120314980","wikidata":"https://www.wikidata.org/wiki/Q180634","display_name":"Distributed computing","level":1,"score":0.5193566083908081},{"id":"https://openalex.org/C2778790127","wikidata":"https://www.wikidata.org/wiki/Q484885","display_name":"Erasure","level":2,"score":0.49538862705230713},{"id":"https://openalex.org/C137529215","wikidata":"https://www.wikidata.org/wiki/Q5385031","display_name":"Erasure code","level":3,"score":0.45419859886169434},{"id":"https://openalex.org/C2776257435","wikidata":"https://www.wikidata.org/wiki/Q1576430","display_name":"Bandwidth (computing)","level":2,"score":0.44324150681495667},{"id":"https://openalex.org/C31258907","wikidata":"https://www.wikidata.org/wiki/Q1301371","display_name":"Computer network","level":1,"score":0.4344242811203003},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.32141339778900146},{"id":"https://openalex.org/C124101348","wikidata":"https://www.wikidata.org/wiki/Q172491","display_name":"Data mining","level":1,"score":0.11637604236602783},{"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/C154945302","wikidata":"https://www.wikidata.org/wiki/Q11660","display_name":"Artificial intelligence","level":1,"score":0.0},{"id":"https://openalex.org/C57273362","wikidata":"https://www.wikidata.org/wiki/Q576722","display_name":"Decoding methods","level":2,"score":0.0}],"mesh":[],"locations_count":2,"locations":[{"id":"doi:10.1109/glocom.2011.6134478","is_oa":false,"landing_page_url":"https://doi.org/10.1109/glocom.2011.6134478","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"2011 IEEE Global Telecommunications Conference - GLOBECOM 2011","raw_type":"proceedings-article"},{"id":"pmh:oai:zenodo.org:1268976","is_oa":true,"landing_page_url":"https://zenodo.org/record/1268976","pdf_url":null,"source":{"id":"https://openalex.org/S4306400562","display_name":"Zenodo (CERN European Organization for Nuclear Research)","issn_l":null,"issn":null,"is_oa":true,"is_in_doaj":false,"is_core":false,"host_organization":"https://openalex.org/I67311998","host_organization_name":"European Organization for Nuclear Research","host_organization_lineage":["https://openalex.org/I67311998"],"host_organization_lineage_names":[],"type":"repository"},"license":"public-domain","license_id":"https://openalex.org/licenses/public-domain","version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"","raw_type":"info:eu-repo/semantics/conferencePaper"}],"best_oa_location":{"id":"pmh:oai:zenodo.org:1268976","is_oa":true,"landing_page_url":"https://zenodo.org/record/1268976","pdf_url":null,"source":{"id":"https://openalex.org/S4306400562","display_name":"Zenodo (CERN European Organization for Nuclear Research)","issn_l":null,"issn":null,"is_oa":true,"is_in_doaj":false,"is_core":false,"host_organization":"https://openalex.org/I67311998","host_organization_name":"European Organization for Nuclear Research","host_organization_lineage":["https://openalex.org/I67311998"],"host_organization_lineage_names":[],"type":"repository"},"license":"public-domain","license_id":"https://openalex.org/licenses/public-domain","version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"","raw_type":"info:eu-repo/semantics/conferencePaper"},"sustainable_development_goals":[{"score":0.9100000262260437,"display_name":"Affordable and clean energy","id":"https://metadata.un.org/sdg/7"}],"awards":[],"funders":[],"has_content":{"pdf":false,"grobid_xml":false},"content_urls":null,"referenced_works_count":5,"referenced_works":["https://openalex.org/W2006033216","https://openalex.org/W2058863419","https://openalex.org/W2126866049","https://openalex.org/W2132549513","https://openalex.org/W2138110316"],"related_works":["https://openalex.org/W2535060393","https://openalex.org/W2982181605","https://openalex.org/W2137028263","https://openalex.org/W2130518071","https://openalex.org/W3102119340","https://openalex.org/W2031335939","https://openalex.org/W4287065415","https://openalex.org/W1694938350","https://openalex.org/W2744779861","https://openalex.org/W3184492641"],"abstract_inverted_index":{"Erasure":[0],"codes":[1],"have":[2],"been":[3],"employed":[4],"to":[5,20],"achieve":[6],"persistent":[7],"storage":[8,11,23],"in":[9,18,22,29,54,89],"distributed":[10],"networks.":[12],"Recent":[13],"work":[14],"has":[15],"shown":[16],"that,":[17],"addition":[19],"reduction":[21],"space":[24],"requirements,":[25],"the":[26,30,47,59,73,77,102,105],"communication":[27],"bandwidth":[28],"data":[31,52,87],"regeneration":[32,53,88],"process":[33],"can":[34],"be":[35],"further":[36],"reduced":[37],"by":[38],"using":[39],"Regenerating":[40],"Codes.":[41],"In":[42],"this":[43,128],"paper,":[44],"we":[45,113],"consider":[46],"issue":[48],"of":[49,61,75,80,104],"energy-":[50],"efficient":[51],"wireless":[55],"sensor":[56],"networks":[57,120],"with":[58],"objective":[60],"minimizing":[62],"energy":[63],"expenditure":[64],"and":[65,83,92,121],"thereby":[66],"maximizing":[67],"network":[68],"lifetime.":[69],"We":[70],"formally":[71],"prove":[72],"NP-hardness":[74],"finding":[76],"optimal":[78,95],"set":[79,106],"source":[81],"nodes":[82],"corresponding":[84],"routes":[85],"for":[86,99,118],"general":[90,119],"networks,":[91],"devise":[93,114],"an":[94],"polynomial":[96],"algorithm,":[97],"TROY,":[98,112],"acyclic":[100],"networks;":[101],"cardinality":[103],"is":[107,130],"pre-":[108],"defined.":[109],"Building":[110],"upon":[111],"a":[115],"heuristic":[116,129],"algorithm":[117],"show,":[122],"through":[123],"extensive":[124],"simulation":[125],"studies,":[126],"that":[127],"near-optimal.":[131]},"counts_by_year":[{"year":2013,"cited_by_count":1},{"year":2012,"cited_by_count":1}],"updated_date":"2026-03-20T23:20:44.827607","created_date":"2025-10-10T00:00:00"}