{"id":"https://openalex.org/W2949663235","doi":"https://doi.org/10.1109/tmc.2015.2487258","title":"Low-Complexity Optimal Scheduling over Time-Correlated Fading Channels with ARQ Feedback","display_name":"Low-Complexity Optimal Scheduling over Time-Correlated Fading Channels with ARQ Feedback","publication_year":2015,"publication_date":"2015-10-05","ids":{"openalex":"https://openalex.org/W2949663235","doi":"https://doi.org/10.1109/tmc.2015.2487258","mag":"2949663235"},"language":"en","primary_location":{"id":"doi:10.1109/tmc.2015.2487258","is_oa":false,"landing_page_url":"https://doi.org/10.1109/tmc.2015.2487258","pdf_url":null,"source":{"id":"https://openalex.org/S69141925","display_name":"IEEE Transactions on Mobile Computing","issn_l":"1536-1233","issn":["1536-1233","1558-0660","2161-9875"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310320439","host_organization_name":"IEEE Computer Society","host_organization_lineage":["https://openalex.org/P4310320439","https://openalex.org/P4310319808"],"host_organization_lineage_names":["IEEE Computer Society","Institute of Electrical and Electronics Engineers"],"type":"journal"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"IEEE Transactions on Mobile Computing","raw_type":"journal-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":null,"display_name":"Wenzhuo Ouyang","orcid":null},"institutions":[],"countries":[],"is_corresponding":false,"raw_author_name":"Wenzhuo Ouyang","raw_affiliation_strings":["ASSIA Inc.,"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"ASSIA Inc.,","institution_ids":[]}]},{"author_position":"middle","author":{"id":null,"display_name":"Atilla Eryilmaz","orcid":null},"institutions":[{"id":"https://openalex.org/I52357470","display_name":"The Ohio State University","ror":"https://ror.org/00rs6vg23","country_code":"US","type":"education","lineage":["https://openalex.org/I52357470"]}],"countries":["US"],"is_corresponding":false,"raw_author_name":"Atilla Eryilmaz","raw_affiliation_strings":["Department of ECE, The Ohio State University, Columbus, OH"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Department of ECE, The Ohio State University, Columbus, OH","institution_ids":["https://openalex.org/I52357470"]}]},{"author_position":"last","author":{"id":null,"display_name":"Ness B. Shroff","orcid":null},"institutions":[{"id":"https://openalex.org/I52357470","display_name":"The Ohio State University","ror":"https://ror.org/00rs6vg23","country_code":"US","type":"education","lineage":["https://openalex.org/I52357470"]}],"countries":["US"],"is_corresponding":false,"raw_author_name":"Ness B. Shroff","raw_affiliation_strings":["Department of ECE and the Department of CSE, The Ohio State University, Columbus, OH"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Department of ECE and the Department of CSE, The Ohio State University, Columbus, OH","institution_ids":["https://openalex.org/I52357470"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":1,"corresponding_author_ids":[],"corresponding_institution_ids":[],"apc_list":null,"apc_paid":null,"fwci":0.3207,"has_fulltext":false,"cited_by_count":8,"citation_normalized_percentile":{"value":0.68062737,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":{"min":89,"max":99},"biblio":{"volume":"15","issue":"9","first_page":"2275","last_page":"2289"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T11409","display_name":"Advanced Wireless Network Optimization","score":1.0,"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"}},"topics":[{"id":"https://openalex.org/T11409","display_name":"Advanced Wireless Network Optimization","score":1.0,"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/T10148","display_name":"Advanced MIMO Systems Optimization","score":0.9994999766349792,"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.9986000061035156,"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/scheduling","display_name":"Scheduling (production processes)","score":0.6690000295639038},{"id":"https://openalex.org/keywords/fading","display_name":"Fading","score":0.6007999777793884},{"id":"https://openalex.org/keywords/queue","display_name":"Queue","score":0.5149999856948853},{"id":"https://openalex.org/keywords/exploit","display_name":"Exploit","score":0.5065000057220459},{"id":"https://openalex.org/keywords/markov-process","display_name":"Markov process","score":0.49000000953674316},{"id":"https://openalex.org/keywords/round-robin-scheduling","display_name":"Round-robin scheduling","score":0.47040000557899475},{"id":"https://openalex.org/keywords/channel-state-information","display_name":"Channel state information","score":0.46299999952316284},{"id":"https://openalex.org/keywords/telecommunications-link","display_name":"Telecommunications link","score":0.43689998984336853},{"id":"https://openalex.org/keywords/channel","display_name":"Channel (broadcasting)","score":0.4339999854564667}],"concepts":[{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.8569999933242798},{"id":"https://openalex.org/C206729178","wikidata":"https://www.wikidata.org/wiki/Q2271896","display_name":"Scheduling (production processes)","level":2,"score":0.6690000295639038},{"id":"https://openalex.org/C81978471","wikidata":"https://www.wikidata.org/wiki/Q1196572","display_name":"Fading","level":3,"score":0.6007999777793884},{"id":"https://openalex.org/C160403385","wikidata":"https://www.wikidata.org/wiki/Q220543","display_name":"Queue","level":2,"score":0.5149999856948853},{"id":"https://openalex.org/C165696696","wikidata":"https://www.wikidata.org/wiki/Q11287","display_name":"Exploit","level":2,"score":0.5065000057220459},{"id":"https://openalex.org/C159886148","wikidata":"https://www.wikidata.org/wiki/Q176645","display_name":"Markov process","level":2,"score":0.49000000953674316},{"id":"https://openalex.org/C175893541","wikidata":"https://www.wikidata.org/wiki/Q1196582","display_name":"Round-robin scheduling","level":4,"score":0.47040000557899475},{"id":"https://openalex.org/C148063708","wikidata":"https://www.wikidata.org/wiki/Q5072511","display_name":"Channel state information","level":3,"score":0.46299999952316284},{"id":"https://openalex.org/C138660444","wikidata":"https://www.wikidata.org/wiki/Q5607897","display_name":"Telecommunications link","level":2,"score":0.43689998984336853},{"id":"https://openalex.org/C127162648","wikidata":"https://www.wikidata.org/wiki/Q16858953","display_name":"Channel (broadcasting)","level":2,"score":0.4339999854564667},{"id":"https://openalex.org/C31258907","wikidata":"https://www.wikidata.org/wiki/Q1301371","display_name":"Computer network","level":1,"score":0.42410001158714294},{"id":"https://openalex.org/C31689143","wikidata":"https://www.wikidata.org/wiki/Q733809","display_name":"Fair-share scheduling","level":3,"score":0.40939998626708984},{"id":"https://openalex.org/C107568181","wikidata":"https://www.wikidata.org/wiki/Q5319000","display_name":"Dynamic priority scheduling","level":3,"score":0.37229999899864197},{"id":"https://openalex.org/C79403827","wikidata":"https://www.wikidata.org/wiki/Q3988","display_name":"Real-time computing","level":1,"score":0.35109999775886536},{"id":"https://openalex.org/C98763669","wikidata":"https://www.wikidata.org/wiki/Q176645","display_name":"Markov chain","level":2,"score":0.3384000062942505},{"id":"https://openalex.org/C171952454","wikidata":"https://www.wikidata.org/wiki/Q29522","display_name":"Automatic repeat request","level":4,"score":0.33399999141693115},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.3325999975204468},{"id":"https://openalex.org/C120314980","wikidata":"https://www.wikidata.org/wiki/Q180634","display_name":"Distributed computing","level":1,"score":0.3240000009536743},{"id":"https://openalex.org/C118437007","wikidata":"https://www.wikidata.org/wiki/Q1017139","display_name":"Hybrid automatic repeat request","level":3,"score":0.3116999864578247},{"id":"https://openalex.org/C192163390","wikidata":"https://www.wikidata.org/wiki/Q612061","display_name":"Markovian arrival process","level":3,"score":0.3050999939441681},{"id":"https://openalex.org/C122141398","wikidata":"https://www.wikidata.org/wiki/Q5456330","display_name":"Fixed-priority pre-emptive scheduling","level":5,"score":0.2971999943256378},{"id":"https://openalex.org/C22684755","wikidata":"https://www.wikidata.org/wiki/Q847526","display_name":"Queueing theory","level":2,"score":0.28189998865127563},{"id":"https://openalex.org/C40842320","wikidata":"https://www.wikidata.org/wiki/Q19423","display_name":"Buffer overflow","level":2,"score":0.2615000009536743},{"id":"https://openalex.org/C157764524","wikidata":"https://www.wikidata.org/wiki/Q1383412","display_name":"Throughput","level":3,"score":0.25679999589920044},{"id":"https://openalex.org/C57273362","wikidata":"https://www.wikidata.org/wiki/Q576722","display_name":"Decoding methods","level":2,"score":0.2551000118255615},{"id":"https://openalex.org/C2777382242","wikidata":"https://www.wikidata.org/wiki/Q6017816","display_name":"Index (typography)","level":2,"score":0.25110000371932983},{"id":"https://openalex.org/C34388435","wikidata":"https://www.wikidata.org/wiki/Q2267362","display_name":"Bounded function","level":2,"score":0.25060001015663147}],"mesh":[],"locations_count":1,"locations":[{"id":"doi:10.1109/tmc.2015.2487258","is_oa":false,"landing_page_url":"https://doi.org/10.1109/tmc.2015.2487258","pdf_url":null,"source":{"id":"https://openalex.org/S69141925","display_name":"IEEE Transactions on Mobile Computing","issn_l":"1536-1233","issn":["1536-1233","1558-0660","2161-9875"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310320439","host_organization_name":"IEEE Computer Society","host_organization_lineage":["https://openalex.org/P4310320439","https://openalex.org/P4310319808"],"host_organization_lineage_names":["IEEE Computer Society","Institute of Electrical and Electronics Engineers"],"type":"journal"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"IEEE Transactions on Mobile Computing","raw_type":"journal-article"}],"best_oa_location":null,"sustainable_development_goals":[],"awards":[{"id":"https://openalex.org/G1620273734","display_name":null,"funder_award_id":"HDTRA1-14-1-0058","funder_id":"https://openalex.org/F4320332186","funder_display_name":"Defense Threat Reduction Agency"},{"id":"https://openalex.org/G1700127884","display_name":null,"funder_award_id":"CAREERCNS-0953515","funder_id":"https://openalex.org/F4320306076","funder_display_name":"National Science Foundation"},{"id":"https://openalex.org/G2379327423","display_name":null,"funder_award_id":"HDTRA1-15-1-0003","funder_id":"https://openalex.org/F4320332186","funder_display_name":"Defense Threat Reduction Agency"},{"id":"https://openalex.org/G4061395903","display_name":null,"funder_award_id":"N00014-15-1-2166","funder_id":"https://openalex.org/F4320337345","funder_display_name":"Office of Naval Research"},{"id":"https://openalex.org/G5996067785","display_name":null,"funder_award_id":"CCSS-EARS-1444026","funder_id":"https://openalex.org/F4320306076","funder_display_name":"National Science Foundation"},{"id":"https://openalex.org/G7942095600","display_name":null,"funder_award_id":"CNS-1421576","funder_id":"https://openalex.org/F4320306076","funder_display_name":"National Science Foundation"},{"id":"https://openalex.org/G8727939366","display_name":null,"funder_award_id":"CNS-1012700","funder_id":"https://openalex.org/F4320306076","funder_display_name":"National Science Foundation"},{"id":"https://openalex.org/G8902596527","display_name":null,"funder_award_id":"CNS-WiFiUS-1456806","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"},{"id":"https://openalex.org/F4320332186","display_name":"Defense Threat Reduction Agency","ror":"https://ror.org/04tz64554"},{"id":"https://openalex.org/F4320332753","display_name":"Qatar National Research Fund","ror":"https://ror.org/01svaqq28"},{"id":"https://openalex.org/F4320337345","display_name":"Office of Naval Research","ror":"https://ror.org/00rk2pe57"}],"has_content":{"grobid_xml":false,"pdf":false},"content_urls":null,"referenced_works_count":40,"referenced_works":["https://openalex.org/W565357261","https://openalex.org/W1816977368","https://openalex.org/W1965665090","https://openalex.org/W1975865742","https://openalex.org/W2008055918","https://openalex.org/W2009215512","https://openalex.org/W2013702609","https://openalex.org/W2029199203","https://openalex.org/W2056921512","https://openalex.org/W2066364164","https://openalex.org/W2066917180","https://openalex.org/W2082040833","https://openalex.org/W2093269539","https://openalex.org/W2096752169","https://openalex.org/W2098563066","https://openalex.org/W2103958721","https://openalex.org/W2105177639","https://openalex.org/W2105556121","https://openalex.org/W2110519532","https://openalex.org/W2120112928","https://openalex.org/W2123251411","https://openalex.org/W2131199871","https://openalex.org/W2135663206","https://openalex.org/W2137679512","https://openalex.org/W2141515329","https://openalex.org/W2145878582","https://openalex.org/W2151166730","https://openalex.org/W2153345187","https://openalex.org/W2153441348","https://openalex.org/W2163673459","https://openalex.org/W2173655337","https://openalex.org/W2542098722","https://openalex.org/W2949663235","https://openalex.org/W4297972233","https://openalex.org/W6630965284","https://openalex.org/W6633937657","https://openalex.org/W6638193828","https://openalex.org/W6676272198","https://openalex.org/W6678181239","https://openalex.org/W6683112175"],"related_works":[],"abstract_inverted_index":{"We":[0],"investigate":[1],"the":[2,12,31,37,98,103,111,152,156],"downlink":[3],"scheduling":[4,89,114],"problem":[5],"under":[6,50,63,90,102],"Markovian":[7,38],"ON/OFF":[8],"fading":[9],"channels,":[10],"where":[11],"instantaneous":[13],"channel":[14,108,153],"state":[15],"information":[16],"is":[17,22,53,74,117],"not":[18],"directly":[19],"accessible,":[20],"but":[21],"revealed":[23],"via":[24],"ARQ-type":[25],"feedback.":[26],"The":[27,76,131],"scheduler":[28],"can":[29,147],"exploit":[30],"temporal":[32,51],"correlation/channel":[33],"memory":[34,109,154],"inherent":[35],"in":[36],"channels":[39],"to":[40,86],"improve":[41],"network":[42],"performance.":[43],"However,":[44],"designing":[45],"low-complexity":[46,71,158],"and":[47,107,127],"throughput-optimal":[48],"algorithms":[49],"correlation":[52],"a":[54,70,115,120],"challenging":[55],"problem.":[56],"In":[57],"this":[58],"paper,":[59],"we":[60],"find":[61],"that":[62,143],"an":[64],"average":[65],"number":[66],"of":[67,113,123],"transmissions":[68],"constraint,":[69],"index":[72,80,129,134],"policy":[73,77,135],"throughput-optimal.":[75],"uses":[78],"Whittle's":[79,128],"value,":[81],"which":[82],"was":[83],"previously":[84],"used":[85],"capture":[87],"opportunistic":[88],"temporally":[91],"correlated":[92],"channels.":[93],"Our":[94],"results":[95,141],"build":[96],"on":[97],"interesting":[99],"finding":[100],"that,":[101],"intricate":[104],"queue":[105,125],"length":[106,126],"evolutions,":[110],"importance":[112],"user":[116],"captured":[118],"by":[119,150],"simple":[121],"multiplication":[122],"its":[124],"value.":[130],"proposed":[132,157],"queue-based":[133],"has":[136],"provably":[137],"low":[138],"complexity.":[139],"Numerical":[140],"show":[142],"significant":[144],"throughput":[145],"gains":[146],"be":[148],"realized":[149],"exploiting":[151],"using":[155],"policy.":[159]},"counts_by_year":[{"year":2026,"cited_by_count":3},{"year":2022,"cited_by_count":1},{"year":2019,"cited_by_count":2},{"year":2016,"cited_by_count":1},{"year":2015,"cited_by_count":1}],"updated_date":"2026-07-15T18:14:33.161393","created_date":"2019-06-27T00:00:00"}