Heuristic edge server placement in Industrial Internet of Things and cellular networks

Kasi, Shahrukh Khan, Kasi, Mumraiz K., Ali, Kamran ORCID: https://orcid.org/0000-0001-5301-9125, Raza, Mohsin, Afzal, Hifza, Lasebae, Aboubaker ORCID: https://orcid.org/0000-0003-2312-9694, Naeem, Bushra, Islam, Saif ul and Rodrigues, Joel J. P. C. (2021) Heuristic edge server placement in Industrial Internet of Things and cellular networks. IEEE Internet of Things Journal, 8 (13) . pp. 10308-10317. ISSN 2327-4662 [Article] (doi:10.1109/JIOT.2020.3041805)

Preview

PDF - Final accepted version (with author's formatting) Download (1MB) | Preview

Abstract

Rapid developments in industry 4.0, machine learning, and digital twins have introduced new latency, reliability, and processing restrictions in Industrial Internet of Things (IIoT) and mobile devices. However, using current Information and Communications Technology (ICT), it is difficult to optimally provide services that require high computing power and low latency. To meet these requirements, mobile edge computing is emerging as a ubiquitous computing paradigm that enables the use of network infrastructure components such as cluster heads/sink nodes in IIoT and cellular network base stations to provide local data storage and computation servers at the edge of the network. However, optimal location selection for edge servers within a network out of a very large number of possibilities, such as to balance workload and minimize access delay is a challenging problem. In this paper, the edge server placement problem is addressed within an existing network infrastructure obtained from Shanghai Telecom’s base station the dataset that includes a significant amount of call data records and locations of actual base stations. The problem of edge server placement is formulated as a multi-objective constraint optimization problem that places edge servers strategically to the balance between the workloads of edge servers and reduce access delay between the industrial control center/cellular base-stations and edge servers. To search randomly through a large number of possible solutions and selecting those that are most descriptive of optimal solution can be a very time-consuming process, therefore, we apply the genetic algorithm and local search algorithms (hillclimbing and simulated annealing) to find the best solution in the least number of solution space explorations. Experimental results are obtained to compare the performance of the genetic algorithm against the above-mentioned local search algorithms. The results show that the genetic algorithm can quickly search through the large solution space as compared to local search optimization algorithms to find an edge placement strategy that minimizes the cost function

Actions (login required)

View Item

Statistics

DownloadsShow export options

Export as CSVXMLJSON

Activity Overview

6 month trend

315Downloads

6 month trend

195Hits

Additional statistics are available via IRStats2.