{"id":"https://openalex.org/W7138918439","doi":"https://doi.org/10.1109/globecom59602.2025.11432418","title":"Age-Aware On-Demand Task Scheduling for Vehicular Computing Power Networks","display_name":"Age-Aware On-Demand Task Scheduling for Vehicular Computing Power Networks","publication_year":2025,"publication_date":"2025-12-08","ids":{"openalex":"https://openalex.org/W7138918439","doi":"https://doi.org/10.1109/globecom59602.2025.11432418"},"language":null,"primary_location":{"id":"doi:10.1109/globecom59602.2025.11432418","is_oa":false,"landing_page_url":"https://doi.org/10.1109/globecom59602.2025.11432418","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"GLOBECOM 2025 - 2025 IEEE Global Communications Conference","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/A5100604518","display_name":"Jiajia Liu","orcid":"https://orcid.org/0000-0002-1923-5964"},"institutions":[{"id":"https://openalex.org/I21193070","display_name":"Beijing Jiaotong University","ror":"https://ror.org/01yj56c84","country_code":"CN","type":"education","lineage":["https://openalex.org/I21193070"]}],"countries":["CN"],"is_corresponding":false,"raw_author_name":"Jiajia Liu","raw_affiliation_strings":["Beijing Jiaotong University,School of Electronic and Information Engineering,Beijing,China"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Beijing Jiaotong University,School of Electronic and Information Engineering,Beijing,China","institution_ids":["https://openalex.org/I21193070"]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5101131280","display_name":"Yunlong Lu","orcid":"https://orcid.org/0000-0001-9552-5130"},"institutions":[{"id":"https://openalex.org/I21193070","display_name":"Beijing Jiaotong University","ror":"https://ror.org/01yj56c84","country_code":"CN","type":"education","lineage":["https://openalex.org/I21193070"]}],"countries":["CN"],"is_corresponding":false,"raw_author_name":"Yunlong Lu","raw_affiliation_strings":["Beijing Jiaotong University,School of Electronic and Information Engineering,Beijing,China"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Beijing Jiaotong University,School of Electronic and Information Engineering,Beijing,China","institution_ids":["https://openalex.org/I21193070"]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5129907339","display_name":"Bo Ai","orcid":null},"institutions":[{"id":"https://openalex.org/I21193070","display_name":"Beijing Jiaotong University","ror":"https://ror.org/01yj56c84","country_code":"CN","type":"education","lineage":["https://openalex.org/I21193070"]}],"countries":["CN"],"is_corresponding":false,"raw_author_name":"Bo Ai","raw_affiliation_strings":["Beijing Jiaotong University,School of Electronic and Information Engineering,Beijing,China"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Beijing Jiaotong University,School of Electronic and Information Engineering,Beijing,China","institution_ids":["https://openalex.org/I21193070"]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5087353591","display_name":"Zhigang Wu","orcid":"https://orcid.org/0000-0002-6782-9249"},"institutions":[{"id":"https://openalex.org/I21193070","display_name":"Beijing Jiaotong University","ror":"https://ror.org/01yj56c84","country_code":"CN","type":"education","lineage":["https://openalex.org/I21193070"]}],"countries":["CN"],"is_corresponding":false,"raw_author_name":"Hao Wu","raw_affiliation_strings":["Beijing Jiaotong University,School of Electronic and Information Engineering,Beijing,China"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Beijing Jiaotong University,School of Electronic and Information Engineering,Beijing,China","institution_ids":["https://openalex.org/I21193070"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5130182438","display_name":"Yan Zhang","orcid":null},"institutions":[{"id":"https://openalex.org/I184942183","display_name":"University of Oslo","ror":"https://ror.org/01xtthb56","country_code":"NO","type":"education","lineage":["https://openalex.org/I184942183"]}],"countries":["NO"],"is_corresponding":false,"raw_author_name":"Yan Zhang","raw_affiliation_strings":["University of Oslo,Department of Informatics,Oslo,Norway"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"University of Oslo,Department of Informatics,Oslo,Norway","institution_ids":["https://openalex.org/I184942183"]}]}],"institutions":[],"countries_distinct_count":2,"institutions_distinct_count":2,"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.71317138,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":null,"biblio":{"volume":null,"issue":null,"first_page":"5423","last_page":"5428"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T13553","display_name":"Age of Information Optimization","score":0.9843999743461609,"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.9843999743461609,"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.006399999838322401,"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/T10761","display_name":"Vehicular Ad Hoc Networks (VANETs)","score":0.002099999925121665,"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/scheduling","display_name":"Scheduling (production processes)","score":0.6089000105857849},{"id":"https://openalex.org/keywords/dynamic-priority-scheduling","display_name":"Dynamic priority scheduling","score":0.5117999911308289},{"id":"https://openalex.org/keywords/markov-decision-process","display_name":"Markov decision process","score":0.4465999901294708},{"id":"https://openalex.org/keywords/task-analysis","display_name":"Task analysis","score":0.4092000126838684},{"id":"https://openalex.org/keywords/maximization","display_name":"Maximization","score":0.376800000667572},{"id":"https://openalex.org/keywords/job-shop-scheduling","display_name":"Job shop scheduling","score":0.3743000030517578},{"id":"https://openalex.org/keywords/wireless","display_name":"Wireless","score":0.36489999294281006},{"id":"https://openalex.org/keywords/wireless-network","display_name":"Wireless network","score":0.3528999984264374},{"id":"https://openalex.org/keywords/fair-share-scheduling","display_name":"Fair-share scheduling","score":0.34529998898506165}],"concepts":[{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.7932999730110168},{"id":"https://openalex.org/C206729178","wikidata":"https://www.wikidata.org/wiki/Q2271896","display_name":"Scheduling (production processes)","level":2,"score":0.6089000105857849},{"id":"https://openalex.org/C120314980","wikidata":"https://www.wikidata.org/wiki/Q180634","display_name":"Distributed computing","level":1,"score":0.567300021648407},{"id":"https://openalex.org/C107568181","wikidata":"https://www.wikidata.org/wiki/Q5319000","display_name":"Dynamic priority scheduling","level":3,"score":0.5117999911308289},{"id":"https://openalex.org/C106189395","wikidata":"https://www.wikidata.org/wiki/Q176789","display_name":"Markov decision process","level":3,"score":0.4465999901294708},{"id":"https://openalex.org/C175154964","wikidata":"https://www.wikidata.org/wiki/Q380077","display_name":"Task analysis","level":3,"score":0.4092000126838684},{"id":"https://openalex.org/C2776330181","wikidata":"https://www.wikidata.org/wiki/Q18358244","display_name":"Maximization","level":2,"score":0.376800000667572},{"id":"https://openalex.org/C55416958","wikidata":"https://www.wikidata.org/wiki/Q6206757","display_name":"Job shop scheduling","level":3,"score":0.3743000030517578},{"id":"https://openalex.org/C555944384","wikidata":"https://www.wikidata.org/wiki/Q249","display_name":"Wireless","level":2,"score":0.36489999294281006},{"id":"https://openalex.org/C108037233","wikidata":"https://www.wikidata.org/wiki/Q11375","display_name":"Wireless network","level":3,"score":0.3528999984264374},{"id":"https://openalex.org/C31689143","wikidata":"https://www.wikidata.org/wiki/Q733809","display_name":"Fair-share scheduling","level":3,"score":0.34529998898506165},{"id":"https://openalex.org/C98763669","wikidata":"https://www.wikidata.org/wiki/Q176645","display_name":"Markov chain","level":2,"score":0.34049999713897705},{"id":"https://openalex.org/C159886148","wikidata":"https://www.wikidata.org/wiki/Q176645","display_name":"Markov process","level":2,"score":0.33379998803138733},{"id":"https://openalex.org/C2780451532","wikidata":"https://www.wikidata.org/wiki/Q759676","display_name":"Task (project management)","level":2,"score":0.3321000039577484},{"id":"https://openalex.org/C31258907","wikidata":"https://www.wikidata.org/wiki/Q1301371","display_name":"Computer network","level":1,"score":0.30379998683929443},{"id":"https://openalex.org/C179799912","wikidata":"https://www.wikidata.org/wiki/Q205084","display_name":"Computational complexity theory","level":2,"score":0.2948000133037567},{"id":"https://openalex.org/C79403827","wikidata":"https://www.wikidata.org/wiki/Q3988","display_name":"Real-time computing","level":1,"score":0.29429998993873596},{"id":"https://openalex.org/C119948110","wikidata":"https://www.wikidata.org/wiki/Q7858726","display_name":"Two-level scheduling","level":4,"score":0.2865000069141388},{"id":"https://openalex.org/C122141398","wikidata":"https://www.wikidata.org/wiki/Q5456330","display_name":"Fixed-priority pre-emptive scheduling","level":5,"score":0.2856000065803528},{"id":"https://openalex.org/C127456818","wikidata":"https://www.wikidata.org/wiki/Q238879","display_name":"Rate-monotonic scheduling","level":4,"score":0.2732999920845032},{"id":"https://openalex.org/C5119721","wikidata":"https://www.wikidata.org/wiki/Q220501","display_name":"Quality of service","level":2,"score":0.2700999975204468},{"id":"https://openalex.org/C192448918","wikidata":"https://www.wikidata.org/wiki/Q682677","display_name":"Vehicular ad hoc network","level":4,"score":0.25780001282691956},{"id":"https://openalex.org/C2780898871","wikidata":"https://www.wikidata.org/wiki/Q860554","display_name":"Performance metric","level":2,"score":0.2540000081062317},{"id":"https://openalex.org/C175893541","wikidata":"https://www.wikidata.org/wiki/Q1196582","display_name":"Round-robin scheduling","level":4,"score":0.25380000472068787},{"id":"https://openalex.org/C24590314","wikidata":"https://www.wikidata.org/wiki/Q336038","display_name":"Wireless sensor network","level":2,"score":0.2517000138759613}],"mesh":[],"locations_count":1,"locations":[{"id":"doi:10.1109/globecom59602.2025.11432418","is_oa":false,"landing_page_url":"https://doi.org/10.1109/globecom59602.2025.11432418","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"GLOBECOM 2025 - 2025 IEEE Global Communications Conference","raw_type":"proceedings-article"}],"best_oa_location":null,"sustainable_development_goals":[],"awards":[],"funders":[{"id":"https://openalex.org/F4320321001","display_name":"National Natural Science Foundation of China","ror":"https://ror.org/01h0zpd94"},{"id":"https://openalex.org/F4320335787","display_name":"Fundamental Research Funds for the Central Universities","ror":null}],"has_content":{"pdf":false,"grobid_xml":false},"content_urls":null,"referenced_works_count":13,"referenced_works":["https://openalex.org/W3006655855","https://openalex.org/W3110646255","https://openalex.org/W3161618639","https://openalex.org/W4226154801","https://openalex.org/W4321194942","https://openalex.org/W4375929259","https://openalex.org/W4381198725","https://openalex.org/W4382407470","https://openalex.org/W4388019181","https://openalex.org/W4388145742","https://openalex.org/W4389230688","https://openalex.org/W4408790737","https://openalex.org/W7128317047"],"related_works":[],"abstract_inverted_index":{"The":[0],"deep":[1],"integration":[2],"of":[3,23,73,82,100,115],"the":[4,14,18,30,71,78,113,118,120,140,157,184,203,210,219],"vehicular":[5,25],"computing":[6,98],"power":[7],"network":[8],"(VCPN)":[9],"and":[10,20,40,47,59,97,103,130,133,151,161,182],"artificial":[11],"intelligence":[12],"offers":[13],"potential":[15],"to":[16,29,38,112,177,201,217],"meet":[17],"computation-intensive":[19],"low-latency":[21],"demands":[22],"emerging":[24],"applications.":[26],"However,":[27],"due":[28],"dynamic":[31,141],"VCPN":[32],"scenarios,":[33],"task":[34,42,61,74,105,147,159,220],"heterogeneity":[35],"gives":[36],"rise":[37],"differentiated":[39,79],"time-varying":[41],"requirements,":[43],"while":[44],"node":[45],"mobility":[46],"wireless":[48,153],"channel":[49],"fluctuations":[50],"further":[51],"exacerbate":[52],"scheduling":[53,88,129,142,160],"complexity,":[54],"which":[55,76],"jointly":[56,93],"hinder":[57],"efficient":[58],"on-demand":[60],"scheduling.":[62],"In":[63],"this":[64],"paper,":[65],"we":[66,155,192],"propose":[67],"a":[68,104,126,134,165],"metric":[69],"termed":[70],"age":[72],"(AoT),":[75],"characterizes":[77],"service":[80],"requirements":[81],"tasks":[83],"in":[84,144,187],"VCPN.":[85],"A":[86],"utility-driven":[87],"model":[89,156],"is":[90,109,123,175],"developed":[91],"that":[92,209],"considers":[94],"AoT":[95],"reduction":[96],"cost":[99],"concurrent":[101],"tasks,":[102],"utility":[106],"maximization":[107],"problem":[108,122],"formulated.":[110],"Due":[111],"complexity":[114],"directly":[116],"solving":[117],"problem,":[119],"original":[121],"decomposed":[124],"into":[125],"joint":[127,158],"multi-task":[128],"matching":[131,162],"subproblem":[132,163],"resource":[135,198],"allocation":[136,199],"subproblem.":[137],"To":[138],"address":[139],"challenges":[143],"VCPN,":[145],"including":[146],"heterogeneity,":[148],"vehicle":[149],"mobility,":[150],"fluctuating":[152],"channels,":[154],"as":[164],"Markov":[166],"decision":[167],"process.":[168],"An":[169],"age-aware,":[170],"multi-dimensional":[171],"double-deep":[172],"Q-learning":[173],"algorithm":[174,200,212],"designed":[176],"handle":[178],"discrete":[179],"action":[180],"spaces":[181],"mitigate":[183],"overestimation":[185],"bias":[186],"traditional":[188],"DQN":[189],"methods.":[190],"Additionally,":[191],"develop":[193],"an":[194],"improved":[195],"interior":[196],"point-based":[197],"obtain":[202],"optimal":[204],"solution.":[205],"Numerical":[206],"results":[207],"show":[208],"proposed":[211],"effectively":[213],"adjusts":[214],"learning":[215],"strategies":[216],"maximize":[218],"utility.":[221]},"counts_by_year":[],"updated_date":"2026-07-29T14:22:42.915294","created_date":"2026-03-20T00:00:00"}
