移動Ad Hoc云環(huán)境中基于移動性預測的計算卸載算法研究
發(fā)布時間：2018-08-28 11:23
【摘要】：以智能手機和平板電腦為代表的移動設(shè)備的快速普及給人們的日常生活帶來了極大的便利。但是,由于受到CPU性能、電池容量、存儲容量等因素的限制,移動設(shè)備在處理計算密集型的任務(wù)時卻表現(xiàn)欠佳,比如運算速度緩慢、掉電迅速等。移動云計算技術(shù)的出現(xiàn)為該問題的解決提供了一個很好的思路：通過把移動客戶端上的計算密集型任務(wù)卸載到目標代理中去執(zhí)行不僅可以大大縮減任務(wù)的處理時間而且還可以最大限度的降低移動設(shè)備的能耗。 在移動Ad Hoc云環(huán)境下,移動客戶端節(jié)點和目標代理節(jié)點的位置都時刻處于動態(tài)變化的狀態(tài),受無線網(wǎng)絡(luò)有效覆蓋范圍的限制和節(jié)點移動性的影響,客戶端節(jié)點和代理節(jié)點之間的網(wǎng)絡(luò)連接也是間歇性的。因此,當把計算任務(wù)從移動客戶端節(jié)點卸載到代理節(jié)點中去執(zhí)行時就有可能會出現(xiàn)計算卸載失敗的問題。傳統(tǒng)的計算卸載算法雖然在靜態(tài)卸載環(huán)境下表現(xiàn)出色,但是在移動Ad Hoc云環(huán)境下卻難以克服計算卸載失敗所帶來的問題。 為了解決移動Ad Hoc云環(huán)境下計算卸載失敗的問題,本文在已有的靜態(tài)卸載算法MET、MCT、MinMin、MaxMin、Sufferage的基礎(chǔ)上提出了五個適用于動態(tài)卸載環(huán)境的新算法DynMETComm DynMCTComm、DynMinMinComm、DynMaxMinComm和DynSufferageComm。與傳統(tǒng)的靜態(tài)卸載算法相比,這些新算法不僅考慮了任務(wù)在卸載過程中的通信開銷而且增加了對任務(wù)卸載失敗后的處理,即當卸載到代理節(jié)點上的任務(wù)執(zhí)行失敗時,更新任務(wù)的到達時間為失敗時間點,從而參與后續(xù)的調(diào)度。為了最大限度的避免任務(wù)卸載失敗所產(chǎn)生的開銷,本文又提出了基于移動性預測的新算法DynPredict。該算法在預測到任務(wù)執(zhí)行失敗時,會從有能力執(zhí)行成功的代理節(jié)點中選擇一個次優(yōu)的代理重新進行卸載,從而保證任務(wù)順利執(zhí)行完成。仿真結(jié)果表明：帶預測的算法DynPredict在大多數(shù)性能指標上都能表現(xiàn)出最優(yōu)的性能,頁DynMETComm則表現(xiàn)最差；在線算法DynMCTComm則通常接近甚至超過其他三個比較復雜的批調(diào)度算法(包括DynMinMinComm、DynMaxMinComm和DynSufferageComm)的性能。 本文的研究成果可以很好地應用于移動Ad Hoc云環(huán)境下的計算卸載,也為下一步任務(wù)遷移方向的研究奠定了基礎(chǔ)。文中所采用的研究方法和思路對于移動云計算環(huán)境下的計算卸載的深入研究也具有一定的參考價值。
[Abstract]:The rapid popularization of mobile devices, represented by smart phones and tablets, brings great convenience to people's daily life. However, due to the limitations of CPU performance, battery capacity, storage capacity and other factors, mobile devices perform poorly in processing computationally intensive tasks, such as slow computing speed, rapid power loss, and so on. The emergence of mobile cloud computing technology provides a good way to solve this problem: by uninstalling computationally intensive tasks on mobile clients to target agents to perform tasks that can significantly reduce the processing time It can also minimize the energy consumption of mobile devices. In mobile Ad Hoc cloud environment, the location of mobile client node and target proxy node is always in a dynamic state, which is affected by the limit of effective coverage of wireless network and the mobility of nodes. The network connection between client node and proxy node is also intermittent. Therefore, when the computing task is unloaded from the mobile client node to the proxy node, the problem of computing uninstall failure may occur. Although the traditional computing unload algorithm performs well in static uninstall environment, it is difficult to overcome the problem of computing uninstall failure in mobile Ad Hoc cloud environment. In order to solve the problem of computing unload failure in mobile Ad Hoc cloud environment, this paper proposes five new algorithms, DynMETComm DynMCTComm,DynMinMinComm,DynMaxMinComm and DynSufferageComm., which are suitable for dynamic uninstall environment, based on the existing static uninstall algorithm MET,MCT,MinMin,MaxMin,Sufferage. Compared with the traditional static unload algorithm, these new algorithms not only consider the communication overhead of the task during the uninstall process, but also increase the processing of the task unload failure, that is, when the task unloaded to the proxy node fails to execute, The time of arrival of the update task is the point of failure, so as to participate in the subsequent scheduling. In order to avoid the overhead caused by unload failure, a new algorithm DynPredict. based on mobility prediction is proposed in this paper. When the task execution failure is predicted, the algorithm selects a sub-optimal agent from the agent node with the ability to execute successfully, so as to ensure the smooth completion of the task. The simulation results show that the DynPredict algorithm with prediction can show the best performance on most performance indexes, while the page DynMETComm shows the worst performance. DynMCTComm, an online algorithm, usually approaches or exceeds the performance of the other three more complex batch scheduling algorithms (including DynMinMinComm,DynMaxMinComm and DynSufferageComm). The research results in this paper can be applied to computing unload in mobile Ad Hoc cloud environment, and it also lays a foundation for further research on the direction of task migration. The research methods and ideas used in this paper also have a certain reference value for the further study of computing uninstall in mobile cloud computing environment.
【學位授予單位】：云南大學
【學位級別】：碩士
【學位授予年份】：2015
【分類號】：TN929.5
本文編號：2209251
[Abstract]:The rapid popularization of mobile devices, represented by smart phones and tablets, brings great convenience to people's daily life. However, due to the limitations of CPU performance, battery capacity, storage capacity and other factors, mobile devices perform poorly in processing computationally intensive tasks, such as slow computing speed, rapid power loss, and so on. The emergence of mobile cloud computing technology provides a good way to solve this problem: by uninstalling computationally intensive tasks on mobile clients to target agents to perform tasks that can significantly reduce the processing time It can also minimize the energy consumption of mobile devices. In mobile Ad Hoc cloud environment, the location of mobile client node and target proxy node is always in a dynamic state, which is affected by the limit of effective coverage of wireless network and the mobility of nodes. The network connection between client node and proxy node is also intermittent. Therefore, when the computing task is unloaded from the mobile client node to the proxy node, the problem of computing uninstall failure may occur. Although the traditional computing unload algorithm performs well in static uninstall environment, it is difficult to overcome the problem of computing uninstall failure in mobile Ad Hoc cloud environment. In order to solve the problem of computing unload failure in mobile Ad Hoc cloud environment, this paper proposes five new algorithms, DynMETComm DynMCTComm,DynMinMinComm,DynMaxMinComm and DynSufferageComm., which are suitable for dynamic uninstall environment, based on the existing static uninstall algorithm MET,MCT,MinMin,MaxMin,Sufferage. Compared with the traditional static unload algorithm, these new algorithms not only consider the communication overhead of the task during the uninstall process, but also increase the processing of the task unload failure, that is, when the task unloaded to the proxy node fails to execute, The time of arrival of the update task is the point of failure, so as to participate in the subsequent scheduling. In order to avoid the overhead caused by unload failure, a new algorithm DynPredict. based on mobility prediction is proposed in this paper. When the task execution failure is predicted, the algorithm selects a sub-optimal agent from the agent node with the ability to execute successfully, so as to ensure the smooth completion of the task. The simulation results show that the DynPredict algorithm with prediction can show the best performance on most performance indexes, while the page DynMETComm shows the worst performance. DynMCTComm, an online algorithm, usually approaches or exceeds the performance of the other three more complex batch scheduling algorithms (including DynMinMinComm,DynMaxMinComm and DynSufferageComm). The research results in this paper can be applied to computing unload in mobile Ad Hoc cloud environment, and it also lays a foundation for further research on the direction of task migration. The research methods and ideas used in this paper also have a certain reference value for the further study of computing uninstall in mobile cloud computing environment.
【學位授予單位】：云南大學
【學位級別】：碩士
【學位授予年份】：2015
【分類號】：TN929.5
【參考文獻】
相關(guān)期刊論文 前2條
1 朱雨虹;徐昌慶;;基于無線局域網(wǎng)的室內(nèi)覆蓋分布系統(tǒng)模型[J];計算機工程;2008年07期
2 陳嶺;許曉龍;楊清;陳根才;;基于三次樣條插值的無線信號強度衰減模型[J];浙江大學學報(工學版);2011年09期
，本文編號：2209251
本文鏈接：http://sikaile.net/kejilunwen/wltx/2209251.html
最近更新
教材專著
