{"id":"https://openalex.org/W2994173306","doi":"https://doi.org/10.1109/allerton.2019.8919867","title":"Scheduling to Minimize Age of Information in Multi-State Time-Varying Networks with Power Constraints","display_name":"Scheduling to Minimize Age of Information in Multi-State Time-Varying Networks with Power Constraints","publication_year":2019,"publication_date":"2019-09-01","ids":{"openalex":"https://openalex.org/W2994173306","doi":"https://doi.org/10.1109/allerton.2019.8919867","mag":"2994173306"},"language":"en","primary_location":{"id":"doi:10.1109/allerton.2019.8919867","is_oa":false,"landing_page_url":"https://doi.org/10.1109/allerton.2019.8919867","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"2019 57th Annual Allerton Conference on Communication, Control, and Computing (Allerton)","raw_type":"proceedings-article"},"type":"conference-paper","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/A5021894541","display_name":"Haoyue Tang","orcid":"https://orcid.org/0000-0003-1227-8715"},"institutions":[{"id":"https://openalex.org/I99065089","display_name":"Tsinghua University","ror":"https://ror.org/03cve4549","country_code":"CN","type":"education","lineage":["https://openalex.org/I99065089"]}],"countries":["CN"],"is_corresponding":false,"raw_author_name":"Haoyue Tang","raw_affiliation_strings":["Tsinghua University,Beijing National Research Center for Information Science and Technology (BNRist),Beijing,China,100084","Beijing National Research Center for Information Science and Technology (BNRist), Tsinghua University, Beijing, China"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Tsinghua University,Beijing National Research Center for Information Science and Technology (BNRist),Beijing,China,100084","institution_ids":["https://openalex.org/I99065089"]},{"raw_affiliation_string":"Beijing National Research Center for Information Science and Technology (BNRist), Tsinghua University, Beijing, China","institution_ids":["https://openalex.org/I99065089"]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5100379884","display_name":"Jintao Wang","orcid":"https://orcid.org/0000-0002-5245-5379"},"institutions":[{"id":"https://openalex.org/I99065089","display_name":"Tsinghua University","ror":"https://ror.org/03cve4549","country_code":"CN","type":"education","lineage":["https://openalex.org/I99065089"]}],"countries":["CN"],"is_corresponding":false,"raw_author_name":"Jintao Wang","raw_affiliation_strings":["Tsinghua University,Beijing National Research Center for Information Science and Technology (BNRist),Beijing,China,100084","Beijing National Research Center for Information Science and Technology (BNRist), Tsinghua University, Beijing, China"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Tsinghua University,Beijing National Research Center for Information Science and Technology (BNRist),Beijing,China,100084","institution_ids":["https://openalex.org/I99065089"]},{"raw_affiliation_string":"Beijing National Research Center for Information Science and Technology (BNRist), Tsinghua University, Beijing, China","institution_ids":["https://openalex.org/I99065089"]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5035185924","display_name":"Linqi Song","orcid":"https://orcid.org/0000-0003-2756-4984"},"institutions":[{"id":"https://openalex.org/I168719708","display_name":"City University of Hong Kong","ror":"https://ror.org/03q8dnn23","country_code":"HK","type":"education","lineage":["https://openalex.org/I168719708"]}],"countries":["HK"],"is_corresponding":false,"raw_author_name":"Linqi Song","raw_affiliation_strings":["City University of Hong Kong,Department of Computer Science,Kowloon Tong,Hong Kong","Department of Computer Science, City University of Hong Kong, Kowloon Tong, Hong Kong"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"City University of Hong Kong,Department of Computer Science,Kowloon Tong,Hong Kong","institution_ids":["https://openalex.org/I168719708"]},{"raw_affiliation_string":"Department of Computer Science, City University of Hong Kong, Kowloon Tong, Hong Kong","institution_ids":["https://openalex.org/I168719708"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5100403297","display_name":"Jian Song","orcid":"https://orcid.org/0000-0002-6066-9510"},"institutions":[{"id":"https://openalex.org/I99065089","display_name":"Tsinghua University","ror":"https://ror.org/03cve4549","country_code":"CN","type":"education","lineage":["https://openalex.org/I99065089"]}],"countries":["CN"],"is_corresponding":false,"raw_author_name":"Jian Song","raw_affiliation_strings":["Tsinghua University,Beijing National Research Center for Information Science and Technology (BNRist),Beijing,China,100084","Beijing National Research Center for Information Science and Technology (BNRist), Tsinghua University, Beijing, China"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Tsinghua University,Beijing National Research Center for Information Science and Technology (BNRist),Beijing,China,100084","institution_ids":["https://openalex.org/I99065089"]},{"raw_affiliation_string":"Beijing National Research Center for Information Science and Technology (BNRist), Tsinghua University, Beijing, China","institution_ids":["https://openalex.org/I99065089"]}]}],"institutions":[],"countries_distinct_count":2,"institutions_distinct_count":2,"corresponding_author_ids":[],"corresponding_institution_ids":[],"apc_list":null,"apc_paid":null,"fwci":null,"has_fulltext":false,"cited_by_count":33,"citation_normalized_percentile":null,"cited_by_percentile_year":null,"biblio":{"volume":null,"issue":null,"first_page":"1198","last_page":"1205"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T13553","display_name":"Age of Information Optimization","score":1.0,"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"}},"topics":[{"id":"https://openalex.org/T13553","display_name":"Age of Information Optimization","score":1.0,"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"}},{"id":"https://openalex.org/T10300","display_name":"Congenital Heart Disease Studies","score":0.9769999980926514,"subfield":{"id":"https://openalex.org/subfields/2713","display_name":"Epidemiology"},"field":{"id":"https://openalex.org/fields/27","display_name":"Medicine"},"domain":{"id":"https://openalex.org/domains/4","display_name":"Health Sciences"}},{"id":"https://openalex.org/T13471","display_name":"Cognitive Functions and Memory","score":0.9495999813079834,"subfield":{"id":"https://openalex.org/subfields/3205","display_name":"Experimental and Cognitive Psychology"},"field":{"id":"https://openalex.org/fields/32","display_name":"Psychology"},"domain":{"id":"https://openalex.org/domains/2","display_name":"Social Sciences"}}],"keywords":[{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.7301872968673706},{"id":"https://openalex.org/keywords/scheduling","display_name":"Scheduling (production processes)","score":0.6522411704063416},{"id":"https://openalex.org/keywords/markov-decision-process","display_name":"Markov decision process","score":0.631934404373169},{"id":"https://openalex.org/keywords/mathematical-optimization","display_name":"Mathematical optimization","score":0.5860227346420288},{"id":"https://openalex.org/keywords/exploit","display_name":"Exploit","score":0.5317092537879944},{"id":"https://openalex.org/keywords/dynamic-priority-scheduling","display_name":"Dynamic priority scheduling","score":0.4591291844844818},{"id":"https://openalex.org/keywords/bandwidth","display_name":"Bandwidth (computing)","score":0.41268688440322876},{"id":"https://openalex.org/keywords/distributed-computing","display_name":"Distributed computing","score":0.38060203194618225},{"id":"https://openalex.org/keywords/real-time-computing","display_name":"Real-time computing","score":0.37267667055130005},{"id":"https://openalex.org/keywords/markov-process","display_name":"Markov process","score":0.36361202597618103},{"id":"https://openalex.org/keywords/schedule","display_name":"Schedule","score":0.356696754693985},{"id":"https://openalex.org/keywords/computer-network","display_name":"Computer network","score":0.15285030007362366},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.13325288891792297}],"concepts":[{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.7301872968673706},{"id":"https://openalex.org/C206729178","wikidata":"https://www.wikidata.org/wiki/Q2271896","display_name":"Scheduling (production processes)","level":2,"score":0.6522411704063416},{"id":"https://openalex.org/C106189395","wikidata":"https://www.wikidata.org/wiki/Q176789","display_name":"Markov decision process","level":3,"score":0.631934404373169},{"id":"https://openalex.org/C126255220","wikidata":"https://www.wikidata.org/wiki/Q141495","display_name":"Mathematical optimization","level":1,"score":0.5860227346420288},{"id":"https://openalex.org/C165696696","wikidata":"https://www.wikidata.org/wiki/Q11287","display_name":"Exploit","level":2,"score":0.5317092537879944},{"id":"https://openalex.org/C107568181","wikidata":"https://www.wikidata.org/wiki/Q5319000","display_name":"Dynamic priority scheduling","level":3,"score":0.4591291844844818},{"id":"https://openalex.org/C2776257435","wikidata":"https://www.wikidata.org/wiki/Q1576430","display_name":"Bandwidth (computing)","level":2,"score":0.41268688440322876},{"id":"https://openalex.org/C120314980","wikidata":"https://www.wikidata.org/wiki/Q180634","display_name":"Distributed computing","level":1,"score":0.38060203194618225},{"id":"https://openalex.org/C79403827","wikidata":"https://www.wikidata.org/wiki/Q3988","display_name":"Real-time computing","level":1,"score":0.37267667055130005},{"id":"https://openalex.org/C159886148","wikidata":"https://www.wikidata.org/wiki/Q176645","display_name":"Markov process","level":2,"score":0.36361202597618103},{"id":"https://openalex.org/C68387754","wikidata":"https://www.wikidata.org/wiki/Q7271585","display_name":"Schedule","level":2,"score":0.356696754693985},{"id":"https://openalex.org/C31258907","wikidata":"https://www.wikidata.org/wiki/Q1301371","display_name":"Computer network","level":1,"score":0.15285030007362366},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.13325288891792297},{"id":"https://openalex.org/C105795698","wikidata":"https://www.wikidata.org/wiki/Q12483","display_name":"Statistics","level":1,"score":0.0},{"id":"https://openalex.org/C38652104","wikidata":"https://www.wikidata.org/wiki/Q3510521","display_name":"Computer security","level":1,"score":0.0},{"id":"https://openalex.org/C111919701","wikidata":"https://www.wikidata.org/wiki/Q9135","display_name":"Operating system","level":1,"score":0.0}],"mesh":[],"locations_count":1,"locations":[{"id":"doi:10.1109/allerton.2019.8919867","is_oa":false,"landing_page_url":"https://doi.org/10.1109/allerton.2019.8919867","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"2019 57th Annual Allerton Conference on Communication, Control, and Computing (Allerton)","raw_type":"proceedings-article"}],"best_oa_location":null,"sustainable_development_goals":[{"display_name":"Peace, Justice and strong institutions","id":"https://metadata.un.org/sdg/16","score":0.6600000262260437}],"awards":[],"funders":[],"has_content":{"grobid_xml":false,"pdf":false},"content_urls":null,"referenced_works_count":31,"referenced_works":["https://openalex.org/W1409984952","https://openalex.org/W1518931405","https://openalex.org/W1640967807","https://openalex.org/W1972770660","https://openalex.org/W1993918491","https://openalex.org/W2111340059","https://openalex.org/W2155670180","https://openalex.org/W2415697701","https://openalex.org/W2496350169","https://openalex.org/W2588468001","https://openalex.org/W2742721402","https://openalex.org/W2743336004","https://openalex.org/W2744248483","https://openalex.org/W2744483094","https://openalex.org/W2782548437","https://openalex.org/W2782611477","https://openalex.org/W2791487310","https://openalex.org/W2809579289","https://openalex.org/W2884979698","https://openalex.org/W2886961132","https://openalex.org/W2962941768","https://openalex.org/W2963061785","https://openalex.org/W2963270598","https://openalex.org/W2963568654","https://openalex.org/W2963630011","https://openalex.org/W2963696760","https://openalex.org/W2963787033","https://openalex.org/W2963941676","https://openalex.org/W2964022677","https://openalex.org/W2964217103","https://openalex.org/W2994173306"],"related_works":["https://openalex.org/W17155033","https://openalex.org/W3207760230","https://openalex.org/W1496222301","https://openalex.org/W4312814274","https://openalex.org/W1590307681","https://openalex.org/W2536018345","https://openalex.org/W2315999538","https://openalex.org/W187740018","https://openalex.org/W2162286586","https://openalex.org/W4255368532"],"abstract_inverted_index":{"In":[0],"this":[1],"paper,":[2],"we":[3,80,104],"study":[4],"how":[5,60],"to":[6,61,65,77,147,164,175],"collect":[7],"fresh":[8],"data":[9,19],"in":[10,190],"time-varying":[11],"networks":[12],"with":[13,184],"power":[14,187],"constrained":[15,91],"users.":[16],"We":[17,47],"measure":[18],"freshness":[20],"from":[21],"the":[22,25,30,36,40,44,51,55,83,99,106,110,114,121,137,144,150,170,196],"perspective":[23],"of":[24,33,43,98,109,149],"central":[26],"controller":[27],"by":[28,179],"using":[29],"metric":[31],"Age":[32],"Information,":[34],"namely":[35],"time":[37],"elapsed":[38],"since":[39],"generation":[41],"time-stamp":[42],"freshest":[45],"information.":[46],"wonder":[48],"what":[49],"is":[50,141,156],"minimum":[52],"AoI":[53,168],"performance":[54,155],"network":[56],"can":[57,135,199],"achieve":[58],"and":[59,119],"design":[62],"scheduling":[63,73,85],"algorithms":[64],"approach":[66],"it.":[67],"To":[68],"answer":[69],"these":[70],"questions":[71],"when":[72],"decisions":[74],"are":[75,188],"restricted":[76],"bandwidth":[78,101,139,197],"constraint,":[79],"first":[81],"decouple":[82],"multi-user":[84],"problem":[86],"into":[87],"a":[88,166,191],"single":[89,116],"user":[90,117],"Markov":[92],"decision":[93],"process":[94],"(CMDP)":[95],"through":[96,124,158],"relaxation":[97],"hard":[100,138],"constraint.":[102],"Next":[103],"exploit":[105],"threshold":[107],"structure":[108],"optimal":[111,131,145],"policy":[112,133],"for":[113],"decoupled":[115,151],"CMDP":[118],"obtain":[120,165],"optimum":[122],"solution":[123,146],"linear":[125],"programming":[126],"(LP).":[127],"Finally,":[128],"an":[129],"asymptotic":[130],"truncated":[132],"that":[134,163,195],"satisfy":[136],"constraint":[140,198],"built":[142],"upon":[143],"each":[148],"single-user":[152],"sub-problem.":[153],"The":[154],"verified":[157],"simulations.":[159],"Our":[160],"investigation":[161],"shows":[162],"small":[167],"performance,":[169],"scheduler":[171],"exploits":[172],"good":[173],"channels":[174],"schedule":[176],"users":[177],"supported":[178],"limited":[180],"power.":[181],"Users":[182],"equipped":[183],"enough":[185],"transmission":[186],"updated":[189],"timely":[192],"manner":[193],"such":[194],"be":[200],"satisfied.":[201]},"counts_by_year":[{"year":2025,"cited_by_count":2},{"year":2024,"cited_by_count":1},{"year":2023,"cited_by_count":4},{"year":2022,"cited_by_count":3},{"year":2021,"cited_by_count":7},{"year":2020,"cited_by_count":11},{"year":2019,"cited_by_count":5}],"updated_date":"2026-07-14T23:27:15.235271","created_date":"2025-10-10T00:00:00"}