{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,3,25]],"date-time":"2025-03-25T18:56:02Z","timestamp":1742928962512,"version":"3.40.3"},"publisher-location":"Cham","reference-count":29,"publisher":"Springer International Publishing","isbn-type":[{"type":"print","value":"9783030235963"},{"type":"electronic","value":"9783030235970"}],"license":[{"start":{"date-parts":[[2019,1,1]],"date-time":"2019-01-01T00:00:00Z","timestamp":1546300800000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2019]]},"DOI":"10.1007\/978-3-030-23597-0_34","type":"book-chapter","created":{"date-parts":[[2019,6,20]],"date-time":"2019-06-20T11:03:48Z","timestamp":1561028628000},"page":"419-431","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":1,"title":["OWLS: Opportunistic Wireless Link Scheduling with SINR Constraints"],"prefix":"10.1007","author":[{"given":"Xiaohua","family":"Xu","sequence":"first","affiliation":[]},{"given":"Yuanfang","family":"Chen","sequence":"additional","affiliation":[]},{"given":"Shuibing","family":"He","sequence":"additional","affiliation":[]},{"given":"Patrick Otoo","family":"Bobbie","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2019,6,21]]},"reference":[{"key":"34_CR1","doi-asserted-by":"crossref","unstructured":"Ahmad, S., Liu, M.: Multi-channel opportunistic access: a case of restless bandits with multiple plays. In: Allerton, pp. 1361\u20131368 (2009)","DOI":"10.1109\/ALLERTON.2009.5394517"},{"issue":"9","key":"34_CR2","doi-asserted-by":"crossref","first-page":"4040","DOI":"10.1109\/TIT.2009.2025561","volume":"55","author":"SHA Ahmad","year":"2009","unstructured":"Ahmad, S.H.A., Liu, M., Javidi, T., Zhao, Q., Krishnamachari, B.: Optimality of myopic sensing in multichannel opportunistic access. IEEE Trans. Inf. Theory 55(9), 4040\u20134050 (2009)","journal-title":"IEEE Trans. Inf. Theory"},{"issue":"3","key":"34_CR3","first-page":"585","volume":"33","author":"P Blasco","year":"2015","unstructured":"Blasco, P., G\u00fcnd\u00fcz, D.: Multi-access communications with energy harvesting: a multi-armed bandit model and the optimality of the myopic policy. IEEE JSAC 33(3), 585\u2013597 (2015)","journal-title":"IEEE JSAC"},{"issue":"1","key":"34_CR4","doi-asserted-by":"crossref","first-page":"1","DOI":"10.1561\/2200000024","volume":"5","author":"S Bubeck","year":"2012","unstructured":"Bubeck, S., Cesa-Bianchi, N., et al.: Regret analysis of stochastic and nonstochastic multi-armed bandit problems. Found. Trends Mach. Learn. 5(1), 1\u2013122 (2012)","journal-title":"Found. Trends Mach. Learn."},{"issue":"9","key":"34_CR5","doi-asserted-by":"crossref","first-page":"1253","DOI":"10.1002\/j.1538-7305.1960.tb03959.x","volume":"39","author":"E Gilbert","year":"1960","unstructured":"Gilbert, E., et al.: Capacity of a burst-noise channel. Bell Syst. Tech. J 39(9), 1253\u20131265 (1960)","journal-title":"Bell Syst. Tech. J"},{"key":"34_CR6","doi-asserted-by":"crossref","DOI":"10.1002\/9780470980033","volume-title":"Multi-armed Bandit Allocation Indices","author":"J Gittins","year":"2011","unstructured":"Gittins, J., Glazebrook, K., Weber, R.: Multi-armed Bandit Allocation Indices. Wiley, Hoboken (2011)"},{"key":"34_CR7","doi-asserted-by":"crossref","unstructured":"Goussevskaia, O., Wattenhofer, R., Halld\u00f3rsson, M.M., Welzl, E.: Capacity of arbitrary wireless networks. In: IEEE INFOCOM, pp. 1872\u20131880 (2009)","DOI":"10.1109\/INFCOM.2009.5062108"},{"key":"34_CR8","doi-asserted-by":"crossref","unstructured":"Guha, S., Munagala, K.: Approximation algorithms for partial-information based stochastic control with Markovian rewards. In: IEEE FOCS, pp. 483\u2013493 (2007)","DOI":"10.1109\/FOCS.2007.4389518"},{"issue":"1","key":"34_CR9","doi-asserted-by":"crossref","first-page":"3","DOI":"10.1145\/1870103.1870106","volume":"58","author":"S Guha","year":"2010","unstructured":"Guha, S., Munagala, K., Shi, P.: Approximation algorithms for restless bandit problems. J. ACM (JACM) 58(1), 3 (2010)","journal-title":"J. ACM (JACM)"},{"issue":"2","key":"34_CR10","doi-asserted-by":"crossref","first-page":"388","DOI":"10.1109\/18.825799","volume":"46","author":"P Gupta","year":"2000","unstructured":"Gupta, P., Kumar, P.R.: The capacity of wireless networks. IEEE Trans. Inf. Theory 46(2), 388\u2013404 (2000)","journal-title":"IEEE Trans. Inf. Theory"},{"key":"34_CR11","doi-asserted-by":"crossref","unstructured":"Le Ny, J., Dahleh, M., Feron, E.: Multi-UAV dynamic routing with partial observations using restless bandit allocation indices. In: American Control Conference, pp. 4220\u20134225. IEEE (2008)","DOI":"10.1109\/ACC.2008.4587156"},{"key":"34_CR12","unstructured":"Li, B., Yang, P., Li, X.-Y., Tang, S., Liu, Y., Wu, Q.: Almost optimal dynamically-ordered multi-channel accessing for cognitive networks. In: IEEE INFOCOM, pp. 3081\u20133085. IEEE (2012)"},{"issue":"7","key":"34_CR13","first-page":"528","volume":"70","author":"C-P Li","year":"2013","unstructured":"Li, C.-P., Neely, M.J.: Network utility maximization over partially observable markovian channels. Perform. Eval. 70(7), 528\u2013548 (2013)","journal-title":"Perform. Eval."},{"issue":"11","key":"34_CR14","doi-asserted-by":"crossref","first-page":"5547","DOI":"10.1109\/TIT.2010.2068950","volume":"56","author":"K Liu","year":"2010","unstructured":"Liu, K., Zhao, Q.: Indexability of restless bandit problems and optimality of whittle index for dynamic multichannel access. IEEE Trans. Inf. Theory 56(11), 5547\u20135567 (2010)","journal-title":"IEEE Trans. Inf. Theory"},{"issue":"3","key":"34_CR15","doi-asserted-by":"crossref","first-page":"123","DOI":"10.1109\/MSP.2014.2338894","volume":"32","author":"J Lunden","year":"2015","unstructured":"Lunden, J., Koivunen, V., Poor, H.V.: Spectrum exploration and exploitation for cognitive radio: recent advances. IEEE Signal Process. Mag. 32(3), 123\u2013140 (2015)","journal-title":"IEEE Signal Process. Mag."},{"key":"34_CR16","doi-asserted-by":"crossref","unstructured":"Mahajan, A., Teneketzis, D.: Multi-armed bandit problems. Found. Appl. Sens. Manag., 121\u2013151 (2008)","DOI":"10.1007\/978-0-387-49819-5_6"},{"issue":"4","key":"34_CR17","doi-asserted-by":"crossref","first-page":"13","DOI":"10.1109\/98.788210","volume":"6","author":"J Mitola","year":"1999","unstructured":"Mitola, J., Maguire, G.Q., et al.: Cognitive radio: making software radios more personal. IEEE Pers. Commun. 6(4), 13\u201318 (1999)","journal-title":"IEEE Pers. Commun."},{"issue":"4","key":"34_CR18","doi-asserted-by":"crossref","first-page":"1702","DOI":"10.1109\/TIT.2015.2399923","volume":"61","author":"W Ouyang","year":"2015","unstructured":"Ouyang, W., Murugesan, S., Eryilmaz, A., Shroff, N.B.: Exploiting channel memory for joint estimation and scheduling in downlink networks\u2013a Whittle\u2019s indexability analysis. IEEE Trans. Inf. Theory 61(4), 1702\u20131719 (2015)","journal-title":"IEEE Trans. Inf. Theory"},{"key":"34_CR19","doi-asserted-by":"crossref","unstructured":"Wan, P.-J., Jia, X., Dai, G., Du, H., Frieder, O.: Fast and simple approximation algorithms for maximum weighted independent set of links. In: IEEE INFOCOM, pp. 1653\u20131661 (2014)","DOI":"10.1109\/INFOCOM.2014.6848102"},{"key":"34_CR20","doi-asserted-by":"crossref","unstructured":"Wan, P.-J., Xu, X.: Weighted restless bandit and its applications. In: IEEE ICDCS, pp. 507\u2013516 (2015)","DOI":"10.1109\/ICDCS.2015.58"},{"issue":"1","key":"34_CR21","doi-asserted-by":"crossref","first-page":"300","DOI":"10.1109\/TSP.2011.2170684","volume":"60","author":"K Wang","year":"2012","unstructured":"Wang, K., Chen, L.: On optimality of myopic policy for restless multi-armed bandit problem: an axiomatic approach. IEEE Trans. Signal Process. 60(1), 300\u2013309 (2012)","journal-title":"IEEE Trans. Signal Process."},{"issue":"2","key":"34_CR22","doi-asserted-by":"crossref","first-page":"759","DOI":"10.1109\/TWC.2014.2359917","volume":"14","author":"K Wang","year":"2015","unstructured":"Wang, K., Chen, L., Liu, Q., Wang, W., Li, F.: One step beyond myopic probing policy: a heuristic lookahead policy for multi-channel opportunistic access. IEEE Trans. Wirel. Commun. 14(2), 759\u2013769 (2015)","journal-title":"IEEE Trans. Wirel. Commun."},{"issue":"2","key":"34_CR23","doi-asserted-by":"crossref","first-page":"300","DOI":"10.1109\/LCOMM.2015.2503770","volume":"20","author":"K Wang","year":"2016","unstructured":"Wang, K., Chen, L., Yu, J., Zhang, D.: Optimality of myopic policy for multistate channel access. IEEE Commun. Lett. 20(2), 300\u2013303 (2016)","journal-title":"IEEE Commun. Lett."},{"issue":"7","key":"34_CR24","doi-asserted-by":"crossref","first-page":"1017","DOI":"10.1049\/iet-com.2014.1026","volume":"9","author":"K Wang","year":"2015","unstructured":"Wang, K., Liu, Q., Li, F., Chen, L., Ma, X.: Myopic policy for opportunistic access in cognitive radio networks by exploiting primary user feedbacks. IET Commun. 9(7), 1017\u20131025 (2015)","journal-title":"IET Commun."},{"key":"34_CR25","doi-asserted-by":"crossref","first-page":"287","DOI":"10.2307\/3214163","volume":"25","author":"P Whittle","year":"1988","unstructured":"Whittle, P.: Restless bandits: activity allocation in a changing world. J. Appl. Probab. 25, 287\u2013298 (1988)","journal-title":"J. Appl. Probab."},{"issue":"12","key":"34_CR26","doi-asserted-by":"crossref","first-page":"2518","DOI":"10.1109\/TMC.2012.245","volume":"12","author":"X Xu","year":"2013","unstructured":"Xu, X., Li, X.-Y., Song, M.: Efficient aggregation scheduling in multihop wireless sensor networks with SINR constraints. IEEE Trans. Mob. Comput. 12(12), 2518\u20132528 (2013)","journal-title":"IEEE Trans. Mob. Comput."},{"key":"34_CR27","doi-asserted-by":"crossref","unstructured":"Xu, X., Song, M.: Approximation algorithms for wireless opportunistic spectrum scheduling in cognitive radio networks. In: IEEE INFOCOM (2016)","DOI":"10.1109\/INFOCOM.2016.7524597"},{"issue":"4","key":"34_CR28","doi-asserted-by":"crossref","first-page":"2138","DOI":"10.1109\/TNET.2017.2684831","volume":"25","author":"D Yu","year":"2017","unstructured":"Yu, D., Ning, L., Zou, Y., Yu, J., Cheng, X., Lau, F.C.: Distributed spanner construction with physical interference: constant stretch and linear sparseness. IEEE\/ACM Trans. Netw. 25(4), 2138\u20132151 (2017)","journal-title":"IEEE\/ACM Trans. Netw."},{"issue":"3","key":"34_CR29","doi-asserted-by":"crossref","first-page":"2643","DOI":"10.1109\/TVT.2016.2580379","volume":"66","author":"J Yu","year":"2017","unstructured":"Yu, J., Huang, B., Cheng, X., Atiquzzaman, M.: Shortest link scheduling algorithms in wireless networks under the SINR model. IEEE Trans. Veh. Technol. 66(3), 2643\u20132657 (2017)","journal-title":"IEEE Trans. Veh. Technol."}],"container-title":["Lecture Notes in Computer Science","Wireless Algorithms, Systems, and Applications"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-030-23597-0_34","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,6,27]],"date-time":"2019-06-27T05:13:07Z","timestamp":1561612387000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-030-23597-0_34"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2019]]},"ISBN":["9783030235963","9783030235970"],"references-count":29,"URL":"https:\/\/doi.org\/10.1007\/978-3-030-23597-0_34","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2019]]},"assertion":[{"value":"21 June 2019","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}},{"value":"WASA","order":1,"name":"conference_acronym","label":"Conference Acronym","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"International Conference on Wireless Algorithms, Systems, and Applications","order":2,"name":"conference_name","label":"Conference Name","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Honolulu, HI","order":3,"name":"conference_city","label":"Conference City","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"USA","order":4,"name":"conference_country","label":"Conference Country","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"2019","order":5,"name":"conference_year","label":"Conference Year","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"24 June 2019","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"26 June 2019","order":8,"name":"conference_end_date","label":"Conference End Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"14","order":9,"name":"conference_number","label":"Conference Number","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"wasa2019","order":10,"name":"conference_id","label":"Conference ID","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"http:\/\/wasa-conference.org\/WASA2019\/index.html","order":11,"name":"conference_url","label":"Conference URL","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Single-blind","order":1,"name":"type","label":"Type","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"EasyChair","order":2,"name":"conference_management_system","label":"Conference Management System","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"143","order":3,"name":"number_of_submissions_sent_for_review","label":"Number of Submissions Sent for Review","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"43","order":4,"name":"number_of_full_papers_accepted","label":"Number of Full Papers Accepted","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"11","order":5,"name":"number_of_short_papers_accepted","label":"Number of Short Papers Accepted","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"30% - The value is computed by the equation \"Number of Full Papers Accepted \/ Number of Submissions Sent for Review * 100\" and then rounded to a whole number.","order":6,"name":"acceptance_rate_of_full_papers","label":"Acceptance Rate of Full Papers","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"3","order":7,"name":"average_number_of_reviews_per_paper","label":"Average Number of Reviews per Paper","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"6","order":8,"name":"average_number_of_papers_per_reviewer","label":"Average Number of Papers per Reviewer","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"Yes","order":9,"name":"external_reviewers_involved","label":"External Reviewers Involved","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}}]}}