FAIR RESOURCE ALLOCATION FOR SYSTEM THROUGHPUT MAXIMIZATION IN MOBILE EDGE COMPUTING
ABSTRACT:
Communication resource allocation is important for improving the performance of users in mobile edge computing (MEC) scenarios. In existing studies, the users in the MEC system typically suffer from the unfair resource allocation, which results in the inefficient resource utilization and degraded user performance. To address this challenge, in this paper, we propose a fair resource allocation approach to maximize the overall network throughput, under the constraint of each mobile user’s minimum transmission rate. We formulate the problem as a fair Nash bargaining resource allocation game, and the existence and uniqueness of the solution to this game model are analyzed. By adopting the time-sharing variable, we obtain the near optimal bargaining resource allocation strategy for the mixed integer nonlinear programming optimization. The user’s priority is further considered in the iterative implementation of the proposed algorithm by considering the time delay constraint of users. Simulation results show that the proposed scheme outperforms existing methods in terms of resource allocation fairness and overall system throughput. Index Terms—Mobile Edge Computing, resource allocation, fairness, system throughput maximization, minimum rate requirement.
EXISTING SYSTEM:
mobile edge computing (MEC) has been considered as a promising technology to support the next generation Internet, such as Tactile Internet, Internet of Things (IoT), and Internet of Me, by migrating the mobile computing, network control and storage to the network edges. Therefore, it is possible to run the highly demanding applications at the user equipments while meeting strict delay requirements. With the development of mobile network and mobile devices, the number of mobile internet users has shown explosive growth, which results in the spectrum scarcity for mobile users. The spectrum scarcity has raised the necessity of a fair spectrum allocation for mobile users. Without fair resource allocation, the minimum rate constraint of some users may not be satisfied, which leads to the degradation of the user performance. Spectrum resource allocation has received considerable attentions in MEC systems. quantitative study on adaptive resource allocation by designing a frequency reuse scheme to mitigate interference and maintain high spectral efficiency. In order to improve the performance in terms of higher system capacity, a resource allocation scheme with differentiated QoS provisioning for cell-edge active users. Proposed a greedy heuristic method to achieve the optimal resource allocation for users. developed a piecewise resource allocation algorithm to allocate the communication and computation resources jointly. However, most of these approaches are centralized allocation
schemes without considering the channel diversity a users. The individual profit of each user may result in the deployment difficulty of the centralized allocation in MEC. Game theory is thus introduced to address the individual characteristics of mobile users in the spectrum allocation problem proposed a game-based distributed algorithm to solve the resource allocation problem a multiple mobile devices with limited communication resource. Taking energy consumption and transmission delay into account, developed a distributed algorithm to achieve joint radio and communication resource allocation with the game equilibrium. proposed an enhance adaptive video delivery scheme with joint cache and radio resource allocation in order to provide the low-latency and high quality services for mobile device users.
PROPOSED SYSTEM:
We consider an uplink transmission scenario in mobile networks with the MEC. As shown in Fig. 1, there is one base station (BS) that works in OFDMA mode with wireless channel set K = f1; 2; :::;Kg. The set of mobile users within BS coverage area is denoted by N = f1; 2; :::;Ng. In this scenario, one subchannel can only be used by one user at a time. It is assumed that each user has a delay-sensitive computation task to be completed on the mobile device or on the mobile edge cloud server via computation offloading. The tasks include interactive gaming, high-definition image processing, face recognition, virtual reality, and so on [8], [12]. In general, each task to be processed can be described by a tuple as Ji = fdi; !ig; i 2 N, where di denotes the size
of computation input data, including the program codes and input parameters, and !i denotes the total number of CPU cycles required to accomplish this task. In this paper, it is assumed that the battery-powered mobile device has sufficient energy to support task offloading or local execution [12]. Then, we discuss the computation overhead of time cost for both local execution and offloading approaches
CONCLUSION:
In this paper, we investigate the overall network throughput maximization problem in MEC to meet the resource requirements of ever-increasing mobile devices. As a cooperative game theory, the Nash bargaining game is adopted to ensure the fairness of resource allocation. Furthermore, the existence and uniqueness of the Nash bargaining game based solution has been investigated. And an algorithm is developed to determine user priority by considering the users’ delay constraint. Evaluation results demonstrate that our scheme can improve the overall system rates considerably, and ensure the fairness a various users. In the future work, the coalition of MECs will be studied to improve the resources utilization further.
REFERENCES:
[1] Y. Mao, C. You, J. Zhang, K. Huang, and K. B. Letaief, “A survey on mobile edge computing: The communication perspective,” IEEE Communications Surveys Tutorials, vol. 19, no. 4, pp. 2322–2358, Fourthquarter 2017.
[2] P. Mach and Z. Becvar, “Mobile edge computing: A survey on architecture and computation offloading,” IEEE Communications Surveys Tutorials, vol. 19, no. 3, pp. 1628–1656, thirdquarter 2017.
[3] Z. Han, Z. Ji, and K. J. R. Liu, “Fair multiuser channel allocation for ofdma networks using nash bargaining solutions and coalitions,” IEEE Transactions on Communications, vol. 53, no. 8, pp. 1366–1376, Aug 2005.
[4] Y. Zhao, X. Fang, R. Huang, and Y. Fang, “Joint interference coordination and load balancing for ofdma multihop cellular networks,” IEEE Transactions on Mobile Computing, vol. 13, no. 1, pp. 89–101, Jan 2014.
[5] C. Singhal, S. Kumar, S. De, N. Panwar, R. Tonde, and P. De, “Classbased shared resource allocation for cell-edge users in ofdma networks,” IEEE Transactions on Mobile Computing, vol. 13, no. 1, pp. 48–60, Jan 2014.
[6] P. Zhao, H. Tian, C. Qin, and G. Nie, “Energy-saving offloading by jointly allocating radio and computational resources for mobile edge computing,” IEEE Access, vol. 5, pp. 11 255–11 268, June 2017.
[7] J. Ren, G. Yu, Y. Cai, and Y. He, “Latency optimization for resource allocation in mobile-edge computation offloading,” CoRR, vol. abs/ 1704.00163, 2017. [Online]. Available: http://arxiv.org/abs/1704.00163
[8] X. Chen, L. Jiao, W. Li, and X. Fu, “Efficient multi-user computation offloading for mobile-edge cloud computing,” IEEE/ACM Transactions on Networking, vol. 24, no. 5, pp. 2795–2808, Oct 2016.
[9] X. Ma, C. Lin, X. Xiang, and C. Chen, “Game-theoretic analysis of computation offloading for cloudlet-based mobile cloud computing,” in Proceedings of the 18th ACM International Conference on Modeling, Analysis and Simulation of Wireless and Mobile Systems, ser. MSWiM ’15. New York, NY, USA: ACM, 2015, pp. 271–278. [Online]. Available: http://doi.acm.org/10.1145/2811587.2811598
[10] X. Xu, J. Liu, and X. Tao, “Mobile edge computing enhanced adaptive bitrate video delivery with joint cache and radio resource allocation,” IEEE Access, vol. 5, pp. 16 406–16 415, Aug 2017.