{"id":"https://openalex.org/W2947364945","doi":"https://doi.org/10.1109/spcom.2018.8724448","title":"Age-of-Information Aware Scheduling","display_name":"Age-of-Information Aware Scheduling","publication_year":2018,"publication_date":"2018-07-01","ids":{"openalex":"https://openalex.org/W2947364945","doi":"https://doi.org/10.1109/spcom.2018.8724448","mag":"2947364945"},"language":"en","primary_location":{"id":"doi:10.1109/spcom.2018.8724448","is_oa":false,"landing_page_url":"https://doi.org/10.1109/spcom.2018.8724448","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"2018 International Conference on Signal Processing and Communications (SPCOM)","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/A5051894559","display_name":"Prakirt Raj Jhunjhunwala","orcid":"https://orcid.org/0000-0002-1574-6206"},"institutions":[{"id":"https://openalex.org/I162827531","display_name":"Indian Institute of Technology Bombay","ror":"https://ror.org/02qyf5152","country_code":"IN","type":"education","lineage":["https://openalex.org/I162827531"]}],"countries":["IN"],"is_corresponding":true,"raw_author_name":"Prakirt Raj Jhunjhunwala","raw_affiliation_strings":["Indian Institute of Technology, Bombay"],"affiliations":[{"raw_affiliation_string":"Indian Institute of Technology, Bombay","institution_ids":["https://openalex.org/I162827531"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5005788654","display_name":"Sharayu Moharir","orcid":"https://orcid.org/0000-0001-9393-9276"},"institutions":[{"id":"https://openalex.org/I162827531","display_name":"Indian Institute of Technology Bombay","ror":"https://ror.org/02qyf5152","country_code":"IN","type":"education","lineage":["https://openalex.org/I162827531"]}],"countries":["IN"],"is_corresponding":false,"raw_author_name":"Sharayu Moharir","raw_affiliation_strings":["Indian Institute of Technology, Bombay"],"affiliations":[{"raw_affiliation_string":"Indian Institute of Technology, Bombay","institution_ids":["https://openalex.org/I162827531"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":2,"corresponding_author_ids":["https://openalex.org/A5051894559"],"corresponding_institution_ids":["https://openalex.org/I162827531"],"apc_list":null,"apc_paid":null,"fwci":2.9259,"has_fulltext":false,"cited_by_count":33,"citation_normalized_percentile":{"value":0.91967155,"is_in_top_1_percent":false,"is_in_top_10_percent":true},"cited_by_percentile_year":{"min":90,"max":99},"biblio":{"volume":null,"issue":null,"first_page":"222","last_page":"226"},"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.9805999994277954,"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/T12079","display_name":"IoT Networks and Protocols","score":0.9433000087738037,"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/computer-science","display_name":"Computer science","score":0.7402744889259338},{"id":"https://openalex.org/keywords/scheduling","display_name":"Scheduling (production processes)","score":0.6813564896583557},{"id":"https://openalex.org/keywords/dynamic-priority-scheduling","display_name":"Dynamic priority scheduling","score":0.5412423610687256},{"id":"https://openalex.org/keywords/greedy-algorithm","display_name":"Greedy algorithm","score":0.51609867811203},{"id":"https://openalex.org/keywords/mathematical-optimization","display_name":"Mathematical optimization","score":0.4701307713985443},{"id":"https://openalex.org/keywords/fair-share-scheduling","display_name":"Fair-share scheduling","score":0.4423588812351227},{"id":"https://openalex.org/keywords/computer-network","display_name":"Computer network","score":0.1688530445098877},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.15377363562583923},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.12612253427505493}],"concepts":[{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.7402744889259338},{"id":"https://openalex.org/C206729178","wikidata":"https://www.wikidata.org/wiki/Q2271896","display_name":"Scheduling (production processes)","level":2,"score":0.6813564896583557},{"id":"https://openalex.org/C107568181","wikidata":"https://www.wikidata.org/wiki/Q5319000","display_name":"Dynamic priority scheduling","level":3,"score":0.5412423610687256},{"id":"https://openalex.org/C51823790","wikidata":"https://www.wikidata.org/wiki/Q504353","display_name":"Greedy algorithm","level":2,"score":0.51609867811203},{"id":"https://openalex.org/C126255220","wikidata":"https://www.wikidata.org/wiki/Q141495","display_name":"Mathematical optimization","level":1,"score":0.4701307713985443},{"id":"https://openalex.org/C31689143","wikidata":"https://www.wikidata.org/wiki/Q733809","display_name":"Fair-share scheduling","level":3,"score":0.4423588812351227},{"id":"https://openalex.org/C31258907","wikidata":"https://www.wikidata.org/wiki/Q1301371","display_name":"Computer network","level":1,"score":0.1688530445098877},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.15377363562583923},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.12612253427505493},{"id":"https://openalex.org/C5119721","wikidata":"https://www.wikidata.org/wiki/Q220501","display_name":"Quality of service","level":2,"score":0.0}],"mesh":[],"locations_count":1,"locations":[{"id":"doi:10.1109/spcom.2018.8724448","is_oa":false,"landing_page_url":"https://doi.org/10.1109/spcom.2018.8724448","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"2018 International Conference on Signal Processing and Communications (SPCOM)","raw_type":"proceedings-article"}],"best_oa_location":null,"sustainable_development_goals":[],"awards":[],"funders":[],"has_content":{"pdf":false,"grobid_xml":false},"content_urls":null,"referenced_works_count":26,"referenced_works":["https://openalex.org/W1640967807","https://openalex.org/W1677318746","https://openalex.org/W1932416753","https://openalex.org/W1970679118","https://openalex.org/W1993918491","https://openalex.org/W2036772106","https://openalex.org/W2066786775","https://openalex.org/W2069689609","https://openalex.org/W2102159907","https://openalex.org/W2110216183","https://openalex.org/W2119584748","https://openalex.org/W2260745325","https://openalex.org/W2345637103","https://openalex.org/W2444311295","https://openalex.org/W2586350738","https://openalex.org/W2744483094","https://openalex.org/W2783882572","https://openalex.org/W2963230953","https://openalex.org/W2963568655","https://openalex.org/W2963696760","https://openalex.org/W2963869148","https://openalex.org/W2964201926","https://openalex.org/W2964222997","https://openalex.org/W2964250104","https://openalex.org/W4251434705","https://openalex.org/W6676076879"],"related_works":["https://openalex.org/W2184166483","https://openalex.org/W2397293317","https://openalex.org/W2389640906","https://openalex.org/W4312077400","https://openalex.org/W2377713709","https://openalex.org/W2373973180","https://openalex.org/W2372008037","https://openalex.org/W2978148977","https://openalex.org/W2225350526","https://openalex.org/W1545991362"],"abstract_inverted_index":{"We":[0,82,131],"study":[1],"the":[2,33,39,48,55,65,69,92,122,141,149,158],"task":[3],"of":[4,27,35,64,68,115,124],"scheduling":[5,76,89,108],"in":[6,98],"a":[7,17,28,58,62,84,111],"multi-source":[8],"system":[9,56],"where":[10],"sources":[11],"report":[12],"their":[13],"time-varying":[14],"information":[15],"to":[16,74,78,105,148],"central":[18],"monitoring":[19,49],"station":[20],"via":[21],"multiple":[22],"orthogonal":[23],"channels.":[24],"The":[25],"Age-of-Information":[26],"source":[29,44],"is":[30,61,73,144,161],"defined":[31],"as":[32],"amount":[34],"time":[36,53],"elapsed":[37],"since":[38],"latest":[40],"update":[41],"from":[42],"that":[43,60,133],"was":[45],"received":[46],"at":[47],"station.":[50],"At":[51],"each":[52],"instant,":[54],"pays":[57],"cost":[59,95,116,142,159],"function":[63,143,160],"current":[66],"Ages-of-Information":[67],"sources.":[70,164],"Our":[71],"goal":[72],"design":[75,106],"policies":[77,109,136,156],"minimize":[79],"this":[80,103],"cost.":[81],"draw":[83],"novel":[85],"parallel":[86],"between":[87],"our":[88,125,151],"problem":[90,97],"and":[91,101],"minimum":[93],"mean":[94],"cycle":[96],"weighted":[99],"graphs":[100],"use":[102],"insight":[104],"optimal":[107,139],"for":[110],"very":[112],"general":[113],"class":[114],"functions.":[117],"In":[118],"addition,":[119],"we":[120],"compare":[121],"performance":[123],"policy":[126,152],"with":[127,146],"naive":[128],"greedy":[129,135,155],"policies.":[130],"show":[132],"while":[134],"can":[137],"be":[138],"if":[140],"symmetric":[145],"respect":[147],"sources,":[150],"strictly":[153],"outperforms":[154],"when":[157],"asymmetric":[162],"across":[163]},"counts_by_year":[{"year":2026,"cited_by_count":1},{"year":2025,"cited_by_count":4},{"year":2024,"cited_by_count":2},{"year":2023,"cited_by_count":7},{"year":2022,"cited_by_count":4},{"year":2021,"cited_by_count":9},{"year":2020,"cited_by_count":3},{"year":2019,"cited_by_count":2},{"year":2018,"cited_by_count":1}],"updated_date":"2026-03-20T23:20:44.827607","created_date":"2025-10-10T00:00:00"}