{"id":"https://openalex.org/W4386474131","doi":"https://doi.org/10.1109/lcn58197.2023.10223373","title":"Diversity Maximized Scheduling in RoadSide Units for Traffic Monitoring Applications","display_name":"Diversity Maximized Scheduling in RoadSide Units for Traffic Monitoring Applications","publication_year":2023,"publication_date":"2023-09-06","ids":{"openalex":"https://openalex.org/W4386474131","doi":"https://doi.org/10.1109/lcn58197.2023.10223373"},"language":"en","primary_location":{"id":"doi:10.1109/lcn58197.2023.10223373","is_oa":false,"landing_page_url":"https://doi.org/10.1109/lcn58197.2023.10223373","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"2023 IEEE 48th Conference on Local Computer Networks (LCN)","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/A5047560521","display_name":"Ahmad Sarlak","orcid":null},"institutions":[{"id":"https://openalex.org/I8078737","display_name":"Clemson University","ror":"https://ror.org/037s24f05","country_code":"US","type":"education","lineage":["https://openalex.org/I8078737"]}],"countries":["US"],"is_corresponding":true,"raw_author_name":"Ahmad Sarlak","raw_affiliation_strings":["Clemson University,School of Computing,Clemson,SC,USA","School of Computing, Clemson University, Clemson, SC, USA"],"affiliations":[{"raw_affiliation_string":"Clemson University,School of Computing,Clemson,SC,USA","institution_ids":["https://openalex.org/I8078737"]},{"raw_affiliation_string":"School of Computing, Clemson University, Clemson, SC, USA","institution_ids":["https://openalex.org/I8078737"]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5011987346","display_name":"Abolfazl Razi","orcid":"https://orcid.org/0000-0002-3330-6132"},"institutions":[{"id":"https://openalex.org/I8078737","display_name":"Clemson University","ror":"https://ror.org/037s24f05","country_code":"US","type":"education","lineage":["https://openalex.org/I8078737"]}],"countries":["US"],"is_corresponding":false,"raw_author_name":"Abolfazl Razi","raw_affiliation_strings":["Clemson University,School of Computing,Clemson,SC,USA","School of Computing, Clemson University, Clemson, SC, USA"],"affiliations":[{"raw_affiliation_string":"Clemson University,School of Computing,Clemson,SC,USA","institution_ids":["https://openalex.org/I8078737"]},{"raw_affiliation_string":"School of Computing, Clemson University, Clemson, SC, USA","institution_ids":["https://openalex.org/I8078737"]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5100657344","display_name":"Xiwen Chen","orcid":"https://orcid.org/0000-0002-8006-4383"},"institutions":[{"id":"https://openalex.org/I8078737","display_name":"Clemson University","ror":"https://ror.org/037s24f05","country_code":"US","type":"education","lineage":["https://openalex.org/I8078737"]}],"countries":["US"],"is_corresponding":false,"raw_author_name":"Xiwen Chen","raw_affiliation_strings":["Clemson University,School of Computing,Clemson,SC,USA","School of Computing, Clemson University, Clemson, SC, USA"],"affiliations":[{"raw_affiliation_string":"Clemson University,School of Computing,Clemson,SC,USA","institution_ids":["https://openalex.org/I8078737"]},{"raw_affiliation_string":"School of Computing, Clemson University, Clemson, SC, USA","institution_ids":["https://openalex.org/I8078737"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5085194763","display_name":"Rahul Amin","orcid":"https://orcid.org/0000-0002-2865-2356"},"institutions":[{"id":"https://openalex.org/I4210122954","display_name":"MIT Lincoln Laboratory","ror":"https://ror.org/022z6jk58","country_code":"US","type":"facility","lineage":["https://openalex.org/I4210122954","https://openalex.org/I63966007"]}],"countries":["US"],"is_corresponding":false,"raw_author_name":"Rahul Amin","raw_affiliation_strings":["Tactical Networks Group, MIT Lincoln Laboratory,Lexington,MA,USA","Tactical Networks Group, MIT Lincoln Laboratory, Lexington, MA, USA"],"affiliations":[{"raw_affiliation_string":"Tactical Networks Group, MIT Lincoln Laboratory,Lexington,MA,USA","institution_ids":["https://openalex.org/I4210122954"]},{"raw_affiliation_string":"Tactical Networks Group, MIT Lincoln Laboratory, Lexington, MA, USA","institution_ids":["https://openalex.org/I4210122954"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":4,"corresponding_author_ids":["https://openalex.org/A5047560521"],"corresponding_institution_ids":["https://openalex.org/I8078737"],"apc_list":null,"apc_paid":null,"fwci":1.7457,"has_fulltext":false,"cited_by_count":10,"citation_normalized_percentile":{"value":0.87699234,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":{"min":97,"max":98},"biblio":{"volume":null,"issue":null,"first_page":"1","last_page":"4"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T10764","display_name":"Privacy-Preserving Technologies in Data","score":0.9998000264167786,"subfield":{"id":"https://openalex.org/subfields/1702","display_name":"Artificial Intelligence"},"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/T10764","display_name":"Privacy-Preserving Technologies in Data","score":0.9998000264167786,"subfield":{"id":"https://openalex.org/subfields/1702","display_name":"Artificial Intelligence"},"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/T10237","display_name":"Cryptography and Data Security","score":0.9919000267982483,"subfield":{"id":"https://openalex.org/subfields/1702","display_name":"Artificial Intelligence"},"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/T11612","display_name":"Stochastic Gradient Optimization Techniques","score":0.9912999868392944,"subfield":{"id":"https://openalex.org/subfields/1702","display_name":"Artificial Intelligence"},"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.7688286304473877},{"id":"https://openalex.org/keywords/scheduling","display_name":"Scheduling (production processes)","score":0.6600345969200134},{"id":"https://openalex.org/keywords/greedy-algorithm","display_name":"Greedy algorithm","score":0.5240033864974976},{"id":"https://openalex.org/keywords/selection","display_name":"Selection (genetic algorithm)","score":0.46924901008605957},{"id":"https://openalex.org/keywords/reinforcement-learning","display_name":"Reinforcement learning","score":0.46445465087890625},{"id":"https://openalex.org/keywords/interval","display_name":"Interval (graph theory)","score":0.4217188060283661},{"id":"https://openalex.org/keywords/artificial-intelligence","display_name":"Artificial intelligence","score":0.32312995195388794},{"id":"https://openalex.org/keywords/mathematical-optimization","display_name":"Mathematical optimization","score":0.21243473887443542},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.1600854992866516}],"concepts":[{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.7688286304473877},{"id":"https://openalex.org/C206729178","wikidata":"https://www.wikidata.org/wiki/Q2271896","display_name":"Scheduling (production processes)","level":2,"score":0.6600345969200134},{"id":"https://openalex.org/C51823790","wikidata":"https://www.wikidata.org/wiki/Q504353","display_name":"Greedy algorithm","level":2,"score":0.5240033864974976},{"id":"https://openalex.org/C81917197","wikidata":"https://www.wikidata.org/wiki/Q628760","display_name":"Selection (genetic algorithm)","level":2,"score":0.46924901008605957},{"id":"https://openalex.org/C97541855","wikidata":"https://www.wikidata.org/wiki/Q830687","display_name":"Reinforcement learning","level":2,"score":0.46445465087890625},{"id":"https://openalex.org/C2778067643","wikidata":"https://www.wikidata.org/wiki/Q166507","display_name":"Interval (graph theory)","level":2,"score":0.4217188060283661},{"id":"https://openalex.org/C154945302","wikidata":"https://www.wikidata.org/wiki/Q11660","display_name":"Artificial intelligence","level":1,"score":0.32312995195388794},{"id":"https://openalex.org/C126255220","wikidata":"https://www.wikidata.org/wiki/Q141495","display_name":"Mathematical optimization","level":1,"score":0.21243473887443542},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.1600854992866516},{"id":"https://openalex.org/C114614502","wikidata":"https://www.wikidata.org/wiki/Q76592","display_name":"Combinatorics","level":1,"score":0.0},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.0}],"mesh":[],"locations_count":1,"locations":[{"id":"doi:10.1109/lcn58197.2023.10223373","is_oa":false,"landing_page_url":"https://doi.org/10.1109/lcn58197.2023.10223373","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"2023 IEEE 48th Conference on Local Computer Networks (LCN)","raw_type":"proceedings-article"}],"best_oa_location":null,"sustainable_development_goals":[],"awards":[],"funders":[{"id":"https://openalex.org/F4320306076","display_name":"National Science Foundation","ror":"https://ror.org/021nxhr62"}],"has_content":{"pdf":false,"grobid_xml":false},"content_urls":null,"referenced_works_count":21,"referenced_works":["https://openalex.org/W1562810981","https://openalex.org/W1580375566","https://openalex.org/W2113371053","https://openalex.org/W2116612304","https://openalex.org/W2138779671","https://openalex.org/W2798720628","https://openalex.org/W2963351448","https://openalex.org/W3090615085","https://openalex.org/W3105122387","https://openalex.org/W3132438052","https://openalex.org/W3198080154","https://openalex.org/W3216563077","https://openalex.org/W4214911442","https://openalex.org/W4221145385","https://openalex.org/W4283808627","https://openalex.org/W4285523956","https://openalex.org/W4312288984","https://openalex.org/W4361272114","https://openalex.org/W6806609746","https://openalex.org/W6810891649","https://openalex.org/W6848079696"],"related_works":["https://openalex.org/W4387497383","https://openalex.org/W3183948672","https://openalex.org/W3173606202","https://openalex.org/W3110381201","https://openalex.org/W2948807893","https://openalex.org/W2935909890","https://openalex.org/W2778153218","https://openalex.org/W2758277628","https://openalex.org/W1531601525","https://openalex.org/W4306904969"],"abstract_inverted_index":{"This":[0],"paper":[1],"develops":[2],"an":[3],"optimal":[4],"data":[5,45,77,112],"aggregation":[6],"policy":[7,89],"for":[8,79],"learning-based":[9],"traffic":[10],"control":[11],"systems":[12],"based":[13,47],"on":[14,48],"imagery":[15],"collected":[16],"from":[17,32],"Road":[18],"Side":[19],"Units":[20],"(RSUs)":[21],"under":[22],"imperfect":[23],"communications.":[24],"Our":[25,122],"focus":[26],"is":[27],"optimizing":[28],"semantic":[29],"information":[30],"flow":[31],"RSUs":[33,101],"to":[34,75,95,110,118,129],"a":[35,85,106],"nearby":[36],"edge":[37],"server":[38],"or":[39],"cloud-based":[40],"processing":[41],"units":[42],"by":[43,91],"maximizing":[44],"diversity":[46,78],"the":[49,97,116,119],"target":[50],"machine":[51],"learning":[52,120,126],"application":[53],"while":[54],"taking":[55],"into":[56],"account":[57],"heterogeneous":[58],"channel":[59],"conditions":[60],"and":[61,134],"constrained":[62],"total":[63],"transmission":[64],"rate.":[65],"To":[66],"this":[67],"end,":[68],"we":[69,83,104],"enforce":[70],"fairness":[71],"among":[72],"class":[73],"labels":[74],"increase":[76],"classification":[80],"problems.":[81],"Furthermore,":[82],"propose":[84],"greedy":[86],"interval-by-interval":[87],"scheduling":[88],"powered":[90],"coalition":[92],"game":[93],"theory":[94],"reduce":[96],"computation":[98],"complexity.":[99],"Once,":[100],"are":[102],"selected,":[103],"employ":[105],"maximum":[107],"uncertainty":[108],"method":[109,123],"handpick":[111],"samples":[113],"that":[114],"contribute":[115],"most":[117],"performance.":[121],"yields":[124],"higher":[125],"accuracy":[127],"compared":[128],"random":[130],"selection,":[131,133],"uniform":[132],"network-based":[135],"optimization":[136],"methods":[137],"(e.g.,":[138],"FedCS)":[139],"<sup":[140],"xmlns:mml=\"http://www.w3.org/1998/Math/MathML\"":[141],"xmlns:xlink=\"http://www.w3.org/1999/xlink\">1</sup>":[142],".":[143]},"counts_by_year":[{"year":2024,"cited_by_count":4},{"year":2023,"cited_by_count":6}],"updated_date":"2025-11-06T03:46:38.306776","created_date":"2025-10-10T00:00:00"}