Haijun Liao, Zhenyu Zhou, Xiongwen Zhao, B. Ai, S. Mumtaz
{"title":"信息不确定性下车辆雾计算任务卸载:一种匹配学习方法","authors":"Haijun Liao, Zhenyu Zhou, Xiongwen Zhao, B. Ai, S. Mumtaz","doi":"10.1109/IWCMC.2019.8766579","DOIUrl":null,"url":null,"abstract":"Vehicular fog computing (VFC) has emerged as a cost-efficient solution for task processing in vehicular networks. However, how to realize stable and reliable task offloading under information uncertainty remains a critical challenge. In this paper, we propose a matching-learning-based task offloading algorithm to address this challenge. First, a low-complexity and stable task offloading mechanism is proposed to minimize the total network delay based on the pricing-based matching. Second, we extend the work to the scenario of information uncertainty, and develop a matching-learning-based task offloading algorithm by combining matching theory and upper confidence bound (UCB) algorithm. Simulation results demonstrate that the proposed algorithm can achieve bounded deviation from the optimal performance without the global information.","PeriodicalId":363800,"journal":{"name":"2019 15th International Wireless Communications & Mobile Computing Conference (IWCMC)","volume":"8 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2019-06-24","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"17","resultStr":"{\"title\":\"Task Offloading for Vehicular Fog Computing under Information Uncertainty: A Matching-Learning Approach\",\"authors\":\"Haijun Liao, Zhenyu Zhou, Xiongwen Zhao, B. Ai, S. Mumtaz\",\"doi\":\"10.1109/IWCMC.2019.8766579\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"Vehicular fog computing (VFC) has emerged as a cost-efficient solution for task processing in vehicular networks. However, how to realize stable and reliable task offloading under information uncertainty remains a critical challenge. In this paper, we propose a matching-learning-based task offloading algorithm to address this challenge. First, a low-complexity and stable task offloading mechanism is proposed to minimize the total network delay based on the pricing-based matching. Second, we extend the work to the scenario of information uncertainty, and develop a matching-learning-based task offloading algorithm by combining matching theory and upper confidence bound (UCB) algorithm. Simulation results demonstrate that the proposed algorithm can achieve bounded deviation from the optimal performance without the global information.\",\"PeriodicalId\":363800,\"journal\":{\"name\":\"2019 15th International Wireless Communications & Mobile Computing Conference (IWCMC)\",\"volume\":\"8 1\",\"pages\":\"0\"},\"PeriodicalIF\":0.0000,\"publicationDate\":\"2019-06-24\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"17\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"2019 15th International Wireless Communications & Mobile Computing Conference (IWCMC)\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://doi.org/10.1109/IWCMC.2019.8766579\",\"RegionNum\":0,\"RegionCategory\":null,\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"\",\"JCRName\":\"\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"2019 15th International Wireless Communications & Mobile Computing Conference (IWCMC)","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/IWCMC.2019.8766579","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
Task Offloading for Vehicular Fog Computing under Information Uncertainty: A Matching-Learning Approach
Vehicular fog computing (VFC) has emerged as a cost-efficient solution for task processing in vehicular networks. However, how to realize stable and reliable task offloading under information uncertainty remains a critical challenge. In this paper, we propose a matching-learning-based task offloading algorithm to address this challenge. First, a low-complexity and stable task offloading mechanism is proposed to minimize the total network delay based on the pricing-based matching. Second, we extend the work to the scenario of information uncertainty, and develop a matching-learning-based task offloading algorithm by combining matching theory and upper confidence bound (UCB) algorithm. Simulation results demonstrate that the proposed algorithm can achieve bounded deviation from the optimal performance without the global information.