An Efficient Offloading Algorithm Based on Support Vector Machine for Mobile Edge Computing in Vehicular Networks

Siyun Wu, Weiwei Xia, Wenqing Cui, Chao Qian, Zhuorui Lan, Feng Yan, Lianfeng Shen
{"title":"An Efficient Offloading Algorithm Based on Support Vector Machine for Mobile Edge Computing in Vehicular Networks","authors":"Siyun Wu, Weiwei Xia, Wenqing Cui, Chao Qian, Zhuorui Lan, Feng Yan, Lianfeng Shen","doi":"10.1109/WCSP.2018.8555695","DOIUrl":null,"url":null,"abstract":"In vehicular networks, Mobile Edge Computing (MEC) is applied to meet the offloading demand from vehicles. However, the mobility of vehicles may increase the offloading delay and even reduce the success rate of offloading, because vehicles may access another road side unit (RSU) before finishing offloading. Therefore, an offloading algorithm with low time complexity is required to make the offloading decision quickly. In this paper, we put forward an efficient offloading algorithm based on Support Vector Machine (SVMO) to satisfy the fast offloading demand in vehicular networks. The algorithm can segment a huge task into several sub-tasks through a weight allocation method according to available resources of MEC servers. Then each sub-task is decided whether it should be offloaded or executed locally based on SVMs. As the vehicle moves through several MEC servers, sub-tasks are allocated to them by order if they are offloaded. Each server ensures the sub-task can be processed and returned in time. Our proposed algorithm generate training data through Decision Tree. The simulation results show that the SVMO algorithm has a high decision accuracy, converges faster than other algorithms and has a small response time.","PeriodicalId":423073,"journal":{"name":"2018 10th International Conference on Wireless Communications and Signal Processing (WCSP)","volume":"103 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2018-10-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"35","resultStr":null,"platform":"Semanticscholar","paperid":null,"PeriodicalName":"2018 10th International Conference on Wireless Communications and Signal Processing (WCSP)","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/WCSP.2018.8555695","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 35

Abstract

In vehicular networks, Mobile Edge Computing (MEC) is applied to meet the offloading demand from vehicles. However, the mobility of vehicles may increase the offloading delay and even reduce the success rate of offloading, because vehicles may access another road side unit (RSU) before finishing offloading. Therefore, an offloading algorithm with low time complexity is required to make the offloading decision quickly. In this paper, we put forward an efficient offloading algorithm based on Support Vector Machine (SVMO) to satisfy the fast offloading demand in vehicular networks. The algorithm can segment a huge task into several sub-tasks through a weight allocation method according to available resources of MEC servers. Then each sub-task is decided whether it should be offloaded or executed locally based on SVMs. As the vehicle moves through several MEC servers, sub-tasks are allocated to them by order if they are offloaded. Each server ensures the sub-task can be processed and returned in time. Our proposed algorithm generate training data through Decision Tree. The simulation results show that the SVMO algorithm has a high decision accuracy, converges faster than other algorithms and has a small response time.
查看原文
分享 分享
微信好友 朋友圈 QQ好友 复制链接
本刊更多论文
基于支持向量机的车联网移动边缘计算高效卸载算法
在车载网络中,应用移动边缘计算(MEC)来满足车辆的卸载需求。然而,车辆的移动性可能会增加卸载延迟,甚至降低卸载成功率,因为车辆可能会在卸载完成之前进入另一个路旁单元(RSU)。因此,需要一种低时间复杂度的卸载算法来快速做出卸载决策。本文提出了一种基于支持向量机(SVMO)的高效卸载算法,以满足车载网络中的快速卸载需求。该算法可以根据MEC服务器的可用资源,通过权重分配方法将一个庞大的任务分割成若干个子任务。然后根据支持向量机决定每个子任务是卸载还是在本地执行。当车辆通过多个MEC服务器时,子任务将按顺序分配给它们,如果它们被卸载。每个服务器确保子任务能够被及时处理和返回。该算法通过决策树生成训练数据。仿真结果表明,该算法具有较高的决策精度,收敛速度快于其他算法,响应时间短。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
求助全文
约1分钟内获得全文 去求助
来源期刊
自引率
0.00%
发文量
0
期刊最新文献
Energy Depositing for Energy Harvesting Wireless Communications Experimental Demonstration of Acoustic Inversion Using an AUV Carrying Source Channel Tracking for Uniform Rectangular Arrays in mmWave Massive MIMO Systems Rate Matching and Piecewise Sequence Adaptation for Polar Codes with Reed-Solomon Kernels Utility Maximization for MISO Bursty Interference Channels
×
引用
GB/T 7714-2015
复制
MLA
复制
APA
复制
导出至
BibTeX EndNote RefMan NoteFirst NoteExpress
×
×
提示
您的信息不完整,为了账户安全,请先补充。
现在去补充
×
提示
您因"违规操作"
具体请查看互助需知
我知道了
×
提示
现在去查看 取消
×
提示
确定
0
微信
客服QQ
Book学术公众号 扫码关注我们
反馈
×
意见反馈
请填写您的意见或建议
请填写您的手机或邮箱
已复制链接
已复制链接
快去分享给好友吧!
我知道了
×
扫码分享
扫码分享
Book学术官方微信
Book学术文献互助
Book学术文献互助群
群 号:481959085
Book学术
文献互助 智能选刊 最新文献 互助须知 联系我们:info@booksci.cn
Book学术提供免费学术资源搜索服务,方便国内外学者检索中英文文献。致力于提供最便捷和优质的服务体验。
Copyright © 2023 Book学术 All rights reserved.
ghs 京公网安备 11010802042870号 京ICP备2023020795号-1