2021 IEEE 6th International Conference on Intelligent Computing and Signal Processing (ICSP 2021)
Optimizing Energy consumption and Latency based
on computation offloading and cell association in
2021 6th International Conference on Intelligent Computing and Signal Processing (ICSP) | 978-1-6654-0413-6/20/$31.00 ©2021 IEEE | DOI: 10.1109/ICSP51882.2021.9408693
MEC enabled Industrial IoT environment
Ahsan Rafiq
Department of Computer Sciences
Chongqing University of Posts and Telecommunications
Chongqing, China
asn_rafiq@hotmail.com
Wei Min*
Department of Automation
Chongqing University of Posts and Telecommunications
Chongqing, China
weimin@cqupt.edu.cn
Nteziriza Nkerabahizi Josbert
Department of Computer Sciences
Chongqing University of Posts and Telecommunications
Chongqing, China
josbertnn@gmail.com
Abstract— Mobile edge computing emerges as a promising
technology for the industrial internet of things (IIoT). It provides
more opportunities and efficient computing resources for end-
users when edge nodes are deployed at the nearest IoT devices
(IDs). However, IDs have limited computing capability and battery
life in the IIoT environment due to their high computational tasks.
The IDs can offload the computational tasks to edge nodes to
achieve low latency and energy consumption. Our proposed work
examines the cell association and computational offloading
problem in the MEC-enabled IIoT environment. This problem is
formulated as a cost execution problem (total sum of energy
consumption and latency). Three different computing modes (full-
local, full-MEC, and partial) are used for task execution, where the
end-user can choose one of them. To achieve the optimal solution
Khun-Munkres algorithm and extensive search method are
deployed. Experimental results demonstrate the better
performance of the proposed method in latency and energy
consumption.
Keywords—Edge computing, Industrial IoT, Computational
offloading, Energy consumption, latency
I. INTRODUCTION
Industry 4.0 and the industrial internet of things (IIoT) are
significant terms used in current industries [1]. The fast growth
of Industrial automation is a significant objective of Industry,
and it has been realized with the assistance of IoT devices,
sensors, and actuators. Radio frequency identification and
wireless sensor network technologies have been widely used in
Industry 4.0 [2], these technologies are generally
computationally intensive, delicate energy consumption, and
execution of latency. Therefore, they pose challenges to the
computational and processing capabilities of end-users. To
978-1-6654-0413-6/21/$31.00 ©2021 IEEE
10
Authorized licensed use limited to: University of Ottawa. Downloaded on January 16,2024 at 20:11:44 UTC from IEEE Xplore. Restrictions apply.
Wang Ping
Department of Automation
Chongqing University of Posts and Telecommunications
Chongqing, China
wangping@cqupt.edu.cn
Seung Ho Hong
Department of Electronics and System Engineering
Hanyang University Ansan
426791 Ansan, Seoul, South Korea
shhong@hanyang.ac.kr
overcome these challenges, researchers have developed a new
technology known as mobile edge computing (MEC), which
enables the provisioning of cloud resources within radio access
networks in the vicinity to end-users [3-4]. The concept of edge
computing is explored in industries to improve latency and
energy efficiency of future applications [5]-[7]. By deploying
edge nodes ( 𝐸𝑁𝑠 ) in the industrial environment, end-users
offload computational tasks to the 𝐸𝑁𝑠 and perform task
execution [8]. With the advanced performance of edge
computing, computational offloading to the 𝐸𝑁𝑠 may enhance
the task execution performance, especially energy consumption
and latency of the end-users [9, 10].
To support various services of the IoT devices (𝐼𝐷𝑠) and
transmission performance to the end-users in industrial IoT,
homogeneous industrial network architecture has transformed
into heterogenous industrial networks. Hence, this network
enables the integration of numerous 𝐸𝑁𝑠, such as macro 𝐸𝑁𝑠,
and small 𝐸𝑁𝑠 . Since several 𝐸𝑁𝑠 can be installed in an
industrial environment densely, the possibility of existing 𝐼𝐷𝑠 in
an overlapped zone is high. In this situation, 𝐼𝐷𝑠 are capable of
accessing various 𝐸𝑁𝑠, resulting across multiple transmission
performances, due to the heterogeneity of the 𝐸𝑁𝑠, especially in
terms of channel characteristics and available resources in the
network. Therefore, the development of an ideal cell association
scheme is necessary since it can significantly affect the overall
performance of the network and the users' quality of service
(QoS) [11].
The challenge of computational offloading has been
investigated in previous studies by considering binary offloading
scheme such as executing the task locally at 𝐼𝐷 or remotely at
the 𝐸𝑁’s server. In [12], the authors studied the problem of
computational offloading in order to improve scalability, latency,
and energy efficiency in 6TiSCH-based smart industries for
practical scenarios using rough set-based root selection (R2S)
algorithm for network layer energy, Q-learning algorithm for
offloading to manage the energy consumption among fog/edge
nodes. A game theory concept was studied in [13] for distributed
computational offloading strategies in various 𝐼𝐷𝑠 , and the
model achieves the Nash equilibrium point of the formulated
game model.
System transmission time allocation and joint optimal
computation mode selection strategy for multiple users in
wireless MEC networks were proposed to optimize the weighted
sum function of computational rate [14]. Additionally, the partial
computational offloading mode can be adopted for enhancing
the 𝐼𝐷𝑠 task execution. A partial offloading strategy was Figure 1: MEC enabled Industrial IoT Network
proposed to execute the tasks locally and remotely in a parallel
way aiming to optimize the latency [15]. Each 𝐼𝐷 has to perform a task. that can be described by
three parameters < 𝑄 , 𝐾 , 𝐿 >, where input data size is 𝑄
Cell association challenge in industrial networks has been
and 𝐾 is the CPU cycle required to execute the task, 𝐼𝐷 and
investigated in these scenarios, and a distributed heuristics
algorithm was proposed to improve the probability of universal 𝐿 represents the maximum latency.
outage and the total function of long-term rate parallelly [16]. A B. Computational Modes
cell association and activation model were considered to
Each 𝐼𝐷 uses full-local, full 𝑀𝐸𝐶 or partial computational
enhance the energy efficiency in the network with respect of 𝐼𝐷𝑠
mode to execute its task.
long-term rate constraints [17].
1) Full-Local Computational Mode: Each 𝐼𝐷 performs its
In this work, we tackle the challenges posed by cell offloading task in local mode. Where local computational
association and computational offloading of multiple 𝐼𝐷𝑠 in power 𝑓 of 𝐼𝐷 vs. 𝐶𝑃𝑈 cycles per second, and the system
edge-based industrial networks. We formulate the computational cost 𝐿 required to complete 𝐼𝐷 's task in full local
offloading and cell association problem to minimize task computational mode. 𝐿 can be expressed as follows:
execution's sensitivity to energy consumption and latency. As
this is a nonlinear integer optimization problem, so it is not easy
to resolve to apply conventional optimization techniques. The 𝐿 = (1)
problem is divided into computational offloading and cell The energy consumption of 𝐼𝐷 due to task execution can be
association sub-problem, and two different (Khun-Munkers, and expressed as follows:
Extensive search) methods are utilized to achieve optimization 𝐸 = 𝜆 𝐾 (𝑓 ) (2)
solution. where 𝜆 is the energy consumption coefficient of 𝐼𝐷 , which
depends on the attributes of the 𝐶𝑃𝑈 of 𝐼𝐷 .
II. METHODOLOGY
2) Full-MEC Computational Mode: Complete task of each
A. System Model 𝐼𝐷 offloaded to the associated 𝐸𝑁𝑠 , and the MEC server
In this work, we consider an edge-based Industrial network connected to the 𝐸𝑁𝑠 process the task for 𝐼𝐷 . In order to
consisting of several cells and different 𝐼𝐷𝑠. We consider each transfer the task of the 𝐼𝐷𝑠 to the linked 𝐸𝑁𝑠 , latency and
cell is equipped with an 𝐸𝑁, which is co-located with a 𝑀𝐸𝐶 energy consumption are incurred. Denote 𝐿 ,, and𝐸 , , as the
server that provides an offloading service to the 𝐼𝐷 for transmission energy consumption and latency required when
computations. We denote the 𝑖 𝐼𝐷 and the 𝑗 𝐸𝑁 as 𝐼𝐷 and 𝐼𝐷 transmits its task to 𝐸𝑁 , we can compute 𝐿 ,, and 𝐸 , , as
𝐸𝑁 1 ≤ 𝑖 ≤ 𝑀, 1 ≤ 𝑗 ≤ 𝑈 where 𝑀 and 𝑈 denote the number follows:
of 𝐼𝐷 and 𝐸𝑁 respectively. For simplicity, we denote the 𝑀𝐸𝐶 𝐿 ,. = (3)
server that is connected to 𝐸𝑁 as 𝑀𝐸𝐶 . Each 𝐼𝐷 can select ,

only one 𝐸𝑁 to perform its task and vice versa. The 𝐸𝑁 can be 𝐸 ,, = (4)
,
assigned difference bandwidth channels to avoid inter-symbol Where 𝑅 , symbolizes the achievable bit rate between 𝐼𝐷
interference between 𝐸𝑁𝑠. and 𝐸𝑁 , which can be derived as follows:
Figure 1 depicts the proposed system model for Industrial 𝑅 . = 𝑊 𝑙𝑜𝑔 ( 1 +
,
) (5)
IoT using MEC.
Where 𝑊 is the transmission bandwidth of 𝐸𝑁 , 𝑃 is the
transmission power of 𝐼𝐷 , ℎ , is channel gain, and 𝜎 noise
power.

11

Authorized licensed use limited to: University of Ottawa. Downloaded on January 16,2024 at 20:11:44 UTC from IEEE Xplore. Restrictions apply.
 Task execution cost requisite for task completion of 𝐼𝐷 for B. Constraints
𝑀𝐸𝐶 is given as follows: Optimization constraints for computational offloading and
𝐿 ,. = (6) cell association are:

𝐸 , , = 𝜆 𝐾 (𝑓 ) (7) 1) Computational Constraint: Each 𝐼𝐷 choose either full-

local, full-MEC, or partial computational mode to execute the
Where 𝑓 represents the computational ability of 𝑀𝐸𝐶 and task as follows:
𝜆 is the energy consumption coefficient of 𝑀𝐸𝐶 . By 𝐶1: 𝛽 + ∑ 𝛽 , + ∑ 𝛽 , ≤ 1 (17)
integrating equation (3) and (6), the total task execution latency
2) Data Rate Constraint: For efficient data transmission,
𝐿 , requisite for task completion of 𝐼𝐷 for 𝑀𝐸𝐶 is given as
𝑅 should be higher than 𝑅 , where 𝑅 , 𝑎𝑛𝑑 𝑅 symbolizes
follows:
the minimum data rate and data rate of 𝐼𝐷 , respectively:
𝐿 , = 𝐿 ,, + 𝐿 ,, (8) 𝐶2: 𝑅 ≥ 𝑅 (18)
Furthermore, by integrating equation (4) and (7), the total 𝑅 = ∑ (𝛽 , + 𝛽 , )𝑅 , (19)
energy consumption required by 𝑀𝐸𝐶 to perform the entire 3) Cell association Constraint: To make sure that one 𝐸𝑁
task of 𝐼𝐷 , symbolized by 𝐸 , can be determined as follows: is available for one 𝐼𝐷, we get:
𝐸 , = 𝐸 ,, + 𝐸 ,, (9) 𝐶3: ∑ 𝛽 , + ∑ 𝛽 , ≤ 1 (20)
Partial- Computational Mode: Here, 𝜇 , , and (1 − 𝜇 , ) are a 4) Task Partition Constraints: Following variable of the
subset of 𝐼𝐷 ’s task that is offloaded to 𝑀𝐸𝐶 and executed 𝐼𝐷𝑠 should satisfy the resulting condition:
𝐶4: 0 ≤ 𝜇 , ≤ 1 (21)
locally, respectively. 𝐿 , , 𝑎𝑛𝑑 𝐸 , are the task execution
The task partition variable 𝜇 , and partial computational
latency and energy consumption of 𝐼𝐷 are given as follows:
variable 𝛽 , are closely related. Precisely, 𝜇 , is nonzero if and
𝐿 , = 𝑚𝑎𝑥{ (1 − 𝜇 , )𝐿 , 𝜇 , 𝐿 , } (10)
only if 𝛽 , = 1, and vice versa, we get:
𝐸 , = 𝑚𝑎𝑥{ (1 − 𝜇 , )𝐸 , 𝜇 , 𝐸 , } (11)
𝐶5: 𝛽 , ⊙ 𝜇 , = 1 (22)
III. PROBLEM FORMULATION
Here ⊙ is inclusive OR-operator and ceiling function is
We formulate an optimization problem for MEC-enabled 𝜇, .
Industrial Network as a cost execution problem (sum of energy
consumption and latency).
C. Optimization Problem
A. Objective Function We get the optimal solution for computational offloading and
cell association problems using equation (23).
By emphasizing task execution cost of all 𝐼𝐷 , we define as
follows: 𝑚𝑖𝑛 𝐶 (23)
, , , , , ,
𝐿=∑ 𝐿 (12)
𝑠. 𝑡 𝐶1 − 𝐶5
𝐸=∑ 𝐸 (13)
Where 𝐿 and 𝐸 describe the energy consumption and IV. OPTIMIZATION PROBLEM SOLUTION
latency of 𝐼𝐷 's , and can be given as follows: Since the formulated optimization problem is NP-Hard, the
𝐿 =𝛽 𝐿 +∑ 𝛽, 𝐿 , +∑ 𝛽, 𝐿 , (14) optimization problem is decomposed into computational
offloading and cell association problems. And optimization
𝐸 =𝛽 𝐸 +∑ 𝛽, 𝐸, +∑ 𝛽, 𝐸, (15) problem is solved by equation (23).
Where 𝛽 ∈ {0,1}, 𝛽 , ∈ {0,1}, and 𝛽 , ∈ {0,1} are the A. Task Partition
decision variables of 𝐼𝐷 for (full-local, full-MEC, and partial)
Task execution cost of 𝐼𝐷𝑠 is examined in different
computational mode, respectively. When 𝛽 = 1, 𝛽 , =
computational modes. It can be explicitly determined if the 𝐼𝐷
1, 𝑎𝑛𝑑 𝛽 , = 1, 𝐼𝐷 can choose either full-local, full-MEC, or choose the full local and full 𝑀𝐸𝐶 computational offloading,
partial computational mode to complete the task, otherwise ∗
but we need to find the optimal task partition variable 𝜇(𝑖, 𝑗)^ ,
𝛽 = 0, 𝛽 , = 0, 𝑎𝑛𝑑 𝛽 , = 0 if the 𝐼𝐷 chooses the partial computational offloading mode. It
Let 𝐶 indicate the execution cost, which can be given as can be solved using an extensive search method and following
∗
follows: formulation is used to find the variable 𝜇(𝑖, 𝑗)^ .
𝐶 =𝜂 𝐿+𝜂 𝐸 (16)
Where 𝜂 and 𝜂 are the weighting factors of latency and
energy consumption. 𝜂 ∈ [0,1] and 𝜂 can be computed as
follows: 𝜂 = (1 − 𝜂 ).

12

Authorized licensed use limited to: University of Ottawa. Downloaded on January 16,2024 at 20:11:44 UTC from IEEE Xplore. Restrictions apply.
 TABLE I. MINIMUM EXECUTION COST OF 𝐼𝐷𝑠 OVER 𝜇 , Figure 2 shows task execution cost as 𝐸𝑁𝑠 bandwidth
Full local Full MEC Partial function. We have covered the function of our proposed and the
ID computational computational computational benchmark schemes for comparison. The decreasing of task
mode mode mode execution cost reciprocally reasoned the increasing of the 𝐸𝑁𝑠
1 𝐶 𝐶 ,
,∗
𝐶 ,
,∗
bandwidth. Resultantly, the larger bandwidth steers towards a
,∗ ,∗ high data rate and short time of task execution in return.
2 𝐶 𝐶 𝐶
, ,
Furthermore, it can be noticed that the proposed method
… … … … performs outstandingly the benchmark method.
,∗ ,∗
M 𝐶 𝐶 , 𝐶 ,

𝑚𝑖𝑛 𝐶, (24)
,
𝑠. 𝑡 𝐶4: 0 ≤ 𝜇 , ≤ 1
B. Computation Offloading
Depending on the execution cost of the three different modes,
𝐼𝐷 is assigned to a computational mode with the lowest
execution cost compared to the other modes, this can be
examined from table I.

C. Computing Mode Selection

Once 𝐼𝐷𝑠 has performed the task in one of three modes, the
computational mode can be assigned to the available remaining
𝐼𝐷𝑠.
Given ℜ as the available remaining 𝐼𝐷𝑠, the task execution
cost of the 𝐼𝐷𝑠 in ℜ can be computed as follows: Figure 2: Task execution cost as edge node Bandwidth function
,∗
𝐶 = ∑IDs∈ℜ 𝐶 = ∑IDs∈ℜ(𝛽 𝐶 + ∑ (𝛽 , 𝐶 , + 𝛽 , 𝐶 , )) (25) Moreover, figure 3 shows the task execution cost as 𝐼𝐷𝑠
As the available remaining 𝐼𝐷𝑠 tend to upload their tasks to input data packet size function got from both the proposed and
benchmark method, simultaneously. No doubt, the task
𝐸𝑁𝑠 for computing, 𝐼𝐷𝑠 face cell association problem and the
execution cost increases with more data-size of input because it
problem can be formulated as follows:
increases the task execution cost. The figure shows the noise
𝑚𝑖𝑛 𝐶 (26) power impact on task execution cost. Resultantly, smaller noise
, , , , power leads towards less task execution cost due to high signal-
to-noise ratio (SNR) vs. smaller transmission cost. Finally, the
𝑠. 𝑡 𝐶1 − 𝐶3 outstanding outcomes of the proposed method are observed in
We utilized the Kuhn-Munkres algorithm to solve the the light of the results of comparison between the proposed and
optimization problem [18]. Graph matching in a bipartite graph benchmark methods.
and mapped to a weighted overall bipartite graph 𝐺(𝜓, 𝜙, 𝐸, 𝑁).
𝐸𝑁𝑠 is 𝜙 = {𝐸𝑁 , 𝐸𝑁 , 𝐸𝑁 , … . , 𝐸𝑁 } . 𝐸 = {𝑒(𝐼𝐷 , 𝐸𝑁 )}
and 𝑊 = {𝑒(𝐼𝐷 , 𝐸𝑁 )} are sets of 𝐸𝑁𝑠 , where edge 𝐸 =
{𝑒(𝐼𝐷 ∈ 𝜓)} is connected to the 𝐸𝑁 ∈ 𝜙, and edge weights
are 𝑒(𝐼𝐷 , 𝐸𝑁 ) ∈ 𝐸. 𝑤(𝐼𝐷 , 𝐸𝑁 ) is the minimum execution
cost respectively, as shown in table I.

V. RESULTS AND DISCUSSION

In this section, we present the simulation outcomes of our
proposed method with the comparison of the benchmark method
of [19]. The presented situation of simulation is MEC-enabled
edge base industrial IoT comprises of various cells and 𝐼𝐷𝑠. It is
considered that every cell has one 𝐸𝑁 that is employed with
MEC server. A total of 50 𝐼𝐷𝑠 and 5, and 10 𝐸𝑁𝑠 were
considered. The fixed area of simulation is 10000m x 10000m.
Table II shows the other parameters utilized in simulation,
explains the task execution requisite numbers of CPU cycles, the Figure 3: Task execution cost as IoT Devices input data packet size
input size of data, MEC server’s computing aptitude, and
random choosing capacity of 𝐼𝐷𝑠. The simulation outcomes of Furthermore, figure 4 represents the task execution cost as
5000 independent experimentations are narrated in this study. 𝐼𝐷𝑠 number function. So, according to the increasing of 𝐼𝐷𝑠
numbers, task execution cost also increases. We have also

13

Authorized licensed use limited to: University of Ottawa. Downloaded on January 16,2024 at 20:11:44 UTC from IEEE Xplore. Restrictions apply.
covered the impact of 𝐸𝑁𝑠 numbers on task execution cost. REFERENCES
Furthermore, task execution cost decreases reciprocally with [1] Watteyne, T., Tuset-Peiro, P., Vilajosana, X., Pollin, S., &
more significant 𝐸𝑁𝑠 numbers. The increasing numbers of 𝐸𝑁𝑠 Krishnamachari, B. (2017). Teaching Communication Technologies and
and MEC servers result in a wide variety in 𝐼𝐷𝑠 cell association. Standards for the Industrial IoT? Use 6TiSCH! IEEE Communications
The proposed method performance is satisfactory as compared Magazine, 55(5), 132–137.
to the benchmark method. The best performance of task [2] N. Abbas, Y. Zhang, A. Taherkordi and T. Skeie,“Mobile edge computing:
a survey,” IEEE Internet of Things Journal, vol. 5, no. 1, pp. 450-465, Feb.
execution could be achieved, resultantly. 2018.
[3] Y. C. Hu, M. Patel, D. Sabella, N. Sprecher, and V. Young,“ Mobile edge
computing: a key technology towards 5G,” ETSI White Paper, vol. 11,
Sep. 2015.
[4] M. A. Al Sibahee et al., "Lightweight Secure Message Delivery for E2E
S2S Communication in the IoT-Cloud System," in IEEE Access, vol. 8,
pp. 218331-218347, 2020, doi: 10.1109/ACCESS.2020.3041809.
[5] Aazam, M., Zeadally, S., & Harras, K. A. (2018). Deploying Fog
Computing in Industrial Internet of Things and Industry 4.0. IEEE
Transactions on Industrial Informatics, 1–1.
[6] Chen, L., Zhou, P., Gao, L., & Xu, J. (2018). Adaptive Fog Configuration
for the Industrial Internet of Things. IEEE Transactions on Industrial
Informatics, 1–1.
[7] Dogo, E. M., Salami, A. F., Aigbavboa, C. O., & Nkonyana, T. (2018).
Taking Cloud Computing to the Extreme Edge: A Review of Mist
Computing for Smart Cities and Industry 4.0 in Africa. EAI/Springer
Innovations in Communication and Computing, 107–132.
[8] W. Lee, J. Koo, Y. Park, and S. Choi, “Transfer time, energy, and
quotaaware multi-rat operation scheme in smartphone,” IEEE
Figure 4: Task execution cost as IoT Devices number function
Transactions on Vehicular Technology, vol. 65, no. 1, pp. 307–317, 2016.
[9] Y. Mao, C. You, J. Zhang, K. Huang and K. B. Letaief,“ A survey on
mobile edge computing: the communication perspective,” IEEE
TABLE II. NOTATIONS WITH DESCRIPTION Communications Surveys and Tutorials, vol. 19, no. 4, pp. 2322-2358,
Notation Values Aug. 2017.
[10] T. Taleb, K. Samdanis, B. Mada, H. Flinck, S. Dutta and D. Sabella,“On
Path loss factor 4
multi-access edge computing: a survey of the emerging 5G network edge
𝐸𝑁 bandwidth (𝑊 ) {05,15} MHz cloud architecture and orchestration,” IEEE Communications Surveys and
Tutorials, vol. 19, no. 3, pp. 1657?681, 3rd Quart. 2017.
Power of Transmission 𝐼𝐷 (𝑝 ) 0.5 W
[11] T. Zhou, N. Jiang, Z. Liu and C. Li,“Joint cell activation and selection for
Noise amplitude (𝜎 ) -75 dBm green communications in ultra-dense heterogeneous networks,” IEEE
Access, vol. 6, pp. 1894-1904, Dec. 2017.
Computational capacity of 𝐸𝑁 (𝑓 ) {05,15} GHz
[12] A. Rafiq, W. Ping, W. Min and M. S. A. Muthanna, "Fog Assisted
Computational capacity of 𝐼𝐷 (𝑓 ) {2,3} GHz 6TiSCH Tri-Layer Network Architecture for Adaptive Scheduling and
Energy-Efficient Offloading Using Rank-Based Q-learning in Smart
Data size (𝑈 ) {7,8} Mb
Industries," in IEEE Sensors Journal, doi: 10.1109/JSEN.2021.3058976.
{500,600}
Cpu Cycle (𝐶 ) [13] X. Chen, L. Jiao, W. Li and X. Fu,“Efficient multi-user computation
Mcycles
offloading for mobile-edge cloud computing,” IEEE/ACM Transactions
on Networking, vol. 24, no. 5, pp. 2795-2808, Oct. 2016.
VI. CONCLUSION
[14] S. Bi and Y. J. Zhang,“Computation rate maximization for wireless
In this work, we investigate the formulated optimization powered mobile-edge computing with binary computation offloading,”
problem of cell association and computation offloading in MEC- IEEE Transactions on Wireless Communications, vol. 17, no. 6, pp. 4177-
4190, Jun. 2018.
enabled Industrial networks to optimize task execution (sum of
[15] Y. Wang, M. Sheng, X. Wang, L. Wang and J. Li,“Mobile-edge
energy consumption and latency). We consider three offloading computing: partial computation offloading using dynamic voltage scaling,”
scenarios full-local, full-MEC, and partial, for task execution of IEEE Transactions on Communications, vol. 64, no. 10, pp. 4268-4282,
𝐼𝐷𝑠. Khun-Munkres algorithm and extensive search method are Oct. 2016.
utilized to obtain the optimal solution. The experimental results [16] M. Haddad, P. Wiecek, H.B.A. Sidi and E. Altman,“An automated
represent the proposed method performs satisfactorily dynamic offset for network selection in heterogeneous networks,” IEEE
performance than that the benchmark method. Security threats Transactions on Mobile Computing, vol. 15, no. 9, pp. 2151-2164, Sep.
2016.
often disturb the network performance during offloading
computational tasks. Accordingly, in future work, we plan to [17] T. Zhou, N. Jiang, Z. Liu and C. Li,“Joint cell activation and selection for
green communications in ultra-dense heterogeneous networks,” IEEE
analyze the security aspects of edge computing in industrial Access, vol. 6, pp. 1894-1904, Dec. 2017.
networks in terms of energy consumption and latency. [18] J. Munkres,“Algorithms for the assignment and transportation problems,”
J. Soc. Indust. Appl. Math., vol. 5, no. 1, pp. 32C38, Mar. 1957.
ACKNOWLEDGMENT [19] L. Yang, H. Zhang, M. Li, J. Guo and H. Ji,“Mobile edge computing
empowered energy efficient task offloading in 5G,” IEEE Transactions on
This work was supported by the National Key Research and Vehicular Technology, vol. 67, no. 7, pp. 6398-6409, Jul. 2018.
Development Program of China (2017YE0123000).

14

Authorized licensed use limited to: University of Ottawa. Downloaded on January 16,2024 at 20:11:44 UTC from IEEE Xplore. Restrictions apply.