DocumentCode
1884085
Title
Performance optimization for cyber foraging network via dynamic spectrum allocation
Author
Cao, Yang ; Yang, Shiyong ; Jiang, Tao ; Qu, Daiming
Author_Institution
Dept. of Electron. & Inf. Eng., Huazhong Univ. of Sci. & Technol., Wuhan, China
fYear
2011
fDate
10-15 April 2011
Firstpage
648
Lastpage
653
Abstract
Recently, cyber foraging has been proposed to reduce the application response time and to save energy for the mobile hosts by offloading the resource-demanding tasks to the surrogates via wireless networks. However, communication overheads are further aggravated in the cyber foraging network (CFN), where multi-hosts share the same spectrum to offload tasks. Therefore, it is important for the CFN to properly allocate the spectrum to multi-hosts to improve the network performance. In this paper, we deeply discuss the challenging issue of the dynamic spectrum allocation for the infrastructure-based CFN, and aim to minimize the total completion time of the multiple remote tasks offloaded by mobile hosts with the constraints that the task completion time of each remote task is less than a preset threshold. Firstly, a system-level workflow is proposed to handle the requests of offloading tasks for mobile hosts. Then, we formulate the optimization problem of the dynamic spectrum allocation for the infrastructure-based CFN. We propose an algorithm to test the feasibility of satisfying the task completion time constraint for each remote task simultaneously. Moreover, we derive an optimal solution of the dynamic spectrum allocation. Conducted simulation results show the validity of the proposed dynamic spectrum allocation algorithm.
Keywords
mobile radio; radio networks; ubiquitous computing; application response time; communication overheads; cyber foraging network; dynamic spectrum allocation; dynamic spectrum allocation algorithm; infrastructure based CFN; mobile hosts; multi hosts share; multiple remote tasks; performance optimization; resource demanding tasks; system level workflow; task completion time constraint; total completion time; wireless networks; Data communication; Downlink; Dynamic scheduling; Heuristic algorithms; Indexes; Resource management; Wireless communication;
fLanguage
English
Publisher
ieee
Conference_Titel
Computer Communications Workshops (INFOCOM WKSHPS), 2011 IEEE Conference on
Conference_Location
Shanghai
Print_ISBN
978-1-4577-0249-5
Electronic_ISBN
978-1-4577-0248-8
Type
conf
DOI
10.1109/INFCOMW.2011.5928893
Filename
5928893
Link To Document