{"id":"https://openalex.org/W2103613456","doi":"https://doi.org/10.1145/2629662","title":"Building Maximum Lifetime Shortest Path Data Aggregation Trees in Wireless Sensor Networks","display_name":"Building Maximum Lifetime Shortest Path Data Aggregation Trees in Wireless Sensor Networks","publication_year":2014,"publication_date":"2014-07-17","ids":{"openalex":"https://openalex.org/W2103613456","doi":"https://doi.org/10.1145/2629662","mag":"2103613456"},"language":"en","primary_location":{"id":"doi:10.1145/2629662","is_oa":false,"landing_page_url":"https://doi.org/10.1145/2629662","pdf_url":null,"source":{"id":"https://openalex.org/S170502224","display_name":"ACM Transactions on Sensor Networks","issn_l":"1550-4859","issn":["1550-4859","1550-4867"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310319798","host_organization_name":"Association for Computing Machinery","host_organization_lineage":["https://openalex.org/P4310319798"],"host_organization_lineage_names":["Association for Computing Machinery"],"type":"journal"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"ACM Transactions on Sensor Networks","raw_type":"journal-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/A5068616308","display_name":"Mengfan Shan","orcid":null},"institutions":[{"id":"https://openalex.org/I881766915","display_name":"Nanjing University","ror":"https://ror.org/01rxvg760","country_code":"CN","type":"education","lineage":["https://openalex.org/I881766915"]}],"countries":["CN"],"is_corresponding":true,"raw_author_name":"Mengfan Shan","raw_affiliation_strings":["Nanjing University, Nanjing, China"],"affiliations":[{"raw_affiliation_string":"Nanjing University, Nanjing, China","institution_ids":["https://openalex.org/I881766915"]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5100428808","display_name":"Guihai Chen","orcid":"https://orcid.org/0000-0002-6934-1685"},"institutions":[{"id":"https://openalex.org/I881766915","display_name":"Nanjing University","ror":"https://ror.org/01rxvg760","country_code":"CN","type":"education","lineage":["https://openalex.org/I881766915"]}],"countries":["CN"],"is_corresponding":false,"raw_author_name":"Guihai Chen","raw_affiliation_strings":["Nanjing University, Nanjing, China"],"affiliations":[{"raw_affiliation_string":"Nanjing University, Nanjing, China","institution_ids":["https://openalex.org/I881766915"]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5101186016","display_name":"Dijun Luo","orcid":null},"institutions":[{"id":"https://openalex.org/I881766915","display_name":"Nanjing University","ror":"https://ror.org/01rxvg760","country_code":"CN","type":"education","lineage":["https://openalex.org/I881766915"]}],"countries":["CN"],"is_corresponding":false,"raw_author_name":"Dijun Luo","raw_affiliation_strings":["Nanjing University, Nanjing, China"],"affiliations":[{"raw_affiliation_string":"Nanjing University, Nanjing, China","institution_ids":["https://openalex.org/I881766915"]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5011796495","display_name":"Xiaojun Zhu","orcid":"https://orcid.org/0000-0003-0931-2927"},"institutions":[{"id":"https://openalex.org/I881766915","display_name":"Nanjing University","ror":"https://ror.org/01rxvg760","country_code":"CN","type":"education","lineage":["https://openalex.org/I881766915"]}],"countries":["CN"],"is_corresponding":false,"raw_author_name":"Xiaojun Zhu","raw_affiliation_strings":["Nanjing University, Nanjing, China"],"affiliations":[{"raw_affiliation_string":"Nanjing University, Nanjing, China","institution_ids":["https://openalex.org/I881766915"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5065158162","display_name":"Xiaobing Wu","orcid":"https://orcid.org/0000-0002-2823-2634"},"institutions":[{"id":"https://openalex.org/I881766915","display_name":"Nanjing University","ror":"https://ror.org/01rxvg760","country_code":"CN","type":"education","lineage":["https://openalex.org/I881766915"]}],"countries":["CN"],"is_corresponding":false,"raw_author_name":"Xiaobing Wu","raw_affiliation_strings":["Nanjing University, Nanjing, China"],"affiliations":[{"raw_affiliation_string":"Nanjing University, Nanjing, China","institution_ids":["https://openalex.org/I881766915"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":5,"corresponding_author_ids":["https://openalex.org/A5068616308"],"corresponding_institution_ids":["https://openalex.org/I881766915"],"apc_list":null,"apc_paid":null,"fwci":9.7123,"has_fulltext":false,"cited_by_count":65,"citation_normalized_percentile":{"value":0.98219395,"is_in_top_1_percent":false,"is_in_top_10_percent":true},"cited_by_percentile_year":{"min":90,"max":99},"biblio":{"volume":"11","issue":"1","first_page":"1","last_page":"24"},"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.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/T11498","display_name":"Security in Wireless Sensor Networks","score":0.9937999844551086,"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/shortest-path-problem","display_name":"Shortest path problem","score":0.8214083909988403},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.7834277153015137},{"id":"https://openalex.org/keywords/wireless-sensor-network","display_name":"Wireless sensor network","score":0.7485812306404114},{"id":"https://openalex.org/keywords/spanning-tree","display_name":"Spanning tree","score":0.6206642389297485},{"id":"https://openalex.org/keywords/shortest-path-tree","display_name":"Shortest-path tree","score":0.6060725450515747},{"id":"https://openalex.org/keywords/tree","display_name":"Tree (set theory)","score":0.556157112121582},{"id":"https://openalex.org/keywords/computer-network","display_name":"Computer network","score":0.5204629898071289},{"id":"https://openalex.org/keywords/routing","display_name":"Routing (electronic design automation)","score":0.46741676330566406},{"id":"https://openalex.org/keywords/path","display_name":"Path (computing)","score":0.4527303874492645},{"id":"https://openalex.org/keywords/data-aggregator","display_name":"Data aggregator","score":0.4471905827522278},{"id":"https://openalex.org/keywords/routing-protocol","display_name":"Routing protocol","score":0.440236359834671},{"id":"https://openalex.org/keywords/time-complexity","display_name":"Time complexity","score":0.4102194905281067},{"id":"https://openalex.org/keywords/distributed-computing","display_name":"Distributed computing","score":0.40179991722106934},{"id":"https://openalex.org/keywords/minimum-spanning-tree","display_name":"Minimum spanning tree","score":0.3700293004512787},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.24713316559791565},{"id":"https://openalex.org/keywords/theoretical-computer-science","display_name":"Theoretical computer science","score":0.18321597576141357},{"id":"https://openalex.org/keywords/graph","display_name":"Graph","score":0.13974788784980774},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.11992624402046204}],"concepts":[{"id":"https://openalex.org/C22590252","wikidata":"https://www.wikidata.org/wiki/Q1058754","display_name":"Shortest path problem","level":3,"score":0.8214083909988403},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.7834277153015137},{"id":"https://openalex.org/C24590314","wikidata":"https://www.wikidata.org/wiki/Q336038","display_name":"Wireless sensor network","level":2,"score":0.7485812306404114},{"id":"https://openalex.org/C64331007","wikidata":"https://www.wikidata.org/wiki/Q831672","display_name":"Spanning tree","level":2,"score":0.6206642389297485},{"id":"https://openalex.org/C23394520","wikidata":"https://www.wikidata.org/wiki/Q4919350","display_name":"Shortest-path tree","level":3,"score":0.6060725450515747},{"id":"https://openalex.org/C113174947","wikidata":"https://www.wikidata.org/wiki/Q2859736","display_name":"Tree (set theory)","level":2,"score":0.556157112121582},{"id":"https://openalex.org/C31258907","wikidata":"https://www.wikidata.org/wiki/Q1301371","display_name":"Computer network","level":1,"score":0.5204629898071289},{"id":"https://openalex.org/C74172769","wikidata":"https://www.wikidata.org/wiki/Q1446839","display_name":"Routing (electronic design automation)","level":2,"score":0.46741676330566406},{"id":"https://openalex.org/C2777735758","wikidata":"https://www.wikidata.org/wiki/Q817765","display_name":"Path (computing)","level":2,"score":0.4527303874492645},{"id":"https://openalex.org/C82578977","wikidata":"https://www.wikidata.org/wiki/Q16773055","display_name":"Data aggregator","level":3,"score":0.4471905827522278},{"id":"https://openalex.org/C104954878","wikidata":"https://www.wikidata.org/wiki/Q1648707","display_name":"Routing protocol","level":3,"score":0.440236359834671},{"id":"https://openalex.org/C311688","wikidata":"https://www.wikidata.org/wiki/Q2393193","display_name":"Time complexity","level":2,"score":0.4102194905281067},{"id":"https://openalex.org/C120314980","wikidata":"https://www.wikidata.org/wiki/Q180634","display_name":"Distributed computing","level":1,"score":0.40179991722106934},{"id":"https://openalex.org/C13743678","wikidata":"https://www.wikidata.org/wiki/Q240464","display_name":"Minimum spanning tree","level":2,"score":0.3700293004512787},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.24713316559791565},{"id":"https://openalex.org/C80444323","wikidata":"https://www.wikidata.org/wiki/Q2878974","display_name":"Theoretical computer science","level":1,"score":0.18321597576141357},{"id":"https://openalex.org/C132525143","wikidata":"https://www.wikidata.org/wiki/Q141488","display_name":"Graph","level":2,"score":0.13974788784980774},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.11992624402046204},{"id":"https://openalex.org/C114614502","wikidata":"https://www.wikidata.org/wiki/Q76592","display_name":"Combinatorics","level":1,"score":0.0},{"id":"https://openalex.org/C134306372","wikidata":"https://www.wikidata.org/wiki/Q7754","display_name":"Mathematical analysis","level":1,"score":0.0}],"mesh":[],"locations_count":2,"locations":[{"id":"doi:10.1145/2629662","is_oa":false,"landing_page_url":"https://doi.org/10.1145/2629662","pdf_url":null,"source":{"id":"https://openalex.org/S170502224","display_name":"ACM Transactions on Sensor Networks","issn_l":"1550-4859","issn":["1550-4859","1550-4867"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310319798","host_organization_name":"Association for Computing Machinery","host_organization_lineage":["https://openalex.org/P4310319798"],"host_organization_lineage_names":["Association for Computing Machinery"],"type":"journal"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"ACM Transactions on Sensor Networks","raw_type":"journal-article"},{"id":"pmh:oai:CiteSeerX.psu:10.1.1.716.573","is_oa":false,"landing_page_url":"http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.716.573","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"http://xzhu.info/resource/tosn2014-shan.pdf","raw_type":"text"}],"best_oa_location":null,"sustainable_development_goals":[{"id":"https://metadata.un.org/sdg/7","score":0.8999999761581421,"display_name":"Affordable and clean energy"}],"awards":[{"id":"https://openalex.org/G1047252294","display_name":null,"funder_award_id":"2014CB340300 and 2012CB316200","funder_id":"https://openalex.org/F4320321540","funder_display_name":"Ministry of Science and Technology of the People's Republic of China"},{"id":"https://openalex.org/G8512701132","display_name":null,"funder_award_id":"61133006, 61321491, and 61373130","funder_id":"https://openalex.org/F4320321001","funder_display_name":"National Natural Science Foundation of China"}],"funders":[{"id":"https://openalex.org/F4320321001","display_name":"National Natural Science Foundation of China","ror":"https://ror.org/01h0zpd94"},{"id":"https://openalex.org/F4320321540","display_name":"Ministry of Science and Technology of the People's Republic of China","ror":"https://ror.org/027s68j25"}],"has_content":{"grobid_xml":false,"pdf":false},"content_urls":null,"referenced_works_count":32,"referenced_works":["https://openalex.org/W1606343334","https://openalex.org/W1612873298","https://openalex.org/W1964917131","https://openalex.org/W1974616671","https://openalex.org/W1980952440","https://openalex.org/W2011039300","https://openalex.org/W2023037424","https://openalex.org/W2056541664","https://openalex.org/W2070251867","https://openalex.org/W2082863982","https://openalex.org/W2085443650","https://openalex.org/W2096200917","https://openalex.org/W2100617218","https://openalex.org/W2106334612","https://openalex.org/W2111672462","https://openalex.org/W2118498353","https://openalex.org/W2123336539","https://openalex.org/W2123976939","https://openalex.org/W2126409482","https://openalex.org/W2127949150","https://openalex.org/W2130347912","https://openalex.org/W2133320756","https://openalex.org/W2144201174","https://openalex.org/W2149296408","https://openalex.org/W2157090751","https://openalex.org/W2160343401","https://openalex.org/W2169542876","https://openalex.org/W2256369946","https://openalex.org/W2561675875","https://openalex.org/W2752885492","https://openalex.org/W3014094413","https://openalex.org/W4285719527"],"related_works":["https://openalex.org/W2149927264","https://openalex.org/W4308416203","https://openalex.org/W4224251989","https://openalex.org/W2099915933","https://openalex.org/W1991421283","https://openalex.org/W4220861011","https://openalex.org/W2387385213","https://openalex.org/W2418231958","https://openalex.org/W2071845176","https://openalex.org/W2307044859"],"abstract_inverted_index":{"In":[0,17,86],"wireless":[1,103],"sensor":[2,39,104],"networks,":[3],"the":[4,35,92,148,151],"spanning":[5,67],"tree":[6,46,82],"is":[7,50,74],"usually":[8],"used":[9],"as":[10],"a":[11,128,133],"routing":[12],"structure":[13],"to":[14,24,42,58,76,111,158,165],"collect":[15],"data.":[16],"some":[18],"situations,":[19],"nodes":[20],"do":[21],"in-network":[22],"aggregation":[23,45,100,118,168],"reduce":[25],"transmissions,":[26],"save":[27],"energy,":[28],"and":[29,131,153,169],"maximize":[30],"network":[31,152],"lifetime.":[32],"Because":[33],"of":[34,38,47,94,150],"restricted":[36,110],"energy":[37],"nodes,":[40],"how":[41],"build":[43],"an":[44,51,78],"maximum":[48,96,116],"lifetime":[49,97,117,149],"important":[52],"issue.":[53],"It":[54],"has":[55],"been":[56],"proved":[57],"be":[59,121],"NP-complete":[60],"in":[61,102,123],"previous":[62],"works.":[63],"As":[64],"shortest":[65,80,98,112],"path":[66,81,99,113],"trees":[68,101,119],"intuitively":[69],"have":[70],"short":[71],"delay,":[72],"it":[73],"imperative":[75],"find":[77],"energy-efficient":[79],"for":[83,136],"time-critical":[84],"applications.":[85],"this":[87],"article,":[88],"we":[89],"first":[90],"study":[91],"problem":[93],"building":[95,115,137],"networks.":[105],"We":[106,126,161],"show":[107,142],"that":[108,143],"when":[109],"trees,":[114],"can":[120],"solved":[122],"polynomial":[124],"time.":[125],"present":[127,170],"centralized":[129],"algorithm":[130],"design":[132],"distributed":[134],"protocol":[135],"such":[138],"trees.":[139],"Simulation":[140],"results":[141],"our":[144,163],"approaches":[145],"greatly":[146],"improve":[147],"are":[154],"very":[155],"effective":[156],"compared":[157],"other":[159],"solutions.":[160],"extend":[162],"discussion":[164],"networks":[166],"without":[167],"interesting":[171],"results.":[172]},"counts_by_year":[{"year":2025,"cited_by_count":2},{"year":2024,"cited_by_count":2},{"year":2023,"cited_by_count":3},{"year":2022,"cited_by_count":3},{"year":2021,"cited_by_count":5},{"year":2020,"cited_by_count":5},{"year":2019,"cited_by_count":9},{"year":2018,"cited_by_count":9},{"year":2017,"cited_by_count":10},{"year":2016,"cited_by_count":7},{"year":2015,"cited_by_count":9},{"year":2014,"cited_by_count":1}],"updated_date":"2026-04-05T17:49:38.594831","created_date":"2025-10-10T00:00:00"}