{"id":"https://openalex.org/W1597217844","doi":"https://doi.org/10.1109/infocom.2015.7218612","title":"User recruitment for mobile crowdsensing over opportunistic networks","display_name":"User recruitment for mobile crowdsensing over opportunistic networks","publication_year":2015,"publication_date":"2015-04-01","ids":{"openalex":"https://openalex.org/W1597217844","doi":"https://doi.org/10.1109/infocom.2015.7218612","mag":"1597217844"},"language":"en","primary_location":{"id":"doi:10.1109/infocom.2015.7218612","is_oa":false,"landing_page_url":"https://doi.org/10.1109/infocom.2015.7218612","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"2015 IEEE Conference on Computer Communications (INFOCOM)","raw_type":"proceedings-article"},"type":"conference-paper","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/A5108531903","display_name":"Merkouris Karaliopoulos","orcid":null},"institutions":[{"id":"https://openalex.org/I4210093649","display_name":"Information Technologies Institute","ror":"https://ror.org/0069akp70","country_code":"GR","type":"nonprofit","lineage":["https://openalex.org/I4210093649"]},{"id":"https://openalex.org/I73142707","display_name":"Athens University of Economics and Business","ror":"https://ror.org/03s262162","country_code":"GR","type":"education","lineage":["https://openalex.org/I73142707"]}],"countries":["GR"],"is_corresponding":false,"raw_author_name":"Merkouris Karaliopoulos","raw_affiliation_strings":["Department of Informatics, Athens University of Economics and Business, Athens, Greece","Information Technologies Institute, Center for Research and Technology Hellas, Volos, Greece"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Department of Informatics, Athens University of Economics and Business, Athens, Greece","institution_ids":["https://openalex.org/I73142707"]},{"raw_affiliation_string":"Information Technologies Institute, Center for Research and Technology Hellas, Volos, Greece","institution_ids":["https://openalex.org/I4210093649"]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5027676912","display_name":"Orestis Telelis","orcid":"https://orcid.org/0000-0002-8236-7353"},"institutions":[{"id":"https://openalex.org/I154757721","display_name":"University of Piraeus","ror":"https://ror.org/02qs84g94","country_code":"GR","type":"education","lineage":["https://openalex.org/I154757721"]}],"countries":["GR"],"is_corresponding":false,"raw_author_name":"Orestis Telelis","raw_affiliation_strings":["Department of Digital Systems, University of Piraeus, Piraeus, Greece"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Department of Digital Systems, University of Piraeus, Piraeus, Greece","institution_ids":["https://openalex.org/I154757721"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5057979014","display_name":"Iordanis Koutsopoulos","orcid":"https://orcid.org/0000-0001-7699-5276"},"institutions":[{"id":"https://openalex.org/I4210093649","display_name":"Information Technologies Institute","ror":"https://ror.org/0069akp70","country_code":"GR","type":"nonprofit","lineage":["https://openalex.org/I4210093649"]},{"id":"https://openalex.org/I73142707","display_name":"Athens University of Economics and Business","ror":"https://ror.org/03s262162","country_code":"GR","type":"education","lineage":["https://openalex.org/I73142707"]}],"countries":["GR"],"is_corresponding":false,"raw_author_name":"Iordanis Koutsopoulos","raw_affiliation_strings":["Department of Informatics, Athens University of Economics and Business, Athens, Greece","Information Technologies Institute, Center for Research and Technology Hellas, Volos, Greece"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Department of Informatics, Athens University of Economics and Business, Athens, Greece","institution_ids":["https://openalex.org/I73142707"]},{"raw_affiliation_string":"Information Technologies Institute, Center for Research and Technology Hellas, Volos, Greece","institution_ids":["https://openalex.org/I4210093649"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":3,"corresponding_author_ids":[],"corresponding_institution_ids":[],"apc_list":null,"apc_paid":null,"fwci":21.4436,"has_fulltext":false,"cited_by_count":207,"citation_normalized_percentile":{"value":0.99759685,"is_in_top_1_percent":true,"is_in_top_10_percent":true},"cited_by_percentile_year":{"min":90,"max":100},"biblio":{"volume":null,"issue":null,"first_page":null,"last_page":null},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T11896","display_name":"Opportunistic and Delay-Tolerant Networks","score":0.9997000098228455,"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":0.9997000098228455,"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/T11704","display_name":"Mobile Crowdsensing and Crowdsourcing","score":0.9970999956130981,"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/T11980","display_name":"Human Mobility and Location-Based Analysis","score":0.9962999820709229,"subfield":{"id":"https://openalex.org/subfields/3313","display_name":"Transportation"},"field":{"id":"https://openalex.org/fields/33","display_name":"Social Sciences"},"domain":{"id":"https://openalex.org/domains/2","display_name":"Social Sciences"}}],"keywords":[{"id":"https://openalex.org/keywords/submodular-set-function","display_name":"Submodular set function","score":0.8575084209442139},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.7590396404266357},{"id":"https://openalex.org/keywords/heuristics","display_name":"Heuristics","score":0.6000096201896667},{"id":"https://openalex.org/keywords/upload","display_name":"Upload","score":0.5513411164283752},{"id":"https://openalex.org/keywords/set","display_name":"Set (abstract data type)","score":0.5369294881820679},{"id":"https://openalex.org/keywords/node","display_name":"Node (physics)","score":0.5363014936447144},{"id":"https://openalex.org/keywords/cover","display_name":"Cover (algebra)","score":0.4618040919303894},{"id":"https://openalex.org/keywords/greedy-algorithm","display_name":"Greedy algorithm","score":0.4410797357559204},{"id":"https://openalex.org/keywords/set-cover-problem","display_name":"Set cover problem","score":0.43428558111190796},{"id":"https://openalex.org/keywords/distributed-computing","display_name":"Distributed computing","score":0.387043297290802},{"id":"https://openalex.org/keywords/mathematical-optimization","display_name":"Mathematical optimization","score":0.2908044457435608},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.1348741054534912},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.12613219022750854}],"concepts":[{"id":"https://openalex.org/C178621042","wikidata":"https://www.wikidata.org/wiki/Q7631710","display_name":"Submodular set function","level":2,"score":0.8575084209442139},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.7590396404266357},{"id":"https://openalex.org/C127705205","wikidata":"https://www.wikidata.org/wiki/Q5748245","display_name":"Heuristics","level":2,"score":0.6000096201896667},{"id":"https://openalex.org/C71901391","wikidata":"https://www.wikidata.org/wiki/Q7126699","display_name":"Upload","level":2,"score":0.5513411164283752},{"id":"https://openalex.org/C177264268","wikidata":"https://www.wikidata.org/wiki/Q1514741","display_name":"Set (abstract data type)","level":2,"score":0.5369294881820679},{"id":"https://openalex.org/C62611344","wikidata":"https://www.wikidata.org/wiki/Q1062658","display_name":"Node (physics)","level":2,"score":0.5363014936447144},{"id":"https://openalex.org/C2780428219","wikidata":"https://www.wikidata.org/wiki/Q16952335","display_name":"Cover (algebra)","level":2,"score":0.4618040919303894},{"id":"https://openalex.org/C51823790","wikidata":"https://www.wikidata.org/wiki/Q504353","display_name":"Greedy algorithm","level":2,"score":0.4410797357559204},{"id":"https://openalex.org/C100808899","wikidata":"https://www.wikidata.org/wiki/Q1192100","display_name":"Set cover problem","level":3,"score":0.43428558111190796},{"id":"https://openalex.org/C120314980","wikidata":"https://www.wikidata.org/wiki/Q180634","display_name":"Distributed computing","level":1,"score":0.387043297290802},{"id":"https://openalex.org/C126255220","wikidata":"https://www.wikidata.org/wiki/Q141495","display_name":"Mathematical optimization","level":1,"score":0.2908044457435608},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.1348741054534912},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.12613219022750854},{"id":"https://openalex.org/C111919701","wikidata":"https://www.wikidata.org/wiki/Q9135","display_name":"Operating system","level":1,"score":0.0},{"id":"https://openalex.org/C199360897","wikidata":"https://www.wikidata.org/wiki/Q9143","display_name":"Programming language","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/C78519656","wikidata":"https://www.wikidata.org/wiki/Q101333","display_name":"Mechanical engineering","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}],"mesh":[],"locations_count":2,"locations":[{"id":"doi:10.1109/infocom.2015.7218612","is_oa":false,"landing_page_url":"https://doi.org/10.1109/infocom.2015.7218612","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"2015 IEEE Conference on Computer Communications (INFOCOM)","raw_type":"proceedings-article"},{"id":"pmh:oai:CiteSeerX.psu:10.1.1.719.603","is_oa":false,"landing_page_url":"http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.719.603","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"http://www.cs.aueb.gr/%7Ejordan/PAPERS/INFOCOM-2015.pdf","raw_type":"text"}],"best_oa_location":null,"sustainable_development_goals":[],"awards":[],"funders":[],"has_content":{"grobid_xml":false,"pdf":false},"content_urls":null,"referenced_works_count":17,"referenced_works":["https://openalex.org/W1553085258","https://openalex.org/W2009155608","https://openalex.org/W2054106511","https://openalex.org/W2061651455","https://openalex.org/W2064209160","https://openalex.org/W2102158101","https://openalex.org/W2110953678","https://openalex.org/W2115594786","https://openalex.org/W2125826911","https://openalex.org/W2133255965","https://openalex.org/W2134099854","https://openalex.org/W2143487028","https://openalex.org/W2157054705","https://openalex.org/W2167339613","https://openalex.org/W2174359169","https://openalex.org/W4249188205","https://openalex.org/W6633152551"],"related_works":["https://openalex.org/W3047700137","https://openalex.org/W2962866360","https://openalex.org/W2402949237","https://openalex.org/W3119129187","https://openalex.org/W2964314169","https://openalex.org/W2594118609","https://openalex.org/W1497312391","https://openalex.org/W3204684126","https://openalex.org/W2735578456","https://openalex.org/W4389478405"],"abstract_inverted_index":{"We":[0,94,119,159],"look":[1],"into":[2],"the":[3,12,24,47,52,82,104,129,138,154,165,182,186,191,194,200,214],"realization":[4],"of":[5,60,106,140,146,196,202],"mobile":[6,37],"crowdsensing":[7],"campaigns":[8],"that":[9,209],"draw":[10],"on":[11,193],"opportunistic":[13],"networking":[14],"paradigm,":[15],"as":[16,108],"practised":[17],"in":[18,23,29,43,68,210],"delay-tolerant":[19],"networks":[20],"but":[21],"also":[22],"emerging":[25],"device-to-device":[26],"communication":[27],"mode":[28],"cellular":[30],"networks.":[31],"In":[32],"particular,":[33],"we":[34],"ask":[35],"how":[36],"users":[38,64,107],"can":[39],"be":[40],"optimally":[41],"selected":[42],"order":[44],"to":[45,78,87,122,144,153],"generate":[46],"required":[48],"space-time":[49,197],"paths":[50],"across":[51,81],"network":[53,83],"for":[54,136,164],"collecting":[55,72],"data":[56,73,88],"from":[57,71],"a":[58,109,115],"set":[59,111,155],"fixed":[61],"locations.":[62],"The":[63],"hold":[65],"different":[66],"roles":[67],"these":[69],"paths,":[70,198],"with":[74,91,98,114,126,176],"their":[75,171,221],"sensing-enabled":[76],"devices":[77],"relaying":[79],"them":[80,86,152],"and":[84,102,150,169,189,199,205],"uploading":[85],"collection":[89,203],"points":[90],"Internet":[92],"connectivity.":[93],"first":[95],"consider":[96],"scenarios":[97],"deterministic":[99],"node":[100],"mobility":[101,143,178],"formulate":[103],"selection":[105],"minimum-cost":[110],"cover":[112,156],"problem":[113,157,212],"submodular":[116],"objective":[117],"function.":[118],"then":[120],"generalize":[121],"more":[123],"realistic":[124,211],"settings":[125],"uncertainty":[127],"about":[128],"user":[130,142],"mobility.":[131],"A":[132],"methodology":[133],"is":[134],"devised":[135],"translating":[137],"statistics":[139,145],"individual":[141],"spacetime":[147],"path":[148],"formation":[149],"feeding":[151],"formulation.":[158],"describe":[160],"practical":[161],"greedy":[162],"heuristics":[163,215],"resulting":[166],"NP-hard":[167],"problems":[168],"compute":[170],"approximation":[172],"ratios.":[173],"Our":[174],"experimentation":[175],"real":[177],"datasets":[179],"(a)":[180],"illustrates":[181],"multiple":[183],"tradeoffs":[184],"between":[185],"campaign":[187],"cost":[188],"duration,":[190],"bound":[192],"hopcount":[195],"number":[201],"points;":[204],"(b)":[206],"provides":[207],"evidence":[208],"instances":[213],"perform":[216],"much":[217],"better":[218],"than":[219],"what":[220],"pessimistic":[222],"worst-case":[223],"bounds":[224],"suggest.":[225]},"counts_by_year":[{"year":2025,"cited_by_count":1},{"year":2024,"cited_by_count":9},{"year":2023,"cited_by_count":1},{"year":2022,"cited_by_count":16},{"year":2021,"cited_by_count":23},{"year":2020,"cited_by_count":42},{"year":2019,"cited_by_count":34},{"year":2018,"cited_by_count":34},{"year":2017,"cited_by_count":28},{"year":2016,"cited_by_count":17},{"year":2015,"cited_by_count":2}],"updated_date":"2026-07-29T14:22:42.915294","created_date":"2025-10-10T00:00:00"}