{"id":"https://openalex.org/W2171170336","doi":"https://doi.org/10.1109/icc.2010.5502286","title":"Constructing Maximum-Lifetime Data Gathering Trees in Sensor Networks with Data Aggregation","display_name":"Constructing Maximum-Lifetime Data Gathering Trees in Sensor Networks with Data Aggregation","publication_year":2010,"publication_date":"2010-05-01","ids":{"openalex":"https://openalex.org/W2171170336","doi":"https://doi.org/10.1109/icc.2010.5502286","mag":"2171170336"},"language":"en","primary_location":{"id":"doi:10.1109/icc.2010.5502286","is_oa":false,"landing_page_url":"https://doi.org/10.1109/icc.2010.5502286","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"2010 IEEE International Conference on Communications","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/A5100688314","display_name":"Hwa-Chun Lin","orcid":"https://orcid.org/0000-0002-8811-8331"},"institutions":[{"id":"https://openalex.org/I25846049","display_name":"National Tsing Hua University","ror":"https://ror.org/00zdnkx70","country_code":"TW","type":"education","lineage":["https://openalex.org/I25846049"]}],"countries":["TW"],"is_corresponding":false,"raw_author_name":"H.-C. Lin","raw_affiliation_strings":["Department of Computer Science, National Tsing Hua University, Hsinchu, Taiwan"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Department of Computer Science, National Tsing Hua University, Hsinchu, Taiwan","institution_ids":["https://openalex.org/I25846049"]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5044526777","display_name":"F.-J. Li","orcid":null},"institutions":[{"id":"https://openalex.org/I25846049","display_name":"National Tsing Hua University","ror":"https://ror.org/00zdnkx70","country_code":"TW","type":"education","lineage":["https://openalex.org/I25846049"]}],"countries":["TW"],"is_corresponding":false,"raw_author_name":"F.-J. Li","raw_affiliation_strings":["Department of Computer Science, National Tsing Hua University, Hsinchu, Taiwan"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Department of Computer Science, National Tsing Hua University, Hsinchu, Taiwan","institution_ids":["https://openalex.org/I25846049"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5028301985","display_name":"K.-Y. Wang","orcid":null},"institutions":[{"id":"https://openalex.org/I25846049","display_name":"National Tsing Hua University","ror":"https://ror.org/00zdnkx70","country_code":"TW","type":"education","lineage":["https://openalex.org/I25846049"]}],"countries":["TW"],"is_corresponding":false,"raw_author_name":"K.-Y. Wang","raw_affiliation_strings":["Department of Computer Science, National Tsing Hua University, Hsinchu, Taiwan"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Department of Computer Science, National Tsing Hua University, Hsinchu, Taiwan","institution_ids":["https://openalex.org/I25846049"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":3,"corresponding_author_ids":[],"corresponding_institution_ids":[],"apc_list":null,"apc_paid":null,"fwci":4.4742,"has_fulltext":false,"cited_by_count":33,"citation_normalized_percentile":{"value":0.95002136,"is_in_top_1_percent":false,"is_in_top_10_percent":true},"cited_by_percentile_year":{"min":89,"max":99},"biblio":{"volume":null,"issue":null,"first_page":"1","last_page":"6"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T10080","display_name":"Energy Efficient Wireless Sensor Networks","score":1.0,"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":1.0,"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.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"}},{"id":"https://openalex.org/T11896","display_name":"Opportunistic and Delay-Tolerant Networks","score":0.9961000084877014,"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/tree","display_name":"Tree (set theory)","score":0.7186211943626404},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.660209596157074},{"id":"https://openalex.org/keywords/wireless-sensor-network","display_name":"Wireless sensor network","score":0.6271012425422668},{"id":"https://openalex.org/keywords/data-aggregator","display_name":"Data aggregator","score":0.6037700772285461},{"id":"https://openalex.org/keywords/data-collection","display_name":"Data collection","score":0.5663422346115112},{"id":"https://openalex.org/keywords/aggregate","display_name":"Aggregate (composite)","score":0.5420393347740173},{"id":"https://openalex.org/keywords/interval-tree","display_name":"Interval tree","score":0.5264561772346497},{"id":"https://openalex.org/keywords/construct","display_name":"Construct (python library)","score":0.4930267035961151},{"id":"https://openalex.org/keywords/segment-tree","display_name":"Segment tree","score":0.46369990706443787},{"id":"https://openalex.org/keywords/upper-and-lower-bounds","display_name":"Upper and lower bounds","score":0.4584571421146393},{"id":"https://openalex.org/keywords/transmission","display_name":"Transmission (telecommunications)","score":0.4455450773239136},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.4377000331878662},{"id":"https://openalex.org/keywords/data-transmission","display_name":"Data transmission","score":0.4366084337234497},{"id":"https://openalex.org/keywords/base-station","display_name":"Base station","score":0.432127982378006},{"id":"https://openalex.org/keywords/time-complexity","display_name":"Time complexity","score":0.41241830587387085},{"id":"https://openalex.org/keywords/tree-structure","display_name":"Tree structure","score":0.3630468249320984},{"id":"https://openalex.org/keywords/mathematical-optimization","display_name":"Mathematical optimization","score":0.3448040187358856},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.19621196389198303},{"id":"https://openalex.org/keywords/computer-network","display_name":"Computer network","score":0.16668549180030823},{"id":"https://openalex.org/keywords/binary-tree","display_name":"Binary tree","score":0.11727297306060791},{"id":"https://openalex.org/keywords/statistics","display_name":"Statistics","score":0.076131671667099}],"concepts":[{"id":"https://openalex.org/C113174947","wikidata":"https://www.wikidata.org/wiki/Q2859736","display_name":"Tree (set theory)","level":2,"score":0.7186211943626404},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.660209596157074},{"id":"https://openalex.org/C24590314","wikidata":"https://www.wikidata.org/wiki/Q336038","display_name":"Wireless sensor network","level":2,"score":0.6271012425422668},{"id":"https://openalex.org/C82578977","wikidata":"https://www.wikidata.org/wiki/Q16773055","display_name":"Data aggregator","level":3,"score":0.6037700772285461},{"id":"https://openalex.org/C133462117","wikidata":"https://www.wikidata.org/wiki/Q4929239","display_name":"Data collection","level":2,"score":0.5663422346115112},{"id":"https://openalex.org/C4679612","wikidata":"https://www.wikidata.org/wiki/Q866298","display_name":"Aggregate (composite)","level":2,"score":0.5420393347740173},{"id":"https://openalex.org/C84927040","wikidata":"https://www.wikidata.org/wiki/Q6057306","display_name":"Interval tree","level":4,"score":0.5264561772346497},{"id":"https://openalex.org/C2780801425","wikidata":"https://www.wikidata.org/wiki/Q5164392","display_name":"Construct (python library)","level":2,"score":0.4930267035961151},{"id":"https://openalex.org/C94557470","wikidata":"https://www.wikidata.org/wiki/Q2377385","display_name":"Segment tree","level":5,"score":0.46369990706443787},{"id":"https://openalex.org/C77553402","wikidata":"https://www.wikidata.org/wiki/Q13222579","display_name":"Upper and lower bounds","level":2,"score":0.4584571421146393},{"id":"https://openalex.org/C761482","wikidata":"https://www.wikidata.org/wiki/Q118093","display_name":"Transmission (telecommunications)","level":2,"score":0.4455450773239136},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.4377000331878662},{"id":"https://openalex.org/C557945733","wikidata":"https://www.wikidata.org/wiki/Q389772","display_name":"Data transmission","level":2,"score":0.4366084337234497},{"id":"https://openalex.org/C68649174","wikidata":"https://www.wikidata.org/wiki/Q1379116","display_name":"Base station","level":2,"score":0.432127982378006},{"id":"https://openalex.org/C311688","wikidata":"https://www.wikidata.org/wiki/Q2393193","display_name":"Time complexity","level":2,"score":0.41241830587387085},{"id":"https://openalex.org/C163797641","wikidata":"https://www.wikidata.org/wiki/Q2067937","display_name":"Tree structure","level":3,"score":0.3630468249320984},{"id":"https://openalex.org/C126255220","wikidata":"https://www.wikidata.org/wiki/Q141495","display_name":"Mathematical optimization","level":1,"score":0.3448040187358856},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.19621196389198303},{"id":"https://openalex.org/C31258907","wikidata":"https://www.wikidata.org/wiki/Q1301371","display_name":"Computer network","level":1,"score":0.16668549180030823},{"id":"https://openalex.org/C197855036","wikidata":"https://www.wikidata.org/wiki/Q380172","display_name":"Binary tree","level":2,"score":0.11727297306060791},{"id":"https://openalex.org/C105795698","wikidata":"https://www.wikidata.org/wiki/Q12483","display_name":"Statistics","level":1,"score":0.076131671667099},{"id":"https://openalex.org/C134306372","wikidata":"https://www.wikidata.org/wiki/Q7754","display_name":"Mathematical analysis","level":1,"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/C192562407","wikidata":"https://www.wikidata.org/wiki/Q228736","display_name":"Materials science","level":0,"score":0.0},{"id":"https://openalex.org/C159985019","wikidata":"https://www.wikidata.org/wiki/Q181790","display_name":"Composite material","level":1,"score":0.0}],"mesh":[],"locations_count":1,"locations":[{"id":"doi:10.1109/icc.2010.5502286","is_oa":false,"landing_page_url":"https://doi.org/10.1109/icc.2010.5502286","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"2010 IEEE International Conference on Communications","raw_type":"proceedings-article"}],"best_oa_location":null,"sustainable_development_goals":[],"awards":[],"funders":[{"id":"https://openalex.org/F4320321040","display_name":"National Science Council","ror":"https://ror.org/02kv4zf79"}],"has_content":{"pdf":false,"grobid_xml":false},"content_urls":null,"referenced_works_count":18,"referenced_works":["https://openalex.org/W1604406970","https://openalex.org/W1964917131","https://openalex.org/W2017927472","https://openalex.org/W2066700938","https://openalex.org/W2085443650","https://openalex.org/W2102580993","https://openalex.org/W2122179278","https://openalex.org/W2133320756","https://openalex.org/W2153943699","https://openalex.org/W2155150833","https://openalex.org/W2165956524","https://openalex.org/W2176466527","https://openalex.org/W2480020364","https://openalex.org/W2752885492","https://openalex.org/W2946046356","https://openalex.org/W3145128584","https://openalex.org/W3151600927","https://openalex.org/W7029321148"],"related_works":["https://openalex.org/W2359095153","https://openalex.org/W2227684440","https://openalex.org/W2042649304","https://openalex.org/W2280371997","https://openalex.org/W1979994068","https://openalex.org/W2343659340","https://openalex.org/W2160311168","https://openalex.org/W2156833871","https://openalex.org/W1521720839","https://openalex.org/W2083751087"],"abstract_inverted_index":{"This":[0],"paper":[1,90,119],"studies":[2],"the":[3,16,41,53,67,70,103,125,128,150,155,158,166],"problem":[4],"of":[5,19,69,107,127,157,165],"constructing":[6,81],"maximum-lifetime":[7],"data":[8,26,34,72,82,130,144],"gathering":[9,73,83,131,145],"trees":[10],"in":[11,14,47,88,101],"sensor":[12,33,45],"networks":[13,46],"which":[15,48],"power":[17,56,105],"levels":[18,106],"sensors":[20,49,108],"are":[21,37,109],"heterogeneous":[22,110],"and":[23,52,75,111,153],"adjustable.":[24,112],"In-network":[25],"aggregation":[27],"is":[28,91,139,168],"also":[29],"employed":[30],"to":[31,141,170],"aggregate":[32],"while":[35],"they":[36],"being":[38],"forwarded":[39],"toward":[40],"base":[42],"station.":[43],"For":[44,113],"have":[50],"fixed":[51],"same":[54],"transmission":[55,104],"level,":[57],"Wu":[58,98],"et":[59,99],"al.":[60,100],"has":[61],"derived":[62],"an":[63,77,121,134,137],"upper":[64,122],"bound":[65,123],"on":[66,124],"lifetime":[68,126,156],"optimal":[71,129],"tree":[74,146,152],"developed":[76,140],"approximation":[78],"algorithm":[79,138,167],"for":[80],"trees.":[84],"The":[85,161],"model":[86],"considered":[87,96],"this":[89,114,118],"more":[92,115],"general":[93,116],"than":[94],"that":[95,102],"by":[97,147],"model,":[117],"derives":[120],"tree.":[132,160],"Given":[133],"initial":[135],"tree,":[136],"construct":[142],"a":[143],"iteratively":[148],"rearranging":[149],"current":[151,159],"improving":[154],"worst-case":[162],"computational":[163],"complexity":[164],"shown":[169],"be":[171],"polynomial.":[172]},"counts_by_year":[{"year":2024,"cited_by_count":1},{"year":2023,"cited_by_count":1},{"year":2021,"cited_by_count":1},{"year":2020,"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":5},{"year":2014,"cited_by_count":6},{"year":2013,"cited_by_count":6},{"year":2012,"cited_by_count":4}],"updated_date":"2026-06-11T09:08:48.828518","created_date":"2025-10-10T00:00:00"}