{"id":"https://openalex.org/W2066546615","doi":"https://doi.org/10.1145/2746285.2746287","title":"An Online Approach to Dynamic Channel Access and Transmission Scheduling","display_name":"An Online Approach to Dynamic Channel Access and Transmission Scheduling","publication_year":2015,"publication_date":"2015-06-12","ids":{"openalex":"https://openalex.org/W2066546615","doi":"https://doi.org/10.1145/2746285.2746287","mag":"2066546615"},"language":"en","primary_location":{"id":"doi:10.1145/2746285.2746287","is_oa":false,"landing_page_url":"https://doi.org/10.1145/2746285.2746287","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Proceedings of the 16th ACM International Symposium on Mobile Ad Hoc Networking and Computing","raw_type":"proceedings-article"},"type":"preprint","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/A5100355722","display_name":"Yang Liu","orcid":"https://orcid.org/0000-0001-8420-6011"},"institutions":[{"id":"https://openalex.org/I27837315","display_name":"University of Michigan\u2013Ann Arbor","ror":"https://ror.org/00jmfr291","country_code":"US","type":"education","lineage":["https://openalex.org/I27837315"]}],"countries":["US"],"is_corresponding":true,"raw_author_name":"Yang Liu","raw_affiliation_strings":["University of Michigan, Ann Arbor, Ann Arbor, MI, USA"],"affiliations":[{"raw_affiliation_string":"University of Michigan, Ann Arbor, Ann Arbor, MI, USA","institution_ids":["https://openalex.org/I27837315"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5101967011","display_name":"Mingyan Liu","orcid":"https://orcid.org/0000-0003-3295-9200"},"institutions":[{"id":"https://openalex.org/I27837315","display_name":"University of Michigan\u2013Ann Arbor","ror":"https://ror.org/00jmfr291","country_code":"US","type":"education","lineage":["https://openalex.org/I27837315"]}],"countries":["US"],"is_corresponding":false,"raw_author_name":"Mingyan Liu","raw_affiliation_strings":["University of Michigan, Ann Arbor, Ann Arbor, MI, USA"],"affiliations":[{"raw_affiliation_string":"University of Michigan, Ann Arbor, Ann Arbor, MI, USA","institution_ids":["https://openalex.org/I27837315"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":2,"corresponding_author_ids":["https://openalex.org/A5100355722"],"corresponding_institution_ids":["https://openalex.org/I27837315"],"apc_list":null,"apc_paid":null,"fwci":3.7119,"has_fulltext":false,"cited_by_count":20,"citation_normalized_percentile":{"value":0.93006398,"is_in_top_1_percent":false,"is_in_top_10_percent":true},"cited_by_percentile_year":{"min":89,"max":98},"biblio":{"volume":null,"issue":null,"first_page":"187","last_page":"196"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T12101","display_name":"Advanced Bandit Algorithms Research","score":0.9998999834060669,"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"}},"topics":[{"id":"https://openalex.org/T12101","display_name":"Advanced Bandit Algorithms Research","score":0.9998999834060669,"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"}},{"id":"https://openalex.org/T11409","display_name":"Advanced Wireless Network Optimization","score":0.9997000098228455,"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/T13553","display_name":"Age of Information Optimization","score":0.9965000152587891,"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.7704818248748779},{"id":"https://openalex.org/keywords/channel","display_name":"Channel (broadcasting)","score":0.6323934197425842},{"id":"https://openalex.org/keywords/a-priori-and-a-posteriori","display_name":"A priori and a posteriori","score":0.5735235214233398},{"id":"https://openalex.org/keywords/regret","display_name":"Regret","score":0.563718318939209},{"id":"https://openalex.org/keywords/dynamic-priority-scheduling","display_name":"Dynamic priority scheduling","score":0.5413098335266113},{"id":"https://openalex.org/keywords/scheduling","display_name":"Scheduling (production processes)","score":0.5380575060844421},{"id":"https://openalex.org/keywords/exploit","display_name":"Exploit","score":0.48085886240005493},{"id":"https://openalex.org/keywords/random-access","display_name":"Random access","score":0.47298845648765564},{"id":"https://openalex.org/keywords/spectral-efficiency","display_name":"Spectral efficiency","score":0.47108709812164307},{"id":"https://openalex.org/keywords/reinforcement-learning","display_name":"Reinforcement learning","score":0.453235387802124},{"id":"https://openalex.org/keywords/wireless","display_name":"Wireless","score":0.4485607147216797},{"id":"https://openalex.org/keywords/channel-allocation-schemes","display_name":"Channel allocation schemes","score":0.4473971128463745},{"id":"https://openalex.org/keywords/context","display_name":"Context (archaeology)","score":0.4369688034057617},{"id":"https://openalex.org/keywords/dynamic-programming","display_name":"Dynamic programming","score":0.4314063787460327},{"id":"https://openalex.org/keywords/computer-network","display_name":"Computer network","score":0.357697457075119},{"id":"https://openalex.org/keywords/mathematical-optimization","display_name":"Mathematical optimization","score":0.34031349420547485},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.23298314213752747},{"id":"https://openalex.org/keywords/machine-learning","display_name":"Machine learning","score":0.21720874309539795},{"id":"https://openalex.org/keywords/telecommunications","display_name":"Telecommunications","score":0.21169933676719666},{"id":"https://openalex.org/keywords/quality-of-service","display_name":"Quality of service","score":0.14433225989341736},{"id":"https://openalex.org/keywords/computer-security","display_name":"Computer security","score":0.0928983986377716},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.09144768118858337}],"concepts":[{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.7704818248748779},{"id":"https://openalex.org/C127162648","wikidata":"https://www.wikidata.org/wiki/Q16858953","display_name":"Channel (broadcasting)","level":2,"score":0.6323934197425842},{"id":"https://openalex.org/C75553542","wikidata":"https://www.wikidata.org/wiki/Q178161","display_name":"A priori and a posteriori","level":2,"score":0.5735235214233398},{"id":"https://openalex.org/C50817715","wikidata":"https://www.wikidata.org/wiki/Q79895177","display_name":"Regret","level":2,"score":0.563718318939209},{"id":"https://openalex.org/C107568181","wikidata":"https://www.wikidata.org/wiki/Q5319000","display_name":"Dynamic priority scheduling","level":3,"score":0.5413098335266113},{"id":"https://openalex.org/C206729178","wikidata":"https://www.wikidata.org/wiki/Q2271896","display_name":"Scheduling (production processes)","level":2,"score":0.5380575060844421},{"id":"https://openalex.org/C165696696","wikidata":"https://www.wikidata.org/wiki/Q11287","display_name":"Exploit","level":2,"score":0.48085886240005493},{"id":"https://openalex.org/C101722063","wikidata":"https://www.wikidata.org/wiki/Q218825","display_name":"Random access","level":2,"score":0.47298845648765564},{"id":"https://openalex.org/C137246740","wikidata":"https://www.wikidata.org/wiki/Q583970","display_name":"Spectral efficiency","level":3,"score":0.47108709812164307},{"id":"https://openalex.org/C97541855","wikidata":"https://www.wikidata.org/wiki/Q830687","display_name":"Reinforcement learning","level":2,"score":0.453235387802124},{"id":"https://openalex.org/C555944384","wikidata":"https://www.wikidata.org/wiki/Q249","display_name":"Wireless","level":2,"score":0.4485607147216797},{"id":"https://openalex.org/C114237682","wikidata":"https://www.wikidata.org/wiki/Q5072483","display_name":"Channel allocation schemes","level":3,"score":0.4473971128463745},{"id":"https://openalex.org/C2779343474","wikidata":"https://www.wikidata.org/wiki/Q3109175","display_name":"Context (archaeology)","level":2,"score":0.4369688034057617},{"id":"https://openalex.org/C37404715","wikidata":"https://www.wikidata.org/wiki/Q380679","display_name":"Dynamic programming","level":2,"score":0.4314063787460327},{"id":"https://openalex.org/C31258907","wikidata":"https://www.wikidata.org/wiki/Q1301371","display_name":"Computer network","level":1,"score":0.357697457075119},{"id":"https://openalex.org/C126255220","wikidata":"https://www.wikidata.org/wiki/Q141495","display_name":"Mathematical optimization","level":1,"score":0.34031349420547485},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.23298314213752747},{"id":"https://openalex.org/C119857082","wikidata":"https://www.wikidata.org/wiki/Q2539","display_name":"Machine learning","level":1,"score":0.21720874309539795},{"id":"https://openalex.org/C76155785","wikidata":"https://www.wikidata.org/wiki/Q418","display_name":"Telecommunications","level":1,"score":0.21169933676719666},{"id":"https://openalex.org/C5119721","wikidata":"https://www.wikidata.org/wiki/Q220501","display_name":"Quality of service","level":2,"score":0.14433225989341736},{"id":"https://openalex.org/C38652104","wikidata":"https://www.wikidata.org/wiki/Q3510521","display_name":"Computer security","level":1,"score":0.0928983986377716},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.09144768118858337},{"id":"https://openalex.org/C138885662","wikidata":"https://www.wikidata.org/wiki/Q5891","display_name":"Philosophy","level":0,"score":0.0},{"id":"https://openalex.org/C86803240","wikidata":"https://www.wikidata.org/wiki/Q420","display_name":"Biology","level":0,"score":0.0},{"id":"https://openalex.org/C151730666","wikidata":"https://www.wikidata.org/wiki/Q7205","display_name":"Paleontology","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}],"mesh":[],"locations_count":1,"locations":[{"id":"doi:10.1145/2746285.2746287","is_oa":false,"landing_page_url":"https://doi.org/10.1145/2746285.2746287","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Proceedings of the 16th ACM International Symposium on Mobile Ad Hoc Networking and Computing","raw_type":"proceedings-article"}],"best_oa_location":null,"sustainable_development_goals":[{"display_name":"Affordable and clean energy","id":"https://metadata.un.org/sdg/7","score":0.8899999856948853}],"awards":[{"id":"https://openalex.org/G2106233558","display_name":null,"funder_award_id":"CNS 1217689","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":{"pdf":false,"grobid_xml":false},"content_urls":null,"referenced_works_count":35,"referenced_works":["https://openalex.org/W41554520","https://openalex.org/W1552540037","https://openalex.org/W1918580425","https://openalex.org/W1972058715","https://openalex.org/W1976501316","https://openalex.org/W1992595998","https://openalex.org/W1997388850","https://openalex.org/W2007587873","https://openalex.org/W2009551863","https://openalex.org/W2010189695","https://openalex.org/W2027406966","https://openalex.org/W2029199203","https://openalex.org/W2033129021","https://openalex.org/W2066546615","https://openalex.org/W2083877554","https://openalex.org/W2083896716","https://openalex.org/W2094581499","https://openalex.org/W2095157403","https://openalex.org/W2099654130","https://openalex.org/W2102015854","https://openalex.org/W2107923614","https://openalex.org/W2120125372","https://openalex.org/W2121863487","https://openalex.org/W2125724988","https://openalex.org/W2127169877","https://openalex.org/W2129649030","https://openalex.org/W2131257134","https://openalex.org/W2136156306","https://openalex.org/W2149130894","https://openalex.org/W2157146750","https://openalex.org/W2168405694","https://openalex.org/W2338343974","https://openalex.org/W2400672140","https://openalex.org/W4214717370","https://openalex.org/W4235632527"],"related_works":["https://openalex.org/W2971351794","https://openalex.org/W4376155396","https://openalex.org/W1947085858","https://openalex.org/W2174986909","https://openalex.org/W2527791220","https://openalex.org/W2101991911","https://openalex.org/W2155070487","https://openalex.org/W4311589891","https://openalex.org/W3123835761","https://openalex.org/W118270247"],"abstract_inverted_index":{"Making":[0],"judicious":[1],"channel":[2,46,81,133,146,153,180,203],"access":[3,47,134,147,204],"and":[4,20,40,44,60,160,163,205,236,256,266,288],"transmission":[5,206],"scheduling":[6,207],"decisions":[7],"is":[8,67,86,137,173,234],"essential":[9],"for":[10,261,269],"improving":[11],"performance":[12,122,211],"(delay,":[13],"throughput,":[14],"etc.)":[15],"as":[16,18],"well":[17],"energy":[19],"spectral":[21,161],"efficiency":[22],"in":[23,36,96,105,117,245,254,286],"multichannel":[24,272],"wireless":[25],"systems.":[26],"This":[27],"problem":[28],"has":[29,91],"been":[30,93],"a":[31,58,76,87,101,130,139,165,178,214,231,262,270],"subject":[32],"of":[33,63,75,79,177,182,216,248],"extensive":[34],"study":[35],"the":[37,41,80,97,110,118,174,219,223,246,259,267,290],"past":[38],"decade,":[39],"resulting":[42],"dynamic":[43,65,132,202],"opportunistic":[45],"schemes":[48,66],"can":[49,149],"bring":[50],"potentially":[51],"significant":[52],"improvement":[53],"over":[54],"traditional":[55],"schemes.":[56],"However,":[57],"common":[59],"severe":[61],"limitation":[62],"these":[64],"that":[68,155,196,237,252,279],"they":[69],"almost":[70],"always":[71],"require":[72],"some":[73],"form":[74,215],"priori":[77,232],"knowledge":[78],"statistics.":[82],"A":[83],"natural":[84],"remedy":[85],"learning":[88,103,129,168,194,293],"framework,":[89],"which":[90,172],"also":[92],"extensively":[94],"studied":[95],"same":[98],"context,":[99],"but":[100],"typical":[102,166],"algorithm":[104,169],"this":[106,186,190],"literature":[107],"seeks":[108],"only":[109],"best":[111,119],"static":[112,175],"policy":[113,148],"(i.e.,":[114],"to":[115],"stay":[116],"channel),":[120],"with":[121,151],"measured":[123,212],"by":[124,192,213,226,238],"weak":[125],"regret,":[126,218],"rather":[127],"than":[128],"good":[131],"policy.":[135],"There":[136],"thus":[138],"clear":[140],"disconnect":[141],"between":[142,222],"what":[143,164],"an":[144,227],"optimal":[145,199,228],"achieve":[150,282],"known":[152,198],"statistics":[154],"actively":[156],"exploits":[157],"temporal,":[158],"spatial":[159],"diversity,":[162],"existing":[167],"aims":[170],"for,":[171],"use":[176],"single":[179],"devoid":[181],"diversity":[183],"gain.":[184],"In":[185,274],"paper":[187],"we":[188,277],"bridge":[189],"gap":[191],"designing":[193],"algorithms":[195,251,281],"track":[197],"or":[200],"sub-optimal":[201],"policies,":[208],"thereby":[209],"yielding":[210],"strong":[217],"accumulated":[220],"difference":[221],"reward":[224],"returned":[225],"solution":[229],"when":[230],"information":[233],"available":[235],"our":[239,280],"online":[240],"algorithm.":[241],"We":[242],"do":[243],"so":[244],"context":[247],"two":[249],"specific":[250],"appeared":[253],"[1]":[255],"[2],":[257],"respectively,":[258],"former":[260],"multiuser":[263],"single-channel":[264],"setting":[265],"latter":[268],"single-user":[271],"setting.":[273],"both":[275],"cases":[276],"show":[278],"sub-linear":[283],"regret":[284],"uniform":[285],"time":[287],"outperforms":[289],"standard":[291],"weak-regret":[292],"algorithms.":[294]},"counts_by_year":[{"year":2023,"cited_by_count":1},{"year":2022,"cited_by_count":4},{"year":2021,"cited_by_count":2},{"year":2020,"cited_by_count":1},{"year":2019,"cited_by_count":3},{"year":2018,"cited_by_count":4},{"year":2017,"cited_by_count":2},{"year":2016,"cited_by_count":2},{"year":2015,"cited_by_count":1}],"updated_date":"2026-04-04T16:13:02.066488","created_date":"2025-10-10T00:00:00"}