Abstract
Mobile edge computing (MEC) casts the computation-intensive and delay-sensitive applications of mobiles on the network edges. Task offloading incurs extra communication latency and energy cost, and extensive efforts have been focused on the offloading scheme. To achieve satisfactory quality of experience, many metrics of the system utility are defined. However, most existing works overlook the balancing between the throughput and fairness. This paper investigates the problem of seeking optimal offloading scheme and the objective of the optimization is to maximize the system utility for leveraging between throughput and fairness. Based on KKT condition, we analyze the expectation of time complexity for deriving the optimal scheme. We provide an increment based greedy approximation algorithm with \(1 + \frac{1}{{e - 1}}\) ratio. Experimental results show that the proposed algorithm has better performance.
Sign-in/Register to access full text options 
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a callDisclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.
