{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,6,18]],"date-time":"2025-06-18T06:40:09Z","timestamp":1750228809076,"version":"3.41.0"},"publisher-location":"New York, NY, USA","reference-count":32,"publisher":"ACM","license":[{"start":{"date-parts":[[2015,6,22]],"date-time":"2015-06-22T00:00:00Z","timestamp":1434931200000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.acm.org\/publications\/policies\/copyright_policy#Background"}],"funder":[{"DOI":"10.13039\/100000001","name":"National Science Foundation","doi-asserted-by":"publisher","award":["CNS 1217689"],"award-info":[{"award-number":["CNS 1217689"]}],"id":[{"id":"10.13039\/100000001","id-type":"DOI","asserted-by":"publisher"}]}],"content-domain":{"domain":["dl.acm.org"],"crossmark-restriction":true},"short-container-title":[],"published-print":{"date-parts":[[2015,6,22]]},"DOI":"10.1145\/2746285.2746287","type":"proceedings-article","created":{"date-parts":[[2015,6,12]],"date-time":"2015-06-12T18:43:54Z","timestamp":1434134634000},"page":"187-196","update-policy":"https:\/\/doi.org\/10.1145\/crossmark-policy","source":"Crossref","is-referenced-by-count":17,"title":["An Online Approach to Dynamic Channel Access and Transmission Scheduling"],"prefix":"10.1145","author":[{"given":"Yang","family":"Liu","sequence":"first","affiliation":[{"name":"University of Michigan, Ann Arbor, Ann Arbor, MI, USA"}]},{"given":"Mingyan","family":"Liu","sequence":"additional","affiliation":[{"name":"University of Michigan, Ann Arbor, Ann Arbor, MI, USA"}]}],"member":"320","published-online":{"date-parts":[[2015,6,22]]},"reference":[{"key":"e_1_3_2_1_1_1","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2008.2008137"},{"key":"e_1_3_2_1_2_1","doi-asserted-by":"publisher","DOI":"10.1109\/TNET.2009.2014460"},{"key":"e_1_3_2_1_3_1","doi-asserted-by":"publisher","DOI":"10.1109\/BROADNETS.2004.46"},{"key":"e_1_3_2_1_4_1","doi-asserted-by":"publisher","DOI":"10.1145\/1614320.1614325"},{"key":"e_1_3_2_1_5_1","doi-asserted-by":"publisher","DOI":"10.1109\/TNET.2007.893230"},{"key":"e_1_3_2_1_6_1","doi-asserted-by":"publisher","DOI":"10.1109\/INFCOM.2003.1208947"},{"key":"e_1_3_2_1_7_1","doi-asserted-by":"publisher","DOI":"10.1109\/35.900644"},{"key":"e_1_3_2_1_8_1","first-page":"976","volume-title":"Dynamic Rate Control Algorithms for HDR Throughput Optimization. In INFOCOM 2001. Twentieth Annual Joint Conference of the IEEE Computer and Communications Societies. Proceedings. IEEE","volume":"2","author":"Borst S.","year":"2001","unstructured":"S. Borst and P. Whiting . Dynamic Rate Control Algorithms for HDR Throughput Optimization. In INFOCOM 2001. Twentieth Annual Joint Conference of the IEEE Computer and Communications Societies. Proceedings. IEEE , volume 2 , pages 976 -- 985 vol.2, 2001 . S. Borst and P. Whiting. Dynamic Rate Control Algorithms for HDR Throughput Optimization. In INFOCOM 2001. Twentieth Annual Joint Conference of the IEEE Computer and Communications Societies. Proceedings. IEEE, volume 2, pages 976--985 vol.2, 2001."},{"key":"e_1_3_2_1_9_1","doi-asserted-by":"publisher","DOI":"10.5555\/1833515.1833882"},{"key":"e_1_3_2_1_10_1","doi-asserted-by":"publisher","DOI":"10.1109\/INFCOM.2003.1208698"},{"key":"e_1_3_2_1_11_1","first-page":"1427","volume-title":"Explicit and Implicit Pipelining for Wireless Medium Access Control. In Vehicular Technology Conference, 2003. VTC 2003-Fall. 2003 IEEE 58th","volume":"3","author":"Yang X.","year":"2003","unstructured":"X. Yang and N.H. Vaidya . Explicit and Implicit Pipelining for Wireless Medium Access Control. In Vehicular Technology Conference, 2003. VTC 2003-Fall. 2003 IEEE 58th , volume 3 , pages 1427 -- 1431 Vol.3, oct. 2003 . X. Yang and N.H. Vaidya. Explicit and Implicit Pipelining for Wireless Medium Access Control. In Vehicular Technology Conference, 2003. VTC 2003-Fall. 2003 IEEE 58th, volume 3, pages 1427--1431 Vol.3, oct. 2003."},{"key":"e_1_3_2_1_12_1","doi-asserted-by":"publisher","DOI":"10.1109\/26.111441"},{"key":"e_1_3_2_1_13_1","doi-asserted-by":"publisher","DOI":"10.1002\/bltj.2069"},{"key":"e_1_3_2_1_14_1","doi-asserted-by":"publisher","DOI":"10.1016\/0196-8858(85)90002-8"},{"key":"e_1_3_2_1_15_1","volume-title":"University of California","author":"Anantharam V.","year":"1986","unstructured":"V. Anantharam , P. Varaiya , and J. Walrand . Asymptotically Efficient Allocation Rules for the Multiarmed Bandit Problem with Multiple Plays Part I: I.I.D. Rewards, Part II: Markovian Rewards. Technical Report UCB\/ERL M86\/62, EECS Department , University of California , Berkeley , 1986 . V. Anantharam, P. Varaiya, and J. Walrand. Asymptotically Efficient Allocation Rules for the Multiarmed Bandit Problem with Multiple Plays Part I: I.I.D. Rewards, Part II: Markovian Rewards. Technical Report UCB\/ERL M86\/62, EECS Department, University of California, Berkeley, 1986."},{"key":"e_1_3_2_1_16_1","doi-asserted-by":"publisher","DOI":"10.1023\/A:1013689704352"},{"key":"e_1_3_2_1_17_1","doi-asserted-by":"publisher","DOI":"10.1109\/INFCOM.2011.5935068"},{"key":"e_1_3_2_1_18_1","doi-asserted-by":"publisher","DOI":"10.1109\/MILCOM.2012.6415693"},{"key":"e_1_3_2_1_19_1","doi-asserted-by":"publisher","DOI":"10.1109\/ITA.2011.5743588"},{"key":"e_1_3_2_1_20_1","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-642-30373-9_23"},{"key":"e_1_3_2_1_21_1","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2006.890777"},{"key":"e_1_3_2_1_22_1","unstructured":"J. Heinonen. Lectures on Lipschitz analysis. 2005.  J. Heinonen. Lectures on Lipschitz analysis. 2005."},{"key":"e_1_3_2_1_23_1","doi-asserted-by":"publisher","DOI":"10.1137\/S0363012992237273"},{"key":"e_1_3_2_1_24_1","volume-title":"Reinforcement learning: An introduction","author":"Barto A. G","year":"1998","unstructured":"A. G Barto . Reinforcement learning: An introduction . MIT press , 1998 . A. G Barto. Reinforcement learning: An introduction. MIT press, 1998."},{"key":"e_1_3_2_1_25_1","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2009.2025561"},{"issue":"8","key":"e_1_3_2_1_26_1","first-page":"4922","article-title":"Sufficient conditions on the optimality of myopic sensing in opportunistic channel access: A unifying framework. Information Theory","volume":"60","author":"Liu Y.","year":"2014","unstructured":"Y. Liu , M. Liu , and S.H.A. Ahmed . Sufficient conditions on the optimality of myopic sensing in opportunistic channel access: A unifying framework. Information Theory , IEEE Transactions on , 60 ( 8 ): 4922 -- 4940 , Aug 2014 . Y. Liu, M. Liu, and S.H.A. Ahmed. Sufficient conditions on the optimality of myopic sensing in opportunistic channel access: A unifying framework. Information Theory, IEEE Transactions on, 60(8):4922--4940, Aug 2014.","journal-title":"IEEE Transactions on"},{"key":"e_1_3_2_1_27_1","doi-asserted-by":"publisher","DOI":"10.1109\/CDC.2006.377612"},{"key":"e_1_3_2_1_28_1","doi-asserted-by":"publisher","DOI":"10.1287\/opre.48.1.80.12444"},{"key":"e_1_3_2_1_29_1","doi-asserted-by":"publisher","DOI":"10.1109\/INFCOM.2011.5935146"},{"key":"e_1_3_2_1_30_1","article-title":"Scheduling in wireless networks with rayleigh-fading interference. Mobile Computing","author":"Dams J.","year":"2014","unstructured":"J. Dams , M. Hoefer , and T. Kesselheim . Scheduling in wireless networks with rayleigh-fading interference. Mobile Computing , IEEE Transactions on, PP(99):1--1 , 2014 . J. Dams, M. Hoefer, and T. Kesselheim. Scheduling in wireless networks with rayleigh-fading interference. Mobile Computing, IEEE Transactions on, PP(99):1--1, 2014.","journal-title":"IEEE Transactions on, PP(99):1--1"},{"key":"e_1_3_2_1_31_1","volume-title":"Optimal exploration-exploitation in a multi-armed-bandit problem with non-stationary rewards. Available at SSRN 2436629","author":"Besbes O.","year":"2014","unstructured":"O. Besbes , Y. Gur , and A. Zeevi . Optimal exploration-exploitation in a multi-armed-bandit problem with non-stationary rewards. Available at SSRN 2436629 , 2014 . O. Besbes, Y. Gur, and A. Zeevi. Optimal exploration-exploitation in a multi-armed-bandit problem with non-stationary rewards. Available at SSRN 2436629, 2014."},{"key":"e_1_3_2_1_32_1","doi-asserted-by":"publisher","DOI":"10.1145\/2746285.2746287"}],"event":{"name":"MobiHoc'15: The Sixteenth ACM International Symposium on Mobile Ad Hoc Networking and Computing","sponsor":["SIGMOBILE ACM Special Interest Group on Mobility of Systems, Users, Data and Computing"],"location":"Hangzhou China","acronym":"MobiHoc'15"},"container-title":["Proceedings of the 16th ACM International Symposium on Mobile Ad Hoc Networking and Computing"],"original-title":[],"link":[{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/2746285.2746287","content-type":"unspecified","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/dl.acm.org\/doi\/pdf\/10.1145\/2746285.2746287","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,6,18]],"date-time":"2025-06-18T06:16:57Z","timestamp":1750227417000},"score":1,"resource":{"primary":{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/2746285.2746287"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2015,6,22]]},"references-count":32,"alternative-id":["10.1145\/2746285.2746287","10.1145\/2746285"],"URL":"https:\/\/doi.org\/10.1145\/2746285.2746287","relation":{},"subject":[],"published":{"date-parts":[[2015,6,22]]},"assertion":[{"value":"2015-06-22","order":2,"name":"published","label":"Published","group":{"name":"publication_history","label":"Publication History"}}]}}