{"id":"https://openalex.org/W2155150833","doi":"https://doi.org/10.1109/wowmom.2008.4594858","title":"A combinatorial algorithm for the Maximum Lifetime Data Gathering And Aggregation problem in sensor networks","display_name":"A combinatorial algorithm for the Maximum Lifetime Data Gathering And Aggregation problem in sensor networks","publication_year":2008,"publication_date":"2008-06-01","ids":{"openalex":"https://openalex.org/W2155150833","doi":"https://doi.org/10.1109/wowmom.2008.4594858","mag":"2155150833"},"language":"en","primary_location":{"id":"doi:10.1109/wowmom.2008.4594858","is_oa":false,"landing_page_url":"https://doi.org/10.1109/wowmom.2008.4594858","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"2008 International Symposium on a World of Wireless, Mobile and Multimedia Networks","raw_type":"proceedings-article"},"type":"conference-paper","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/A5020847214","display_name":"Konstantinos Kalpakis","orcid":"https://orcid.org/0000-0002-4827-2828"},"institutions":[{"id":"https://openalex.org/I126744593","display_name":"University of Maryland, Baltimore","ror":"https://ror.org/04rq5mt64","country_code":"US","type":"education","lineage":["https://openalex.org/I126744593"]}],"countries":["US"],"is_corresponding":false,"raw_author_name":"Konstantinos Kalpakis","raw_affiliation_strings":["Computer Science & Electrical Engineering Department, University of Maryland, Baltimore, USA"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Computer Science & Electrical Engineering Department, University of Maryland, Baltimore, USA","institution_ids":["https://openalex.org/I126744593"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5072090932","display_name":"Shilang Tang","orcid":null},"institutions":[{"id":"https://openalex.org/I126744593","display_name":"University of Maryland, Baltimore","ror":"https://ror.org/04rq5mt64","country_code":"US","type":"education","lineage":["https://openalex.org/I126744593"]}],"countries":["US"],"is_corresponding":false,"raw_author_name":"Shilang Tang","raw_affiliation_strings":["Computer Science & Electrical Engineering Department, University of Maryland, Baltimore, USA"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Computer Science & Electrical Engineering Department, University of Maryland, Baltimore, USA","institution_ids":["https://openalex.org/I126744593"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":1,"corresponding_author_ids":[],"corresponding_institution_ids":["https://openalex.org/I126744593"],"apc_list":null,"apc_paid":null,"fwci":0.5092,"has_fulltext":false,"cited_by_count":10,"citation_normalized_percentile":{"value":0.61137613,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":{"min":89,"max":98},"biblio":{"volume":"lncs 1815","issue":null,"first_page":"1","last_page":"8"},"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.9998000264167786,"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.9998000264167786,"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.9927999973297119,"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/T10249","display_name":"Distributed Control Multi-Agent Systems","score":0.9761999845504761,"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/algorithm","display_name":"Algorithm","score":0.6084302663803101},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.6066737174987793},{"id":"https://openalex.org/keywords/network-topology","display_name":"Network topology","score":0.5743159651756287},{"id":"https://openalex.org/keywords/rounding","display_name":"Rounding","score":0.5704867243766785},{"id":"https://openalex.org/keywords/tree","display_name":"Tree (set theory)","score":0.4956158399581909},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.3291743993759155},{"id":"https://openalex.org/keywords/combinatorics","display_name":"Combinatorics","score":0.248896986246109},{"id":"https://openalex.org/keywords/computer-network","display_name":"Computer network","score":0.07740330696105957}],"concepts":[{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.6084302663803101},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.6066737174987793},{"id":"https://openalex.org/C199845137","wikidata":"https://www.wikidata.org/wiki/Q145490","display_name":"Network topology","level":2,"score":0.5743159651756287},{"id":"https://openalex.org/C136625980","wikidata":"https://www.wikidata.org/wiki/Q663208","display_name":"Rounding","level":2,"score":0.5704867243766785},{"id":"https://openalex.org/C113174947","wikidata":"https://www.wikidata.org/wiki/Q2859736","display_name":"Tree (set theory)","level":2,"score":0.4956158399581909},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.3291743993759155},{"id":"https://openalex.org/C114614502","wikidata":"https://www.wikidata.org/wiki/Q76592","display_name":"Combinatorics","level":1,"score":0.248896986246109},{"id":"https://openalex.org/C31258907","wikidata":"https://www.wikidata.org/wiki/Q1301371","display_name":"Computer network","level":1,"score":0.07740330696105957},{"id":"https://openalex.org/C111919701","wikidata":"https://www.wikidata.org/wiki/Q9135","display_name":"Operating system","level":1,"score":0.0}],"mesh":[],"locations_count":1,"locations":[{"id":"doi:10.1109/wowmom.2008.4594858","is_oa":false,"landing_page_url":"https://doi.org/10.1109/wowmom.2008.4594858","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"2008 International Symposium on a World of Wireless, Mobile and Multimedia Networks","raw_type":"proceedings-article"}],"best_oa_location":null,"sustainable_development_goals":[{"display_name":"Affordable and clean energy","id":"https://metadata.un.org/sdg/7","score":0.8600000143051147}],"awards":[],"funders":[],"has_content":{"grobid_xml":false,"pdf":false},"content_urls":null,"referenced_works_count":35,"referenced_works":["https://openalex.org/W1557310162","https://openalex.org/W1581215653","https://openalex.org/W1604406970","https://openalex.org/W1762430620","https://openalex.org/W1970592111","https://openalex.org/W1988615825","https://openalex.org/W2053480573","https://openalex.org/W2059632502","https://openalex.org/W2085443650","https://openalex.org/W2087884895","https://openalex.org/W2094619585","https://openalex.org/W2105327482","https://openalex.org/W2106335692","https://openalex.org/W2110173519","https://openalex.org/W2115187901","https://openalex.org/W2117520883","https://openalex.org/W2122179278","https://openalex.org/W2123411230","https://openalex.org/W2124804629","https://openalex.org/W2130403046","https://openalex.org/W2132895032","https://openalex.org/W2133443216","https://openalex.org/W2141351680","https://openalex.org/W2142372059","https://openalex.org/W2148251644","https://openalex.org/W2151157922","https://openalex.org/W2153943699","https://openalex.org/W2161118867","https://openalex.org/W2165956524","https://openalex.org/W2167396179","https://openalex.org/W2169542876","https://openalex.org/W2172131322","https://openalex.org/W2176466527","https://openalex.org/W4210431029","https://openalex.org/W4285719527"],"related_works":["https://openalex.org/W4220780102","https://openalex.org/W1502401885","https://openalex.org/W2410881844","https://openalex.org/W3196334750","https://openalex.org/W2004257129","https://openalex.org/W2116281088","https://openalex.org/W2016668641","https://openalex.org/W2357551824","https://openalex.org/W2019368960","https://openalex.org/W2349094459"],"abstract_inverted_index":{"The":[0],"Maximum":[1],"Lifetime":[2],"Data":[3],"Gathering":[4],"and":[5,98,108,164],"Aggregation":[6],"(MLDA)":[7],"problem":[8,46,87,151],"is":[9,157],"concerned":[10],"with":[11,27,55],"maximizing":[12],"the":[13,31,36,44,56,85,105,113,126,149,153,162,167],"system":[14],"lifetime":[15,70,100],"T":[16,22,42],"so":[17],"that":[18,88],"we":[19,160],"can":[20],"perform":[21],"rounds":[23,59],"of":[24,35,40,48,51,58,90,166],"data":[25],"gathering":[26],"in-network":[28],"aggregation,":[29],"given":[30],"initial":[32,109],"available":[33,111],"energy":[34,110],"sensors.":[37,114],"A":[38],"solution":[39,83,121,156],"value":[41],"to":[43,68,84,92,148],"MLDA":[45,86,150],"consists":[47,89],"a":[49,74],"collection":[50],"aggregation":[52,96],"trees":[53,97],"together":[54],"number":[57],"each":[60],"such":[61],"tree":[62],"should":[63],"be":[64],"used":[65],"in":[66,135],"order":[67],"achieve":[69],"T.":[71],"We":[72,115,142],"describe":[73],"combinatorial":[75],"iterative":[76],"algorithm":[77,169],"for":[78],"finding":[79],"an":[80,117],"optimal":[81,119,127,145,154],"continuous":[82,128,155],"up":[91],"n":[93],"-":[94],"1":[95],"achieves":[99],"To,":[101],"which":[102],"depends":[103],"on":[104],"network":[106],"topology":[107],"at":[112],"obtain":[116],"\u03b1-approximate":[118],"integral":[120,146],"by":[122],"simply":[123],"rounding":[124],"down":[125],"solution,":[129],"where":[130],"\u03b1":[131,139],"=":[132],"(To\u2212n+1)/To.":[133],"Since":[134],"practice":[136],"To\u226b":[137],"n,":[138],"\u2248":[140],"1.":[141],"get":[143],"asymptotically":[144],"solutions":[147],"whenever":[152],"\u03c9(n).":[158],"Furthermore,":[159],"demonstrate":[161],"efficiency":[163],"effectiveness":[165],"proposed":[168],"via":[170],"extensive":[171],"experimental":[172],"results.":[173]},"counts_by_year":[{"year":2018,"cited_by_count":1},{"year":2014,"cited_by_count":1},{"year":2013,"cited_by_count":5},{"year":2012,"cited_by_count":1}],"updated_date":"2026-07-29T14:22:42.915294","created_date":"2025-10-10T00:00:00"}