{"id":"https://openalex.org/W4415368254","doi":"https://doi.org/10.1109/isit63088.2025.11195612","title":"Age of Information Optimization with Preemption Strategies for Correlated Systems","display_name":"Age of Information Optimization with Preemption Strategies for Correlated Systems","publication_year":2025,"publication_date":"2025-06-22","ids":{"openalex":"https://openalex.org/W4415368254","doi":"https://doi.org/10.1109/isit63088.2025.11195612"},"language":null,"primary_location":{"id":"doi:10.1109/isit63088.2025.11195612","is_oa":false,"landing_page_url":"https://doi.org/10.1109/isit63088.2025.11195612","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"2025 IEEE International Symposium on Information Theory (ISIT)","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/A5094236162","display_name":"Egemen Erbayat","orcid":"https://orcid.org/0009-0003-1241-1464"},"institutions":[{"id":"https://openalex.org/I193531525","display_name":"George Washington University","ror":"https://ror.org/00y4zzh67","country_code":"US","type":"education","lineage":["https://openalex.org/I193531525"]}],"countries":["US"],"is_corresponding":true,"raw_author_name":"Egemen Erbayat","raw_affiliation_strings":["The George Washington University,USA"],"affiliations":[{"raw_affiliation_string":"The George Washington University,USA","institution_ids":["https://openalex.org/I193531525"]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5072222232","display_name":"Ali Maatouk","orcid":"https://orcid.org/0000-0002-3436-7068"},"institutions":[{"id":"https://openalex.org/I32971472","display_name":"Yale University","ror":"https://ror.org/03v76x132","country_code":"US","type":"education","lineage":["https://openalex.org/I32971472"]}],"countries":["US"],"is_corresponding":false,"raw_author_name":"Ali Maatouk","raw_affiliation_strings":["Yale University,USA"],"affiliations":[{"raw_affiliation_string":"Yale University,USA","institution_ids":["https://openalex.org/I32971472"]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5077653400","display_name":"Peng Zou","orcid":"https://orcid.org/0000-0001-7639-6580"},"institutions":[{"id":"https://openalex.org/I200845125","display_name":"Nanjing University of Information Science and Technology","ror":"https://ror.org/02y0rxk19","country_code":"CN","type":"education","lineage":["https://openalex.org/I200845125"]}],"countries":["CN"],"is_corresponding":false,"raw_author_name":"Peng Zou","raw_affiliation_strings":["Nanjing University of Information Science and Technology,China"],"affiliations":[{"raw_affiliation_string":"Nanjing University of Information Science and Technology,China","institution_ids":["https://openalex.org/I200845125"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5042830832","display_name":"Suresh Subramaniam","orcid":"https://orcid.org/0000-0003-1501-5953"},"institutions":[{"id":"https://openalex.org/I193531525","display_name":"George Washington University","ror":"https://ror.org/00y4zzh67","country_code":"US","type":"education","lineage":["https://openalex.org/I193531525"]}],"countries":["US"],"is_corresponding":false,"raw_author_name":"Suresh Subramaniam","raw_affiliation_strings":["The George Washington University,USA"],"affiliations":[{"raw_affiliation_string":"The George Washington University,USA","institution_ids":["https://openalex.org/I193531525"]}]}],"institutions":[],"countries_distinct_count":2,"institutions_distinct_count":4,"corresponding_author_ids":["https://openalex.org/A5094236162"],"corresponding_institution_ids":["https://openalex.org/I193531525"],"apc_list":null,"apc_paid":null,"fwci":2.8392,"has_fulltext":false,"cited_by_count":2,"citation_normalized_percentile":{"value":0.92635545,"is_in_top_1_percent":false,"is_in_top_10_percent":true},"cited_by_percentile_year":{"min":98,"max":99},"biblio":{"volume":null,"issue":null,"first_page":"1","last_page":"6"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T13553","display_name":"Age of Information Optimization","score":0.9988999962806702,"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.9988999962806702,"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/T11992","display_name":"CCD and CMOS Imaging Sensors","score":0.9387999773025513,"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/preemption","display_name":"Preemption","score":0.9355999827384949},{"id":"https://openalex.org/keywords/probabilistic-logic","display_name":"Probabilistic logic","score":0.5378999710083008},{"id":"https://openalex.org/keywords/scalability","display_name":"Scalability","score":0.5146999955177307},{"id":"https://openalex.org/keywords/reciprocal","display_name":"Reciprocal","score":0.4629000127315521},{"id":"https://openalex.org/keywords/optimization-problem","display_name":"Optimization problem","score":0.38609999418258667},{"id":"https://openalex.org/keywords/upper-and-lower-bounds","display_name":"Upper and lower bounds","score":0.38359999656677246},{"id":"https://openalex.org/keywords/frame","display_name":"Frame (networking)","score":0.3750999867916107},{"id":"https://openalex.org/keywords/logarithm","display_name":"Logarithm","score":0.3668000102043152},{"id":"https://openalex.org/keywords/dependency","display_name":"Dependency (UML)","score":0.3571999967098236}],"concepts":[{"id":"https://openalex.org/C206952183","wikidata":"https://www.wikidata.org/wiki/Q1193100","display_name":"Preemption","level":2,"score":0.9355999827384949},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.6586999893188477},{"id":"https://openalex.org/C49937458","wikidata":"https://www.wikidata.org/wiki/Q2599292","display_name":"Probabilistic logic","level":2,"score":0.5378999710083008},{"id":"https://openalex.org/C48044578","wikidata":"https://www.wikidata.org/wiki/Q727490","display_name":"Scalability","level":2,"score":0.5146999955177307},{"id":"https://openalex.org/C2777742833","wikidata":"https://www.wikidata.org/wiki/Q1964083","display_name":"Reciprocal","level":2,"score":0.4629000127315521},{"id":"https://openalex.org/C126255220","wikidata":"https://www.wikidata.org/wiki/Q141495","display_name":"Mathematical optimization","level":1,"score":0.4422000050544739},{"id":"https://openalex.org/C137836250","wikidata":"https://www.wikidata.org/wiki/Q984063","display_name":"Optimization problem","level":2,"score":0.38609999418258667},{"id":"https://openalex.org/C77553402","wikidata":"https://www.wikidata.org/wiki/Q13222579","display_name":"Upper and lower bounds","level":2,"score":0.38359999656677246},{"id":"https://openalex.org/C126042441","wikidata":"https://www.wikidata.org/wiki/Q1324888","display_name":"Frame (networking)","level":2,"score":0.3750999867916107},{"id":"https://openalex.org/C39927690","wikidata":"https://www.wikidata.org/wiki/Q11197","display_name":"Logarithm","level":2,"score":0.3668000102043152},{"id":"https://openalex.org/C19768560","wikidata":"https://www.wikidata.org/wiki/Q320727","display_name":"Dependency (UML)","level":2,"score":0.3571999967098236},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.34360000491142273},{"id":"https://openalex.org/C117220453","wikidata":"https://www.wikidata.org/wiki/Q5172842","display_name":"Correlation","level":2,"score":0.3278000056743622},{"id":"https://openalex.org/C41045048","wikidata":"https://www.wikidata.org/wiki/Q202843","display_name":"Linear programming","level":2,"score":0.32690000534057617},{"id":"https://openalex.org/C311688","wikidata":"https://www.wikidata.org/wiki/Q2393193","display_name":"Time complexity","level":2,"score":0.3156000077724457},{"id":"https://openalex.org/C111335779","wikidata":"https://www.wikidata.org/wiki/Q3454686","display_name":"Reduction (mathematics)","level":2,"score":0.30480000376701355},{"id":"https://openalex.org/C147764199","wikidata":"https://www.wikidata.org/wiki/Q6865248","display_name":"Minification","level":2,"score":0.3034000098705292},{"id":"https://openalex.org/C120314980","wikidata":"https://www.wikidata.org/wiki/Q180634","display_name":"Distributed computing","level":1,"score":0.2694000005722046},{"id":"https://openalex.org/C196921405","wikidata":"https://www.wikidata.org/wiki/Q786431","display_name":"Online algorithm","level":2,"score":0.26840001344680786},{"id":"https://openalex.org/C19012869","wikidata":"https://www.wikidata.org/wiki/Q578372","display_name":"Response time","level":2,"score":0.2678999900817871},{"id":"https://openalex.org/C2778112365","wikidata":"https://www.wikidata.org/wiki/Q3511065","display_name":"Sequence (biology)","level":2,"score":0.2655999958515167},{"id":"https://openalex.org/C113336015","wikidata":"https://www.wikidata.org/wiki/Q574010","display_name":"Complete information","level":2,"score":0.2621999979019165},{"id":"https://openalex.org/C148764684","wikidata":"https://www.wikidata.org/wiki/Q621751","display_name":"Approximation algorithm","level":2,"score":0.2540000081062317},{"id":"https://openalex.org/C106189395","wikidata":"https://www.wikidata.org/wiki/Q176789","display_name":"Markov decision process","level":3,"score":0.25380000472068787},{"id":"https://openalex.org/C124101348","wikidata":"https://www.wikidata.org/wiki/Q172491","display_name":"Data mining","level":1,"score":0.25220000743865967},{"id":"https://openalex.org/C151376022","wikidata":"https://www.wikidata.org/wiki/Q168698","display_name":"Exponential function","level":2,"score":0.25060001015663147}],"mesh":[],"locations_count":1,"locations":[{"id":"doi:10.1109/isit63088.2025.11195612","is_oa":false,"landing_page_url":"https://doi.org/10.1109/isit63088.2025.11195612","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"2025 IEEE International Symposium on Information Theory (ISIT)","raw_type":"proceedings-article"}],"best_oa_location":null,"sustainable_development_goals":[],"awards":[{"id":"https://openalex.org/G1197563420","display_name":null,"funder_award_id":"CNS2219180","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":{"pdf":false,"grobid_xml":false},"content_urls":null,"referenced_works_count":38,"referenced_works":["https://openalex.org/W1495367673","https://openalex.org/W1677318746","https://openalex.org/W1919404870","https://openalex.org/W1932416753","https://openalex.org/W1972382727","https://openalex.org/W1993918491","https://openalex.org/W2066786775","https://openalex.org/W2102501784","https://openalex.org/W2571303926","https://openalex.org/W2744483094","https://openalex.org/W2797442898","https://openalex.org/W2825335763","https://openalex.org/W2860412241","https://openalex.org/W2905236430","https://openalex.org/W2909704954","https://openalex.org/W2922356761","https://openalex.org/W2963270598","https://openalex.org/W2963294159","https://openalex.org/W2963568655","https://openalex.org/W2963630011","https://openalex.org/W2963696760","https://openalex.org/W2964290621","https://openalex.org/W2971937201","https://openalex.org/W3007447684","https://openalex.org/W3008803558","https://openalex.org/W3041291604","https://openalex.org/W3097276919","https://openalex.org/W3136260254","https://openalex.org/W3137257456","https://openalex.org/W3176620738","https://openalex.org/W3181171726","https://openalex.org/W4220712038","https://openalex.org/W4285104925","https://openalex.org/W4297102110","https://openalex.org/W4297882647","https://openalex.org/W4389776294","https://openalex.org/W4390098252","https://openalex.org/W4403017220"],"related_works":[],"abstract_inverted_index":{"In":[0,34],"this":[1,35,118],"paper,":[2],"we":[3,39,80,120,172,186],"examine":[4],"a":[5,20,82,106,112,129,134,150,204],"multi-sensor":[6],"system":[7],"where":[8,45,86],"each":[9],"sensor":[10,89],"monitors":[11],"multiple":[12],"dynamic":[13],"information":[14,29],"processes":[15,148,192],"and":[16,101,149],"transmits":[17],"updates":[18,25],"over":[19],"shared":[21],"communication":[22],"channel.":[23],"These":[24],"may":[26],"include":[27],"correlated":[28,71],"across":[30],"the":[31,41,55,87,99,126,137,145,154,157,161,189,194,200,212],"various":[32],"processes.":[33],"type":[36],"of":[37,43,57,108,136,147,156,191,214],"system,":[38],"analyze":[40],"impact":[42],"preemption,":[44],"ongoing":[46],"transmissions":[47],"are":[48],"replaced":[49],"by":[50,132,199],"newer":[51],"updates,":[52],"on":[53,125,153,169],"minimizing":[54],"Age":[56],"Information":[58],"(Aol).":[59],"While":[60],"preemption":[61,84,90,183,209],"is":[62,92],"optimal":[63,162,182],"in":[64,69,208],"some":[65],"scenarios,":[66],"its":[67,103],"effectiveness":[68],"multisensor":[70],"systems":[72],"remains":[73],"an":[74,122],"open":[75],"question.":[76],"To":[77,116],"address":[78],"this,":[79],"introduce":[81],"probabilistic":[83],"policy,":[85],"source":[88],"decision":[91],"stochastic.":[93],"We":[94],"derive":[95],"closedform":[96],"expressions":[97],"for":[98],"Aol":[100],"frame":[102],"optimization":[104],"as":[105,197],"sum":[107],"linear":[109,142],"ratios":[110],"problem,":[111],"well-known":[113],"NP-hard":[114],"problem.":[115,138],"navigate":[117],"complexity,":[119],"establish":[121],"upper":[123],"bound":[124],"iterations":[127],"using":[128],"branch-and-bound":[130],"algorithm":[131],"leveraging":[133],"reformulation":[135],"This":[139],"analysis":[140],"reveals":[141],"scalability":[143],"with":[144],"number":[146,213],"logarithmic":[151],"dependency":[152],"reciprocal":[155],"error":[158],"that":[159,188],"shows":[160],"solution":[163],"can":[164,178],"be":[165],"efficiently":[166],"found.":[167],"Building":[168],"these":[170],"findings,":[171],"show":[173],"how":[174],"different":[175],"correlation":[176,201],"matrices":[177],"lead":[179],"to":[180],"distinct":[181],"strategies.":[184],"Interestingly,":[185],"demonstrate":[187],"diversity":[190],"within":[193],"sensors'":[195],"packets,":[196],"captured":[198],"matrix,":[202],"plays":[203],"more":[205],"significant":[206],"role":[207],"priority":[210],"than":[211],"updates.":[215]},"counts_by_year":[{"year":2026,"cited_by_count":2}],"updated_date":"2026-04-09T08:11:56.329763","created_date":"2025-10-21T00:00:00"}