{"id":"https://openalex.org/W2053861975","doi":"https://doi.org/10.1145/1989493.1989521","title":"Maximising lifetime for fault-tolerant target coverage in sensor networks","display_name":"Maximising lifetime for fault-tolerant target coverage in sensor networks","publication_year":2011,"publication_date":"2011-06-04","ids":{"openalex":"https://openalex.org/W2053861975","doi":"https://doi.org/10.1145/1989493.1989521","mag":"2053861975"},"language":"en","primary_location":{"id":"doi:10.1145/1989493.1989521","is_oa":false,"landing_page_url":"https://doi.org/10.1145/1989493.1989521","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Proceedings of the twenty-third annual ACM symposium on Parallelism in algorithms and architectures","raw_type":"proceedings-article"},"type":"article","indexed_in":["crossref"],"open_access":{"is_oa":true,"oa_status":"green","oa_url":"https://figshare.com/articles/conference_contribution/Maximising_lifetime_for_fault-tolerant_target_coverage_in_sensor_networks/10103741","any_repository_has_fulltext":true},"authorships":[{"author_position":"first","author":{"id":"https://openalex.org/A5049579750","display_name":"Thomas Erlebach","orcid":"https://orcid.org/0000-0002-4470-5868"},"institutions":[{"id":"https://openalex.org/I153648349","display_name":"University of Leicester","ror":"https://ror.org/04h699437","country_code":"GB","type":"education","lineage":["https://openalex.org/I153648349"]}],"countries":["GB"],"is_corresponding":true,"raw_author_name":"Thomas Erlebach","raw_affiliation_strings":["University of Leicester, Leicester, United Kingdom","university of leicester, Leicester, United Kingdom"],"affiliations":[{"raw_affiliation_string":"University of Leicester, Leicester, United Kingdom","institution_ids":["https://openalex.org/I153648349"]},{"raw_affiliation_string":"university of leicester, Leicester, United Kingdom","institution_ids":["https://openalex.org/I153648349"]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5054767506","display_name":"Tom Grant","orcid":null},"institutions":[{"id":"https://openalex.org/I153648349","display_name":"University of Leicester","ror":"https://ror.org/04h699437","country_code":"GB","type":"education","lineage":["https://openalex.org/I153648349"]}],"countries":["GB"],"is_corresponding":false,"raw_author_name":"Tom Grant","raw_affiliation_strings":["University of Leicester, Leicester, United Kingdom","university of leicester, Leicester, United Kingdom"],"affiliations":[{"raw_affiliation_string":"University of Leicester, Leicester, United Kingdom","institution_ids":["https://openalex.org/I153648349"]},{"raw_affiliation_string":"university of leicester, Leicester, United Kingdom","institution_ids":["https://openalex.org/I153648349"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5078740848","display_name":"Frank Kammer","orcid":"https://orcid.org/0000-0002-2662-3471"},"institutions":[{"id":"https://openalex.org/I179225836","display_name":"University of Augsburg","ror":"https://ror.org/03p14d497","country_code":"DE","type":"education","lineage":["https://openalex.org/I179225836"]}],"countries":["DE"],"is_corresponding":false,"raw_author_name":"Frank Kammer","raw_affiliation_strings":["Universit\u00e4t Augsburg, Augsburg, Germany"],"affiliations":[{"raw_affiliation_string":"Universit\u00e4t Augsburg, Augsburg, Germany","institution_ids":["https://openalex.org/I179225836"]}]}],"institutions":[],"countries_distinct_count":2,"institutions_distinct_count":3,"corresponding_author_ids":["https://openalex.org/A5049579750"],"corresponding_institution_ids":["https://openalex.org/I153648349"],"apc_list":null,"apc_paid":null,"fwci":1.8218,"has_fulltext":false,"cited_by_count":10,"citation_normalized_percentile":{"value":0.85913315,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":{"min":90,"max":97},"biblio":{"volume":null,"issue":null,"first_page":"187","last_page":"196"},"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.9975000023841858,"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.9975000023841858,"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/T10996","display_name":"Computational Geometry and Mesh Generation","score":0.9796000123023987,"subfield":{"id":"https://openalex.org/subfields/1704","display_name":"Computer Graphics and Computer-Aided Design"},"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/T10848","display_name":"Advanced Multi-Objective Optimization Algorithms","score":0.9505000114440918,"subfield":{"id":"https://openalex.org/subfields/1703","display_name":"Computational Theory and Mathematics"},"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/wireless-sensor-network","display_name":"Wireless sensor network","score":0.7618716955184937},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.5468466281890869},{"id":"https://openalex.org/keywords/schedule","display_name":"Schedule","score":0.5463989973068237},{"id":"https://openalex.org/keywords/approximation-algorithm","display_name":"Approximation algorithm","score":0.5297920107841492},{"id":"https://openalex.org/keywords/fault-tolerance","display_name":"Fault tolerance","score":0.5238571166992188},{"id":"https://openalex.org/keywords/cover","display_name":"Cover (algebra)","score":0.49888157844543457},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.4957374036312103},{"id":"https://openalex.org/keywords/event","display_name":"Event (particle physics)","score":0.4940979778766632},{"id":"https://openalex.org/keywords/set-cover-problem","display_name":"Set cover problem","score":0.4362230598926544},{"id":"https://openalex.org/keywords/set","display_name":"Set (abstract data type)","score":0.432561457157135},{"id":"https://openalex.org/keywords/brooks\u2013iyengar-algorithm","display_name":"Brooks\u2013Iyengar algorithm","score":0.4214453101158142},{"id":"https://openalex.org/keywords/real-time-computing","display_name":"Real-time computing","score":0.3878522217273712},{"id":"https://openalex.org/keywords/mathematical-optimization","display_name":"Mathematical optimization","score":0.3498704135417938},{"id":"https://openalex.org/keywords/topology","display_name":"Topology (electrical circuits)","score":0.3326689600944519},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.31537964940071106},{"id":"https://openalex.org/keywords/distributed-computing","display_name":"Distributed computing","score":0.22808563709259033},{"id":"https://openalex.org/keywords/key-distribution-in-wireless-sensor-networks","display_name":"Key distribution in wireless sensor networks","score":0.2074204981327057},{"id":"https://openalex.org/keywords/engineering","display_name":"Engineering","score":0.15625503659248352},{"id":"https://openalex.org/keywords/computer-network","display_name":"Computer network","score":0.11102166771888733},{"id":"https://openalex.org/keywords/combinatorics","display_name":"Combinatorics","score":0.10751950740814209}],"concepts":[{"id":"https://openalex.org/C24590314","wikidata":"https://www.wikidata.org/wiki/Q336038","display_name":"Wireless sensor network","level":2,"score":0.7618716955184937},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.5468466281890869},{"id":"https://openalex.org/C68387754","wikidata":"https://www.wikidata.org/wiki/Q7271585","display_name":"Schedule","level":2,"score":0.5463989973068237},{"id":"https://openalex.org/C148764684","wikidata":"https://www.wikidata.org/wiki/Q621751","display_name":"Approximation algorithm","level":2,"score":0.5297920107841492},{"id":"https://openalex.org/C63540848","wikidata":"https://www.wikidata.org/wiki/Q3140932","display_name":"Fault tolerance","level":2,"score":0.5238571166992188},{"id":"https://openalex.org/C2780428219","wikidata":"https://www.wikidata.org/wiki/Q16952335","display_name":"Cover (algebra)","level":2,"score":0.49888157844543457},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.4957374036312103},{"id":"https://openalex.org/C2779662365","wikidata":"https://www.wikidata.org/wiki/Q5416694","display_name":"Event (particle physics)","level":2,"score":0.4940979778766632},{"id":"https://openalex.org/C100808899","wikidata":"https://www.wikidata.org/wiki/Q1192100","display_name":"Set cover problem","level":3,"score":0.4362230598926544},{"id":"https://openalex.org/C177264268","wikidata":"https://www.wikidata.org/wiki/Q1514741","display_name":"Set (abstract data type)","level":2,"score":0.432561457157135},{"id":"https://openalex.org/C10000559","wikidata":"https://www.wikidata.org/wiki/Q4975143","display_name":"Brooks\u2013Iyengar algorithm","level":5,"score":0.4214453101158142},{"id":"https://openalex.org/C79403827","wikidata":"https://www.wikidata.org/wiki/Q3988","display_name":"Real-time computing","level":1,"score":0.3878522217273712},{"id":"https://openalex.org/C126255220","wikidata":"https://www.wikidata.org/wiki/Q141495","display_name":"Mathematical optimization","level":1,"score":0.3498704135417938},{"id":"https://openalex.org/C184720557","wikidata":"https://www.wikidata.org/wiki/Q7825049","display_name":"Topology (electrical circuits)","level":2,"score":0.3326689600944519},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.31537964940071106},{"id":"https://openalex.org/C120314980","wikidata":"https://www.wikidata.org/wiki/Q180634","display_name":"Distributed computing","level":1,"score":0.22808563709259033},{"id":"https://openalex.org/C41971633","wikidata":"https://www.wikidata.org/wiki/Q6398155","display_name":"Key distribution in wireless sensor networks","level":4,"score":0.2074204981327057},{"id":"https://openalex.org/C127413603","wikidata":"https://www.wikidata.org/wiki/Q11023","display_name":"Engineering","level":0,"score":0.15625503659248352},{"id":"https://openalex.org/C31258907","wikidata":"https://www.wikidata.org/wiki/Q1301371","display_name":"Computer network","level":1,"score":0.11102166771888733},{"id":"https://openalex.org/C114614502","wikidata":"https://www.wikidata.org/wiki/Q76592","display_name":"Combinatorics","level":1,"score":0.10751950740814209},{"id":"https://openalex.org/C108037233","wikidata":"https://www.wikidata.org/wiki/Q11375","display_name":"Wireless network","level":3,"score":0.0},{"id":"https://openalex.org/C76155785","wikidata":"https://www.wikidata.org/wiki/Q418","display_name":"Telecommunications","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/C555944384","wikidata":"https://www.wikidata.org/wiki/Q249","display_name":"Wireless","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/C78519656","wikidata":"https://www.wikidata.org/wiki/Q101333","display_name":"Mechanical engineering","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},{"id":"https://openalex.org/C199360897","wikidata":"https://www.wikidata.org/wiki/Q9143","display_name":"Programming language","level":1,"score":0.0}],"mesh":[],"locations_count":4,"locations":[{"id":"doi:10.1145/1989493.1989521","is_oa":false,"landing_page_url":"https://doi.org/10.1145/1989493.1989521","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Proceedings of the twenty-third annual ACM symposium on Parallelism in algorithms and architectures","raw_type":"proceedings-article"},{"id":"pmh:oai:CiteSeerX.psu:10.1.1.723.7168","is_oa":false,"landing_page_url":"http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.723.7168","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"http://www.cs.le.ac.uk/people/terlebach/papers/spaa2011.pdf","raw_type":"text"},{"id":"pmh:oai:figshare.com:article/10103741","is_oa":true,"landing_page_url":"https://figshare.com/articles/conference_contribution/Maximising_lifetime_for_fault-tolerant_target_coverage_in_sensor_networks/10103741","pdf_url":null,"source":{"id":"https://openalex.org/S4377196282","display_name":"Figshare","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"host_organization":"https://openalex.org/I4210132348","host_organization_name":"Figshare (United Kingdom)","host_organization_lineage":["https://openalex.org/I4210132348"],"host_organization_lineage_names":[],"type":"repository"},"license":"cc-by","license_id":"https://openalex.org/licenses/cc-by","version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"","raw_type":"Text"},{"id":"pmh:oai:lra.le.ac.uk:2381/10169","is_oa":false,"landing_page_url":"http://dl.acm.org/citation.cfm?id=1989493.1989521","pdf_url":null,"source":{"id":"https://openalex.org/S4306402365","display_name":"Leicester Research Archive (University of Leicester)","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"host_organization":"https://openalex.org/I153648349","host_organization_name":"University of Leicester","host_organization_lineage":["https://openalex.org/I153648349"],"host_organization_lineage_names":[],"type":"repository"},"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"","raw_type":"Conference Paper"}],"best_oa_location":{"id":"pmh:oai:figshare.com:article/10103741","is_oa":true,"landing_page_url":"https://figshare.com/articles/conference_contribution/Maximising_lifetime_for_fault-tolerant_target_coverage_in_sensor_networks/10103741","pdf_url":null,"source":{"id":"https://openalex.org/S4377196282","display_name":"Figshare","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"host_organization":"https://openalex.org/I4210132348","host_organization_name":"Figshare (United Kingdom)","host_organization_lineage":["https://openalex.org/I4210132348"],"host_organization_lineage_names":[],"type":"repository"},"license":"cc-by","license_id":"https://openalex.org/licenses/cc-by","version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"","raw_type":"Text"},"sustainable_development_goals":[],"awards":[],"funders":[],"has_content":{"pdf":false,"grobid_xml":false},"content_urls":null,"referenced_works_count":22,"referenced_works":["https://openalex.org/W1495791449","https://openalex.org/W1579968022","https://openalex.org/W1607840687","https://openalex.org/W1982267100","https://openalex.org/W1991055327","https://openalex.org/W1998475832","https://openalex.org/W2001352447","https://openalex.org/W2063572899","https://openalex.org/W2063726026","https://openalex.org/W2100961486","https://openalex.org/W2108135277","https://openalex.org/W2121666810","https://openalex.org/W2122205547","https://openalex.org/W2130382583","https://openalex.org/W2141821897","https://openalex.org/W2145311081","https://openalex.org/W2155234080","https://openalex.org/W2166022623","https://openalex.org/W2220232453","https://openalex.org/W2629001168","https://openalex.org/W4285719527","https://openalex.org/W6676240169"],"related_works":["https://openalex.org/W2147086810","https://openalex.org/W4376639562","https://openalex.org/W1594413663","https://openalex.org/W1496354680","https://openalex.org/W2102199239","https://openalex.org/W2952847377","https://openalex.org/W2099799577","https://openalex.org/W2019216770","https://openalex.org/W1517616038","https://openalex.org/W2782292024"],"abstract_inverted_index":{"We":[0,45,124],"study":[1],"the":[2,6,27,38,83,90,104,138,142,147,156,162,187],"problem":[3,131,144,167],"of":[4,8,30,33,40,65,145,149,186],"maximising":[5],"lifetime":[7],"a":[9,17,23,31,63,99,126,150,192],"sensor":[10,48,78,122,152,165],"network":[11],"for":[12,129,141,161,172],"fault-tolerant":[13,151,164],"target":[14],"coverage":[15],"in":[16,82,110],"setting":[18],"with":[19,103,137,176],"composite":[20,24,69],"events.":[21],"Here,":[22],"event":[25,60,113],"is":[26,96,115,181],"simultaneous":[28],"occurrence":[29],"combination":[32],"atomic":[34],"events,":[35],"such":[36],"as":[37],"detection":[39],"smoke":[41],"and":[42,56,62,77,86,154,180],"high":[43],"temperature.":[44],"are":[46,80],"given":[47],"nodes":[49,79,88],"that":[50,106,190],"have":[51,89],"an":[52,134],"initial":[53],"battery":[54],"level":[55],"can":[57],"monitor":[58],"certain":[59],"types,":[61],"set":[64,174],"points":[66,76],"at":[67,107,118],"which":[68],"events":[70],"need":[71],"to":[72,97],"be":[73],"detected.":[74],"The":[75,94],"located":[81],"Euclidean":[84],"plane,":[85],"all":[87],"same":[91,139],"sensing":[92],"radius.":[93],"goal":[95],"compute":[98],"longest":[100],"activity":[101],"schedule":[102],"property":[105],"any":[108],"point":[109,114],"time,":[111],"each":[112],"monitored":[116],"by":[117,132,183],"least":[119],"two":[120],"active":[121],"nodes.":[123],"present":[125],"(6+\u03b5)-approximation":[127],"algorithm":[128,136,160],"this":[130],"devising":[133],"approximation":[135,170],"ratio":[140],"dual":[143],"minimising":[146],"weight":[148],"cover":[153,166,175],"applying":[155],"Garg-K\u00f6nemann":[157],"algorithm.":[158],"Our":[159],"minimum-weight":[163],"generalises":[168],"previous":[169],"algorithms":[171],"geometric":[173],"weighted":[177],"unit":[178],"disks":[179],"obtained":[182],"enumerating":[184],"properties":[185],"optimal":[188],"solution":[189],"guide":[191],"dynamic":[193],"programming":[194],"approach.":[195]},"counts_by_year":[{"year":2025,"cited_by_count":1},{"year":2018,"cited_by_count":1},{"year":2016,"cited_by_count":1},{"year":2015,"cited_by_count":2},{"year":2014,"cited_by_count":1},{"year":2013,"cited_by_count":3},{"year":2012,"cited_by_count":1}],"updated_date":"2026-04-04T16:13:02.066488","created_date":"2025-10-10T00:00:00"}