scholarly journals Computing Unloading Strategy of Massive Internet of Things Devices Based on Game Theory in Mobile Edge Computing

2021 ◽  
Vol 2021 ◽  
pp. 1-12
Author(s):  
Xinhui Ding ◽  
Wenjuan Zhang

Due to the limited computing resources of the mobile edge computing (MEC) server, a massive Internet of things device computing unloading strategy using game theory in mobile edge computing is proposed. First of all, in order to make full use of the massive local Internet of things equipment resources, a new MEC system computing an unloading system model based on device-to-device (D2D) communication is designed and modeled, including communication model, task model, and computing model. Then, by using the utility function, the parameters are substituted into it, and the optimization problem with the goal of maximizing the number of CPU cycles and minimizing the energy consumption is constructed with the unloading strategy and power as constraints. Finally, the game theory is used to solve the problem of computing offload. Based on the proposed beneficial task offload theory, combined with the mobile user device computing offload task amount, transmission rate, idle device performance, and other factors, the computing offload scheme suitable for their own situation is selected. The simulation results show that the proposed scheme has better convergence characteristics, and, compared with other schemes, the proposed scheme significantly improves the amount of data transmission and reduces the energy consumption of the task.

Sensors ◽  
2021 ◽  
Vol 21 (14) ◽  
pp. 4798
Author(s):  
Fangni Chen ◽  
Anding Wang ◽  
Yu Zhang ◽  
Zhengwei Ni ◽  
Jingyu Hua

With the increasing deployment of IoT devices and applications, a large number of devices that can sense and monitor the environment in IoT network are needed. This trend also brings great challenges, such as data explosion and energy insufficiency. This paper proposes a system that integrates mobile edge computing (MEC) technology and simultaneous wireless information and power transfer (SWIPT) technology to improve the service supply capability of WSN-assisted IoT applications. A novel optimization problem is formulated to minimize the total system energy consumption under the constraints of data transmission rate and transmitting power requirements by jointly considering power allocation, CPU frequency, offloading weight factor and energy harvest weight factor. Since the problem is non-convex, we propose a novel alternate group iteration optimization (AGIO) algorithm, which decomposes the original problem into three subproblems, and alternately optimizes each subproblem using the group interior point iterative algorithm. Numerical simulations validate that the energy consumption of our proposed design is much lower than the two benchmark algorithms. The relationship between system variables and energy consumption of the system is also discussed.


2021 ◽  
Vol 2021 ◽  
pp. 1-18
Author(s):  
Chuanxiu Chi ◽  
Yingjie Wang ◽  
Yingshu Li ◽  
Xiangrong Tong

With the advent of the Internet of Things (IoT) era, various application requirements have put forward higher requirements for data transmission bandwidth and real-time data processing. Mobile edge computing (MEC) can greatly alleviate the pressure on network bandwidth and improve the response speed by effectively using the device resources of mobile edge. Research on mobile crowdsourcing in edge computing has become a hot spot. Hence, we studied resource utilization issues between edge mobile devices, namely, crowdsourcing scenarios in mobile edge computing. We aimed to design an incentive mechanism to ensure the long-term participation of users and high quality of tasks. This paper designs a long-term incentive mechanism based on game theory. The long-term incentive mechanism is to encourage participants to provide long-term and continuous quality data for mobile crowdsourcing systems. The multistrategy repeated game-based incentive mechanism (MSRG incentive mechanism) is proposed to guide participants to provide long-term participation and high-quality data. The proposed mechanism regards the interaction between the worker and the requester as a repeated game and obtains a long-term incentive based on the historical information and discount factor. In addition, the evolutionary game theory and the Wright-Fisher model in biology are used to analyze the evolution of participants’ strategies. The optimal discount factor is found within the range of discount factors based on repeated games. Finally, simulation experiments verify the existing crowdsourcing dilemma and the effectiveness of the incentive mechanism. The results show that the proposed MSRG incentive mechanism has a long-term incentive effect for participants in mobile crowdsourcing systems.


2019 ◽  
Vol 6 (3) ◽  
pp. 4791-4803 ◽  
Author(s):  
Laizhong Cui ◽  
Chong Xu ◽  
Shu Yang ◽  
Joshua Zhexue Huang ◽  
Jianqiang Li ◽  
...  

2021 ◽  
Vol 17 (6) ◽  
pp. 155014772110230
Author(s):  
Aamir Abbas ◽  
Ali Raza ◽  
Farhan Aadil ◽  
Muazzam Maqsood

With the recent advancements in communication technologies, the realization of computation-intensive applications like virtual/augmented reality, face recognition, and real-time video processing becomes possible at mobile devices. These applications require intensive computations for real-time decision-making and better user experience. However, mobile devices and Internet of things have limited energy and computational power. Executing such computationally intensive tasks on edge devices either leads to high computation latency or high energy consumption. Recently, mobile edge computing has been evolved and used for offloading these complex tasks. In mobile edge computing, Internet of things devices send their tasks to edge servers, which in turn perform fast computation. However, many Internet of things devices and edge server put an upper limit on concurrent task execution. Moreover, executing a very small size task (1 KB) over an edge server causes increased energy consumption due to communication. Therefore, it is required to have an optimal selection for tasks offloading such that the response time and energy consumption will become minimum. In this article, we proposed an optimal selection of offloading tasks using well-known metaheuristics, ant colony optimization algorithm, whale optimization algorithm, and Grey wolf optimization algorithm using variant design of these algorithms according to our problem through mathematical modeling. Executing multiple tasks at the server tends to provide high response time that leads to overloading and put additional latency at task computation. We also graphically represent the tradeoff between energy and delay that, how both parameters are inversely proportional to each other, using values from simulation. Results show that Grey wolf optimization outperforms the others in terms of optimizing energy consumption and execution latency while selected optimal set of offloading tasks.


Author(s):  
Zhuofan Liao ◽  
Jingsheng Peng ◽  
Bing Xiong ◽  
Jiawei Huang

AbstractWith the combination of Mobile Edge Computing (MEC) and the next generation cellular networks, computation requests from end devices can be offloaded promptly and accurately by edge servers equipped on Base Stations (BSs). However, due to the densified heterogeneous deployment of BSs, the end device may be covered by more than one BS, which brings new challenges for offloading decision, that is whether and where to offload computing tasks for low latency and energy cost. This paper formulates a multi-user-to-multi-servers (MUMS) edge computing problem in ultra-dense cellular networks. The MUMS problem is divided and conquered by two phases, which are server selection and offloading decision. For the server selection phases, mobile users are grouped to one BS considering both physical distance and workload. After the grouping, the original problem is divided into parallel multi-user-to-one-server offloading decision subproblems. To get fast and near-optimal solutions for these subproblems, a distributed offloading strategy based on a binary-coded genetic algorithm is designed to get an adaptive offloading decision. Convergence analysis of the genetic algorithm is given and extensive simulations show that the proposed strategy significantly reduces the average latency and energy consumption of mobile devices. Compared with the state-of-the-art offloading researches, our strategy reduces the average delay by 56% and total energy consumption by 14% in the ultra-dense cellular networks.


Electronics ◽  
2021 ◽  
Vol 10 (2) ◽  
pp. 190
Author(s):  
Wu Ouyang ◽  
Zhigang Chen ◽  
Jia Wu ◽  
Genghua Yu ◽  
Heng Zhang

As transportation becomes more convenient and efficient, users move faster and faster. When a user leaves the service range of the original edge server, the original edge server needs to migrate the tasks offloaded by the user to other edge servers. An effective task migration strategy needs to fully consider the location of users, the load status of edge servers, and energy consumption, which make designing an effective task migration strategy a challenge. In this paper, we innovatively proposed a mobile edge computing (MEC) system architecture consisting of multiple smart mobile devices (SMDs), multiple unmanned aerial vehicle (UAV), and a base station (BS). Moreover, we establish the model of the Markov decision process with unknown rewards (MDPUR) based on the traditional Markov decision process (MDP), which comprehensively considers the three aspects of the migration distance, the residual energy status of the UAVs, and the load status of the UAVs. Based on the MDPUR model, we propose a advantage-based value iteration (ABVI) algorithm to obtain the effective task migration strategy, which can help the UAV group to achieve load balancing and reduce the total energy consumption of the UAV group under the premise of ensuring user service quality. Finally, the results of simulation experiments show that the ABVI algorithm is effective. In particular, the ABVI algorithm has better performance than the traditional value iterative algorithm. And in a dynamic environment, the ABVI algorithm is also very robust.


Sign in / Sign up

Export Citation Format

Share Document