{"id":"https://openalex.org/W4414646797","doi":"https://doi.org/10.1109/vtc2025-spring65109.2025.11174612","title":"HAPTA: Adaptive Learning Based Horizontal Computation Offloading over RSUs in VEC","display_name":"HAPTA: Adaptive Learning Based Horizontal Computation Offloading over RSUs in VEC","publication_year":2025,"publication_date":"2025-06-17","ids":{"openalex":"https://openalex.org/W4414646797","doi":"https://doi.org/10.1109/vtc2025-spring65109.2025.11174612"},"language":"en","primary_location":{"id":"doi:10.1109/vtc2025-spring65109.2025.11174612","is_oa":false,"landing_page_url":"https://doi.org/10.1109/vtc2025-spring65109.2025.11174612","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"2025 IEEE 101st Vehicular Technology Conference (VTC2025-Spring)","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/A5115842227","display_name":"Tanniru Abhinav Siddharth","orcid":null},"institutions":[{"id":"https://openalex.org/I65181880","display_name":"Indian Institute of Technology Hyderabad","ror":"https://ror.org/01j4v3x97","country_code":"IN","type":"education","lineage":["https://openalex.org/I65181880"]}],"countries":["IN"],"is_corresponding":false,"raw_author_name":"Tanniru Abhinav Siddharth","raw_affiliation_strings":["IIIT Hyderabad,Computer Systems Group"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"IIIT Hyderabad,Computer Systems Group","institution_ids":["https://openalex.org/I65181880"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5047166433","display_name":"Deepak Gangadharan","orcid":"https://orcid.org/0000-0001-6630-0012"},"institutions":[{"id":"https://openalex.org/I65181880","display_name":"Indian Institute of Technology Hyderabad","ror":"https://ror.org/01j4v3x97","country_code":"IN","type":"education","lineage":["https://openalex.org/I65181880"]}],"countries":["IN"],"is_corresponding":false,"raw_author_name":"Deepak Gangadharan","raw_affiliation_strings":["IIIT Hyderabad,Computer Systems Group"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"IIIT Hyderabad,Computer Systems Group","institution_ids":["https://openalex.org/I65181880"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":1,"corresponding_author_ids":[],"corresponding_institution_ids":["https://openalex.org/I65181880"],"apc_list":null,"apc_paid":null,"fwci":0.0,"has_fulltext":false,"cited_by_count":0,"citation_normalized_percentile":{"value":0.3099324,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":null,"biblio":{"volume":null,"issue":null,"first_page":"1","last_page":"7"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T10715","display_name":"Distributed and Parallel Computing Systems","score":0.9128999710083008,"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/T10715","display_name":"Distributed and Parallel Computing Systems","score":0.9128999710083008,"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"}}],"keywords":[{"id":"https://openalex.org/keywords/scheduling","display_name":"Scheduling (production processes)","score":0.6536999940872192},{"id":"https://openalex.org/keywords/latency","display_name":"Latency (audio)","score":0.5655999779701233},{"id":"https://openalex.org/keywords/task","display_name":"Task (project management)","score":0.5238000154495239},{"id":"https://openalex.org/keywords/edge-computing","display_name":"Edge computing","score":0.5180000066757202},{"id":"https://openalex.org/keywords/computation-offloading","display_name":"Computation offloading","score":0.46779999136924744},{"id":"https://openalex.org/keywords/computation","display_name":"Computation","score":0.4645000100135803},{"id":"https://openalex.org/keywords/task-analysis","display_name":"Task analysis","score":0.3822999894618988},{"id":"https://openalex.org/keywords/enhanced-data-rates-for-gsm-evolution","display_name":"Enhanced Data Rates for GSM Evolution","score":0.3580000102519989}],"concepts":[{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.8603000044822693},{"id":"https://openalex.org/C206729178","wikidata":"https://www.wikidata.org/wiki/Q2271896","display_name":"Scheduling (production processes)","level":2,"score":0.6536999940872192},{"id":"https://openalex.org/C120314980","wikidata":"https://www.wikidata.org/wiki/Q180634","display_name":"Distributed computing","level":1,"score":0.6376000046730042},{"id":"https://openalex.org/C82876162","wikidata":"https://www.wikidata.org/wiki/Q17096504","display_name":"Latency (audio)","level":2,"score":0.5655999779701233},{"id":"https://openalex.org/C2780451532","wikidata":"https://www.wikidata.org/wiki/Q759676","display_name":"Task (project management)","level":2,"score":0.5238000154495239},{"id":"https://openalex.org/C2778456923","wikidata":"https://www.wikidata.org/wiki/Q5337692","display_name":"Edge computing","level":3,"score":0.5180000066757202},{"id":"https://openalex.org/C2781041963","wikidata":"https://www.wikidata.org/wiki/Q18348618","display_name":"Computation offloading","level":4,"score":0.46779999136924744},{"id":"https://openalex.org/C45374587","wikidata":"https://www.wikidata.org/wiki/Q12525525","display_name":"Computation","level":2,"score":0.4645000100135803},{"id":"https://openalex.org/C175154964","wikidata":"https://www.wikidata.org/wiki/Q380077","display_name":"Task analysis","level":3,"score":0.3822999894618988},{"id":"https://openalex.org/C31258907","wikidata":"https://www.wikidata.org/wiki/Q1301371","display_name":"Computer network","level":1,"score":0.3601999878883362},{"id":"https://openalex.org/C162307627","wikidata":"https://www.wikidata.org/wiki/Q204833","display_name":"Enhanced Data Rates for GSM Evolution","level":2,"score":0.3580000102519989},{"id":"https://openalex.org/C138236772","wikidata":"https://www.wikidata.org/wiki/Q25098575","display_name":"Edge device","level":3,"score":0.3440000116825104},{"id":"https://openalex.org/C77553402","wikidata":"https://www.wikidata.org/wiki/Q13222579","display_name":"Upper and lower bounds","level":2,"score":0.3433000147342682},{"id":"https://openalex.org/C206345919","wikidata":"https://www.wikidata.org/wiki/Q20380951","display_name":"Resource (disambiguation)","level":2,"score":0.3285999894142151},{"id":"https://openalex.org/C79974875","wikidata":"https://www.wikidata.org/wiki/Q483639","display_name":"Cloud computing","level":2,"score":0.32749998569488525},{"id":"https://openalex.org/C29202148","wikidata":"https://www.wikidata.org/wiki/Q287260","display_name":"Resource allocation","level":2,"score":0.32109999656677246},{"id":"https://openalex.org/C79403827","wikidata":"https://www.wikidata.org/wiki/Q3988","display_name":"Real-time computing","level":1,"score":0.3125999867916107},{"id":"https://openalex.org/C139807058","wikidata":"https://www.wikidata.org/wiki/Q352374","display_name":"Adaptation (eye)","level":2,"score":0.2879999876022339},{"id":"https://openalex.org/C97541855","wikidata":"https://www.wikidata.org/wiki/Q830687","display_name":"Reinforcement learning","level":2,"score":0.2872999906539917},{"id":"https://openalex.org/C107568181","wikidata":"https://www.wikidata.org/wiki/Q5319000","display_name":"Dynamic priority scheduling","level":3,"score":0.28290000557899475},{"id":"https://openalex.org/C55416958","wikidata":"https://www.wikidata.org/wiki/Q6206757","display_name":"Job shop scheduling","level":3,"score":0.2743000090122223},{"id":"https://openalex.org/C179799912","wikidata":"https://www.wikidata.org/wiki/Q205084","display_name":"Computational complexity theory","level":2,"score":0.2687999904155731},{"id":"https://openalex.org/C2780609101","wikidata":"https://www.wikidata.org/wiki/Q17156588","display_name":"Resource management (computing)","level":2,"score":0.25290000438690186}],"mesh":[],"locations_count":1,"locations":[{"id":"doi:10.1109/vtc2025-spring65109.2025.11174612","is_oa":false,"landing_page_url":"https://doi.org/10.1109/vtc2025-spring65109.2025.11174612","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"2025 IEEE 101st Vehicular Technology Conference (VTC2025-Spring)","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":0,"referenced_works":[],"related_works":[],"abstract_inverted_index":{"The":[0,105],"rapid":[1],"evolution":[2],"of":[3,22],"vehicular":[4,24,100,125],"edge":[5],"computing":[6],"(VEC)":[7],"has":[8],"made":[9],"task":[10,55,75,103,139],"offloading":[11,58,76],"to":[12,67,71],"roadside":[13],"units":[14],"(RSUs)":[15],"essential":[16],"for":[17],"addressing":[18],"the":[19,61,87,129],"computational":[20],"demands":[21],"modern":[23],"applications.":[25],"However,":[26],"efficiently":[27],"partitioning":[28,56],"and":[29,57,102,116,142],"scheduling":[30,85],"tasks":[31,70,109],"across":[32,78],"RSUs":[33,93],"in":[34,146],"dynamic":[35],"environments":[36],"remains":[37],"challenging.":[38],"This":[39],"paper":[40],"introduces":[41],"a":[42,52],"novel":[43],"algorithm,":[44,66],"HAPTA":[45,89,130],"(Horizontal,":[46],"Adaptive":[47],"Learning-based,":[48],"Partitioned,":[49],"Timeslot-based":[50],"Algorithm),":[51],"time-slot":[53],"based":[54],"approach":[59,131],"using":[60],"Upper":[62],"Confidence":[63],"Bound":[64],"(UCB)":[65],"adaptively":[68],"allocate":[69],"RSUs.":[72],"We":[73],"consider":[74],"horizontally":[77],"RSU":[79],"nodes.":[80],"Unlike":[81],"static":[82],"or":[83],"heuristic-based":[84,135],"methods,":[86,136],"proposed":[88],"framework":[90,106],"dynamically":[91],"selects":[92],"with":[94],"optimal":[95],"resource":[96,114],"availability":[97],"while":[98],"considering":[99],"mobility":[101],"deadlines.":[104],"supports":[107],"splitting":[108],"into":[110],"subtasks,":[111],"enabling":[112],"efficient":[113],"utilization":[115],"meeting":[117],"stringent":[118],"latency":[119],"constraints.":[120],"Experimental":[121],"evaluations":[122],"on":[123],"real-world":[124],"datasets":[126],"demonstrate":[127],"that":[128],"outperforms":[132],"previously":[133],"introduced":[134],"achieving":[137],"higher":[138],"completion":[140],"rates":[141],"lower":[143],"latency,":[144],"particularly":[145],"high-density":[147],"scenarios.":[148]},"counts_by_year":[],"updated_date":"2026-07-29T14:22:42.915294","created_date":"2025-10-10T00:00:00"}