Secure Task Offloading and Resource Allocation Strategies in Mobile Applications Using Probit Mish-Gated Recurrent Unit and an Enhanced-Searching-Based Serval Optimization Algorithm

Abstract

Today, with the presence of 5G communication systems, including Internet of Things (IoT) technology, there is a high demand for mobile devices (especially smartphones, tablets, wearable technology, and so on). Regarding this proliferation and high demand, the massive adoption of mobile devices (MDs) has led to an exponential increase in network latency; the heavy demand for cloud servers causes the degradation of data traffic, which considerably impacts the real-time communication and computing aspects of mobile devices. As a result, mobile edge computing (MEC), an efficient framework capable of enhancing processing, optimizing energy usage, and offloading computation tasks, is considered a promising solution. In current research, numerous models have been implemented to achieve resource allocation and task offloading. However, these techniques are ineffective due to privacy issues and a lack of sufficient resources. Hence, this study proposes secure task offloading and resource allocation strategies in mobile devices using the Probit Mish–Gated Recurrent Unit (PM-GRU) and Entropic Linear Interpolation-Serval Optimization Algorithm (ELI-SOA). Primarily, the tasks to be offloaded and their attributes are gathered from mobile users and passed to a local computing model to identify the edge server. Here, the task attributes and the server attributes are compared with a cache table using the Sorensen–Dice coefficient. If the attributes match, then details about the appropriate edge server are produced. If the attributes do not match, then they are inputted into a global scheme that analyzes the attributes and predicts the edge server based on the Probit Mish-Gated Recurrent Unit (PM-GRU). Then, the server information is preserved and updated in the cache table in the local scheme. Further, the attributes, along with the predicted edge server, are inputted into a system for privacy-preserving smart contract creation by using Exponential Earth Mover’s Distance Matrix-Based K-Anonymity (EEMDM-KA) to develop a secure smart contract. Subsequently, the traffic attributes in the smart contract are extracted, and the request load is balanced by using HCD-KM. Load-balanced requests are assigned to the edge server, and the optimal resources are allocated in the cloud server by using the Entropic Linear Interpolation-Serval Optimization Algorithm (ELI-SOA). Finally, the created smart contract is hashed based on KECCAK-512 and stored in the blockchain. With a high accuracy of 99.84%, the evaluation results showed that the proposed approach framework performed better than those used in previous efforts.