.png){kind=icon}
.png){kind=icon}
Return
Cheating-Resilient Bandwidth Distribution in Mobile Cloud Computing
.png){kind=icon}
PRE
AI
DOI：10.1109/TCC.2016.2638909.png)
.png){kind=icon}
Original request for help.png){kind=icon}
Share.png){kind=icon}
Save
Abstract
En 中文
In mobile cloud computing (MCC), optimal utilization of resources (e.g., bandwidth), while maintaining the required level of quality-of-services (QoS), is essential. A user participating in the resource allocation process can provide untruthful information for acquiring undue advantages with respect to the allocated resource amount, and the cost incurred. In this paper, we identify, formulate, and address the problem of such misbehaviour. We formulate the bandwidth distribution as a constrained convex utility maximization problem, and solve it using the proposed cheating-resilient bandwidth distribution (CRAB) scheme. Numerical analysis shows that, in CRAB, the misbehaving user is impelled to behave normally as the misbehaviour increases its own cost while the other users including the cloud service provider (CSP) get benefit in terms of revenue. We investigate the existence of Nash Equilibrium (NE) of the proposed scheme. Both the problem and the solution are extensively analysed theoretically. The maximum and minimum selling prices of bandwidth, and the optimal solution for individual user are computed using the method of Lagrange multiplier.
Keywords:
MCC
user misbehaviour
bandwidth distribution
auction theory
utility maximization
AI Summary
Key information extracted from the uploaded paper, including a brief overview, abstract, background, key highlights, visual analysis, and future outlook.
Journal
I
IF:
5
Papers:
1.8K
Citations:
4.3K