Constraints Based Heuristic Approach for Task Offloading In Mobile Cloud Computing

R. Kumari, S. Kaushal
{"title":"Constraints Based Heuristic Approach for Task Offloading In Mobile Cloud Computing","authors":"R. Kumari, S. Kaushal","doi":"10.17762/ITII.V8I1.74","DOIUrl":null,"url":null,"abstract":"Mobile devices are supporting a wide range of applications irrespective of their configuration. There is a need to make the mobile applications executable on mobile devices without concern of battery life. For optimizing mobile applications computational offloading is highly preferred. It helps to overcome the severity of scarce resources constraint mobile devices. In offloading, which part of the application to be offloaded, on which processor and what is available bandwidth rate are the main crucial issues. As subtasks of mobile applications are interdependent, efficient execution of application requires research of favorable wireless network conditions before to take the offloading decision. Broadly in mobile cloud computing the applications is either delay sensitive or delay tolerant. For delay sensitive applications completion time has the highest priority whereas for delay tolerant type of applications depending on the network conditions decision of offloading can be taken. Sometimes, computation time on a cloud server is less but it consumes high communication time which ultimately gives inefficient offloading results. To address this issue, we have proposed a heuristic based level wise task offloading (HTLO). It includes computation time, communication time and maximum energy available on the mobile device to take the decision of offloading. For simulation study, a mobile application is considered as a directed graph and all the tasks are executed on the basis of their levels. The overall results of the proposed heuristic approach are compared with state-of-the-art K-M LARAC algorithm and results show the improvement in execution time, communication time, mobile device energy consumption and total energy consumption.","PeriodicalId":40759,"journal":{"name":"Information Technology in Industry","volume":null,"pages":null},"PeriodicalIF":0.0000,"publicationDate":"2020-04-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"0","resultStr":null,"platform":"Semanticscholar","paperid":null,"PeriodicalName":"Information Technology in Industry","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.17762/ITII.V8I1.74","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 0

Abstract

Mobile devices are supporting a wide range of applications irrespective of their configuration. There is a need to make the mobile applications executable on mobile devices without concern of battery life. For optimizing mobile applications computational offloading is highly preferred. It helps to overcome the severity of scarce resources constraint mobile devices. In offloading, which part of the application to be offloaded, on which processor and what is available bandwidth rate are the main crucial issues. As subtasks of mobile applications are interdependent, efficient execution of application requires research of favorable wireless network conditions before to take the offloading decision. Broadly in mobile cloud computing the applications is either delay sensitive or delay tolerant. For delay sensitive applications completion time has the highest priority whereas for delay tolerant type of applications depending on the network conditions decision of offloading can be taken. Sometimes, computation time on a cloud server is less but it consumes high communication time which ultimately gives inefficient offloading results. To address this issue, we have proposed a heuristic based level wise task offloading (HTLO). It includes computation time, communication time and maximum energy available on the mobile device to take the decision of offloading. For simulation study, a mobile application is considered as a directed graph and all the tasks are executed on the basis of their levels. The overall results of the proposed heuristic approach are compared with state-of-the-art K-M LARAC algorithm and results show the improvement in execution time, communication time, mobile device energy consumption and total energy consumption.
移动云计算中基于约束的启发式任务卸载方法
移动设备支持各种各样的应用程序,而不考虑它们的配置。有必要使移动应用程序在移动设备上可执行而不考虑电池寿命。对于优化移动应用程序,计算卸载是非常可取的。它有助于克服移动设备资源稀缺的严重限制。在卸载过程中,应用程序的哪个部分要卸载,在哪个处理器上卸载,以及可用带宽速率是什么是关键问题。由于移动应用的子任务是相互依赖的,要想高效地执行应用,就需要研究有利的无线网络条件,然后再做出卸载决策。在移动云计算中,应用程序要么是延迟敏感的,要么是延迟容忍的。对于延迟敏感型应用程序,完成时间具有最高的优先级,而对于延迟容忍型应用程序,可根据网络条件决定卸载。有时,云服务器上的计算时间较少,但它消耗的通信时间较高,最终导致卸载效果不佳。为了解决这个问题,我们提出了一种基于启发式的分层任务卸载(HTLO)。它包括计算时间、通信时间和移动设备上可用的最大能量来做出卸载的决定。在模拟研究中,将移动应用程序视为一个有向图,所有的任务都在其级别的基础上执行。将该方法与K-M LARAC算法进行了比较,结果表明,该方法在执行时间、通信时间、移动设备能耗和总能耗方面都有所改善。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
求助全文
约1分钟内获得全文 求助全文
来源期刊
Information Technology in Industry
Information Technology in Industry COMPUTER SCIENCE, SOFTWARE ENGINEERING-
自引率
0.00%
发文量
0
×
引用
GB/T 7714-2015
复制
MLA
复制
APA
复制
导出至
BibTeX EndNote RefMan NoteFirst NoteExpress
×
提示
您的信息不完整,为了账户安全,请先补充。
现在去补充
×
提示
您因"违规操作"
具体请查看互助需知
我知道了
×
提示
确定
请完成安全验证×
copy
已复制链接
快去分享给好友吧!
我知道了
右上角分享
点击右上角分享
0
联系我们:info@booksci.cn Book学术提供免费学术资源搜索服务,方便国内外学者检索中英文文献。致力于提供最便捷和优质的服务体验。 Copyright © 2023 布克学术 All rights reserved.
京ICP备2023020795号-1
ghs 京公网安备 11010802042870号
Book学术文献互助
Book学术文献互助群
群 号:481959085
Book学术官方微信