Skip navigation

DSpace JSPUI

DSpace preserves and enables easy and open access to all types of digital content including text, images, moving images, mpegs and data sets

Learn More
DSpace logo
English
中文
  • Browse
    • Communities
      & Collections
    • Publication Year
    • Author
    • Title
    • Subject
    • Advisor
  • Search TDR
  • Rights Q&A
    • My Page
    • Receive email
      updates
    • Edit Profile
  1. NTU Theses and Dissertations Repository
  2. 管理學院
  3. 資訊管理學系
Please use this identifier to cite or link to this item: http://tdr.lib.ntu.edu.tw/jspui/handle/123456789/71520
Title: 車輛在高速公路之移動雲端運算系統中基於最佳化技術之卸載與資源分配策略
Optimization-based Offloading and Resource Allocation Strategies for Vehicles in Highway Mobile Cloud Computing Systems
Authors: Hsin-Yi Kuo
郭欣宜
Advisor: 林永松
Keyword: 行動雲端運算,車聯網,邊緣運算,移動性,允入控制,拉格蘭日鬆弛法,
Mobile Cloud Computing,Vehicular Networks,Edge Computing,Mobility,Call Admission Control,Lagrangian Relaxation Method,
Publication Year : 2019
Degree: 碩士
Abstract: 自動駕駛車輛是一種新興技術,它有許多不同類型任務 (task) 的需求,包括低延遲的運算任務和資源密集型的運算任務。由於車輛的計算能力和儲存容量有限,如何服務如此大量的任務已成為車用行動通訊網路中的嚴峻挑戰。因此,本研究將使用雲端運算系統來克服車輛自身資源有限的問題,並利用高速公路有固定路線的優點,得到關於車輛移動方向和速度更佳的預測結果。
本論文主要研究在高速公路上的雲端環境中使用資源配置策略和卸載策略來對於車輛上的任務提供更好的服務。我們將此問題設計成一個數學模型,目標為最大化雲端服務提供商的收益。並以拉格蘭日鬆弛法和次梯度法為基礎的演算法來解決此問題。我們也設計一系列的實驗以測試上述演算法的表現,實驗結果顯示此演算法在多種網路情境下均能有較佳及較穩定的可行解。
Self-driving vehicle is an emerging technology which request many different types of tasks, including low-latency computation tasks and resource intensive computation tasks. Due to the limited computational capabilities and storage capacity of vehicles, serving such a large number of tasks has become a serious challenge in the vehicular network. Therefore, this study will use mobile cloud computing systems to overcome the problem of the limited resources in vehicles. By taking the advantages of the fixed route of highway, the direction and the speed of vehicles can be more predictable.
In this thesis, we focus on using resource allocation strategy and offloading strategy better serve vehicle tasks in the cloud environment on the highway. We formulate the problem as a linear integer programming problem, in which the objective is to maximize the revenue of the cloud service provider. An algorithm based on the Lagrangian relaxation method and the subgradient method is used to solve this problem. A series of experiments are designed to test the performance of the algorithm. The experimental results show that the algorithm can have better and more stable feasible solutions under various network scenarios.
URI: http://tdr.lib.ntu.edu.tw/jspui/handle/123456789/71520
DOI: 10.6342/NTU201900312
Fulltext Rights: 有償授權
Appears in Collections:資訊管理學系

Files in This Item:
File SizeFormat 
ntu-108-1.pdf
  Restricted Access
1.44 MBAdobe PDF
Show full item record


Items in DSpace are protected by copyright, with all rights reserved, unless otherwise indicated.

社群連結
聯絡資訊
10617臺北市大安區羅斯福路四段1號
No.1 Sec.4, Roosevelt Rd., Taipei, Taiwan, R.O.C. 106
Tel: (02)33662353
Email: ntuetds@ntu.edu.tw
意見箱
相關連結
館藏目錄
國內圖書館整合查詢 MetaCat
臺大學術典藏 NTU Scholars
臺大圖書館數位典藏館
本站聲明
© NTU Library All Rights Reserved