{"id":"https://openalex.org/W2155966520","doi":"https://doi.org/10.1109/cdc.2008.4739159","title":"Approximate stochastic dynamic programming for opportunistic fair scheduling in wireless networks","display_name":"Approximate stochastic dynamic programming for opportunistic fair scheduling in wireless networks","publication_year":2008,"publication_date":"2008-01-01","ids":{"openalex":"https://openalex.org/W2155966520","doi":"https://doi.org/10.1109/cdc.2008.4739159","mag":"2155966520"},"language":"en","primary_location":{"id":"doi:10.1109/cdc.2008.4739159","is_oa":false,"landing_page_url":"https://doi.org/10.1109/cdc.2008.4739159","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"2008 47th IEEE Conference on Decision and Control","raw_type":"proceedings-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":"https://openalex.org/A5100410680","display_name":"Zhi Zhang","orcid":"https://orcid.org/0000-0001-8672-6766"},"institutions":[{"id":"https://openalex.org/I92446798","display_name":"Colorado State University","ror":"https://ror.org/03k1gpj17","country_code":"US","type":"education","lineage":["https://openalex.org/I92446798"]}],"countries":["US"],"is_corresponding":true,"raw_author_name":"Zhi Zhang","raw_affiliation_strings":["Department of Electrical and Computer Engineering, Colorado State University, Fort Collins, CO, USA"],"affiliations":[{"raw_affiliation_string":"Department of Electrical and Computer Engineering, Colorado State University, Fort Collins, CO, USA","institution_ids":["https://openalex.org/I92446798"]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5057749461","display_name":"Sudhir Moola","orcid":null},"institutions":[{"id":"https://openalex.org/I92446798","display_name":"Colorado State University","ror":"https://ror.org/03k1gpj17","country_code":"US","type":"education","lineage":["https://openalex.org/I92446798"]}],"countries":["US"],"is_corresponding":false,"raw_author_name":"Sudhir Moola","raw_affiliation_strings":["Department of Electrical and Computer Engineering, Colorado State University, Fort Collins, CO, USA"],"affiliations":[{"raw_affiliation_string":"Department of Electrical and Computer Engineering, Colorado State University, Fort Collins, CO, USA","institution_ids":["https://openalex.org/I92446798"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5070385137","display_name":"Edwin K. P. Chong","orcid":"https://orcid.org/0000-0002-7622-4815"},"institutions":[{"id":"https://openalex.org/I92446798","display_name":"Colorado State University","ror":"https://ror.org/03k1gpj17","country_code":"US","type":"education","lineage":["https://openalex.org/I92446798"]}],"countries":["US"],"is_corresponding":false,"raw_author_name":"Edwin K. P. Chong","raw_affiliation_strings":["Department of Electrical and Computer Engineering, Colorado State University, Fort Collins, CO, USA"],"affiliations":[{"raw_affiliation_string":"Department of Electrical and Computer Engineering, Colorado State University, Fort Collins, CO, USA","institution_ids":["https://openalex.org/I92446798"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":3,"corresponding_author_ids":["https://openalex.org/A5100410680"],"corresponding_institution_ids":["https://openalex.org/I92446798"],"apc_list":null,"apc_paid":null,"fwci":1.3323,"has_fulltext":false,"cited_by_count":6,"citation_normalized_percentile":{"value":0.82720783,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":{"min":89,"max":94},"biblio":{"volume":null,"issue":null,"first_page":"1404","last_page":"1409"},"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.9972000122070312,"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/T11158","display_name":"Wireless Networks and Protocols","score":0.9950000047683716,"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.7827799320220947},{"id":"https://openalex.org/keywords/markov-decision-process","display_name":"Markov decision process","score":0.6985100507736206},{"id":"https://openalex.org/keywords/mathematical-optimization","display_name":"Mathematical optimization","score":0.6767298579216003},{"id":"https://openalex.org/keywords/scheduling","display_name":"Scheduling (production processes)","score":0.6469286680221558},{"id":"https://openalex.org/keywords/dynamic-priority-scheduling","display_name":"Dynamic priority scheduling","score":0.6326871514320374},{"id":"https://openalex.org/keywords/dynamic-programming","display_name":"Dynamic programming","score":0.5834509134292603},{"id":"https://openalex.org/keywords/markov-process","display_name":"Markov process","score":0.5272088646888733},{"id":"https://openalex.org/keywords/maximization","display_name":"Maximization","score":0.5188085436820984},{"id":"https://openalex.org/keywords/maximum-throughput-scheduling","display_name":"Maximum throughput scheduling","score":0.4968114197254181},{"id":"https://openalex.org/keywords/proportionally-fair","display_name":"Proportionally fair","score":0.492752343416214},{"id":"https://openalex.org/keywords/utility-maximization","display_name":"Utility maximization","score":0.48794645071029663},{"id":"https://openalex.org/keywords/job-shop-scheduling","display_name":"Job shop scheduling","score":0.48727738857269287},{"id":"https://openalex.org/keywords/wireless","display_name":"Wireless","score":0.4823572039604187},{"id":"https://openalex.org/keywords/wireless-network","display_name":"Wireless network","score":0.46589577198028564},{"id":"https://openalex.org/keywords/round-robin-scheduling","display_name":"Round-robin scheduling","score":0.45782288908958435},{"id":"https://openalex.org/keywords/markov-chain","display_name":"Markov chain","score":0.43521246314048767},{"id":"https://openalex.org/keywords/minification","display_name":"Minification","score":0.42186254262924194},{"id":"https://openalex.org/keywords/distributed-computing","display_name":"Distributed computing","score":0.3909689784049988},{"id":"https://openalex.org/keywords/computer-network","display_name":"Computer network","score":0.22372320294380188},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.1622953712940216},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.12057048082351685}],"concepts":[{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.7827799320220947},{"id":"https://openalex.org/C106189395","wikidata":"https://www.wikidata.org/wiki/Q176789","display_name":"Markov decision process","level":3,"score":0.6985100507736206},{"id":"https://openalex.org/C126255220","wikidata":"https://www.wikidata.org/wiki/Q141495","display_name":"Mathematical optimization","level":1,"score":0.6767298579216003},{"id":"https://openalex.org/C206729178","wikidata":"https://www.wikidata.org/wiki/Q2271896","display_name":"Scheduling (production processes)","level":2,"score":0.6469286680221558},{"id":"https://openalex.org/C107568181","wikidata":"https://www.wikidata.org/wiki/Q5319000","display_name":"Dynamic priority scheduling","level":3,"score":0.6326871514320374},{"id":"https://openalex.org/C37404715","wikidata":"https://www.wikidata.org/wiki/Q380679","display_name":"Dynamic programming","level":2,"score":0.5834509134292603},{"id":"https://openalex.org/C159886148","wikidata":"https://www.wikidata.org/wiki/Q176645","display_name":"Markov process","level":2,"score":0.5272088646888733},{"id":"https://openalex.org/C2776330181","wikidata":"https://www.wikidata.org/wiki/Q18358244","display_name":"Maximization","level":2,"score":0.5188085436820984},{"id":"https://openalex.org/C29722447","wikidata":"https://www.wikidata.org/wiki/Q17097321","display_name":"Maximum throughput scheduling","level":5,"score":0.4968114197254181},{"id":"https://openalex.org/C86127852","wikidata":"https://www.wikidata.org/wiki/Q7250364","display_name":"Proportionally fair","level":5,"score":0.492752343416214},{"id":"https://openalex.org/C2985793214","wikidata":"https://www.wikidata.org/wiki/Q3274096","display_name":"Utility maximization","level":2,"score":0.48794645071029663},{"id":"https://openalex.org/C55416958","wikidata":"https://www.wikidata.org/wiki/Q6206757","display_name":"Job shop scheduling","level":3,"score":0.48727738857269287},{"id":"https://openalex.org/C555944384","wikidata":"https://www.wikidata.org/wiki/Q249","display_name":"Wireless","level":2,"score":0.4823572039604187},{"id":"https://openalex.org/C108037233","wikidata":"https://www.wikidata.org/wiki/Q11375","display_name":"Wireless network","level":3,"score":0.46589577198028564},{"id":"https://openalex.org/C175893541","wikidata":"https://www.wikidata.org/wiki/Q1196582","display_name":"Round-robin scheduling","level":4,"score":0.45782288908958435},{"id":"https://openalex.org/C98763669","wikidata":"https://www.wikidata.org/wiki/Q176645","display_name":"Markov chain","level":2,"score":0.43521246314048767},{"id":"https://openalex.org/C147764199","wikidata":"https://www.wikidata.org/wiki/Q6865248","display_name":"Minification","level":2,"score":0.42186254262924194},{"id":"https://openalex.org/C120314980","wikidata":"https://www.wikidata.org/wiki/Q180634","display_name":"Distributed computing","level":1,"score":0.3909689784049988},{"id":"https://openalex.org/C31258907","wikidata":"https://www.wikidata.org/wiki/Q1301371","display_name":"Computer network","level":1,"score":0.22372320294380188},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.1622953712940216},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.12057048082351685},{"id":"https://openalex.org/C119857082","wikidata":"https://www.wikidata.org/wiki/Q2539","display_name":"Machine learning","level":1,"score":0.0},{"id":"https://openalex.org/C144237770","wikidata":"https://www.wikidata.org/wiki/Q747534","display_name":"Mathematical economics","level":1,"score":0.0},{"id":"https://openalex.org/C5119721","wikidata":"https://www.wikidata.org/wiki/Q220501","display_name":"Quality of service","level":2,"score":0.0},{"id":"https://openalex.org/C105795698","wikidata":"https://www.wikidata.org/wiki/Q12483","display_name":"Statistics","level":1,"score":0.0},{"id":"https://openalex.org/C76155785","wikidata":"https://www.wikidata.org/wiki/Q418","display_name":"Telecommunications","level":1,"score":0.0},{"id":"https://openalex.org/C74172769","wikidata":"https://www.wikidata.org/wiki/Q1446839","display_name":"Routing (electronic design automation)","level":2,"score":0.0}],"mesh":[],"locations_count":1,"locations":[{"id":"doi:10.1109/cdc.2008.4739159","is_oa":false,"landing_page_url":"https://doi.org/10.1109/cdc.2008.4739159","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"2008 47th IEEE Conference on Decision and Control","raw_type":"proceedings-article"}],"best_oa_location":null,"sustainable_development_goals":[{"id":"https://metadata.un.org/sdg/16","display_name":"Peace, Justice and strong institutions","score":0.6000000238418579}],"awards":[],"funders":[],"has_content":{"grobid_xml":false,"pdf":false},"content_urls":null,"referenced_works_count":14,"referenced_works":["https://openalex.org/W1499021337","https://openalex.org/W1516418405","https://openalex.org/W1518931405","https://openalex.org/W1576452626","https://openalex.org/W1577600892","https://openalex.org/W1989225545","https://openalex.org/W2087294514","https://openalex.org/W2098432798","https://openalex.org/W2145983093","https://openalex.org/W2158116199","https://openalex.org/W2164599584","https://openalex.org/W2176566884","https://openalex.org/W2334782222","https://openalex.org/W3016548437"],"related_works":["https://openalex.org/W2093454713","https://openalex.org/W3151407988","https://openalex.org/W2117584696","https://openalex.org/W1999684000","https://openalex.org/W2371964339","https://openalex.org/W3197303648","https://openalex.org/W2639562502","https://openalex.org/W1974668751","https://openalex.org/W2106093660","https://openalex.org/W3126963985"],"abstract_inverted_index":{"We":[0,44],"consider":[1],"the":[2,19,28,54,78,86],"problem":[3,31],"of":[4,8,22],"temporal":[5,41],"fair":[6,75],"scheduling":[7,30,62],"queued":[9],"data":[10],"transmission":[11,29],"in":[12],"wireless":[13],"networks.":[14],"Taking":[15],"fairness":[16,42],"constraints":[17],"and":[18,46,58,96],"memory":[20],"property":[21],"channels":[23],"into":[24],"consideration,":[25],"we":[26,69],"formulate":[27],"as":[32],"a":[33],"discounted":[34],"reward":[35],"Markov":[36],"decision":[37],"process":[38],"(MDP)":[39],"with":[40,101],"constraints.":[43],"derive":[45],"prove":[47],"an":[48,60,71],"explicit":[49],"dynamic":[50],"programming":[51],"equation":[52],"for":[53,92],"above":[55],"constrained":[56],"MDP,":[57],"give":[59],"optimal":[61],"policy":[63],"based":[64],"on":[65],"that":[66,85],"equation.":[67],"Furthermore,":[68],"develop":[70],"efficient":[72],"approximation":[73],"method-temporal":[74],"rollout-to":[76],"reduce":[77],"computational":[79],"cost.":[80],"The":[81],"simulation":[82],"results":[83],"show":[84],"scheme":[87],"achieves":[88],"significant":[89],"performance":[90],"improvement":[91],"both":[93],"throughput":[94],"maximization":[95],"delay":[97],"minimization":[98],"problems":[99],"compared":[100],"other":[102],"existing":[103],"schemes.":[104]},"counts_by_year":[{"year":2024,"cited_by_count":1},{"year":2013,"cited_by_count":1}],"updated_date":"2026-02-26T06:29:33.603293","created_date":"2025-10-10T00:00:00"}