{'fraction_non_alphanumeric': 0.023977433004231313, 'fraction_numerical': 0.0028208744710860366, 'mean_word_length': 5.334821428571429, 'pattern_counts': {'":': 0, '<': 0, '<?xml version=': 0, '>': 0, 'https://': 0, 'lorem ipsum': 0, 'www.': 0, 'xml': 0}, 'pii_count': 0, 'substrings_counts': 0, 'word_list_counts': {'cursed_substrings.json': 0, 'profanity_word_list.json': 0, 'sexual_word_list.json': 0, 'zh_pornsignals.json': 0}}
Joint Optimal Pricing and Task Scheduling in Mobile Cloud Computing Systems

The evolving mobile cloud computing (MCC) paradigm enables mobile users to offload their computing tasks to cloud servers. In this paper, we study the following problems in MCC systems: 1) which tasks should be offloaded to cloud servers? 2) and what is the optimal price of cloud services? We jointly address these issues by formulating two levels of optimization problems. On the mobile users side, we formulate a utility maximization problem that takes the energy consumption, delay, and price of cloud services into account and obtain the optimal scheduling for both delay-sensitive and delay-tolerant applications. On the cloud service provider (CSP) side, we determine the optimal pricing strategy by formulating a profit maximization problem, which is non-convex in general. We further propose an algorithm using convexification and primal-dual methods to mitigate the non-convexity. Through numerical studies, we investigate the mobile users’ behavior and the CSP’s pricing strategy. Our results reveal that the proposed scheduler effectively balances the tradeoff between the energy consumption and delay in comparison with different schedulers proposed in the literature. Furthermore, we show that with the proposed pricing algorithm, the CSP can improve its profit by up to 25% compared with static and dynamic pricing strategies.