{"id":"https://openalex.org/W2766363429","doi":"https://doi.org/10.1109/lcomm.2017.2765308","title":"Starvation Analysis of CDF-Based Scheduling Over Nakagami- $m$ Markov Fading Channels","display_name":"Starvation Analysis of CDF-Based Scheduling Over Nakagami- $m$ Markov Fading Channels","publication_year":2017,"publication_date":"2017-10-23","ids":{"openalex":"https://openalex.org/W2766363429","doi":"https://doi.org/10.1109/lcomm.2017.2765308","mag":"2766363429"},"language":"en","primary_location":{"id":"doi:10.1109/lcomm.2017.2765308","is_oa":false,"landing_page_url":"https://doi.org/10.1109/lcomm.2017.2765308","pdf_url":null,"source":{"id":"https://openalex.org/S147316732","display_name":"IEEE Communications Letters","issn_l":"1089-7798","issn":["1089-7798","1558-2558","2373-7891"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310316002","host_organization_name":"IEEE Communications Society","host_organization_lineage":["https://openalex.org/P4310316002","https://openalex.org/P4310319808"],"host_organization_lineage_names":["IEEE Communications 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 Communications Letters","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":"https://openalex.org/A5066350144","display_name":"Yoora Kim","orcid":"https://orcid.org/0000-0002-5992-0130"},"institutions":[{"id":"https://openalex.org/I40542001","display_name":"University of Ulsan","ror":"https://ror.org/02c2f8975","country_code":"KR","type":"education","lineage":["https://openalex.org/I40542001"]}],"countries":["KR"],"is_corresponding":true,"raw_author_name":"Yoora Kim","raw_affiliation_strings":["Department of Mathematics, University of Ulsan, Ulsan, South Korea"],"affiliations":[{"raw_affiliation_string":"Department of Mathematics, University of Ulsan, Ulsan, South Korea","institution_ids":["https://openalex.org/I40542001"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":1,"corresponding_author_ids":["https://openalex.org/A5066350144"],"corresponding_institution_ids":["https://openalex.org/I40542001"],"apc_list":null,"apc_paid":null,"fwci":0.2867,"has_fulltext":false,"cited_by_count":2,"citation_normalized_percentile":{"value":0.60383295,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":{"min":89,"max":94},"biblio":{"volume":"22","issue":"2","first_page":"372","last_page":"375"},"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.9990000128746033,"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/T10575","display_name":"Wireless Communication Networks Research","score":0.9966999888420105,"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/fading","display_name":"Fading","score":0.9023551344871521},{"id":"https://openalex.org/keywords/nakagami-distribution","display_name":"Nakagami distribution","score":0.8543241024017334},{"id":"https://openalex.org/keywords/cumulative-distribution-function","display_name":"Cumulative distribution function","score":0.6252872943878174},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.6194139122962952},{"id":"https://openalex.org/keywords/markov-chain","display_name":"Markov chain","score":0.5885570645332336},{"id":"https://openalex.org/keywords/telecommunications-link","display_name":"Telecommunications link","score":0.581647515296936},{"id":"https://openalex.org/keywords/scheduling","display_name":"Scheduling (production processes)","score":0.5770904421806335},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.5296399593353271},{"id":"https://openalex.org/keywords/markov-process","display_name":"Markov process","score":0.5054666996002197},{"id":"https://openalex.org/keywords/computational-complexity-theory","display_name":"Computational complexity theory","score":0.44342273473739624},{"id":"https://openalex.org/keywords/mathematical-optimization","display_name":"Mathematical optimization","score":0.3931583762168884},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.3620975613594055},{"id":"https://openalex.org/keywords/probability-density-function","display_name":"Probability density function","score":0.2705707550048828},{"id":"https://openalex.org/keywords/computer-network","display_name":"Computer network","score":0.23716387152671814},{"id":"https://openalex.org/keywords/statistics","display_name":"Statistics","score":0.23194652795791626},{"id":"https://openalex.org/keywords/decoding-methods","display_name":"Decoding methods","score":0.16999781131744385}],"concepts":[{"id":"https://openalex.org/C81978471","wikidata":"https://www.wikidata.org/wiki/Q1196572","display_name":"Fading","level":3,"score":0.9023551344871521},{"id":"https://openalex.org/C115098869","wikidata":"https://www.wikidata.org/wiki/Q3258347","display_name":"Nakagami distribution","level":4,"score":0.8543241024017334},{"id":"https://openalex.org/C103784038","wikidata":"https://www.wikidata.org/wiki/Q386228","display_name":"Cumulative distribution function","level":3,"score":0.6252872943878174},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.6194139122962952},{"id":"https://openalex.org/C98763669","wikidata":"https://www.wikidata.org/wiki/Q176645","display_name":"Markov chain","level":2,"score":0.5885570645332336},{"id":"https://openalex.org/C138660444","wikidata":"https://www.wikidata.org/wiki/Q5607897","display_name":"Telecommunications link","level":2,"score":0.581647515296936},{"id":"https://openalex.org/C206729178","wikidata":"https://www.wikidata.org/wiki/Q2271896","display_name":"Scheduling (production processes)","level":2,"score":0.5770904421806335},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.5296399593353271},{"id":"https://openalex.org/C159886148","wikidata":"https://www.wikidata.org/wiki/Q176645","display_name":"Markov process","level":2,"score":0.5054666996002197},{"id":"https://openalex.org/C179799912","wikidata":"https://www.wikidata.org/wiki/Q205084","display_name":"Computational complexity theory","level":2,"score":0.44342273473739624},{"id":"https://openalex.org/C126255220","wikidata":"https://www.wikidata.org/wiki/Q141495","display_name":"Mathematical optimization","level":1,"score":0.3931583762168884},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.3620975613594055},{"id":"https://openalex.org/C197055811","wikidata":"https://www.wikidata.org/wiki/Q207522","display_name":"Probability density function","level":2,"score":0.2705707550048828},{"id":"https://openalex.org/C31258907","wikidata":"https://www.wikidata.org/wiki/Q1301371","display_name":"Computer network","level":1,"score":0.23716387152671814},{"id":"https://openalex.org/C105795698","wikidata":"https://www.wikidata.org/wiki/Q12483","display_name":"Statistics","level":1,"score":0.23194652795791626},{"id":"https://openalex.org/C57273362","wikidata":"https://www.wikidata.org/wiki/Q576722","display_name":"Decoding methods","level":2,"score":0.16999781131744385},{"id":"https://openalex.org/C119857082","wikidata":"https://www.wikidata.org/wiki/Q2539","display_name":"Machine learning","level":1,"score":0.0}],"mesh":[],"locations_count":1,"locations":[{"id":"doi:10.1109/lcomm.2017.2765308","is_oa":false,"landing_page_url":"https://doi.org/10.1109/lcomm.2017.2765308","pdf_url":null,"source":{"id":"https://openalex.org/S147316732","display_name":"IEEE Communications Letters","issn_l":"1089-7798","issn":["1089-7798","1558-2558","2373-7891"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310316002","host_organization_name":"IEEE Communications Society","host_organization_lineage":["https://openalex.org/P4310316002","https://openalex.org/P4310319808"],"host_organization_lineage_names":["IEEE Communications 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 Communications Letters","raw_type":"journal-article"}],"best_oa_location":null,"sustainable_development_goals":[],"awards":[],"funders":[{"id":"https://openalex.org/F4320321309","display_name":"University of Ulsan","ror":"https://ror.org/02c2f8975"}],"has_content":{"pdf":false,"grobid_xml":false},"content_urls":null,"referenced_works_count":12,"referenced_works":["https://openalex.org/W1975093281","https://openalex.org/W1983209534","https://openalex.org/W2024445160","https://openalex.org/W2100439400","https://openalex.org/W2101527714","https://openalex.org/W2119683335","https://openalex.org/W2163481385","https://openalex.org/W2164599584","https://openalex.org/W2320592338","https://openalex.org/W2493784510","https://openalex.org/W2501246425","https://openalex.org/W2526709821"],"related_works":["https://openalex.org/W2128350152","https://openalex.org/W2121824117","https://openalex.org/W2118931651","https://openalex.org/W2164974156","https://openalex.org/W2088183555","https://openalex.org/W2115794616","https://openalex.org/W2049075887","https://openalex.org/W2103831785","https://openalex.org/W3000477998","https://openalex.org/W2156188675"],"abstract_inverted_index":{"In":[0],"this":[1],"letter,":[2],"we":[3,66],"consider":[4],"a":[5,31,46,50],"cumulative":[6],"distribution":[7,25],"function-based":[8],"scheduling":[9,72],"(CS)":[10],"algorithm":[11,36],"in":[12],"downlink":[13],"cellular":[14],"networks.":[15],"We":[16],"present":[17],"exact":[18],"and":[19,74],"approximate":[20,43],"formulas":[21],"for":[22,49],"the":[23,27,34,68,71,75,80,84],"probability":[24],"of":[26,30,33,53,70,83],"starving":[28,81],"time":[29,82],"user":[32],"CS":[35,85],"over":[37],"Nakagami-m":[38],"Markov":[39],"fading":[40,77],"channels.":[41],"The":[42],"formula":[44],"provides":[45],"tight":[47],"result":[48],"large":[51],"number":[52],"users":[54],"with":[55],"low":[56],"computational":[57],"complexity.":[58],"Through":[59],"numerical":[60],"studies":[61],"based":[62],"on":[63,79],"our":[64],"analysis,":[65],"investigate":[67],"impact":[69],"parameters":[73,78],"Nakagami":[76],"algorithm.":[86]},"counts_by_year":[{"year":2020,"cited_by_count":1},{"year":2019,"cited_by_count":1}],"updated_date":"2025-11-06T03:46:38.306776","created_date":"2025-10-10T00:00:00"}