Figure 1.
Figure 2.
Figure 3.
A computational offloading algorithm based on MHQEA
| begin |
| The current iteration number t = 0, and the maximum |
| Initialize the offload decision matrix An(t) |
| Find the optimal solution matrix Pn(t) by observing the state of |
| Correction of Pn(t) by reparation subroutine |
| Evaluate the total energy consumption of the system and find the |
| while(t<M)do |
| begin |
| Number of current iterations t plus 1 |
| An(t-1) is observed by the make subalgorithm to determine the |
| Evaluate Pn(t) for the minimum total system energy consumption |
| Updating An(t) through the update subroutine |
| Find the optimal solution in Pn(t) and B(t-1) to b |
| if(Current number of iterations meets migration conditions)then Migration b to B(t) |
| end if |
| end |
| end |