Skip to main content

Advances, Systems and Applications

Table 1 Notations

From: Adaptive offloading in mobile-edge computing for ultra-dense cellular networks based on genetic algorithm

Symbol Definition
S The set of edge services
B The set of BSs
U The set of all users
N The number of users the BS bj served
T The set of all computing tasks
\(r_{u_{i}, b_{j}}\) The transmission rate between user i and BS j
\(W_{b_{j}}\) The bandwidth of BS j
\(p_{u_{i}}\) The transmission power of user i
\(g_{u_{i}, b_{j}}\) The channel gain between user i and BS j
ω Background noise
\(F_{b_{j}}\) The CPU frequency of BS j
\(D_{t_{i}}\) The input data size of task i
\(C_{t_{i}}\) The required Cpu cycles of task i
\(m_{t_{i}, s_{j}}\) The offloading decision of task i
\(L_{t_{i}}^{l}\) The local processing latency of task ti
\(E_{t_{i}}^{l}\) The local processing energy consumption of task ti
\(\lambda _{b_{j}}\) Task arrival rate on BS j
\(\mu _{b_{j}}\) Service rate of BS j
\(\phantom {\dot {i}\!}L_{t_{i}}^{off, s_{j}}\) The transmission latency of task ti from user ui to service sj
\(\phantom {\dot {i}\!}L^{soj, s_{j}}\) The average processing delay on service sj
\(E_{t_{i}}^{o f f, s_{j}}\) The transmission energy consumption of task ti from user ui to service sj
Δ Time frame length
β Trade-off parameter between latency and energy consumption
\(H_{t_{i}}\) Overhead of task ti
\(pre_{u_{i}}^{b_{j}}\) The preference from user ui to BS bj
\(load_{b_{j}}\) The load of BS bj
CP The crossover probability of GA
MP The mutation probability of GA