{"id":"https://openalex.org/W7117470051","doi":"https://doi.org/10.1109/ton.2025.3649207","title":"Minimizing Age-of-Information in Heterogeneous Multi-Channel Systems: A New Partial-Index Approach","display_name":"Minimizing Age-of-Information in Heterogeneous Multi-Channel Systems: A New Partial-Index Approach","publication_year":2025,"publication_date":"2025-12-29","ids":{"openalex":"https://openalex.org/W7117470051","doi":"https://doi.org/10.1109/ton.2025.3649207"},"language":null,"primary_location":{"id":"doi:10.1109/ton.2025.3649207","is_oa":false,"landing_page_url":"https://doi.org/10.1109/ton.2025.3649207","pdf_url":null,"source":{"id":"https://openalex.org/S5407042750","display_name":"IEEE Transactions on Networking","issn_l":"2998-4157","issn":["2998-4157"],"is_oa":false,"is_in_doaj":false,"is_core":false,"host_organization":null,"host_organization_name":null,"host_organization_lineage":[],"host_organization_lineage_names":[],"type":"journal"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"IEEE Transactions on Networking","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/A5071450603","display_name":"Yihan Zou","orcid":null},"institutions":[{"id":"https://openalex.org/I219193219","display_name":"Purdue University West Lafayette","ror":"https://ror.org/02dqehb95","country_code":"US","type":"education","lineage":["https://openalex.org/I219193219"]}],"countries":["US"],"is_corresponding":false,"raw_author_name":"Yihan Zou","raw_affiliation_strings":["Elmore Family School of Electrical and Computer Engineering, Purdue University, West Lafayette, IN, USA"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Elmore Family School of Electrical and Computer Engineering, Purdue University, West Lafayette, IN, USA","institution_ids":["https://openalex.org/I219193219"]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5111625063","display_name":"Sixiang Zhou","orcid":null},"institutions":[{"id":"https://openalex.org/I219193219","display_name":"Purdue University West Lafayette","ror":"https://ror.org/02dqehb95","country_code":"US","type":"education","lineage":["https://openalex.org/I219193219"]}],"countries":["US"],"is_corresponding":false,"raw_author_name":"Sixiang Zhou","raw_affiliation_strings":["Elmore Family School of Electrical and Computer Engineering, Purdue University, West Lafayette, IN, USA"],"raw_orcid":"https://orcid.org/0009-0002-4537-8683","affiliations":[{"raw_affiliation_string":"Elmore Family School of Electrical and Computer Engineering, Purdue University, West Lafayette, IN, USA","institution_ids":["https://openalex.org/I219193219"]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5046216789","display_name":"Kwang Taik Kim","orcid":"https://orcid.org/0000-0001-7089-7026"},"institutions":[{"id":"https://openalex.org/I219193219","display_name":"Purdue University West Lafayette","ror":"https://ror.org/02dqehb95","country_code":"US","type":"education","lineage":["https://openalex.org/I219193219"]}],"countries":["US"],"is_corresponding":false,"raw_author_name":"Kwang Taik Kim","raw_affiliation_strings":["Elmore Family School of Electrical and Computer Engineering, Purdue University, West Lafayette, IN, USA"],"raw_orcid":"https://orcid.org/0000-0001-7089-7026","affiliations":[{"raw_affiliation_string":"Elmore Family School of Electrical and Computer Engineering, Purdue University, West Lafayette, IN, USA","institution_ids":["https://openalex.org/I219193219"]}]},{"author_position":"last","author":{"id":null,"display_name":"Xiaojun Lin","orcid":"https://orcid.org/0000-0001-9117-7212"},"institutions":[],"countries":[],"is_corresponding":false,"raw_author_name":"Xiaojun Lin","raw_affiliation_strings":["ByteDance Inc, Mountain View, CA, USA"],"raw_orcid":"https://orcid.org/0000-0001-9117-7212","affiliations":[{"raw_affiliation_string":"ByteDance Inc, Mountain View, CA, USA","institution_ids":[]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":4,"corresponding_author_ids":[],"corresponding_institution_ids":[],"apc_list":null,"apc_paid":null,"fwci":0.0,"has_fulltext":false,"cited_by_count":0,"citation_normalized_percentile":{"value":0.60540326,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":null,"biblio":{"volume":"34","issue":null,"first_page":"2621","last_page":"2636"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T13553","display_name":"Age of Information Optimization","score":0.9995999932289124,"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":0.9995999932289124,"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/T10273","display_name":"IoT and Edge/Fog Computing","score":0.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/T12079","display_name":"IoT Networks and Protocols","score":0.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"}}],"keywords":[{"id":"https://openalex.org/keywords/curse-of-dimensionality","display_name":"Curse of dimensionality","score":0.5841000080108643},{"id":"https://openalex.org/keywords/dual","display_name":"Dual (grammatical number)","score":0.5814999938011169},{"id":"https://openalex.org/keywords/markov-decision-process","display_name":"Markov decision process","score":0.4885999858379364},{"id":"https://openalex.org/keywords/matching","display_name":"Matching (statistics)","score":0.43050000071525574},{"id":"https://openalex.org/keywords/markov-process","display_name":"Markov process","score":0.4106000065803528},{"id":"https://openalex.org/keywords/process","display_name":"Process (computing)","score":0.3637999892234802}],"concepts":[{"id":"https://openalex.org/C126255220","wikidata":"https://www.wikidata.org/wiki/Q141495","display_name":"Mathematical optimization","level":1,"score":0.6621999740600586},{"id":"https://openalex.org/C111030470","wikidata":"https://www.wikidata.org/wiki/Q1430460","display_name":"Curse of dimensionality","level":2,"score":0.5841000080108643},{"id":"https://openalex.org/C2780980858","wikidata":"https://www.wikidata.org/wiki/Q110022","display_name":"Dual (grammatical number)","level":2,"score":0.5814999938011169},{"id":"https://openalex.org/C106189395","wikidata":"https://www.wikidata.org/wiki/Q176789","display_name":"Markov decision process","level":3,"score":0.4885999858379364},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.47279998660087585},{"id":"https://openalex.org/C165064840","wikidata":"https://www.wikidata.org/wiki/Q1321061","display_name":"Matching (statistics)","level":2,"score":0.43050000071525574},{"id":"https://openalex.org/C159886148","wikidata":"https://www.wikidata.org/wiki/Q176645","display_name":"Markov process","level":2,"score":0.4106000065803528},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.387800008058548},{"id":"https://openalex.org/C98045186","wikidata":"https://www.wikidata.org/wiki/Q205663","display_name":"Process (computing)","level":2,"score":0.3637999892234802},{"id":"https://openalex.org/C68387754","wikidata":"https://www.wikidata.org/wiki/Q7271585","display_name":"Schedule","level":2,"score":0.3578999936580658},{"id":"https://openalex.org/C98763669","wikidata":"https://www.wikidata.org/wiki/Q176645","display_name":"Markov chain","level":2,"score":0.35420000553131104},{"id":"https://openalex.org/C2777382242","wikidata":"https://www.wikidata.org/wiki/Q6017816","display_name":"Index (typography)","level":2,"score":0.34299999475479126},{"id":"https://openalex.org/C147764199","wikidata":"https://www.wikidata.org/wiki/Q6865248","display_name":"Minification","level":2,"score":0.29330000281333923},{"id":"https://openalex.org/C137836250","wikidata":"https://www.wikidata.org/wiki/Q984063","display_name":"Optimization problem","level":2,"score":0.27399998903274536}],"mesh":[],"locations_count":1,"locations":[{"id":"doi:10.1109/ton.2025.3649207","is_oa":false,"landing_page_url":"https://doi.org/10.1109/ton.2025.3649207","pdf_url":null,"source":{"id":"https://openalex.org/S5407042750","display_name":"IEEE Transactions on Networking","issn_l":"2998-4157","issn":["2998-4157"],"is_oa":false,"is_in_doaj":false,"is_core":false,"host_organization":null,"host_organization_name":null,"host_organization_lineage":[],"host_organization_lineage_names":[],"type":"journal"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"IEEE Transactions on Networking","raw_type":"journal-article"}],"best_oa_location":null,"sustainable_development_goals":[],"awards":[{"id":"https://openalex.org/G3524895375","display_name":null,"funder_award_id":"CNS-222595","funder_id":"https://openalex.org/F4320306076","funder_display_name":"National Science Foundation"},{"id":"https://openalex.org/G6766275701","display_name":null,"funder_award_id":"CNS-2113893","funder_id":"https://openalex.org/F4320306076","funder_display_name":"National Science Foundation"},{"id":"https://openalex.org/G6903205608","display_name":null,"funder_award_id":"CNS-2225950","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"}],"has_content":{"grobid_xml":false,"pdf":false},"content_urls":null,"referenced_works_count":26,"referenced_works":["https://openalex.org/W103934657","https://openalex.org/W1993918491","https://openalex.org/W2044502527","https://openalex.org/W2047281923","https://openalex.org/W2056921512","https://openalex.org/W2115138651","https://openalex.org/W2161872841","https://openalex.org/W2499002200","https://openalex.org/W2511028367","https://openalex.org/W2744248483","https://openalex.org/W2783882572","https://openalex.org/W2796882881","https://openalex.org/W2915151495","https://openalex.org/W2945729351","https://openalex.org/W2962921664","https://openalex.org/W2963270598","https://openalex.org/W2963782453","https://openalex.org/W2969447045","https://openalex.org/W2992286867","https://openalex.org/W2995485083","https://openalex.org/W3009774140","https://openalex.org/W3014502234","https://openalex.org/W3047000248","https://openalex.org/W3047536455","https://openalex.org/W3175748441","https://openalex.org/W4403018548"],"related_works":[],"abstract_inverted_index":{"We":[0,125,178],"study":[1],"how":[2],"to":[3,19,116,136,159,184],"schedule":[4],"data":[5],"sources":[6],"in":[7,163,190],"a":[8,33,138,170,174,209],"wireless":[9],"time-sensitive":[10],"information":[11],"system":[12],"with":[13,75,114,229],"multiple":[14,76,89,230],"heterogeneous":[15,77,231],"and":[16,48,108,133,151,222],"unreliable":[17],"channels":[18],"minimize":[20],"the":[21,44,63,128,148,165,198,213],"total":[22,166],"expected":[23,167],"Age-of-Information":[24],"(AoI).":[25],"Although":[26],"one":[27,93,117],"could":[28,223],"formulate":[29],"this":[30,99],"problem":[31],"as":[32],"discrete-time":[34],"Markov":[35],"Decision":[36],"Process":[37],"(MDP),":[38],"such":[39],"an":[40,181],"approach":[41],"suffers":[42],"from":[43],"curse":[45],"of":[46,50,105,130,215,219],"dimensionality":[47],"lack":[49],"insights.":[51],"For":[52],"single-channel":[53],"systems,":[54],"prior":[55],"studies":[56],"have":[57],"developed":[58],"lower-complexity":[59],"solutions":[60],"based":[61],"on":[62,173],"Whittle":[64,67],"index.":[65],"However,":[66],"index":[68,217],"has":[69],"not":[70,83],"been":[71],"studied":[72],"for":[73,94,226],"systems":[74],"channels,":[78],"mainly":[79],"because":[80],"indexability":[81,107],"is":[82,157,218],"well":[84],"defined":[85,113],"when":[86],"there":[87],"are":[88,112],"dual":[90,149],"cost":[91],"values,":[92],"each":[95],"channel.":[96],"To":[97],"overcome":[98],"difficulty,":[100],"we":[101],"introduce":[102],"new":[103],"notions":[104],"partial":[106,109,131,152,188,216],"index,":[110],"which":[111,145],"respect":[115],"channel\u2019s":[118],"cost,":[119],"given":[120],"all":[121],"other":[122,227],"channels\u2019":[123],"costs.":[124],"then":[126],"combine":[127],"ideas":[129],"indices":[132,189],"max-weight":[134],"matching":[135],"develop":[137],"Sum":[139],"Weighted":[140],"Index":[141],"Matching":[142],"(SWIM)":[143],"policy,":[144],"iteratively":[146],"updates":[147],"costs":[150],"indices.":[153],"The":[154],"proposed":[155,199],"policy":[156,200],"shown":[158],"be":[160,224],"asymptotically":[161],"optimal":[162],"minimizing":[164],"AoI,":[168],"under":[169],"technical":[171],"condition":[172],"global":[175],"attractor":[176],"property.":[177],"also":[179],"propose":[180],"interpolation-based":[182],"algorithm":[183],"quickly":[185],"compute":[186],"(approximate)":[187],"real":[191],"time.":[192],"Extensive":[193],"performance":[194],"simulations":[195],"demonstrate":[196],"that":[197],"offers":[201],"significant":[202],"gains":[203],"over":[204],"conventional":[205],"approaches":[206],"by":[207],"achieving":[208],"near-optimal":[210],"AoI.":[211],"Further,":[212],"notion":[214],"independent":[220],"interest":[221],"useful":[225],"problems":[228],"resources.":[232]},"counts_by_year":[],"updated_date":"2026-06-11T09:08:48.828518","created_date":"2025-12-29T00:00:00"}