{"id":"https://openalex.org/W2791698791","doi":"https://doi.org/10.1109/tcomm.2018.2796614","title":"Network Resource Constrained Traffic Allocation for Delay Sensitive Mobile Crowdsourcing","display_name":"Network Resource Constrained Traffic Allocation for Delay Sensitive Mobile Crowdsourcing","publication_year":2018,"publication_date":"2018-01-23","ids":{"openalex":"https://openalex.org/W2791698791","doi":"https://doi.org/10.1109/tcomm.2018.2796614","mag":"2791698791"},"language":"en","primary_location":{"id":"doi:10.1109/tcomm.2018.2796614","is_oa":false,"landing_page_url":"https://doi.org/10.1109/tcomm.2018.2796614","pdf_url":null,"source":{"id":"https://openalex.org/S196647941","display_name":"IEEE Transactions on Communications","issn_l":"0090-6778","issn":["0090-6778","1558-0857"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310316002","host_organization_name":"IEEE Communications Society","host_organization_lineage":["https://openalex.org/P4310316002","https://openalex.org/P4310319808"],"host_organization_lineage_names":["IEEE Communications Society","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 Communications","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/A5013728473","display_name":"Yanyan Han","orcid":"https://orcid.org/0000-0003-0147-0525"},"institutions":[{"id":"https://openalex.org/I79516672","display_name":"University of Louisiana at Lafayette","ror":"https://ror.org/01x8rc503","country_code":"US","type":"education","lineage":["https://openalex.org/I2799628689","https://openalex.org/I79516672"]}],"countries":["US"],"is_corresponding":true,"raw_author_name":"Yanyan Han","raw_affiliation_strings":["Center for Advanced Computer Studies, University of Louisiana at Lafayette, Lafayette, LA, USA"],"affiliations":[{"raw_affiliation_string":"Center for Advanced Computer Studies, University of Louisiana at Lafayette, Lafayette, LA, USA","institution_ids":["https://openalex.org/I79516672"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5115636506","display_name":"Hongyi Wu","orcid":"https://orcid.org/0000-0001-6030-6480"},"institutions":[{"id":"https://openalex.org/I81365321","display_name":"Old Dominion University","ror":"https://ror.org/04zjtrb98","country_code":"US","type":"education","lineage":["https://openalex.org/I81365321"]}],"countries":["US"],"is_corresponding":false,"raw_author_name":"Hongyi Wu","raw_affiliation_strings":["Department of Electrical and Computer Engineering, Old Dominion University, Norfolk, VA, USA"],"affiliations":[{"raw_affiliation_string":"Department of Electrical and Computer Engineering, Old Dominion University, Norfolk, VA, USA","institution_ids":["https://openalex.org/I81365321"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":2,"corresponding_author_ids":["https://openalex.org/A5013728473"],"corresponding_institution_ids":["https://openalex.org/I79516672"],"apc_list":null,"apc_paid":null,"fwci":0.3691,"has_fulltext":false,"cited_by_count":3,"citation_normalized_percentile":{"value":0.62167318,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":{"min":89,"max":94},"biblio":{"volume":"66","issue":"8","first_page":"3471","last_page":"3484"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T11896","display_name":"Opportunistic and Delay-Tolerant 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/T11896","display_name":"Opportunistic and Delay-Tolerant 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.9937000274658203,"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/T11478","display_name":"Caching and Content Delivery","score":0.992900013923645,"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/computer-science","display_name":"Computer science","score":0.7724003791809082},{"id":"https://openalex.org/keywords/submodular-set-function","display_name":"Submodular set function","score":0.7446808218955994},{"id":"https://openalex.org/keywords/computer-network","display_name":"Computer network","score":0.5445362329483032},{"id":"https://openalex.org/keywords/distributed-computing","display_name":"Distributed computing","score":0.5164945125579834},{"id":"https://openalex.org/keywords/resource-allocation","display_name":"Resource allocation","score":0.5062659978866577},{"id":"https://openalex.org/keywords/bandwidth","display_name":"Bandwidth (computing)","score":0.49799442291259766},{"id":"https://openalex.org/keywords/bandwidth-allocation","display_name":"Bandwidth allocation","score":0.48023420572280884},{"id":"https://openalex.org/keywords/node","display_name":"Node (physics)","score":0.4708292782306671},{"id":"https://openalex.org/keywords/heuristic","display_name":"Heuristic","score":0.4287897050380707},{"id":"https://openalex.org/keywords/mathematical-optimization","display_name":"Mathematical optimization","score":0.20348641276359558},{"id":"https://openalex.org/keywords/engineering","display_name":"Engineering","score":0.105776846408844}],"concepts":[{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.7724003791809082},{"id":"https://openalex.org/C178621042","wikidata":"https://www.wikidata.org/wiki/Q7631710","display_name":"Submodular set function","level":2,"score":0.7446808218955994},{"id":"https://openalex.org/C31258907","wikidata":"https://www.wikidata.org/wiki/Q1301371","display_name":"Computer network","level":1,"score":0.5445362329483032},{"id":"https://openalex.org/C120314980","wikidata":"https://www.wikidata.org/wiki/Q180634","display_name":"Distributed computing","level":1,"score":0.5164945125579834},{"id":"https://openalex.org/C29202148","wikidata":"https://www.wikidata.org/wiki/Q287260","display_name":"Resource allocation","level":2,"score":0.5062659978866577},{"id":"https://openalex.org/C2776257435","wikidata":"https://www.wikidata.org/wiki/Q1576430","display_name":"Bandwidth (computing)","level":2,"score":0.49799442291259766},{"id":"https://openalex.org/C200157131","wikidata":"https://www.wikidata.org/wiki/Q4854763","display_name":"Bandwidth allocation","level":3,"score":0.48023420572280884},{"id":"https://openalex.org/C62611344","wikidata":"https://www.wikidata.org/wiki/Q1062658","display_name":"Node (physics)","level":2,"score":0.4708292782306671},{"id":"https://openalex.org/C173801870","wikidata":"https://www.wikidata.org/wiki/Q201413","display_name":"Heuristic","level":2,"score":0.4287897050380707},{"id":"https://openalex.org/C126255220","wikidata":"https://www.wikidata.org/wiki/Q141495","display_name":"Mathematical optimization","level":1,"score":0.20348641276359558},{"id":"https://openalex.org/C127413603","wikidata":"https://www.wikidata.org/wiki/Q11023","display_name":"Engineering","level":0,"score":0.105776846408844},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"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/C154945302","wikidata":"https://www.wikidata.org/wiki/Q11660","display_name":"Artificial intelligence","level":1,"score":0.0}],"mesh":[],"locations_count":1,"locations":[{"id":"doi:10.1109/tcomm.2018.2796614","is_oa":false,"landing_page_url":"https://doi.org/10.1109/tcomm.2018.2796614","pdf_url":null,"source":{"id":"https://openalex.org/S196647941","display_name":"IEEE Transactions on Communications","issn_l":"0090-6778","issn":["0090-6778","1558-0857"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310316002","host_organization_name":"IEEE Communications Society","host_organization_lineage":["https://openalex.org/P4310316002","https://openalex.org/P4310319808"],"host_organization_lineage_names":["IEEE Communications Society","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 Communications","raw_type":"journal-article"}],"best_oa_location":null,"sustainable_development_goals":[{"score":0.4399999976158142,"id":"https://metadata.un.org/sdg/9","display_name":"Industry, innovation and infrastructure"}],"awards":[{"id":"https://openalex.org/G2956052448","display_name":null,"funder_award_id":"CNS-1528004","funder_id":"https://openalex.org/F4320306076","funder_display_name":"National Science Foundation"}],"funders":[{"id":"https://openalex.org/F4320306076","display_name":"National Science Foundation","ror":"https://ror.org/021nxhr62"}],"has_content":{"grobid_xml":false,"pdf":false},"content_urls":null,"referenced_works_count":44,"referenced_works":["https://openalex.org/W168233777","https://openalex.org/W1531914496","https://openalex.org/W1536369969","https://openalex.org/W1597217844","https://openalex.org/W1966518282","https://openalex.org/W1970756365","https://openalex.org/W1978211940","https://openalex.org/W1981118980","https://openalex.org/W1994385095","https://openalex.org/W2001843648","https://openalex.org/W2005026120","https://openalex.org/W2010634640","https://openalex.org/W2013491401","https://openalex.org/W2019500426","https://openalex.org/W2023290717","https://openalex.org/W2026137815","https://openalex.org/W2026490835","https://openalex.org/W2035232548","https://openalex.org/W2035892582","https://openalex.org/W2055679609","https://openalex.org/W2070199170","https://openalex.org/W2112316694","https://openalex.org/W2126343340","https://openalex.org/W2129849999","https://openalex.org/W2132743380","https://openalex.org/W2133304166","https://openalex.org/W2135712710","https://openalex.org/W2142522527","https://openalex.org/W2144169341","https://openalex.org/W2144855852","https://openalex.org/W2161373140","https://openalex.org/W2164311866","https://openalex.org/W2166735950","https://openalex.org/W2200366263","https://openalex.org/W2313281262","https://openalex.org/W2326177852","https://openalex.org/W2343269152","https://openalex.org/W2343678393","https://openalex.org/W2344829075","https://openalex.org/W2482718689","https://openalex.org/W3162914541","https://openalex.org/W4234068324","https://openalex.org/W4242656826","https://openalex.org/W6606911112"],"related_works":["https://openalex.org/W1595919516","https://openalex.org/W2945022594","https://openalex.org/W2966531942","https://openalex.org/W2194604332","https://openalex.org/W4379619607","https://openalex.org/W4386185001","https://openalex.org/W4236048596","https://openalex.org/W2411838016","https://openalex.org/W2037283301","https://openalex.org/W2027592263"],"abstract_inverted_index":{"In":[0,54,99],"mobile":[1,68],"opportunistic":[2],"networks,":[3],"a":[4,21,44,84,116,140],"common":[5],"assumption":[6],"is":[7,46],"that":[8,90,172],"nodes":[9,138],"are":[10],"able":[11],"to":[12,33,101,161],"complete":[13],"as":[14,18,95,97],"much":[15],"data":[16],"exchange":[17],"needed":[19],"during":[20],"communication":[22,52],"opportunity,":[23],"which":[24,184],"is,":[25],"however,":[26],"not":[27],"the":[28,40,51,72,107,120,126,148,152,158,173,177],"case":[29],"in":[30,119,189],"practice":[31],"due":[32],"limited":[34],"wireless":[35],"link":[36,79],"bandwidth.":[37],"Beyond":[38],"that,":[39],"storage":[41,77],"capacity":[42],"at":[43,93],"node":[45,76],"also":[47],"limited,":[48],"further":[49],"impacting":[50],"efficiency.":[53],"this":[55],"paper,":[56],"we":[57,81,110,146],"explore":[58],"delay":[59],"sensitive":[60],"and":[61,78,115,132,154,168],"network":[62,191],"resource":[63],"constrained":[64],"traffic":[65,86],"allocation":[66,87],"for":[67,139],"device-to-device":[69],"crowdsourcing.":[70],"With":[71],"requirement":[73],"of":[74,142],"restricted":[75],"bandwidth,":[80],"first":[82],"formulate":[83],"non-linear":[85],"optimization":[88],"problem":[89],"would":[91],"be":[92,186],"least":[94],"hard":[96],"NP-hard.":[98],"order":[100],"practically":[102],"solve":[103],"it,":[104],"based":[105],"on":[106,128],"submodular":[108],"property,":[109],"propose":[111],"an":[112,134],"approximation":[113],"algorithm":[114],"distributed":[117],"heuristic":[118],"same":[121],"design":[122],"principle.":[123],"We":[124],"implement":[125],"latter":[127],"Dell":[129],"Streak":[130],"tablets":[131],"deploy":[133],"experiment":[135,167],"with":[136,180],"21":[137],"period":[141],"three":[143],"weeks.":[144],"Moreover,":[145],"extract":[147],"implementation":[149],"codes":[150],"from":[151],"prototype":[153],"run":[155],"simulations":[156],"using":[157],"Haggle":[159],"trace":[160],"study":[162],"its":[163],"performance":[164,179],"trend.":[165],"The":[166],"simulation":[169],"outcomes":[170],"verify":[171],"proposed":[174],"mechanisms":[175],"achieve":[176],"close-to-optimal":[178],"affordable":[181],"computation":[182],"complexity,":[183],"can":[185],"easily":[187],"implanted":[188],"practical":[190],"environment.":[192]},"counts_by_year":[{"year":2022,"cited_by_count":1},{"year":2019,"cited_by_count":1},{"year":2018,"cited_by_count":1}],"updated_date":"2025-11-06T03:46:38.306776","created_date":"2025-10-10T00:00:00"}