{"id":"https://openalex.org/W2054581030","doi":"https://doi.org/10.1109/tac.2014.2321683","title":"Submodular Utility Maximization for Deadline Constrained Data Collection in Sensor Networks","display_name":"Submodular Utility Maximization for Deadline Constrained Data Collection in Sensor Networks","publication_year":2014,"publication_date":"2014-05-02","ids":{"openalex":"https://openalex.org/W2054581030","doi":"https://doi.org/10.1109/tac.2014.2321683","mag":"2054581030"},"language":"en","primary_location":{"id":"doi:10.1109/tac.2014.2321683","is_oa":false,"landing_page_url":"https://doi.org/10.1109/tac.2014.2321683","pdf_url":null,"source":{"id":"https://openalex.org/S184954342","display_name":"IEEE Transactions on Automatic Control","issn_l":"0018-9286","issn":["0018-9286","1558-2523","2334-3303"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310319808","host_organization_name":"Institute of Electrical and Electronics Engineers","host_organization_lineage":["https://openalex.org/P4310319808"],"host_organization_lineage_names":["Institute of Electrical and Electronics Engineers"],"type":"journal"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"IEEE Transactions on Automatic Control","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/A5101615991","display_name":"Zizhan Zheng","orcid":"https://orcid.org/0000-0003-4799-1051"},"institutions":[{"id":"https://openalex.org/I52357470","display_name":"The Ohio State University","ror":"https://ror.org/00rs6vg23","country_code":"US","type":"education","lineage":["https://openalex.org/I52357470"]}],"countries":["US"],"is_corresponding":true,"raw_author_name":"Zizhan Zheng","raw_affiliation_strings":["Department of Electrical and Computer Engineering, The Ohio State University, Columbus, OH, USA","Dept. of Electr. & Comput. Eng., Ohio state Univ., Columbus, OH, USA"],"affiliations":[{"raw_affiliation_string":"Department of Electrical and Computer Engineering, The Ohio State University, Columbus, OH, USA","institution_ids":["https://openalex.org/I52357470"]},{"raw_affiliation_string":"Dept. of Electr. & Comput. Eng., Ohio state Univ., Columbus, OH, USA","institution_ids":["https://openalex.org/I52357470"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5035752536","display_name":"Ness B. Shroff","orcid":"https://orcid.org/0000-0002-4606-6879"},"institutions":[{"id":"https://openalex.org/I52357470","display_name":"The Ohio State University","ror":"https://ror.org/00rs6vg23","country_code":"US","type":"education","lineage":["https://openalex.org/I52357470"]}],"countries":["US"],"is_corresponding":false,"raw_author_name":"Ness B. Shroff","raw_affiliation_strings":["Department of Electrical and Computer Engineering and the Department of Computer Science and Engineering, The Ohio State University, Columbus, OH, USA","Dept. of Electr. & Comput. Eng., Ohio state Univ., Columbus, OH, USA"],"affiliations":[{"raw_affiliation_string":"Department of Electrical and Computer Engineering and the Department of Computer Science and Engineering, The Ohio State University, Columbus, OH, USA","institution_ids":["https://openalex.org/I52357470"]},{"raw_affiliation_string":"Dept. of Electr. & Comput. Eng., Ohio state Univ., Columbus, OH, USA","institution_ids":["https://openalex.org/I52357470"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":2,"corresponding_author_ids":["https://openalex.org/A5101615991"],"corresponding_institution_ids":["https://openalex.org/I52357470"],"apc_list":null,"apc_paid":null,"fwci":2.518,"has_fulltext":false,"cited_by_count":14,"citation_normalized_percentile":{"value":0.90470442,"is_in_top_1_percent":false,"is_in_top_10_percent":true},"cited_by_percentile_year":{"min":89,"max":96},"biblio":{"volume":"59","issue":"9","first_page":"2400","last_page":"2412"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T10246","display_name":"Mobile Ad Hoc Networks","score":0.9991999864578247,"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/T10246","display_name":"Mobile Ad Hoc Networks","score":0.9991999864578247,"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/T10080","display_name":"Energy Efficient Wireless Sensor Networks","score":0.9980000257492065,"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/T12288","display_name":"Optimization and Search Problems","score":0.9954000115394592,"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/submodular-set-function","display_name":"Submodular set function","score":0.9128854274749756},{"id":"https://openalex.org/keywords/utility-maximization-problem","display_name":"Utility maximization problem","score":0.7392218708992004},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.6309925317764282},{"id":"https://openalex.org/keywords/constraint","display_name":"Constraint (computer-aided design)","score":0.5995503664016724},{"id":"https://openalex.org/keywords/cardinality","display_name":"Cardinality (data modeling)","score":0.5453543066978455},{"id":"https://openalex.org/keywords/mathematical-optimization","display_name":"Mathematical optimization","score":0.5360633730888367},{"id":"https://openalex.org/keywords/monotone-polygon","display_name":"Monotone polygon","score":0.5012927055358887},{"id":"https://openalex.org/keywords/tree","display_name":"Tree (set theory)","score":0.43880587816238403},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.23796069622039795},{"id":"https://openalex.org/keywords/utility-maximization","display_name":"Utility maximization","score":0.17514848709106445},{"id":"https://openalex.org/keywords/data-mining","display_name":"Data mining","score":0.11157962679862976}],"concepts":[{"id":"https://openalex.org/C178621042","wikidata":"https://www.wikidata.org/wiki/Q7631710","display_name":"Submodular set function","level":2,"score":0.9128854274749756},{"id":"https://openalex.org/C2779044140","wikidata":"https://www.wikidata.org/wiki/Q3274096","display_name":"Utility maximization problem","level":3,"score":0.7392218708992004},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.6309925317764282},{"id":"https://openalex.org/C2776036281","wikidata":"https://www.wikidata.org/wiki/Q48769818","display_name":"Constraint (computer-aided design)","level":2,"score":0.5995503664016724},{"id":"https://openalex.org/C87117476","wikidata":"https://www.wikidata.org/wiki/Q362383","display_name":"Cardinality (data modeling)","level":2,"score":0.5453543066978455},{"id":"https://openalex.org/C126255220","wikidata":"https://www.wikidata.org/wiki/Q141495","display_name":"Mathematical optimization","level":1,"score":0.5360633730888367},{"id":"https://openalex.org/C2834757","wikidata":"https://www.wikidata.org/wiki/Q4925424","display_name":"Monotone polygon","level":2,"score":0.5012927055358887},{"id":"https://openalex.org/C113174947","wikidata":"https://www.wikidata.org/wiki/Q2859736","display_name":"Tree (set theory)","level":2,"score":0.43880587816238403},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.23796069622039795},{"id":"https://openalex.org/C2985793214","wikidata":"https://www.wikidata.org/wiki/Q3274096","display_name":"Utility maximization","level":2,"score":0.17514848709106445},{"id":"https://openalex.org/C124101348","wikidata":"https://www.wikidata.org/wiki/Q172491","display_name":"Data mining","level":1,"score":0.11157962679862976},{"id":"https://openalex.org/C144237770","wikidata":"https://www.wikidata.org/wiki/Q747534","display_name":"Mathematical economics","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},{"id":"https://openalex.org/C2524010","wikidata":"https://www.wikidata.org/wiki/Q8087","display_name":"Geometry","level":1,"score":0.0}],"mesh":[],"locations_count":1,"locations":[{"id":"doi:10.1109/tac.2014.2321683","is_oa":false,"landing_page_url":"https://doi.org/10.1109/tac.2014.2321683","pdf_url":null,"source":{"id":"https://openalex.org/S184954342","display_name":"IEEE Transactions on Automatic Control","issn_l":"0018-9286","issn":["0018-9286","1558-2523","2334-3303"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310319808","host_organization_name":"Institute of Electrical and Electronics Engineers","host_organization_lineage":["https://openalex.org/P4310319808"],"host_organization_lineage_names":["Institute of Electrical and Electronics Engineers"],"type":"journal"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"IEEE Transactions on Automatic Control","raw_type":"journal-article"}],"best_oa_location":null,"sustainable_development_goals":[],"awards":[{"id":"https://openalex.org/G4988052250","display_name":null,"funder_award_id":"W911NF-08-1-0238","funder_id":"https://openalex.org/F4320338281","funder_display_name":"Army Research Office"},{"id":"https://openalex.org/G5040205760","display_name":null,"funder_award_id":"W911NF-07-1-0376","funder_id":"https://openalex.org/F4320338281","funder_display_name":"Army Research Office"}],"funders":[{"id":"https://openalex.org/F4320338281","display_name":"Army Research Office","ror":"https://ror.org/05epdh915"}],"has_content":{"grobid_xml":false,"pdf":false},"content_urls":null,"referenced_works_count":41,"referenced_works":["https://openalex.org/W1597597566","https://openalex.org/W1606343334","https://openalex.org/W1680189815","https://openalex.org/W1901187898","https://openalex.org/W1918603512","https://openalex.org/W1967004927","https://openalex.org/W1980952440","https://openalex.org/W2011233235","https://openalex.org/W2023110414","https://openalex.org/W2040333990","https://openalex.org/W2054581030","https://openalex.org/W2061820396","https://openalex.org/W2073744038","https://openalex.org/W2085942561","https://openalex.org/W2100729440","https://openalex.org/W2104259309","https://openalex.org/W2107364542","https://openalex.org/W2117363591","https://openalex.org/W2123976939","https://openalex.org/W2131824593","https://openalex.org/W2132651631","https://openalex.org/W2141403143","https://openalex.org/W2143319963","https://openalex.org/W2143996311","https://openalex.org/W2145152674","https://openalex.org/W2147117072","https://openalex.org/W2148134592","https://openalex.org/W2151239055","https://openalex.org/W2154968665","https://openalex.org/W2161978945","https://openalex.org/W2167308284","https://openalex.org/W2169207653","https://openalex.org/W2171738972","https://openalex.org/W2295961103","https://openalex.org/W2463604212","https://openalex.org/W2757107770","https://openalex.org/W3003506411","https://openalex.org/W3118655244","https://openalex.org/W3143762821","https://openalex.org/W6679608865","https://openalex.org/W6683112175"],"related_works":["https://openalex.org/W2923536170","https://openalex.org/W2944744777","https://openalex.org/W4321600307","https://openalex.org/W4251076636","https://openalex.org/W4301403455","https://openalex.org/W4296167783","https://openalex.org/W4313438685","https://openalex.org/W4313452212","https://openalex.org/W4387682058","https://openalex.org/W4308166788"],"abstract_inverted_index":{"We":[0,123],"study":[1],"the":[2,20,36,46,72,89,112,119],"utility":[3,48,63,77],"maximization":[4,49,95],"problem":[5,41,106,131],"for":[6,88,133],"data":[7,21,114,135,140],"collection":[8,136],"in":[9,51,67],"a":[10,16,23,31,58,98],"wireless":[11],"sensor":[12],"network":[13],"subject":[14,34,96],"to":[15,35,45,97,111,129],"deadline":[17],"constraint,":[18],"where":[19],"on":[22,80],"selected":[24],"subset":[25],"of":[26,57,62,74,82],"nodes":[27],"are":[28],"collected":[29],"through":[30],"routing":[32],"tree":[33],"1-hop":[37],"interference":[38,121],"model.":[39,122],"Our":[40],"is":[42,85,107,142],"closely":[43],"related":[44],"traditional":[47],"problems":[50],"networking":[52],"and":[53,137],"communications.":[54],"However,":[55],"instead":[56],"separable":[59],"concave":[60],"form":[61],"functions":[64,78],"commonly":[65],"seen":[66],"this":[68,130],"area,":[69],"we":[70,91],"consider":[71],"class":[73],"monotone":[75],"submodular":[76,94],"defined":[79],"subsets":[81],"nodes,":[83],"which":[84],"more":[86,108],"appropriate":[87],"applications":[90],"consider.":[92],"While":[93],"cardinality":[99],"constraint":[100],"has":[101],"been":[102],"well":[103],"understood,":[104],"our":[105],"challenging":[109],"due":[110],"multi-hop":[113],"forwarding":[115],"nature":[116],"even":[117],"under":[118],"simple":[120],"have":[124],"derived":[125],"efficient":[126],"approximation":[127],"solutions":[128],"both":[132],"raw":[134],"when":[138],"in-network":[139],"aggregation":[141],"applied.":[143]},"counts_by_year":[{"year":2023,"cited_by_count":2},{"year":2022,"cited_by_count":2},{"year":2021,"cited_by_count":1},{"year":2020,"cited_by_count":1},{"year":2018,"cited_by_count":1},{"year":2017,"cited_by_count":2},{"year":2016,"cited_by_count":1},{"year":2015,"cited_by_count":2},{"year":2014,"cited_by_count":2}],"updated_date":"2026-04-05T17:49:38.594831","created_date":"2025-10-10T00:00:00"}