{"id":"https://openalex.org/W4414230401","doi":"https://doi.org/10.1109/ton.2025.3605656","title":"Preempting to Minimize Age of Incorrect Information Under Transmission Delay","display_name":"Preempting to Minimize Age of Incorrect Information Under Transmission Delay","publication_year":2025,"publication_date":"2025-09-16","ids":{"openalex":"https://openalex.org/W4414230401","doi":"https://doi.org/10.1109/ton.2025.3605656"},"language":"en","primary_location":{"id":"doi:10.1109/ton.2025.3605656","is_oa":false,"landing_page_url":"https://doi.org/10.1109/ton.2025.3605656","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/A5100721369","display_name":"Yutao Chen","orcid":"https://orcid.org/0000-0003-3992-5468"},"institutions":[{"id":"https://openalex.org/I66946132","display_name":"University of Maryland, College Park","ror":"https://ror.org/047s2c258","country_code":"US","type":"education","lineage":["https://openalex.org/I66946132"]}],"countries":["US"],"is_corresponding":true,"raw_author_name":"Yutao Chen","raw_affiliation_strings":["Department of Electrical and Computer Engineering, University of Maryland, College Park, MD, USA"],"raw_orcid":"https://orcid.org/0000-0003-3992-5468","affiliations":[{"raw_affiliation_string":"Department of Electrical and Computer Engineering, University of Maryland, College Park, MD, USA","institution_ids":["https://openalex.org/I66946132"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5008039780","display_name":"Anthony Ephremides","orcid":"https://orcid.org/0000-0003-0172-8944"},"institutions":[{"id":"https://openalex.org/I66946132","display_name":"University of Maryland, College Park","ror":"https://ror.org/047s2c258","country_code":"US","type":"education","lineage":["https://openalex.org/I66946132"]}],"countries":["US"],"is_corresponding":false,"raw_author_name":"Anthony Ephremides","raw_affiliation_strings":["Department of Electrical and Computer Engineering, University of Maryland, College Park, MD, USA"],"raw_orcid":"https://orcid.org/0000-0003-0172-8944","affiliations":[{"raw_affiliation_string":"Department of Electrical and Computer Engineering, University of Maryland, College Park, MD, USA","institution_ids":["https://openalex.org/I66946132"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":2,"corresponding_author_ids":["https://openalex.org/A5100721369"],"corresponding_institution_ids":["https://openalex.org/I66946132"],"apc_list":null,"apc_paid":null,"fwci":0.0,"has_fulltext":false,"cited_by_count":0,"citation_normalized_percentile":{"value":0.2738535,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":null,"biblio":{"volume":"34","issue":null,"first_page":"668","last_page":"680"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T13553","display_name":"Age of Information Optimization","score":0.9998000264167786,"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.9998000264167786,"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/T13471","display_name":"Cognitive Functions and Memory","score":0.9708999991416931,"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"}},{"id":"https://openalex.org/T12079","display_name":"IoT Networks and Protocols","score":0.9386000037193298,"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/transmitter","display_name":"Transmitter","score":0.6937999725341797},{"id":"https://openalex.org/keywords/markov-decision-process","display_name":"Markov decision process","score":0.6672000288963318},{"id":"https://openalex.org/keywords/transmission","display_name":"Transmission (telecommunications)","score":0.6126000285148621},{"id":"https://openalex.org/keywords/channel","display_name":"Channel (broadcasting)","score":0.5945000052452087},{"id":"https://openalex.org/keywords/independent-and-identically-distributed-random-variables","display_name":"Independent and identically distributed random variables","score":0.5467000007629395},{"id":"https://openalex.org/keywords/markov-process","display_name":"Markov process","score":0.5317999720573425},{"id":"https://openalex.org/keywords/channel-state-information","display_name":"Channel state information","score":0.4986000061035156},{"id":"https://openalex.org/keywords/markov-chain","display_name":"Markov chain","score":0.4781999886035919},{"id":"https://openalex.org/keywords/preemption","display_name":"Preemption","score":0.46810001134872437}],"concepts":[{"id":"https://openalex.org/C47798520","wikidata":"https://www.wikidata.org/wiki/Q190157","display_name":"Transmitter","level":3,"score":0.6937999725341797},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.6769000291824341},{"id":"https://openalex.org/C106189395","wikidata":"https://www.wikidata.org/wiki/Q176789","display_name":"Markov decision process","level":3,"score":0.6672000288963318},{"id":"https://openalex.org/C761482","wikidata":"https://www.wikidata.org/wiki/Q118093","display_name":"Transmission (telecommunications)","level":2,"score":0.6126000285148621},{"id":"https://openalex.org/C127162648","wikidata":"https://www.wikidata.org/wiki/Q16858953","display_name":"Channel (broadcasting)","level":2,"score":0.5945000052452087},{"id":"https://openalex.org/C141513077","wikidata":"https://www.wikidata.org/wiki/Q378542","display_name":"Independent and identically distributed random variables","level":3,"score":0.5467000007629395},{"id":"https://openalex.org/C159886148","wikidata":"https://www.wikidata.org/wiki/Q176645","display_name":"Markov process","level":2,"score":0.5317999720573425},{"id":"https://openalex.org/C148063708","wikidata":"https://www.wikidata.org/wiki/Q5072511","display_name":"Channel state information","level":3,"score":0.4986000061035156},{"id":"https://openalex.org/C126255220","wikidata":"https://www.wikidata.org/wiki/Q141495","display_name":"Mathematical optimization","level":1,"score":0.49079999327659607},{"id":"https://openalex.org/C98763669","wikidata":"https://www.wikidata.org/wiki/Q176645","display_name":"Markov chain","level":2,"score":0.4781999886035919},{"id":"https://openalex.org/C206952183","wikidata":"https://www.wikidata.org/wiki/Q1193100","display_name":"Preemption","level":2,"score":0.46810001134872437},{"id":"https://openalex.org/C48103436","wikidata":"https://www.wikidata.org/wiki/Q599031","display_name":"State (computer science)","level":2,"score":0.4142000079154968},{"id":"https://openalex.org/C98045186","wikidata":"https://www.wikidata.org/wiki/Q205663","display_name":"Process (computing)","level":2,"score":0.41029998660087585},{"id":"https://openalex.org/C99414536","wikidata":"https://www.wikidata.org/wiki/Q7098950","display_name":"Optimal stopping","level":2,"score":0.37940001487731934},{"id":"https://openalex.org/C137836250","wikidata":"https://www.wikidata.org/wiki/Q984063","display_name":"Optimization problem","level":2,"score":0.35409998893737793},{"id":"https://openalex.org/C557945733","wikidata":"https://www.wikidata.org/wiki/Q389772","display_name":"Data transmission","level":2,"score":0.34150001406669617},{"id":"https://openalex.org/C122123141","wikidata":"https://www.wikidata.org/wiki/Q176623","display_name":"Random variable","level":2,"score":0.34049999713897705},{"id":"https://openalex.org/C150325174","wikidata":"https://www.wikidata.org/wiki/Q4335500","display_name":"Optimal decision","level":3,"score":0.33169999718666077},{"id":"https://openalex.org/C108921912","wikidata":"https://www.wikidata.org/wiki/Q7834639","display_name":"Transmission delay","level":3,"score":0.3149999976158142},{"id":"https://openalex.org/C2776291640","wikidata":"https://www.wikidata.org/wiki/Q2912517","display_name":"Value (mathematics)","level":2,"score":0.313400000333786},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.3046000003814697},{"id":"https://openalex.org/C177264268","wikidata":"https://www.wikidata.org/wiki/Q1514741","display_name":"Set (abstract data type)","level":2,"score":0.2930999994277954},{"id":"https://openalex.org/C47446073","wikidata":"https://www.wikidata.org/wiki/Q5165890","display_name":"Control theory (sociology)","level":3,"score":0.29109999537467957},{"id":"https://openalex.org/C113336015","wikidata":"https://www.wikidata.org/wiki/Q574010","display_name":"Complete information","level":2,"score":0.2842000126838684},{"id":"https://openalex.org/C79403827","wikidata":"https://www.wikidata.org/wiki/Q3988","display_name":"Real-time computing","level":1,"score":0.27900001406669617},{"id":"https://openalex.org/C158379750","wikidata":"https://www.wikidata.org/wiki/Q214111","display_name":"Network packet","level":2,"score":0.2782999873161316},{"id":"https://openalex.org/C118437007","wikidata":"https://www.wikidata.org/wiki/Q1017139","display_name":"Hybrid automatic repeat request","level":3,"score":0.26919999718666077},{"id":"https://openalex.org/C77553402","wikidata":"https://www.wikidata.org/wiki/Q13222579","display_name":"Upper and lower bounds","level":2,"score":0.26759999990463257},{"id":"https://openalex.org/C151201525","wikidata":"https://www.wikidata.org/wiki/Q177239","display_name":"Limit (mathematics)","level":2,"score":0.25690001249313354},{"id":"https://openalex.org/C163836022","wikidata":"https://www.wikidata.org/wiki/Q6771326","display_name":"Markov model","level":3,"score":0.25540000200271606}],"mesh":[],"locations_count":1,"locations":[{"id":"doi:10.1109/ton.2025.3605656","is_oa":false,"landing_page_url":"https://doi.org/10.1109/ton.2025.3605656","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":[],"funders":[],"has_content":{"pdf":false,"grobid_xml":false},"content_urls":null,"referenced_works_count":33,"referenced_works":["https://openalex.org/W1640967807","https://openalex.org/W1919404870","https://openalex.org/W1993918491","https://openalex.org/W2009533501","https://openalex.org/W2020233257","https://openalex.org/W2065284701","https://openalex.org/W2066786775","https://openalex.org/W2742721402","https://openalex.org/W2744248483","https://openalex.org/W2867820427","https://openalex.org/W2885592455","https://openalex.org/W2885608975","https://openalex.org/W2905236430","https://openalex.org/W2970983057","https://openalex.org/W3041291604","https://openalex.org/W3048471005","https://openalex.org/W3081244218","https://openalex.org/W3114944817","https://openalex.org/W3137257456","https://openalex.org/W3181171726","https://openalex.org/W3197240729","https://openalex.org/W3200517331","https://openalex.org/W3202966056","https://openalex.org/W3215171387","https://openalex.org/W4226370802","https://openalex.org/W4287119468","https://openalex.org/W4312881208","https://openalex.org/W4386260639","https://openalex.org/W4395069505","https://openalex.org/W4402350426","https://openalex.org/W4403017249","https://openalex.org/W4405056392","https://openalex.org/W4405232196"],"related_works":[],"abstract_inverted_index":{"We":[0,29,96],"study":[1],"the":[2,6,15,22,46,53,62,67,71,84,87,92,105,121,130,143,149,154,158,170,173,185,189,203,208,219,224,235,241],"problem":[3,151],"of":[4,8,17,86,157,172],"optimizing":[5],"decisions":[7,43],"a":[9,26,31,35,38,77,98,178],"preemptively":[10],"capable":[11],"transmitter":[12,36,54,72],"to":[13,57,75,119,128,147,183,233],"minimize":[14,129],"Age":[16],"Incorrect":[18],"Information":[19],"(AoII)":[20],"when":[21,61],"communication":[23],"channel":[24,63,68],"has":[25],"random":[27],"delay.":[28],"consider":[30,97],"slotted-time":[32],"system":[33,47,209],"where":[34],"observes":[37],"Markovian":[39,88],"source":[40,89],"and":[41,102,110,152,176,216],"makes":[42],"based":[44,90],"on":[45,91],"status.":[48],"In":[49],"each":[50,114,125],"time":[51,126,134],"slot,":[52],"decides":[55,73],"whether":[56,74],"preempt":[58],"or":[59],"skip":[60],"is":[64,69,108],"busy.":[65],"When":[66],"idle,":[70],"send":[76],"new":[78],"update.":[79,115],"A":[80],"remote":[81],"receiver":[82],"estimates":[83],"state":[85],"update":[93],"it":[94],"receives.":[95],"generic":[99,133],"transmission":[100,106],"delay":[101,107,214],"assume":[103],"that":[104],"independent":[109],"identically":[111],"distributed":[112],"for":[113],"This":[116],"paper":[117],"aims":[118],"optimize":[120],"transmitter\u2019s":[122],"decision":[123,145],"in":[124,202],"slot":[127],"AoII":[131],"with":[132],"penalty":[135],"functions.":[136],"To":[137],"this":[138],"end,":[139],"we":[140,168,198,206],"first":[141],"use":[142],"Markov":[144],"process":[146],"formulate":[148],"optimization":[150],"derive":[153],"analytical":[155],"expressions":[156],"expected":[159],"AoIIs":[160],"achieved":[161],"by":[162,240],"two":[163,212],"canonical":[164,213],"preemptive":[165],"policies.":[166],"Then,":[167],"prove":[169],"existence":[171],"optimal":[174,186,221],"policy":[175,225],"provide":[177],"feasible":[179],"value":[180,190],"iteration":[181,191],"algorithm":[182,192],"approximate":[184],"policy.":[187],"However,":[188],"will":[193],"be":[194],"computationally":[195],"expensive":[196],"if":[197],"want":[199],"considerable":[200],"confidence":[201],"approximation.":[204],"Therefore,":[205],"analyze":[207],"characteristics":[210],"under":[211],"distributions":[215],"theoretically":[217],"obtain":[218],"corresponding":[220],"policies":[222],"using":[223],"improvement":[226],"theorem.":[227],"Finally,":[228],"numerical":[229],"results":[230],"are":[231],"presented":[232],"illustrate":[234],"performance":[236],"improvements":[237],"brought":[238],"about":[239],"preemption":[242],"capability.":[243]},"counts_by_year":[],"updated_date":"2026-01-01T23:40:50.289205","created_date":"2025-10-10T00:00:00"}