{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,10,28]],"date-time":"2025-10-28T00:30:56Z","timestamp":1761611456652,"version":"3.37.3"},"reference-count":29,"publisher":"Springer Science and Business Media LLC","issue":"4","license":[{"start":{"date-parts":[[2018,7,16]],"date-time":"2018-07-16T00:00:00Z","timestamp":1531699200000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"funder":[{"DOI":"10.13039\/501100004083","name":"Ministry of Science ICT and Future Planning","doi-asserted-by":"publisher","award":["IITP-2017-2016-0-00313"],"award-info":[{"award-number":["IITP-2017-2016-0-00313"]}],"id":[{"id":"10.13039\/501100004083","id-type":"DOI","asserted-by":"publisher"}]},{"DOI":"10.13039\/501100003621","name":"Ministry of Science, ICT and Future Planning","doi-asserted-by":"publisher","award":["2015-0-00278"],"award-info":[{"award-number":["2015-0-00278"]}],"id":[{"id":"10.13039\/501100003621","id-type":"DOI","asserted-by":"publisher"}]}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":["Wireless Netw"],"published-print":{"date-parts":[[2019,5]]},"DOI":"10.1007\/s11276-018-1800-6","type":"journal-article","created":{"date-parts":[[2018,7,16]],"date-time":"2018-07-16T04:41:40Z","timestamp":1531716100000},"page":"2101-2115","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":2,"title":["Optimal CSMA scheduling with dual access probability for wireless networks"],"prefix":"10.1007","volume":"25","author":[{"ORCID":"https:\/\/orcid.org\/0000-0002-7186-2156","authenticated-orcid":false,"given":"Jin-Ghoo","family":"Choi","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0000-0003-1690-2298","authenticated-orcid":false,"given":"Changhee","family":"Joo","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2018,7,16]]},"reference":[{"issue":"2","key":"1800_CR1","doi-asserted-by":"publisher","first-page":"180","DOI":"10.1109\/JCN.2017.000027","volume":"19","author":"C Joo","year":"2017","unstructured":"Joo, C., & Kang, S. (2017). Joint scheduling of data transmission and wireless power transfer in multi-channel device-to-device networksnetworks. Journal of Communications and Networks, 19(2), 180\u2013188.","journal-title":"Journal of Communications and Networks"},{"issue":"12","key":"1800_CR2","doi-asserted-by":"publisher","first-page":"1936","DOI":"10.1109\/9.182479","volume":"37","author":"L Tassiulas","year":"1992","unstructured":"Tassiulas, L., & Ephremides, A. (1992). Stability properties of constrained queueing systems and scheduling policies for maximum throughput in multihop radio networks. IEEE Transactions on Automatic Control, 37(12), 1936\u20131948.","journal-title":"IEEE Transactions on Automatic Control"},{"issue":"1","key":"1800_CR3","doi-asserted-by":"publisher","first-page":"89","DOI":"10.1109\/JSAC.2004.837349","volume":"23","author":"MJ Neely","year":"2005","unstructured":"Neely, M. J., Modiano, E., & Rohrs, C. E. (2005). Dynamic power allocation and routing for time-varying wireless networks. IEEE Journal on Selected Areas in Communications, 23(1), 89\u2013103.","journal-title":"IEEE Journal on Selected Areas in Communications"},{"issue":"6","key":"1800_CR4","doi-asserted-by":"publisher","first-page":"595","DOI":"10.1109\/TMC.2007.1061","volume":"6","author":"X Wu","year":"2007","unstructured":"Wu, X., Srikant, R., & Perkins, J. R. (2007). Scheduling efficiency of distributed greedy scheduling algorithms in wireless networks. IEEE Transactions on Mobile Computing, 6(6), 595\u2013605.","journal-title":"IEEE Transactions on Mobile Computing"},{"key":"1800_CR5","doi-asserted-by":"crossref","unstructured":"Modiano, E., Shah, D., & Zussman, G. (2006). Maximizing throughput in wireless networks via gossiping. In Proceedings of the ACM SIGMETRICS.","DOI":"10.1145\/1140103.1140283"},{"issue":"5","key":"1800_CR6","doi-asserted-by":"publisher","first-page":"1481","DOI":"10.1109\/TNET.2008.2010857","volume":"17","author":"C Joo","year":"2009","unstructured":"Joo, C., & Shroff, N. (2009). Performance of random access scheduling schemes in multi-hop wireless networks. IEEE\/ACM Transactions on Networking, 17(5), 1481\u20131493.","journal-title":"IEEE\/ACM Transactions on Networking"},{"key":"1800_CR7","doi-asserted-by":"crossref","unstructured":"Sanghavi, S., Bui, L., & Srikant, R. (2007). Distributed link scheduling with constant overhead. In Proceedings of the ACM SIGMETRICS.","DOI":"10.1145\/1269899.1254920"},{"issue":"3","key":"1800_CR8","doi-asserted-by":"publisher","first-page":"960","DOI":"10.1109\/TNET.2009.2035046","volume":"18","author":"L Jiang","year":"2010","unstructured":"Jiang, L., & Walrand, J. (2010). A distributed CSMA algorithm for throughput and utility maximization in wireless networks. IEEE\/ACM Transactions on Networking, 18(3), 960\u2013972.","journal-title":"IEEE\/ACM Transactions on Networking"},{"issue":"12","key":"1800_CR9","doi-asserted-by":"publisher","first-page":"6182","DOI":"10.1109\/TIT.2010.2081490","volume":"56","author":"L Jiang","year":"2010","unstructured":"Jiang, L., Shah, D., Shin, J., & Walrand, J. (2010). Distributed random access algorithm: Scheduling and congestion control. IEEE Transactions on Information Theory, 56(12), 6182\u20136207.","journal-title":"IEEE Transactions on Information Theory"},{"key":"1800_CR10","doi-asserted-by":"crossref","unstructured":"Rajagopalan, S., Shah, D., & Shin, J. (2009). Network adiabatic theorem: An efficient randomized protocol for contention resolution. In Proceedings of the ACM SIGMETRICS.","DOI":"10.1145\/1555349.1555365"},{"key":"1800_CR11","doi-asserted-by":"crossref","unstructured":"Ni, J., Tan, B., & Srikant, R. (2010). Q-CSMA: Queue-length based CSMA\/CA algorithms for achieving maximum throughput and low delay in wireless networks. In IEEE INFOCOM.","DOI":"10.1109\/INFCOM.2010.5462229"},{"key":"1800_CR12","doi-asserted-by":"crossref","unstructured":"Ghaderi, J., & Srikant, R. (2012). Effect of access probabilities on the delay performance of Q-CSMA algorithms. In IEEE INFOCOM.","DOI":"10.1109\/INFCOM.2012.6195588"},{"key":"1800_CR13","doi-asserted-by":"crossref","unstructured":"Lee, C., Eun, D., Yun, S., & Yi, Y. (2012). From Glauber dynamics to Metropolis algorithm: Smaller delay in optimal CSMA. In IEEE ISIT.","DOI":"10.1109\/ISIT.2012.6284006"},{"key":"1800_CR14","doi-asserted-by":"crossref","unstructured":"Huang, P., & Lin, X. (2013). Improving the delay performance of CSMA algorithms: A virtual multi-channel approach. In IEEE INFOCOM.","DOI":"10.1109\/INFCOM.2013.6567067"},{"key":"1800_CR15","doi-asserted-by":"crossref","unstructured":"Kwak, J., Lee, C., & Eun, D. (2014). A high-order Markov chain based scheduling algorithm for low delay in CSMA networks. In IEEE INFOCOM.","DOI":"10.1109\/INFOCOM.2014.6848103"},{"key":"1800_CR16","doi-asserted-by":"crossref","unstructured":"Wang, Y., & Xia, Y. (2013). A distributed CSMA algorithm for wireless networks based on Ising model. In IEEE GLOBECOM.","DOI":"10.1109\/GLOCOM.2013.6831066"},{"key":"1800_CR17","doi-asserted-by":"crossref","unstructured":"Proutiere, A., Yi, Y., Lan, T., & Chiang, M. (2010). Resource allocation over network dynamics without timescale separation. In Proceedings of the IEEE INFOCOM.","DOI":"10.1109\/INFCOM.2010.5462201"},{"key":"1800_CR18","doi-asserted-by":"crossref","unstructured":"Qian, D., Zheng, D., Zhang, J., & Shroff, N. (2010). CSMA-based distributed scheduling in multi-hop MIMO networks under SINR model. In Proceedings of the IEEE INFOCOM.","DOI":"10.1109\/INFCOM.2010.5462119"},{"issue":"4","key":"1800_CR19","doi-asserted-by":"publisher","first-page":"1204","DOI":"10.1109\/TNET.2013.2273100","volume":"22","author":"J Choi","year":"2014","unstructured":"Choi, J., Joo, C., Zhang, J., & Shroff, N. (2014). Distributed link scheduling under SINR model in multi-hop wireless networks. IEEE\/ACM Transactions on Networking, 22(4), 1204\u20131217.","journal-title":"IEEE\/ACM Transactions on Networking"},{"key":"1800_CR20","doi-asserted-by":"crossref","unstructured":"Yun, S., Shin, J., & Yi, Y. (2013). CSMA over time-varying channels: Optimality, uniqueness and limited backoff rate. In Proceedings of the ACM MOBIHOC.","DOI":"10.1145\/2491288.2491303"},{"key":"1800_CR21","doi-asserted-by":"crossref","unstructured":"Kim, T., Ni, J., Srikant, R., & Vaidya, N. (2011). On the achievable throughput of CSMA under imperfect carrier sensing. In Proceedings of the IEEE INFOCOM.","DOI":"10.1109\/INFCOM.2011.5934962"},{"issue":"10","key":"1800_CR22","doi-asserted-by":"publisher","first-page":"6541","DOI":"10.1109\/TIT.2012.2204032","volume":"58","author":"L Jiang","year":"2012","unstructured":"Jiang, L., Leconte, M., Ni, J., Srikant, R., & Walrand, J. (2012). Fast mixing of parallel glauber dynamics and low-delay CSMA scheduling. IEEE Transactions on Information Theory, 58(10), 6541\u20136555.","journal-title":"IEEE Transactions on Information Theory"},{"key":"1800_CR23","doi-asserted-by":"crossref","unstructured":"Shah, D., & Shin, J. (2010). Delay optimal queue-based CSMA. In Proceedings of the ACM SIGMETRICS.","DOI":"10.1145\/1811039.1811093"},{"key":"1800_CR24","doi-asserted-by":"crossref","unstructured":"Lotfinezhad, M., & Marbach, P. (2011). Throughput-optimal random access with order-optimal delay. In Proceedings of the IEEE INFOCOM.","DOI":"10.1109\/INFCOM.2011.5935124"},{"key":"1800_CR25","doi-asserted-by":"crossref","unstructured":"Lee, D., Yun, D., Shin, J., Yi, Y., & Yun, S. (2014). Provable per-link delay-optimal CSMA for general wireless network topology. In IEEE INFOCOM.","DOI":"10.1109\/INFOCOM.2014.6848200"},{"issue":"2","key":"1800_CR26","doi-asserted-by":"publisher","first-page":"411","DOI":"10.1109\/TNET.2004.842226","volume":"13","author":"A Eryilmaz","year":"2005","unstructured":"Eryilmaz, A., Srikant, R., & Perkins, J. (2005). Stable scheduling policies for fading wireless channels. IEEE\/ACM Transactions on Networking, 13(2), 411\u2013424.","journal-title":"IEEE\/ACM Transactions on Networking"},{"key":"1800_CR27","doi-asserted-by":"publisher","first-page":"165","DOI":"10.1016\/0166-5316(83)90001-9","volume":"3","author":"H Bruneel","year":"1983","unstructured":"Bruneel, H. (1983). On the behavior of buffers with random server interruptions. Performance Evaluation, 3, 165\u2013175.","journal-title":"Performance Evaluation"},{"key":"1800_CR28","doi-asserted-by":"publisher","first-page":"237","DOI":"10.1057\/palgrave.jors.2600523","volume":"49","author":"F Kelly","year":"1998","unstructured":"Kelly, F., Maulloo, A., & Tan, D. (1998). Rate control in communication networks: Shadow prices, proportional fairness and stability. Journal of the Operational Research Society, 49, 237\u2013252.","journal-title":"Journal of the Operational Research Society"},{"issue":"2","key":"1800_CR29","doi-asserted-by":"publisher","first-page":"766","DOI":"10.1109\/TVT.2006.889570","volume":"56","author":"J Choi","year":"2007","unstructured":"Choi, J., & Bahk, S. (2007). Cell throughput analysis of the proportional fair scheduler in the single cell environment. IEEE Transactions on Vehicular Technology, 56(2), 766\u2013778.","journal-title":"IEEE Transactions on Vehicular Technology"}],"container-title":["Wireless Networks"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s11276-018-1800-6.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s11276-018-1800-6\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s11276-018-1800-6.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,9,21]],"date-time":"2019-09-21T13:36:31Z","timestamp":1569072991000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s11276-018-1800-6"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2018,7,16]]},"references-count":29,"journal-issue":{"issue":"4","published-print":{"date-parts":[[2019,5]]}},"alternative-id":["1800"],"URL":"https:\/\/doi.org\/10.1007\/s11276-018-1800-6","relation":{},"ISSN":["1022-0038","1572-8196"],"issn-type":[{"type":"print","value":"1022-0038"},{"type":"electronic","value":"1572-8196"}],"subject":[],"published":{"date-parts":[[2018,7,16]]},"assertion":[{"value":"16 July 2018","order":1,"name":"first_online","label":"First Online","group":{"name":"ArticleHistory","label":"Article History"}}]}}