{"id":"https://openalex.org/W2179754993","doi":"https://doi.org/10.1109/sahcn.2015.7338334","title":"Utility-maximizing data collection in crowd sensing: An optimal scheduling approach","display_name":"Utility-maximizing data collection in crowd sensing: An optimal scheduling approach","publication_year":2015,"publication_date":"2015-06-01","ids":{"openalex":"https://openalex.org/W2179754993","doi":"https://doi.org/10.1109/sahcn.2015.7338334","mag":"2179754993"},"language":"en","primary_location":{"id":"doi:10.1109/sahcn.2015.7338334","is_oa":false,"landing_page_url":"https://doi.org/10.1109/sahcn.2015.7338334","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"2015 12th Annual IEEE International Conference on Sensing, Communication, and Networking (SECON)","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/A5114377911","display_name":"Yang Han","orcid":"https://orcid.org/0000-0003-0786-6731"},"institutions":[{"id":"https://openalex.org/I183067930","display_name":"Shanghai Jiao Tong University","ror":"https://ror.org/0220qvk04","country_code":"CN","type":"education","lineage":["https://openalex.org/I183067930"]}],"countries":["CN"],"is_corresponding":true,"raw_author_name":"Yang Han","raw_affiliation_strings":["Department of Computer Science and Engineering, Shanghai Jiao Tong University, Shanghai, China"],"affiliations":[{"raw_affiliation_string":"Department of Computer Science and Engineering, Shanghai Jiao Tong University, Shanghai, China","institution_ids":["https://openalex.org/I183067930"]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5081759167","display_name":"Yanmin Zhu","orcid":"https://orcid.org/0000-0001-6406-4992"},"institutions":[{"id":"https://openalex.org/I4210151021","display_name":"Shanghai Institute of Computing Technology","ror":"https://ror.org/05ek0ze18","country_code":"CN","type":"facility","lineage":["https://openalex.org/I4210151021"]},{"id":"https://openalex.org/I183067930","display_name":"Shanghai Jiao Tong University","ror":"https://ror.org/0220qvk04","country_code":"CN","type":"education","lineage":["https://openalex.org/I183067930"]}],"countries":["CN"],"is_corresponding":false,"raw_author_name":"Yanmin Zhu","raw_affiliation_strings":["Department of Computer Science and Engineering, Shanghai Jiao Tong University, Shanghai, China","Shanghai Key Lab of Scalable Computing and Systems, Shanghai, China"],"affiliations":[{"raw_affiliation_string":"Department of Computer Science and Engineering, Shanghai Jiao Tong University, Shanghai, China","institution_ids":["https://openalex.org/I183067930"]},{"raw_affiliation_string":"Shanghai Key Lab of Scalable Computing and Systems, Shanghai, China","institution_ids":["https://openalex.org/I4210151021"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5012589427","display_name":"Jiadi Yu","orcid":"https://orcid.org/0000-0002-0207-9643"},"institutions":[{"id":"https://openalex.org/I183067930","display_name":"Shanghai Jiao Tong University","ror":"https://ror.org/0220qvk04","country_code":"CN","type":"education","lineage":["https://openalex.org/I183067930"]}],"countries":["CN"],"is_corresponding":false,"raw_author_name":"Jiadi Yu","raw_affiliation_strings":["Department of Computer Science and Engineering, Shanghai Jiao Tong University, Shanghai, China"],"affiliations":[{"raw_affiliation_string":"Department of Computer Science and Engineering, Shanghai Jiao Tong University, Shanghai, China","institution_ids":["https://openalex.org/I183067930"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":3,"corresponding_author_ids":["https://openalex.org/A5114377911"],"corresponding_institution_ids":["https://openalex.org/I183067930"],"apc_list":null,"apc_paid":null,"fwci":4.0223,"has_fulltext":false,"cited_by_count":19,"citation_normalized_percentile":{"value":0.9397054,"is_in_top_1_percent":false,"is_in_top_10_percent":true},"cited_by_percentile_year":{"min":89,"max":98},"biblio":{"volume":"2","issue":null,"first_page":"345","last_page":"353"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T11704","display_name":"Mobile Crowdsensing and Crowdsourcing","score":1.0,"subfield":{"id":"https://openalex.org/subfields/1706","display_name":"Computer Science Applications"},"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/T11704","display_name":"Mobile Crowdsensing and Crowdsourcing","score":1.0,"subfield":{"id":"https://openalex.org/subfields/1706","display_name":"Computer Science Applications"},"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/T10326","display_name":"Indoor and Outdoor Localization Technologies","score":0.983299970626831,"subfield":{"id":"https://openalex.org/subfields/2208","display_name":"Electrical and Electronic Engineering"},"field":{"id":"https://openalex.org/fields/22","display_name":"Engineering"},"domain":{"id":"https://openalex.org/domains/3","display_name":"Physical Sciences"}},{"id":"https://openalex.org/T11182","display_name":"Auction Theory and Applications","score":0.980400025844574,"subfield":{"id":"https://openalex.org/subfields/1803","display_name":"Management Science and Operations Research"},"field":{"id":"https://openalex.org/fields/18","display_name":"Decision Sciences"},"domain":{"id":"https://openalex.org/domains/2","display_name":"Social Sciences"}}],"keywords":[{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.8318641781806946},{"id":"https://openalex.org/keywords/scheduling","display_name":"Scheduling (production processes)","score":0.5796283483505249},{"id":"https://openalex.org/keywords/scalability","display_name":"Scalability","score":0.5728355050086975},{"id":"https://openalex.org/keywords/online-algorithm","display_name":"Online algorithm","score":0.5033308863639832},{"id":"https://openalex.org/keywords/a-priori-and-a-posteriori","display_name":"A priori and a posteriori","score":0.47462332248687744},{"id":"https://openalex.org/keywords/distributed-computing","display_name":"Distributed computing","score":0.47331225872039795},{"id":"https://openalex.org/keywords/utility-maximization-problem","display_name":"Utility maximization problem","score":0.4552364647388458},{"id":"https://openalex.org/keywords/utility-maximization","display_name":"Utility maximization","score":0.44588059186935425},{"id":"https://openalex.org/keywords/job-shop-scheduling","display_name":"Job shop scheduling","score":0.44106563925743103},{"id":"https://openalex.org/keywords/dynamic-priority-scheduling","display_name":"Dynamic priority scheduling","score":0.426631361246109},{"id":"https://openalex.org/keywords/mathematical-optimization","display_name":"Mathematical optimization","score":0.3232826590538025},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.18450406193733215},{"id":"https://openalex.org/keywords/quality-of-service","display_name":"Quality of service","score":0.10843554139137268},{"id":"https://openalex.org/keywords/computer-network","display_name":"Computer network","score":0.10200914740562439}],"concepts":[{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.8318641781806946},{"id":"https://openalex.org/C206729178","wikidata":"https://www.wikidata.org/wiki/Q2271896","display_name":"Scheduling (production processes)","level":2,"score":0.5796283483505249},{"id":"https://openalex.org/C48044578","wikidata":"https://www.wikidata.org/wiki/Q727490","display_name":"Scalability","level":2,"score":0.5728355050086975},{"id":"https://openalex.org/C196921405","wikidata":"https://www.wikidata.org/wiki/Q786431","display_name":"Online algorithm","level":2,"score":0.5033308863639832},{"id":"https://openalex.org/C75553542","wikidata":"https://www.wikidata.org/wiki/Q178161","display_name":"A priori and a posteriori","level":2,"score":0.47462332248687744},{"id":"https://openalex.org/C120314980","wikidata":"https://www.wikidata.org/wiki/Q180634","display_name":"Distributed computing","level":1,"score":0.47331225872039795},{"id":"https://openalex.org/C2779044140","wikidata":"https://www.wikidata.org/wiki/Q3274096","display_name":"Utility maximization problem","level":3,"score":0.4552364647388458},{"id":"https://openalex.org/C2985793214","wikidata":"https://www.wikidata.org/wiki/Q3274096","display_name":"Utility maximization","level":2,"score":0.44588059186935425},{"id":"https://openalex.org/C55416958","wikidata":"https://www.wikidata.org/wiki/Q6206757","display_name":"Job shop scheduling","level":3,"score":0.44106563925743103},{"id":"https://openalex.org/C107568181","wikidata":"https://www.wikidata.org/wiki/Q5319000","display_name":"Dynamic priority scheduling","level":3,"score":0.426631361246109},{"id":"https://openalex.org/C126255220","wikidata":"https://www.wikidata.org/wiki/Q141495","display_name":"Mathematical optimization","level":1,"score":0.3232826590538025},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.18450406193733215},{"id":"https://openalex.org/C5119721","wikidata":"https://www.wikidata.org/wiki/Q220501","display_name":"Quality of service","level":2,"score":0.10843554139137268},{"id":"https://openalex.org/C31258907","wikidata":"https://www.wikidata.org/wiki/Q1301371","display_name":"Computer network","level":1,"score":0.10200914740562439},{"id":"https://openalex.org/C77088390","wikidata":"https://www.wikidata.org/wiki/Q8513","display_name":"Database","level":1,"score":0.0},{"id":"https://openalex.org/C74172769","wikidata":"https://www.wikidata.org/wiki/Q1446839","display_name":"Routing (electronic design automation)","level":2,"score":0.0},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.0},{"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/C111472728","wikidata":"https://www.wikidata.org/wiki/Q9471","display_name":"Epistemology","level":1,"score":0.0},{"id":"https://openalex.org/C138885662","wikidata":"https://www.wikidata.org/wiki/Q5891","display_name":"Philosophy","level":0,"score":0.0}],"mesh":[],"locations_count":1,"locations":[{"id":"doi:10.1109/sahcn.2015.7338334","is_oa":false,"landing_page_url":"https://doi.org/10.1109/sahcn.2015.7338334","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"2015 12th Annual IEEE International Conference on Sensing, Communication, and Networking (SECON)","raw_type":"proceedings-article"}],"best_oa_location":null,"sustainable_development_goals":[],"awards":[],"funders":[],"has_content":{"pdf":false,"grobid_xml":false},"content_urls":null,"referenced_works_count":20,"referenced_works":["https://openalex.org/W1970756365","https://openalex.org/W2025757280","https://openalex.org/W2028796207","https://openalex.org/W2055665526","https://openalex.org/W2061256826","https://openalex.org/W2082247991","https://openalex.org/W2082720516","https://openalex.org/W2125826911","https://openalex.org/W2127347346","https://openalex.org/W2127963147","https://openalex.org/W2137100320","https://openalex.org/W2137152139","https://openalex.org/W2143004641","https://openalex.org/W2144169341","https://openalex.org/W2144193487","https://openalex.org/W2340544065","https://openalex.org/W2951304829","https://openalex.org/W4230257143","https://openalex.org/W6671092430","https://openalex.org/W6679057506"],"related_works":["https://openalex.org/W2951390543","https://openalex.org/W1908901187","https://openalex.org/W3121912968","https://openalex.org/W2949260239","https://openalex.org/W2949594337","https://openalex.org/W3123067344","https://openalex.org/W2953072363","https://openalex.org/W3125423763","https://openalex.org/W4299412355","https://openalex.org/W2084262048"],"abstract_inverted_index":{"Sensing":[0],"data":[1,19,24,51,155,175],"collection":[2],"is":[3,158],"of":[4,15,18,21,50,83,104,128,161],"great":[5],"significance":[6],"in":[7],"mobile":[8],"crowd":[9],"sensing.":[10],"We":[11,85],"consider":[12],"the":[13,22,100,105,162],"problem":[14,70],"online":[16,68,90,113],"maximization":[17],"utility":[20,156],"sensing":[23,73,134],"collected":[25],"from":[26],"smartphone":[27,130],"users":[28],"under":[29],"a":[30,88,111,152],"time":[31,153,173],"average":[32,154,174],"budget":[33,46],"constraint.":[34],"There":[35],"are":[36,78],"several":[37],"major":[38],"challenges,":[39],"including":[40],"random":[41],"and":[42,48,132],"unknown":[43],"phone":[44],"contexts,":[45,131],"constraint":[47],"existence":[49],"redundancy.":[52],"Little":[53],"work":[54],"has":[55],"studied":[56],"this":[57,61],"crucial":[58],"problem.":[59],"In":[60],"paper":[62],"we":[63,108],"formulate":[64],"it":[65],"as":[66],"an":[67],"scheduling":[69,91,114],"which":[71],"determines":[72],"decisions":[74,135],"for":[75],"smartphones":[76],"that":[77,147,157,168],"distributed":[79,112,118],"over":[80],"different":[81],"regions":[82],"interest":[84],"first":[86],"propose":[87,110],"centralized":[89,106],"algorithm":[92,115],"based":[93,116],"on":[94,117],"stochastic":[95],"optimal":[96],"control.":[97],"To":[98],"address":[99],"poor":[101],"scalability":[102],"issue":[103],"algorithm,":[107],"further":[109],"correlated":[119],"scheduling.":[120],"It":[121],"does":[122],"not":[123],"require":[124],"any":[125],"priori":[126],"knowledge":[127],"future":[129],"hence":[133],"can":[136,150],"locally":[137],"be":[138],"made":[139],"by":[140],"individual":[141],"smartphones.":[142],"Rigorous":[143],"theoretical":[144,163],"analysis":[145],"show":[146],"our":[148,169],"algorithms":[149,170],"achieve":[151],"within":[159],"O{1/V)":[160],"optimum.":[164],"Extensive":[165],"simulations":[166],"demonstrate":[167],"produce":[171],"high":[172],"utility.":[176]},"counts_by_year":[{"year":2024,"cited_by_count":1},{"year":2023,"cited_by_count":2},{"year":2021,"cited_by_count":1},{"year":2020,"cited_by_count":2},{"year":2019,"cited_by_count":5},{"year":2018,"cited_by_count":2},{"year":2017,"cited_by_count":4},{"year":2016,"cited_by_count":2}],"updated_date":"2025-11-06T03:46:38.306776","created_date":"2025-10-10T00:00:00"}