乐胖代购免代理版

{"id":"https://openalex.org/W2111672462","doi":"https://doi.org/10.1109/infcom.2011.5934947","title":"Maximizing lifetime for the shortest path aggregation tree in wireless sensor networks","display_name":"Maximizing lifetime for the shortest path aggregation tree in wireless sensor networks","publication_year":2011,"publication_date":"2011-04-01","ids":{"openalex":"https://openalex.org/W2111672462","doi":"https://doi.org/10.1109/infcom.2011.5934947","mag":"2111672462"},"language":"en","primary_location":{"is_oa":false,"landing_page_url":"https://doi.org/10.1109/infcom.2011.5934947","pdf_url":null,"source":null,"license":null,"license_id":null,"version":null,"is_accepted":false,"is_published":false},"type":"article","type_crossref":"proceedings-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/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":"funder","lineage":["https://openalex.org/I881766915"]}],"countries":["CN"],"is_corresponding":false,"raw_author_name":"Dijun Luo","raw_affiliation_strings":["State Key Laboratory for Novel Software Technology, NanJing University, China"],"affiliations":[{"raw_affiliation_string":"State Key Laboratory for Novel Software Technology, NanJing University, 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":"funder","lineage":["https://openalex.org/I881766915"]}],"countries":["CN"],"is_corresponding":false,"raw_author_name":"Xiaojun Zhu","raw_affiliation_strings":["State Key Laboratory for Novel Software Technology, NanJing University, China"],"affiliations":[{"raw_affiliation_string":"State Key Laboratory for Novel Software Technology, NanJing University, China","institution_ids":["https://openalex.org/I881766915"]}]},{"author_position":"middle","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":"funder","lineage":["https://openalex.org/I881766915"]}],"countries":["CN"],"is_corresponding":false,"raw_author_name":"Xiaobing Wu","raw_affiliation_strings":["State Key Laboratory for Novel Software Technology, NanJing University, China"],"affiliations":[{"raw_affiliation_string":"State Key Laboratory for Novel Software Technology, NanJing University, China","institution_ids":["https://openalex.org/I881766915"]}]},{"author_position":"last","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":"funder","lineage":["https://openalex.org/I881766915"]}],"countries":["CN"],"is_corresponding":false,"raw_author_name":"Guihai Chen","raw_affiliation_strings":["State Key Laboratory for Novel Software Technology, NanJing University, China"],"affiliations":[{"raw_affiliation_string":"State Key Laboratory for Novel Software Technology, NanJing University, China","institution_ids":["https://openalex.org/I881766915"]}]}],"institution_assertions":[],"countries_distinct_count":1,"institutions_distinct_count":1,"corresponding_author_ids":[],"corresponding_institution_ids":[],"apc_list":null,"apc_paid":null,"fwci":12.998,"has_fulltext":true,"fulltext_origin":"ngrams","cited_by_count":120,"citation_normalized_percentile":{"value":0.98754,"is_in_top_1_percent":false,"is_in_top_10_percent":true},"cited_by_percentile_year":{"min":98,"max":99},"biblio":{"volume":null,"issue":null,"first_page":"1566","last_page":"1574"},"is_retracted":false,"is_paratext":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.9996,"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/T11158","display_name":"Wireless Networks and Protocols","score":0.9937,"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.50123644},{"id":"https://openalex.org/keywords/sink","display_name":"Sink (geography)","score":0.43711543}],"concepts":[{"id":"https://openalex.org/C22590252","wikidata":"https://www.wikidata.org/wiki/Q1058754","display_name":"Shortest path problem","level":3,"score":0.82242537},{"id":"https://openalex.org/C24590314","wikidata":"https://www.wikidata.org/wiki/Q336038","display_name":"Wireless sensor network","level":2,"score":0.7346043},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.6508999},{"id":"https://openalex.org/C178067994","wikidata":"https://www.wikidata.org/wiki/Q1128278","display_name":"Constrained Shortest Path First","level":5,"score":0.5747535},{"id":"https://openalex.org/C64331007","wikidata":"https://www.wikidata.org/wiki/Q831672","display_name":"Spanning tree","level":2,"score":0.5480351},{"id":"https://openalex.org/C23394520","wikidata":"https://www.wikidata.org/wiki/Q4919350","display_name":"Shortest-path tree","level":3,"score":0.53987384},{"id":"https://openalex.org/C113174947","wikidata":"https://www.wikidata.org/wiki/Q2859736","display_name":"Tree (set theory)","level":2,"score":0.50123644},{"id":"https://openalex.org/C143050476","wikidata":"https://www.wikidata.org/wiki/Q194502","display_name":"Sink (geography)","level":2,"score":0.43711543},{"id":"https://openalex.org/C2777735758","wikidata":"https://www.wikidata.org/wiki/Q817765","display_name":"Path (computing)","level":2,"score":0.4332437},{"id":"https://openalex.org/C62611344","wikidata":"https://www.wikidata.org/wiki/Q1062658","display_name":"Node (physics)","level":2,"score":0.42810547},{"id":"https://openalex.org/C311688","wikidata":"https://www.wikidata.org/wiki/Q2393193","display_name":"Time complexity","level":2,"score":0.41306},{"id":"https://openalex.org/C126255220","wikidata":"https://www.wikidata.org/wiki/Q141495","display_name":"Mathematical optimization","level":1,"score":0.37882978},{"id":"https://openalex.org/C13743678","wikidata":"https://www.wikidata.org/wiki/Q240464","display_name":"Minimum spanning tree","level":2,"score":0.35791177},{"id":"https://openalex.org/C184720557","wikidata":"https://www.wikidata.org/wiki/Q7825049","display_name":"Topology (electrical circuits)","level":2,"score":0.33082283},{"id":"https://openalex.org/C31258907","wikidata":"https://www.wikidata.org/wiki/Q1301371","display_name":"Computer network","level":1,"score":0.3095157},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.27748963},{"id":"https://openalex.org/C70266271","wikidata":"https://www.wikidata.org/wiki/Q6343044","display_name":"K shortest path routing","level":4,"score":0.27702257},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.23950967},{"id":"https://openalex.org/C80444323","wikidata":"https://www.wikidata.org/wiki/Q2878974","display_name":"Theoretical computer science","level":1,"score":0.1748138},{"id":"https://openalex.org/C132525143","wikidata":"https://www.wikidata.org/wiki/Q141488","display_name":"Graph","level":2,"score":0.15899217},{"id":"https://openalex.org/C118615104","wikidata":"https://www.wikidata.org/wiki/Q121416","display_name":"Discrete mathematics","level":1,"score":0.076811045},{"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/C58640448","wikidata":"https://www.wikidata.org/wiki/Q42515","display_name":"Cartography","level":1,"score":0.0},{"id":"https://openalex.org/C66938386","wikidata":"https://www.wikidata.org/wiki/Q633538","display_name":"Structural engineering","level":1,"score":0.0},{"id":"https://openalex.org/C114614502","wikidata":"https://www.wikidata.org/wiki/Q76592","display_name":"Combinatorics","level":1,"score":0.0},{"id":"https://openalex.org/C127413603","wikidata":"https://www.wikidata.org/wiki/Q11023","display_name":"Engineering","level":0,"score":0.0},{"id":"https://openalex.org/C205649164","wikidata":"https://www.wikidata.org/wiki/Q1071","display_name":"Geography","level":0,"score":0.0}],"mesh":[],"locations_count":1,"locations":[{"is_oa":false,"landing_page_url":"https://doi.org/10.1109/infcom.2011.5934947","pdf_url":null,"source":null,"license":null,"license_id":null,"version":null,"is_accepted":false,"is_published":false}],"best_oa_location":null,"sustainable_development_goals":[{"display_name":"Affordable and clean energy","id":"https://metadata.un.org/sdg/7","score":0.83}],"grants":[],"datasets":[],"versions":[],"referenced_works_count":21,"referenced_works":["https://openalex.org/W1612873298","https://openalex.org/W2052924791","https://openalex.org/W2082863982","https://openalex.org/W2085443650","https://openalex.org/W2096200917","https://openalex.org/W2100617218","https://openalex.org/W2106334612","https://openalex.org/W2118498353","https://openalex.org/W2121692374","https://openalex.org/W2123976939","https://openalex.org/W2127949150","https://openalex.org/W2132895032","https://openalex.org/W2133320756","https://openalex.org/W2148251644","https://openalex.org/W2157090751","https://openalex.org/W2160343401","https://openalex.org/W2256369946","https://openalex.org/W3014094413","https://openalex.org/W3145128584","https://openalex.org/W4296557250","https://openalex.org/W73629738"],"related_works":["https://openalex.org/W4308416203","https://openalex.org/W4224251989","https://openalex.org/W4220861011","https://openalex.org/W2418231958","https://openalex.org/W2387385213","https://openalex.org/W2307044859","https://openalex.org/W2149927264","https://openalex.org/W2099915933","https://openalex.org/W2071845176","https://openalex.org/W1991421283"],"abstract_inverted_index":{"In":[0,86],"many":[1],"applications":[2],"of":[3,60,141,145,181,215],"wireless":[4],"sensor":[5,8,45],"networks,":[6],"a":[7,23,32,53,95,129,178,202,227],"node":[9,46],"senses":[10],"the":[11,20,36,39,44,58,61,72,139,143,167,175,187,213,216],"environment":[12],"to":[13,19,51,56,127,152,163],"get":[14],"data":[15,146],"and":[16,80,116,184,218],"delivers":[17],"them":[18],"sink":[21,37],"via":[22],"single":[24],"hop":[25],"or":[26],"multi-hop":[27],"path.":[28],"Many":[29],"systems":[30],"use":[31],"tree":[33,55,98,132],"rooted":[34],"at":[35],"as":[38],"underlying":[40],"routing":[41],"structure.":[42],"Since":[43,106],"is":[47,63,104,108,125,161,170,219,224],"energy":[48],"constrained,":[49],"how":[50],"construct":[52],"good":[54],"prolong":[57],"lifetime":[59,97,144,214],"network":[62,217],"an":[64,110],"important":[65,111],"problem.":[66],"We":[67,156,173],"consider":[68],"this":[69],"problem":[70,140,169,176,188],"under":[71],"scenario":[73],"where":[74],"nodes":[75],"have":[76,121],"different":[77],"initial":[78],"energy,":[79],"they":[81],"can":[82,189],"do":[83],"in-network":[84],"aggregation.":[85],"previous":[87],"works,":[88],"it":[89,124,160,223],"has":[90],"been":[91],"proved":[92],"that":[93,158,186,208],"finding":[94],"maximum":[96],"from":[99],"all":[100],"feasible":[101],"spanning":[102],"trees":[103,119],"NP-complete.":[105],"delay":[107],"also":[109],"element":[112],"in":[113,171,196,226],"time-critical":[114],"applications,":[115],"shortest":[117,130,153,164],"path":[118,131,154,165],"intuitively":[120],"short":[122],"delay,":[123],"imperative":[126],"find":[128,157],"with":[133],"long":[134],"lifetime.":[135],"This":[136],"paper":[137],"studies":[138],"maximizing":[142],"aggregation":[147],"trees,":[148,166],"which":[149],"are":[150],"limited":[151],"trees.":[155],"when":[159,222],"restricted":[162],"original":[168],"P.":[172],"transform":[174],"into":[177],"general":[179],"version":[180],"semi-matching":[182],"problem,":[183],"show":[185,207],"be":[190],"solved":[191],"by":[192],"min-cost":[193],"max-flow":[194],"approach":[195,210],"polynomial":[197],"time.":[198],"Also":[199],"we":[200],"design":[201],"distributed":[203],"solution.":[204],"Simulation":[205],"results":[206],"our":[209],"greatly":[211],"improves":[212],"more":[220],"competitive":[221],"applied":[225],"dense":[228],"network.":[229]},"abstract_inverted_index_v3":null,"cited_by_api_url":"https://api.openalex.org/works?filter=cites:W2111672462","counts_by_year":[{"year":2024,"cited_by_count":2},{"year":2023,"cited_by_count":2},{"year":2022,"cited_by_count":2},{"year":2021,"cited_by_count":5},{"year":2020,"cited_by_count":3},{"year":2019,"cited_by_count":5},{"year":2018,"cited_by_count":10},{"year":2017,"cited_by_count":7},{"year":2016,"cited_by_count":14},{"year":2015,"cited_by_count":16},{"year":2014,"cited_by_count":22},{"year":2013,"cited_by_count":18},{"year":2012,"cited_by_count":11}],"updated_date":"2025-04-16T16:25:03.693446","created_date":"2016-06-24"}