{"id":"https://openalex.org/W3011193967","doi":"https://doi.org/10.1109/apcc47188.2019.9026510","title":"Network Lifetime Maximization for Full Area Coverage in Wireless Sensor Networks","display_name":"Network Lifetime Maximization for Full Area Coverage in Wireless Sensor Networks","publication_year":2019,"publication_date":"2019-11-01","ids":{"openalex":"https://openalex.org/W3011193967","doi":"https://doi.org/10.1109/apcc47188.2019.9026510","mag":"3011193967"},"language":"en","primary_location":{"id":"doi:10.1109/apcc47188.2019.9026510","is_oa":false,"landing_page_url":"https://doi.org/10.1109/apcc47188.2019.9026510","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"2019 25th Asia-Pacific Conference on Communications (APCC)","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/A5037414408","display_name":"Thanh Trung Nguyen","orcid":"https://orcid.org/0000-0002-7405-2984"},"institutions":[{"id":"https://openalex.org/I94518387","display_name":"Hanoi University of Science and Technology","ror":"https://ror.org/04nyv3z04","country_code":"VN","type":"education","lineage":["https://openalex.org/I94518387"]}],"countries":["VN"],"is_corresponding":true,"raw_author_name":"Nguyen Thanh Trung","raw_affiliation_strings":["School of Information and Communication Technology, Hanoi University of Science and Technology, Hanoi, Vietnam"],"affiliations":[{"raw_affiliation_string":"School of Information and Communication Technology, Hanoi University of Science and Technology, Hanoi, Vietnam","institution_ids":["https://openalex.org/I94518387"]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5101659993","display_name":"Nguyen Thanh Hung","orcid":"https://orcid.org/0009-0009-7871-8374"},"institutions":[{"id":"https://openalex.org/I94518387","display_name":"Hanoi University of Science and Technology","ror":"https://ror.org/04nyv3z04","country_code":"VN","type":"education","lineage":["https://openalex.org/I94518387"]}],"countries":["VN"],"is_corresponding":false,"raw_author_name":"Nguyen Thanh Hung","raw_affiliation_strings":["School of Information and Communication Technology, Hanoi University of Science and Technology, Hanoi, Vietnam"],"affiliations":[{"raw_affiliation_string":"School of Information and Communication Technology, Hanoi University of Science and Technology, Hanoi, Vietnam","institution_ids":["https://openalex.org/I94518387"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5058485829","display_name":"Phi Le Nguyen","orcid":"https://orcid.org/0000-0001-6547-7641"},"institutions":[{"id":"https://openalex.org/I94518387","display_name":"Hanoi University of Science and Technology","ror":"https://ror.org/04nyv3z04","country_code":"VN","type":"education","lineage":["https://openalex.org/I94518387"]}],"countries":["VN"],"is_corresponding":false,"raw_author_name":"Phi Le Nguyen","raw_affiliation_strings":["School of Information and Communication Technology, Hanoi University of Science and Technology, Hanoi, Vietnam"],"affiliations":[{"raw_affiliation_string":"School of Information and Communication Technology, Hanoi University of Science and Technology, Hanoi, Vietnam","institution_ids":["https://openalex.org/I94518387"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":3,"corresponding_author_ids":["https://openalex.org/A5037414408"],"corresponding_institution_ids":["https://openalex.org/I94518387"],"apc_list":null,"apc_paid":null,"fwci":0.0,"has_fulltext":false,"cited_by_count":1,"citation_normalized_percentile":{"value":0.24415132,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":{"min":91,"max":95},"biblio":{"volume":null,"issue":null,"first_page":"431","last_page":"436"},"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/T11392","display_name":"Energy Harvesting in Wireless Networks","score":0.9934999942779541,"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"}},{"id":"https://openalex.org/T10246","display_name":"Mobile Ad Hoc Networks","score":0.9909999966621399,"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/computer-science","display_name":"Computer science","score":0.7432247996330261},{"id":"https://openalex.org/keywords/divide-and-conquer-algorithms","display_name":"Divide and conquer algorithms","score":0.7348037958145142},{"id":"https://openalex.org/keywords/wireless-sensor-network","display_name":"Wireless sensor network","score":0.7074058651924133},{"id":"https://openalex.org/keywords/approximation-algorithm","display_name":"Approximation algorithm","score":0.6593541502952576},{"id":"https://openalex.org/keywords/column-generation","display_name":"Column generation","score":0.60736483335495},{"id":"https://openalex.org/keywords/maximization","display_name":"Maximization","score":0.5870459079742432},{"id":"https://openalex.org/keywords/mathematical-optimization","display_name":"Mathematical optimization","score":0.5501639246940613},{"id":"https://openalex.org/keywords/linear-programming","display_name":"Linear programming","score":0.504228949546814},{"id":"https://openalex.org/keywords/wireless-network","display_name":"Wireless network","score":0.4822695851325989},{"id":"https://openalex.org/keywords/scheduling","display_name":"Scheduling (production processes)","score":0.476576566696167},{"id":"https://openalex.org/keywords/wireless","display_name":"Wireless","score":0.3651973009109497},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.2692124545574188},{"id":"https://openalex.org/keywords/computer-network","display_name":"Computer network","score":0.1638372838497162},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.13989508152008057}],"concepts":[{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.7432247996330261},{"id":"https://openalex.org/C71559656","wikidata":"https://www.wikidata.org/wiki/Q671298","display_name":"Divide and conquer algorithms","level":2,"score":0.7348037958145142},{"id":"https://openalex.org/C24590314","wikidata":"https://www.wikidata.org/wiki/Q336038","display_name":"Wireless sensor network","level":2,"score":0.7074058651924133},{"id":"https://openalex.org/C148764684","wikidata":"https://www.wikidata.org/wiki/Q621751","display_name":"Approximation algorithm","level":2,"score":0.6593541502952576},{"id":"https://openalex.org/C168956720","wikidata":"https://www.wikidata.org/wiki/Q3123181","display_name":"Column generation","level":2,"score":0.60736483335495},{"id":"https://openalex.org/C2776330181","wikidata":"https://www.wikidata.org/wiki/Q18358244","display_name":"Maximization","level":2,"score":0.5870459079742432},{"id":"https://openalex.org/C126255220","wikidata":"https://www.wikidata.org/wiki/Q141495","display_name":"Mathematical optimization","level":1,"score":0.5501639246940613},{"id":"https://openalex.org/C41045048","wikidata":"https://www.wikidata.org/wiki/Q202843","display_name":"Linear programming","level":2,"score":0.504228949546814},{"id":"https://openalex.org/C108037233","wikidata":"https://www.wikidata.org/wiki/Q11375","display_name":"Wireless network","level":3,"score":0.4822695851325989},{"id":"https://openalex.org/C206729178","wikidata":"https://www.wikidata.org/wiki/Q2271896","display_name":"Scheduling (production processes)","level":2,"score":0.476576566696167},{"id":"https://openalex.org/C555944384","wikidata":"https://www.wikidata.org/wiki/Q249","display_name":"Wireless","level":2,"score":0.3651973009109497},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.2692124545574188},{"id":"https://openalex.org/C31258907","wikidata":"https://www.wikidata.org/wiki/Q1301371","display_name":"Computer network","level":1,"score":0.1638372838497162},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.13989508152008057},{"id":"https://openalex.org/C76155785","wikidata":"https://www.wikidata.org/wiki/Q418","display_name":"Telecommunications","level":1,"score":0.0}],"mesh":[],"locations_count":1,"locations":[{"id":"doi:10.1109/apcc47188.2019.9026510","is_oa":false,"landing_page_url":"https://doi.org/10.1109/apcc47188.2019.9026510","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"2019 25th Asia-Pacific Conference on Communications (APCC)","raw_type":"proceedings-article"}],"best_oa_location":null,"sustainable_development_goals":[{"score":0.4000000059604645,"display_name":"Industry, innovation and infrastructure","id":"https://metadata.un.org/sdg/9"}],"awards":[],"funders":[],"has_content":{"pdf":false,"grobid_xml":false},"content_urls":null,"referenced_works_count":10,"referenced_works":["https://openalex.org/W2010380541","https://openalex.org/W2063933261","https://openalex.org/W2065766579","https://openalex.org/W2106264338","https://openalex.org/W2241708051","https://openalex.org/W2571303926","https://openalex.org/W2777252451","https://openalex.org/W2792880844","https://openalex.org/W2849020821","https://openalex.org/W2973247266"],"related_works":["https://openalex.org/W2352794675","https://openalex.org/W1539994214","https://openalex.org/W2051228988","https://openalex.org/W4247094814","https://openalex.org/W108531593","https://openalex.org/W2111712077","https://openalex.org/W2060052838","https://openalex.org/W2367938014","https://openalex.org/W2201623492","https://openalex.org/W1578117578"],"abstract_inverted_index":{"Sensor":[0],"scheduling":[1],"for":[2,102],"maximizing":[3],"the":[4,9,34,45,54,65,74,93,99,110,114,119,124,135,143,150],"network":[5,94],"lifetime":[6],"and":[7,105],"achieving":[8],"full":[10],"area":[11],"coverage":[12],"is":[13,29,90],"a":[14,31,79],"paramount":[15],"problem":[16,28,55],"in":[17,70],"wireless":[18],"sensor":[19],"networks.":[20],"Although":[21],"considerable":[22],"effort":[23],"has":[24],"been":[25],"devoted,":[26],"this":[27,49],"still":[30],"challenge":[32],"to":[33,63,72,91,108],"research":[35],"community.":[36],"The":[37,87,139],"approximation":[38,132],"algorithms":[39,148],"proposed":[40,147],"so":[41],"far":[42],"couldn't":[43],"guarantee":[44],"performance":[46],"ratio.":[47],"In":[48],"paper,":[50],"we":[51,77,129],"first":[52],"formulate":[53],"under":[56],"linear":[57],"programming":[58],"model":[59],"which":[60],"can":[61],"help":[62],"determine":[64,98],"exact":[66],"optimal":[67],"solution.":[68],"Then,":[69],"order":[71],"reduce":[73],"time":[75],"complexity,":[76],"propose":[78,130],"(1":[80],"+\u220a)-approximation":[81],"algorithm":[82,133],"based":[83],"on":[84],"divide-and-conquer":[85],"technique.":[86],"main":[88],"idea":[89],"divide":[92],"into":[95],"sub-regions,":[96],"then":[97],"suboptimal":[100,125],"solution":[101,112,126],"every":[103],"sub-region":[104],"combine":[106],"them":[107],"obtain":[109],"total":[111],"of":[113,121,145],"whole":[115],"network.":[116],"Moreover,":[117],"with":[118],"aim":[120],"speeding":[122],"up":[123],"finding":[127],"process,":[128],"an":[131],"using":[134],"column":[136],"generation":[137],"approach.":[138],"experiment":[140],"results":[141],"show":[142],"superiority":[144],"our":[146],"over":[149],"existing":[151],"ones.":[152]},"counts_by_year":[{"year":2025,"cited_by_count":1}],"updated_date":"2026-01-13T01:12:25.745995","created_date":"2025-10-10T00:00:00"}