Change search
CiteExportLink to record
Permanent link

Direct link
Cite
Citation style
  • apa
  • harvard1
  • ieee
  • modern-language-association-8th-edition
  • vancouver
  • Other style
More styles
Language
  • de-DE
  • en-GB
  • en-US
  • fi-FI
  • nn-NO
  • nn-NB
  • sv-SE
  • Other locale
More languages
Output format
  • html
  • text
  • asciidoc
  • rtf
A Game Theoretic Analysis of Selfish Mobile Computation Offloading
KTH, School of Electrical Engineering and Computer Science (EECS), Network and Systems engineering.
KTH, School of Electrical Engineering and Computer Science (EECS), Network and Systems engineering.ORCID iD: 0000-0002-4876-0223
2017 (English)In: IEEE INFOCOM 2017 - IEEE CONFERENCE ON COMPUTER COMMUNICATIONS, IEEE , 2017Conference paper, Published paper (Refereed)
Abstract [en]

Offloading computation to a mobile cloud is a promising approach for enabling the use of computationally intensive applications by mobile devices. In this paper we consider autonomous devices that maximize their own performance by choosing one of many wireless access points for computation offloading. We develop a game theoretic model of the problem, prove the existence of pure strategy Nash equilibria, and provide a polynomial time algorithm for computing an equilibrium. For the case when the cloud computing resources scale with the number of mobile devices we show that all improvement paths are finite. We provide a bound on the price of anarchy of the game, thus our algorithm serves as an approximation algorithm for the global computation offloading cost minimization problem. We use extensive simulations to provide insight into the performance and the convergence time of the algorithms in various scenarios. Our results show that the equilibrium cost may be close to optimal, and the convergence time is almost linear in the number of mobile devices.

Place, publisher, year, edition, pages
IEEE , 2017.
Series
IEEE INFOCOM, ISSN 0743-166X
National Category
Electrical Engineering, Electronic Engineering, Information Engineering
Identifiers
URN: urn:nbn:se:kth:diva-224086DOI: 10.1109/INFOCOM.2017.8057148ISI: 000425232200205Scopus ID: 2-s2.0-85034110902ISBN: 978-1-5090-5336-0 OAI: oai:DiVA.org:kth-224086DiVA, id: diva2:1190381
Conference
IEEE Conference on Computer Communications (INFOCOM), MAY 01-04, 2017, Atlanta, GA
Note

QC 20180314

Available from: 2018-03-14 Created: 2018-03-14 Last updated: 2018-05-17Bibliographically approved
In thesis
1. Decentralized Algorithms for Resource Allocation in Mobile Cloud Computing Systems
Open this publication in new window or tab >>Decentralized Algorithms for Resource Allocation in Mobile Cloud Computing Systems
2018 (English)Licentiate thesis, comprehensive summary (Other academic)
Abstract [en]

The rapid increase in the number of mobile devices has been followed by an increase in the capabilities of mobile devices, such as the computational power, memory and battery capacity. Yet, the computational resources of individual mobile devices are still insufficient for various delay sensitive and computationally intensive applications. These emerging applications could be supported by mobile cloud computing, which allows using external computational resources. Mobile cloud computing does not only improve the users’ perceived performance of mobile applications, but it also may reduce the energy consumption of mobile devices, and thus it may extend their battery life. However, the overall performance of mobile cloud computing systems is determined by the efficiency of allocating communication and computational resources. The work in this thesis proposes decentralized algorithms for allocating these two resources in mobile cloud computing systems. In the first part of the thesis, we consider the resource allocation problem in a mobile cloud computing system that allows mobile users to use cloud computational resources and the resources of each other. We consider that each mobile device aims at minimizing its perceived response time, and we develop a game theoretical model of the problem. Based on the game theoretical model, we propose an efficient decentralized algorithm that relies on average system parameters, and we show that the proposed algorithm could be a promising solution for coordinating multiple mobile devices. In the second part of the thesis, we consider the resource allocation problem in a mobile cloud computing system that consists of multiple wireless links and a cloud server. We model the problem as a strategic game, in which each mobile device aims at minimizing a combination of its response time and energy consumption for performing the computation. We prove the existence of equilibrium allocations of mobile cloud resources, and we use game theoretical tools for designing polynomial time decentralized algorithms with a bounded approximation ratio. We then consider the problem of allocating communication and computational resources over time slots, and we show that equilibrium allocations still exist. Furthermore, we analyze the structure of equilibrium allocations, and we show that the proposed decentralized algorithm for computing equilibria achieves good system performance. By providing constructive equilibrium existence proofs, the results in this thesis provide low complexity decentralized algorithms for allocating mobile cloud resources for various mobile cloud computing architectures.

Place, publisher, year, edition, pages
KTH Royal Institute of Technology, 2018. p. 33
Series
TRITA-EECS-AVL ; 2018:34
National Category
Electrical Engineering, Electronic Engineering, Information Engineering
Research subject
Electrical Engineering
Identifiers
urn:nbn:se:kth:diva-228084 (URN)978-91-7729-751-2 (ISBN)
Presentation
2018-05-31, Q2, Osquldasväg 6, Stockholm, 10:00 (English)
Opponent
Supervisors
Note

QC 20180518

Available from: 2018-05-18 Created: 2018-05-17 Last updated: 2018-05-18Bibliographically approved

Open Access in DiVA

No full text in DiVA

Other links

Publisher's full textScopus

Authority records BETA

Josilo, SladanaDán, György

Search in DiVA

By author/editor
Josilo, SladanaDán, György
By organisation
Network and Systems engineering
Electrical Engineering, Electronic Engineering, Information Engineering

Search outside of DiVA

GoogleGoogle Scholar

doi
isbn
urn-nbn

Altmetric score

doi
isbn
urn-nbn
Total: 24 hits
CiteExportLink to record
Permanent link

Direct link
Cite
Citation style
  • apa
  • harvard1
  • ieee
  • modern-language-association-8th-edition
  • vancouver
  • Other style
More styles
Language
  • de-DE
  • en-GB
  • en-US
  • fi-FI
  • nn-NO
  • nn-NB
  • sv-SE
  • Other locale
More languages
Output format
  • html
  • text
  • asciidoc
  • rtf