
Toward Energy-Efficient Task Execution in Mobile Cloud Computing 75
Under the block-fading channel, the problem of minimum energy
consumption within time delay can be transformed into a determinis-
tic constrained shortest path problem. Specifically, all the costs of data
transmission are deterministic, including the completion time and the
energy consumption of each task, that is, d
s
(k)=α
k
/R, d
r
(k)=β
k
/R,
and e
s
(k)=(α
k
/R)p
s
, e
r
(k)=(β
k
/R)p
r
. In this case, one can enumerate
all the paths and choose the one that results in the minimal energy
consumption while satisfying the time delay constraint. However, this
brute-force search will lead to the complexity ...