Search

The Internet of Things (IoT) networks comes with many challenges, especially in network architecture designs. IoT is populated by several kinds of devices with different characteristics that are autonomously managed. These devices do not have enough resources and they require to process data in real-time. Hence, there is a need to design suitable architectures for IoT networks that are as efficient as possible. Previously, Cloud Computing (CC) seemed to provide a good solution of processing data from IoT networks. Recently, Mobile Edge Computing (MEC) seems to be offering a better solution than CC by ensuring a better Quality of Services (QoS) provisioning. As a result, many MEC solutions have emerged for QoS improvement in IoT networks. These solutions mainly focus on device resource management without considering data routing from an end-user device to another, especially when the latter are mobile and need to communicate with each other. In this paper, we propose to design an adaptive routing protocol for a MEC-based network to manage efficiently, the end-user devices' energy consumption during data routing. The proposed adaptive Mobile Edge Computing-based protocol consists of two main phases: firstly, we subdivide the network's objects into clusters by exploiting a link quality prediction algorithm. Secondly, we route the data to their destination adaptively by considering the object's movement during the routing process. As presented in the simulation results, our protocol outperforms other existing routing protocols for IoT networks in terms of energy consumption. We then propose the use of our solution for data routing in IoT networks that require huge data processing and forwarding. [ABSTRACT FROM AUTHOR]

MEC and IoT are rapidly expanding technologies that offer numerous opportunities to enhance efficiency and application performance. However, the huge volume of data generated by IoT devices, coupled with computational and latency constraints, poses data processing challenges. To address this within the MEC architecture, deploying computing servers at the network edge near IoT devices is a promising approach. This reduces latency and traffic load on the core network while improving the user experience. However, offloading computations task from IoT devices to MEC servers and efficiently allocating computing resources is a complex problem. IoT tasks may have specific requirements in terms of latency, bandwidth and energy efficiency, while computing resources and capacities maybe limited or shared between several users. We propose an approach called FedMeta2Ag, which we evaluate using the MNIST database. With 20 epochs, the training accuracy reached 91.5%, while the test accuracy achieved 92.0%. Performance consistently improved during the initial 20 iterations and gradually stabilized thereafter. Additionally, we compared the performance of our proposed model with existing methods, finding that our approach outperforms existing models in predicting performance more accurately. Thus, this approach effectively meets the demanding performance requirements of wireless communication systems. [ABSTRACT FROM AUTHOR]

Summary: Due to geographical factors, it is impossible to build large‐scale communication network infrastructure in remote areas, which leads to poor network communication quality in these areas and a series of delay‐sensitive tasks cannot be timely processed and responded. Aiming at the problem of limited coverage in remote areas, the space‐air‐ground integrated networks (SAGIN) combined with mobile edge computing (MEC) can provide low latency and high reliability transmission for offloading delay‐sensitive tasks for users in remote areas. Considering the strong limitation of satellite resources in the space‐ground integrated network and insufficient energy of local user equipment, firstly, a satellite‐UAV cluster‐ground three‐layer edge computing network architecture is proposed in this paper. Under the condition that the delay requirements of various ground tasks are met, the task offloading problem is transformed into a Stackelberg game between ground user equipment and edge servers. In addition, it is proved that the existence of Nash equilibrium in non‐cooperative game between ground user equipment by using potential game. Finally, a Nash equilibrium iterative offloading algorithm based on Stackelberg game (NEIO‐SG) is proposed to find the optimal offloading strategy for tasks to minimize the system offloading cost and the optimal forwarding percentage strategy for offloading tasks to maximize the utility function of the edge server. Simulation results show that compared to other baseline algorithms, NEIO‐SG reduces the total system latency during task offloading by about 13%$$ \% $$ and the energy consumption of the edge server by about 35%$$ \% $$. [ABSTRACT FROM AUTHOR]

Integrated communication–sensing–computing (ICSC) satellites, which integrate edge computing servers on Earth observation satellites to process collected data directly in orbit, are attracting growing attention. Nevertheless, some monitoring tasks involve sequential sub-tasks like target observation and movement prediction, leading to data dependencies. Moreover, the limited energy supply on satellites requires the sequential execution of sub-tasks. Therefore, inappropriate assignments can cause circular waiting among satellites, resulting in deadlocks. This paper formulates task offloading in ICSC satellites with data-dependent constraints as a mixed-integer linear programming (MILP) problem, aiming to minimize service latency and energy consumption simultaneously. Given the non-centrality of ICSC satellites, we propose a distributed deadlock-free task offloading (DDFTO) algorithm. DDFTO operates in parallel on each satellite, alternating between sub-task inclusion and consensus and sub-task removal until a common offloading assignment is reached. To avoid deadlocks arising from sub-task inclusion, we introduce the deadlock-free insertion mechanism (DFIM), which strategically restricts the insertion positions of sub-tasks based on interval relationships, ensuring deadlock-free assignments. Extensive experiments demonstrate the effectiveness of DFIM in avoiding deadlocks and show that the DDFTO algorithm outperforms benchmark algorithms in achieving deadlock-free offloading assignments. [ABSTRACT FROM AUTHOR]

In recent years, mobile applications have proliferated across domains such as E-banking, Augmented Reality, E-Transportation, and E-Healthcare. These applications are often built using microservices, an architectural style where the application is composed of independently deployable services focusing on specific functionalities. Mobile devices cannot process these microservices locally, so traditionally, cloud-based frameworks using cost-efficient Virtual Machines (VMs) and edge servers have been used to offload these tasks. However, cloud frameworks suffer from extended boot times and high transmission overhead, while edge servers have limited computational resources. To overcome these challenges, this study introduces a Microservices Container-Based Mobile Edge Cloud Computing (MCBMEC) environment and proposes an innovative framework, Optimization Task Scheduling and Computational Offloading with Cost Awareness (OTSCOCA). This framework addresses Resource Matching, Task Sequencing, and Task Scheduling to enhance server utilization, reduce service latency, and improve service bootup times. Empirical results validate the efficacy of MCBMEC and OTSCOCA, demonstrating significant improvements in server efficiency, reduced service latency, faster service bootup times, and notable cost savings. These outcomes underscore the pivotal role of these methodologies in advancing mobile edge computing applications amidst the challenges of edge server limitations and traditional cloud-based approaches. [ABSTRACT FROM AUTHOR]

An optimized container consolidation is a key factor in Mobile Edge Computing. It is a challenging problem as its complexity is NP-hard. In addition to structural properties of a network which reveal nodes features and their connectivity, we believe that the spectral properties of correlation between rows of similarity matrix of the network could be more beneficial in placement algorithm. Most existing literature focus on reducing energy consumption in cloud or edge environments based on structural properties of the given network. However, they undermine the concept of locality which could affect excessive network traffic. Our proposed method utilizes structural and spectral properties of the network to solve the problem. We expected to improve locality factor and link reduction as well as reducing the problem space by utilizing a centroid-based approach and a queue. Our proposed algorithm preserves topology architecture without consuming more energy in comparison to the existing popular algorithms. [ABSTRACT FROM AUTHOR]

Mobile edge computing (MEC) is considered one of the key technologies for large-scale network services. Task scheduling helps to improve the task completion rate of MEC, by properly mapping tasks generated by devices onto MEC resources. However, the mobility of devices introduces complexities, potentially resulting in failed task offloading or unavailable task results. To tackle this issue, we propose a mobile-aware task scheduling scheme. We first model the trajectory of mobile devices and introduce a strategy for the fastest task offloading, coupled with an efficient result return method. Subsequently, to improve the task completion rate, we present a task scheduling model based on task migration and formulate the relevant problem as a Mixed Integer Non-linear Programming (MINLP) problem. To achieve a solution within a reasonable time complexity, we propose a Particle Swarm Optimization and Genetic Algorithm with a Rescheduling operator (PSOGAR). In PSOGAR, particles update their positions using a mating operator, while maintaining diversity by a mutation operator. In addition, a rescheduling operator is used to further improve the task completion rate. Finally, through simulation experiments, compare PSOGAR with state-of-the-art and classic algorithms. The experimental results show that PSOGAR can improve the task completion rate by 18–31% and can be applied to scenarios with tight task deadlines. [ABSTRACT FROM AUTHOR]

Mobile Edge Computing (MEC) has been widely applied in various Internet of Things (IoT) scenarios due to its advantages of low latency and low energy consumption. However, the offloading of tasks generated by terminal devices to edge servers inevitably raises privacy leakage concerns. Given the limited resources in MEC networks, this paper proposes a task scheduling strategy, named DQN-DP, to minimize location privacy leakage under the constraint of offloading costs. The strategy is based on a differential privacy location obfuscation probability density function. Theoretical analysis demonstrates that the probability density function employed in this study is valid and satisfies ϵ -differential privacy in terms of security. Numerical results indicate that, compared to existing baseline approaches, the proposed DQN-DP algorithm effectively balances privacy leakage and offloading cost. Specifically, DQN-DP reduces privacy leakage by approximately 20% relative to baseline approaches. [ABSTRACT FROM AUTHOR]

As machine learning (ML) technologies continue to evolve, there is an increasing demand for data. Mobile crowd sensing (MCS) can motivate more users in the data collection process through reasonable compensation, which can enrich the data scale and coverage. However, nowadays, users are increasingly concerned about their privacy and are unwilling to easily share their personal data. Therefore, protecting privacy has become a crucial issue. In ML, federated learning (FL) is a widely known privacy‐preserving technique where the model training process is performed locally by the data owner, which can protect privacy to a large extent. However, as the model size grows, the weak computing power and battery life of user devices are not sufficient to support training a large number of models locally. With mobile edge computing (MEC), user can offload some of the model training tasks to the edge server for collaborative computation, allowing the edge server to participate in the model training process to improve training efficiency. However, edge servers are not fully trusted, and there is still a risk of privacy leakage if data is directly uploaded to the edge server. To address this issue, we design a local differential privacy (LDP) based data privacy‐preserving algorithm and a deep reinforcement learning (DRL) based task offloading algorithm. We also propose a privacy‐preserving distributed ML framework for MEC and model the cloud‐edge‐mobile collaborative training process. These algorithms not only enable effective utilization of edge computing to accelerate machine learning model training but also significantly enhance user privacy and save device battery power. We have conducted experiments to verify the effectiveness of the framework and algorithms. [ABSTRACT FROM AUTHOR]

Mobile edge computing (MEC) technology is widely used for real‐time and bandwidth‐intensive services, but its underlying heterogeneous architecture may lead to a variety of security and privacy issues. Blockchain provides novel solutions for data security and privacy protection in MEC. However, the scalability of traditional blockchain is difficult to meet the requirements of real‐time data processing, and the consensus mechanism is not suitable for resource‐constrained devices. Moreover, the access control of MEC data needs to be further improved. Given the above problems, a data privacy protection model based on sharding blockchain and access control is designed in this paper. First, a privacy‐preserving platform based on a sharding blockchain is designed. Reputation calculation and improved Proof‐of‐Work (PoW) consensus mechanism are proposed to accommodate resource‐constrained edge devices. The incentive mechanism with rewards and punishments is designed to constrain node behavior. A reward allocation algorithm is proposed to encourage nodes to actively contribute to obtaining more rewards. Second, an access control strategy using ciphertext policy attribute‐based encryption (CP‐ABE) and RSA is designed. A smart contract is deployed to implement the automatic access control function. The InterPlanetary File System is introduced to alleviate the blockchain storage burden. Finally, we analyze the security of the proposed privacy protection model and statistics of the GAS consumed by the access control policy. The experimental results show that the proposed data privacy protection model achieves fine‐grained control of access rights, and has higher throughput and security than traditional blockchain. [ABSTRACT FROM AUTHOR]

Face recognition is one of the most important applications of MEC. However, there have been many fake face data that can deceive MEC devices, causing serious problems such as information leakage. Face forgery detection can effectively solve this problem. Current face forgery detection methods have achieved high accuracy. However, most of the methods are researched on the classification of face authenticity. We find that studying multi‐classification of forgery methods can not only improve the accuracy of the model to identify fake faces, but also help improve the generalization ability of fake face classification. We argue that multi‐scale features and high‐frequency features can expose more detailed forgery artifacts. So, we design four modules, which take advantage of the complementarity of RGB features and frequency features, global features and local features. The first module is a residual‐guided multi‐scale spatial attention module, which uses residuals to guide the RGB feature extractor to extract fake features from a multi‐scale perspective. The second module is a multi‐scale retinal feature extraction module. The third module is a multi‐scale channel attention‐guided local frequency statistics module, which extracts local frequency responses using sliding‐window DCT. The last module is a capsule network classification module with overall correlation to classify the fused features. The information transfer between the subject capsule and the classification capsule can increase the integrity of the model, making the model converge faster. We conduct experiments on the databases FaceForensics++, DeepfakeDetection, and FakeAVCeleb. Experimental result shows that our method performs well on forgery classification. [ABSTRACT FROM AUTHOR]

In this article, we propose a mobile edge computing (MEC)‐related system named PD‐Gait, which can measure gait parameters of Parkinson's disease patients in a contactless and privacy‐preserving manner. We utilize inaudible acoustic signals and band‐pass filters to achieve privacy data protection in the physical layer. The proposed framework can be easily deployed in the mobile end of MEC, and hence release the edge server in cybersecurity attacks fighting. The gait parameters include stride cycle time length and moving speed, and hence providing an objective basis for the doctors' judgment. PD‐Gait utilizes acoustic signals in bands from 16 to 23 kHz to achieve device‐free sensing, which would release both doctors and patients from the tedious wearing process and psychological burden caused by traditional wearable devices. To achieve robust measurement, we propose a novel acoustic ranging method to avoid "broken tones" and "uneven peak distribution" in the received data. The corresponding ranging accuracy is 0.1 m. We also propose auto‐focus micro‐Doppler features to extract robust stride cycle time length, and can achieve an accuracy of 0.052 s. We deployed PD‐Gait in a brain hospital and collected data from 8 patients. The total walked distance is over 330 m. From the overall trend, our results are highly correlated with the doctor's judgment. [ABSTRACT FROM AUTHOR]

As a new paradigm of distributed computing, mobile edge computing (MEC) has gained increasing attention due to its ability to expand the capabilities of centralized cloud computing. In MEC environments, a software application typically consists of multiple micro‐services, which can be composed together in a flexible manner to achieve various user requests. However, the composition of micro‐services in MEC is still a challenging research issue arising from three aspects. Firstly, composite micro‐services constructed by ignoring the processing capabilities of different micro‐services may cause waste of edge resources. Secondly, edge servers' limitations in terms of computational power can easily cause service occupancy between composite micro‐services, severely affecting the user experience. Thirdly, in dynamic and unstable mobile environments, different edge users have different sensitivities to request latency, which increases the complexity of micro‐service composition. In order to improve edge resource utilization and user experience on micro‐service invocations, in this paper, we comprehensively consider the above three factors, and we first model the micro‐services composition problem in MEC as a constrained multi‐objective optimization problem. Then, a micro‐service composition optimization method M3C combining graph search and branch‐and‐bound strategy is proposed to find a composition solution set with low energy consumption and high success rate for multiple edge users. Finally, we perform a series of experiments on two widely used datasets. Experimental results show that our proposed approach significantly outperforms the four competing baseline approaches, and that it is sufficiently efficient for practical deployment. [ABSTRACT FROM AUTHOR]

Deep learning has been widely explored in 5G applications, including computer vision, the Internet of Things (IoT), and intermedia classification. However, applying the deep learning approach in limited-resource mobile devices is one of the most challenging issues. At the same time, users' experience in terms of Quality of Service (QoS) (e.g., service latency, outcome accuracy, and achievable data rate) performs poorly while interacting with machine learning applications. Mobile edge computing (MEC) has been introduced as a cooperative approach to bring computation resources in proximity to end-user devices to overcome these limitations. This article aims to design a novel image reiterative extraction algorithm based on convolution neural network (CNN) learning and computational task offloading to support machine learning-based mobile applications in resource-limited and uncertain environments. Accordingly, we leverage the framework of image retrieval extraction and introduce three approaches. First, privacy preservation is strict and aims to protect personal data. Second, network traffic reduction. Third, minimizing feature matching time. Our simulation results associated with real-time experiments on a small-scale MEC server have shown the effectiveness of the proposed deep learning-based approach over existing schemes. The source code is available here: https://github.com/jamalalasadi/CNN_Image_retrieval. [ABSTRACT FROM AUTHOR]

Unmanned aerial vehicle (UAV)-enabled edge computing combines mobile edge computing technology with UAV platform. It can provide timely and effective computing services for wireless devices by taking advantages of the flexible deployment and mobility of UAV. Starting with the network architecture of UAV-enabled edge computing, the technical architecture based on network function virtualization and software- defined networks is proposed. For the key technologies of UAV-enabled edge computing, different multiple access schemes in UAV-enabled edge computing network are compared. Furthermore, according to different optimization objectives, the computation offloading strategies based on classical non-convex optimization, game theory, and artificial intelligence are summarized and analyzed. Finally, the future research direction is discussed and prospected. [ABSTRACT FROM AUTHOR]

With the rapid advancement of the Internet of Things and the emergence of 6G networks in smart city environments, a growth in the generation of data, commonly known as big data, is expected to consequently lead to higher latency. To mitigate this latency, mobile edge computing has been proposed to alleviate a portion of the workload from mobile devices by offloading it to nearby edge servers equipped with appropriate computational resources. However, existing solutions often exhibit poor performance when confronted with complex network topologies. Thus, this paper introduces a decentralized mechanism aimed at determining the locations of network edge nodes in such complex network topologies, characterized by lengthy execution times. Our proposal provides performance improvements and offers scalability and flexibility as networks become more complex. Experimental evaluations are conducted using the Shanghai Telecom dataset to validate our proposed approach. [ABSTRACT FROM AUTHOR]

Task offloading and resource allocation is a research hotspot in cloud-edge collaborative computing. Many existing pieces of research adopted single-agent reinforcement learning to solve this problem, which has some defects such as low robustness, large decision space, and ignoring delayed rewards. In view of the above deficiencies, this paper constructs a cloud-edge collaborative computing model, and related task queue, delay, and energy consumption model, and gives joint optimization problem modeling for task offloading and resource allocation with multiple constraints. Then, in order to solve the joint optimization problem, this paper designs a decentralized offloading and scheduling scheme based on "task-oriented" multi-agent reinforcement learning. In this scheme, we present information synchronization protocols and offloading scheduling rules and use edge servers as agents to construct a multi-agent system based on the Actor–Critic framework. In order to solve delayed rewards, this paper models the offloading and scheduling problem as a "task-oriented" Markov decision process. This process abandons the commonly used equidistant time slot model but uses dynamic and parallel slots in the step of task processing time. Finally, an offloading decision algorithm TOMAC-PPO is proposed. The algorithm applies the proximal policy optimization to the multi-agent system and combines the Transformer neural network model to realize the memory and prediction of network state information. Experimental results show that this algorithm has better convergence speed and can effectively reduce the service cost, energy consumption, and task drop rate under high load and high failure rates. For example, the proposed TOMAC-PPO can reduce the average cost by from 19.4% to 66.6% compared to other offloading schemes under the same network load. In addition, the drop rate of some baseline algorithms with 50 users can achieve 62.5% for critical tasks, while the proposed TOMAC-PPO only has 5.5%. [ABSTRACT FROM AUTHOR]

Summary: Mobile edge computing (MEC) promotes the development and popularity of Internet of Things (IoT) devices with higher connectivity and ultra‐low latency through network topology optimization and real‐time data analysis. With the exponential growth of data traffic generated by IoT devices, it is essential to prevent edge servers (ESs) from overloading through efficient task scheduling to ensure the quality of service (QoS). However, the lack of trust and incentive mechanisms between ESs deployed and managed by different infrastructure providers makes it challenging to perform peer‐offloaded tasks. Moreover, to meet the low‐latency requirement of many IoT applications, the execution efficiency of the task scheduling scheme in MEC needs to be improved. To address the above challenges systematically, a QoS‐driven task scheduling scheme with blockchain in MEC named SharpEdge is proposed. In SharpEdge, ESs publish tasks with rewards and then select the most reliable executors through a historical performance‐based reputation mechanism to perform peer offloading. The performance of the executor will be recorded into the blockchain after the task is completed. In addition, a concurrent consensus mechanism using sharding technology is designed, improving task scheduling efficiency. We implement SharpEdge based on Hyperledger Fabric and verify its performance in a simulated MEC environment. [ABSTRACT FROM AUTHOR]

In the last few years, the rapid advancement of the Internet of Things (IoT) and the widespread adoption of smart cities have posed new challenges to computing services. Traditional cloud computing models fail to fulfil the rapid response requirement of latency‐sensitive applications, while mobile edge computing (MEC) improves service efficiency and customer experience by transferring computing tasks to servers located at the network edge. However, designing an effective computing offloading strategy in complex scenarios involving multiple computing tasks, nodes, and services remains a pressing issue. In this paper, a computing offloading approach based on Deep Reinforcement Learning (DRL) is proposed for large‐scale heterogeneous computing tasks. First, Markov Decision Processes (MDPs) is used to formulate computing offloading decision and resource allocation problems in large‐scale heterogeneous MEC systems. Subsequently, a comprehensive framework comprising the "end‐edge‐cloud" along with the corresponding time‐overhead and resource allocation models is constructed. Finally, through extensive experiments on real datasets, the proposed approach is demonstrated to outperform existing methods in enhancing service response speed, reducing latency, balancing server loads, and saving energy. [ABSTRACT FROM AUTHOR]

Device-to-device (D2D) is a pivotal technology in the next generation of communication, allowing for direct task offloading between mobile devices (MDs) to improve the efficient utilization of idle resources. This paper proposes a novel algorithm for dynamic task offloading between the active MDs and the idle MDs in a D2D–MEC (mobile edge computing) system by deploying multi-agent deep reinforcement learning (DRL) to minimize the long-term average delay of delay-sensitive tasks under deadline constraints. Our core innovation is a dynamic partitioning scheme for idle and active devices in the D2D–MEC system, accounting for stochastic task arrivals and multi-time-slot task execution, which has been insufficiently explored in the existing literature. We adopt a queue-based system to formulate a dynamic task offloading optimization problem. To address the challenges of large action space and the coupling of actions across time slots, we model the problem as a Markov decision process (MDP) and perform multi-agent DRL through multi-agent proximal policy optimization (MAPPO). We employ a centralized training with decentralized execution (CTDE) framework to enable each MD to make offloading decisions solely based on its local system state. Extensive simulations demonstrate the efficiency and fast convergence of our algorithm. In comparison to the existing sub-optimal results deploying single-agent DRL, our algorithm reduces the average task completion delay by 11.0% and the ratio of dropped tasks by 17.0%. Our proposed algorithm is particularly pertinent to sensor networks, where mobile devices equipped with sensors generate a substantial volume of data that requires timely processing to ensure quality of experience (QoE) and meet the service-level agreements (SLAs) of delay-sensitive applications. [ABSTRACT FROM AUTHOR]

Federated learning (FL) can break the problem of data silos and allow multiple data owners to collaboratively train shared machine learning models without disclosing local data in mobile edge computing. However, how to incentivize these clients to actively participate in training and ensure efficient convergence and high test accuracy of the model has become an important issue. Traditional methods often use a reverse auction framework but ignore the consideration of client volatility. This paper proposes a multi-dimensional reverse auction mechanism (MRATR) that considers the uncertainty of client training time and reputation. First, we introduce reputation to objectively reflect the data quality and training stability of the client. Then, we transform the goal of maximizing social welfare into an optimization problem, which is proven to be NP-hard. Then, we propose a multi-dimensional auction mechanism MRATR that can find the optimal client selection and task allocation strategy considering clients' volatility and data quality differences. The computational complexity of this mechanism is polynomial, which can promote the rapid convergence of FL task models while ensuring near-optimal social welfare maximization and achieving high test accuracy. Finally, the effectiveness of this mechanism is verified through simulation experiments. Compared with a series of other mechanisms, the MRATR mechanism has faster convergence speed and higher testing accuracy on both the CIFAR-10 and IMAGE-100 datasets. [ABSTRACT FROM AUTHOR]

Summary: Mobile edge computing has become popular in the past few years as a means of creating computing resources close to end‐user nodes at the network edge. Nodes—end users—demand work offloading to improve service utilization. Furthermore, when the number of users in mobile edge computing increases, the minimal resources deployed at the edge become a problem. Develop the idea of reinforcement learning using a metaheuristic technique intended to achieve effective resource allocation and resolve offloading issues to handle this issue. The ideal way to manage the implementation of mobile edge computing with a cognitive agent's help is to request compensation for all client necessities. To complete the infrastructure type for the Internet of Things (IoT), the operator information is combined with its distinctive methodology. Neural caching during task execution is provided by reinforcement learning based on snake swarm optimization (SSO). Neural caching during task execution is provided by reinforcement learning based on SSO. In the process of creating the cost mapping table and incentive factor‐based optimal resource allocation, this suggested method is applied to a contract with effective resource allocation among the end manipulators. Using performance metrics like delivery ratio, energy consumption, throughput, and delay, the suggested approach is put into practice and examined. It is also contrasted with traditional methods like Gray Wolf Optimization (GWO) ant colony optimization (ACO) and genetic algorithms (GA). [ABSTRACT FROM AUTHOR]

Cybertwin (CT) is an innovative network structure that digitally simulates humans and items in a virtual environment, significantly influencing Cybertwin instances more than regular VMs. Cybertwin-driven networks, combined with Mobile Edge Computing (MEC), provide practical options for transmitting IoT-enabled data. This research introduces a hybrid methodology integrating deep learning with Cybertwin-driven resource allocation to enhance energy-efficient workload offloading and resource management in MEC networks. Offloading work is essential in MEC networks since several applications require significant resources. The Cybertwin-driven approach considers user mobility, virtualization, processing power, load migrations, and resource demand as crucial elements in the decision-making process for offloading. The model optimizes job allocation between on-premises and distant execution using a task-offloading strategy to reduce the operating burden on the MEC network. The model uses a hybrid partitioning approach and a cost function to optimize resource allocation efficiently. This cost function accounts for energy consumption and service delays associated with job assignment, execution, and fulfilment. The model calculates the cost of several segmentation and offloading procedures and chooses the lowest cost to enhance energy efficiency and performance. The approach employs a deep learning architecture called "CNN-LSTM-TL" to accomplish energy-efficient task offloading, utilizing pre-trained transfer learning models. Batch normalization is used to speed up model training and improve its robustness. The model is trained and assessed using an extensive mobile edge computing public dataset. The experimental findings confirm the efficacy of the proposed methodology, indicating a 20% decrease in energy usage compared to conventional methods while achieving comparable or superior performance levels. Simulation studies emphasize the advantages of incorporating Cybertwin-driven insights into resource allocation and workload-offloading techniques. This research enhances energy-efficient and resource-aware MEC networks by incorporating Cybertwin-driven techniques. [ABSTRACT FROM AUTHOR]

As far as mobile edge computing is concerned, it is necessary to ensure the data integrity of latency-sensitive applications during the process of computing. While certain research programs have demonstrated efficacy, challenges persist, including the inefficient utilization of computing resources, network backhaul issues, and the occurrence of false-negative detections. To solve these problems, an integrity protection scheme is proposed in this paper on the basis of data right confirmation (DRC). Under this scheme, a two-layer consensus algorithm is developed. The outer algorithm is applied to establish a data authorization mechanism by marking the original data source to avoid the false negative results caused by network attacks from the data source. In addition, blockchain-based mobile edge computing (BMEC) technology is applied to enable data sharing in the context of mobile edge computing while minimizing the network backhaul of edge computing. Based on the Merkle Tree algorithm, the inner layer algorithm is capable not only of accurately locating and promptly repairing damaged data but also of verifying all servers in the mobile edge computing network either regularly or on demand. Finally, our proposal is evaluated against two existing research schemes. The experimental results show that our proposed scheme is not only effective in ensuring data integrity in mobile edge computing, but it is also capable of achieving better performance. [ABSTRACT FROM AUTHOR]

The rapid increase in the number of computing intensive tasks has led to an overload of SMD (Smart Mobile Devices) computing tasks. By using MEC(Mobile Edge Computing Servers) and idle ED (Edge Devices) in the network, SMD with limited computing power can offload computing tasks to MEC and ED collaboration, and enhance system security based on the DPoR (Delegated Proof of Reputation) consensus mechanism. This study proposes a blockchain mobile edge computing offloading model based on BS AFSA (Bird Swarm Artificial Fish Swarm Algorithm), which transforms the task offloading problem into an optimization objective function to reduce the computational overhead. The improved BS AFSA is used to optimize the task delay and energy consumption, and the behavior parameters in the algorithm are constructed and the crowding factor is improved to elevate the local search accuracy in the later iteration. The simulation results show that compared with other benchmark algorithms, the proposed algorithm reduces the possibility of falling into local optimum and effectively reduces the total system cost of the joint offloading scheme. [ABSTRACT FROM AUTHOR]

Maritime transport plays a critical role in global logistics. Compared to road transport, the pace of research and development is much slower for maritime transport. It faces many major challenges, such as busy ports, long journeys, significant accidents, and greenhouse gas emissions. The problems have been exacerbated by recent regional conflicts and increasing international shipping demands. Maritime Autonomous Surface Ships (MASSs) are widely regarded as a promising solution to addressing maritime transport problems with improved safety and efficiency. With advanced sensing and path-planning technologies, MASSs can autonomously understand environments and navigate without human intervention. However, the complex traffic and water conditions and the corner cases are large barriers in the way of MASSs being practically deployed. In this paper, to address the above issues, we investigated the application of Large Language Models (LLMs), which have demonstrated strong generalization abilities. Given the substantial computational demands of LLMs, we propose a framework for LLM-assisted navigation in connected MASSs. In this framework, LLMs are deployed onshore or in remote clouds, to facilitate navigation and provide guidance services for MASSs. Additionally, certain large oceangoing vessels can deploy LLMs locally, to obtain real-time navigation recommendations. To the best of our knowledge, this is the first attempt to apply LLMs to assist with ship navigation. Specifically, MASSs transmit assistance requests to LLMs, which then process these requests and return assistance guidance. A crucial aspect, which has not been investigated in the literature, of this safety-critical LLM-assisted guidance system is the knowledge and safety performance of the LLMs, in regard to ship handling, navigation rules, and skills. To assess LLMs' knowledge of navigation rules and their qualifications for navigation assistance systems, we designed and conducted navigation theory tests for LLMs, which consisted of more than 1500 multiple-choice questions. These questions were similar to the official theory exams that are used to award the Officer Of the Watch (OOW) certificate based on the Standards of Training, Certification, and Watchkeeping (STCW) for Seafarers. A wide range of LLMs were tested, which included commercial ones from OpenAI and Baidu and an open-source one called ChatGLM, from Tsinghua. Our experimental results indicated that among all the tested LLMs, only GPT-4o passed the tests, with an accuracy of 86%. This suggests that, while the current LLMs possess significant potential in regard to navigation and guidance systems for connected MASSs, further improvements are needed. [ABSTRACT FROM AUTHOR]

Unmanned aerial vehicles (UAVs) equipped with mobile edge computing (MEC) servers and featuring flexible deployment capabilities can help to reduce the computing pressure on ground user networks. However, the majority of ground users are hindered by their limited battery life, preventing them from working without interruption. To maximize the service lifetime of ground users, UAVs transmit energy to them first and then collect offload tasks afterwards. This approach allows users to work without interruption while transmitting UAVs with computing tasks which can then be processed with the help of MEC servers. This helps to reduce the pressure on ground user networks, ensuring that they remain reliable and efficient. Therefore, we propose an optimization problem that aims to maximize the minimum security offloading rate of the system. This problem involves multiple variables, so conventional methods are not suitable for solving it. Our proposed scheme utilizes block coordinate descent (BCD) and successive convex approximation (SCA) algorithms, which can better optimize the user offloading decision, energy transfer duration, and user transmit power. Numerical results demonstrate that our scheme is more effective than the two benchmark schemes in improving the system performance. [ABSTRACT FROM AUTHOR]

With the rapid development of innovative applications, lots of computation-intensive and delay-sensitive tasks are emerging. Task offloading, which is regarded as a key technology in the emerging mobile edge computing paradigm, aims at offloading the tasks from mobile devices (MDs) to edge servers or the remote cloud to reduce system delay and energy consumption of MDs. However, most existing task offloading studies either didn't consider the dependencies among tasks or simply designed heuristic schemes to solve dependent task offloading problems. Different from these studies, we propose a deep reinforcement learning (DRL) based task offloading scheme to jointly offload tasks with dependencies. Specifically, we model the dependencies among tasks by directed acyclic graphs and formulate the task offloading problem as minimizing the average cost of energy and time (CET) of users. To solve this NP-hard problem, we propose a deep Q-network learning-based framework that creatively utilizes deep neural networks to extract system features. Simulation results show that our proposed scheme outperforms the existing DRL scheme and heuristic scheme in reducing the average CET of all users and can obtain near-optimal solutions. [ABSTRACT FROM AUTHOR]

With the development of Mobile Edge Computing, driverless, 5 G, and related techniques, Edge-Cloud based Urban Intelligent Video Systems are extremely promising to support public safety through powerful analysis and timely response. Furtherly, flexible Unmanned Ground Vehicles(UGVs), which are equipped with edge devices, can enhance these edge systems to withstand these abnormalities: natural disasters, abnormal crowd flows, and other emergencies. In this regard, as a critical issue in edge systems, task placement in these systems needs to consider these "mobile" edge nodes: ICVs(UGVs). Therefore, a novel and effective framework named Optimized Centroids K-means based Task Placement framework is proposed: we firstly involve the clustering approach to optimize initial centroids as the positions of ICVs in terms of Edge Nodes, various typical optimization methods can be utilized to place related edge tasks effectively. The experimental results demonstrate that our novel framework has a great improvement over several existing typical strategies and supports multiple optimization methods well in this paper. [ABSTRACT FROM AUTHOR]

Copyright of Aero Weaponry is the property of Aero Weaponry Editorial Office and its content may not be copied or emailed to multiple sites or posted to a listserv without the copyright holder's express written permission. However, users may print, download, or email articles for individual use. This abstract may be abridged. No warranty is given about the accuracy of the copy. Users should refer to the original published version of the material for the full abstract. (Copyright applies to all Abstracts.)

Mobile Edge Computing (MEC) is a promising approach. Dynamic service migration is a key technology in MEC. In order to maintain the continuity of services in a dynamic environment, mobile users need to migrate tasks between multiple servers in real time. Due to the uncertainty of movement, frequent migration will increase delays and costs and non-migration will lead to service interruption. Therefore, it is very challenging to design an optimal migration strategy. In this paper, we investigate the multi-user task migration problem in a dynamic environment and minimizes the average service delay while meeting the migration cost. In order to optimize the service delay and migration cost, we propose an adaptive weight deep deterministic policy gradient (AWDDPG) algorithm. And distributed execution and centralized training are adopted to solve the high-dimensional problem. Experiments show that the proposed algorithm can greatly reduce the migration cost and service delay compared with the other related algorithms. [ABSTRACT FROM AUTHOR]

Online detection devices, powered by artificial intelligence technologies, enable the comprehensive and continuous detection of high-speed railways (HSRs). However, the computation-intensive and latency-sensitive nature of these detection tasks often exceeds local processing capabilities. Mobile Edge Computing (MEC) emerges as a key solution in the railway Internet of Things (IoT) scenario to address these challenges. Nevertheless, the rapidly varying channel conditions in HSR scenarios pose significant challenges for efficient resource allocation. In this paper, a computation offloading system model for detection tasks in the railway IoT scenario is proposed. This system includes direct and relay transmission models, incorporating Non-Orthogonal Multiple Access (NOMA) technology. This paper focuses on the offloading strategy for subcarrier assignment, mode selection, relay power allocation, and computing resource management within this system to minimize the average delay ratio (the ratio of delay to the maximum tolerable delay). However, this optimization problem is a complex Mixed-Integer Non-Linear Programming (MINLP) problem. To address this, we present a low-complexity subcarrier allocation algorithm to reduce the dimensionality of decision-making actions. Furthermore, we propose an improved Deep Deterministic Policy Gradient (DDPG) algorithm that represents discrete variables using selection probabilities to handle the hybrid action space problem. Our results indicate that the proposed system model adapts well to the offloading issues of detection tasks in HSR scenarios, and the improved DDPG algorithm efficiently identifies optimal computation offloading strategies. [ABSTRACT FROM AUTHOR]

With the proliferation of intelligent applications, mobile devices are increasingly handling computation-intensive tasks but often struggle with limited computing power and energy resources. Mobile Edge Computing (MEC) offers a solution by enabling these devices to offload computation-intensive tasks to resource-rich edge servers, thus reducing processing latency and energy consumption. However, existing task-offloading strategies often neglect critical security concerns. In this paper, we propose a security-aware task-offloading framework that utilizes Deep Reinforcement Learning (DRL) to solve these challenges. Our framework is designed to minimize the latency of task accomplishment and energy consumption while ensuring data security. We model system utility as a Markov Decision Process (MDP) and design a Proximal Policy Optimization (PPO)-based algorithm to derive optimal offloading strategies. Experimental results demonstrate that the proposed algorithm outperforms traditional methods regarding task execution latency and energy consumption. [ABSTRACT FROM AUTHOR]

Copyright of Journal of Chongqing University of Posts & Telecommunications (Natural Science Edition) is the property of Chongqing University of Posts & Telecommunications and its content may not be copied or emailed to multiple sites or posted to a listserv without the copyright holder's express written permission. However, users may print, download, or email articles for individual use. This abstract may be abridged. No warranty is given about the accuracy of the copy. Users should refer to the original published version of the material for the full abstract. (Copyright applies to all Abstracts.)

With the rapid advancement of the Internet of Things and 5G networks in smart cities, the inevitable generation of massive amounts of data, commonly known as big data, has introduced increased latency within the traditional cloud computing paradigm. In response to this challenge, Mobile Edge Computing (MEC) has emerged as a viable solution, offloading a portion of mobile device workloads to nearby edge servers equipped with ample computational resources. Despite significant research in MEC systems, optimizing the placement of edge servers in smart cities to enhance network performance has received little attention. In this article, we propose RESP, a novel Recursive clustering technique for Edge Server Placement in MEC environments. RESP operates based on the median of each cluster determined by the number of base transceiver stations, strategically placing edge servers to achieve workload balance and minimize network traffic between them. Our proposed clustering approach substantially improves load balancing compared to existing methods and demonstrates superior performance in handling traffic dynamics. Through experimental evaluation with real-world data from Shanghai Telecom's base station dataset, our approach outperforms several representative techniques in terms of workload balancing and network traffic optimization. By addressing the ESP problem and introducing an advanced recursive clustering technique, this work makes a substantial contribution to optimizing mobile edge computing networks in smart cities. The proposed algorithm outperforms alternative methodologies, demonstrating a 10% average improvement in optimizing network traffic. Moreover, it achieves a 53% more suitable result in terms of computational load. [ABSTRACT FROM AUTHOR]

Abstract In recent years, mobile applications have proliferated across domains such as E-banking, Augmented Reality, E-Transportation, and E-Healthcare. These applications are often built using microservices, an architectural style where the application is composed of independently deployable services focusing on specific functionalities. Mobile devices cannot process these microservices locally, so traditionally, cloud-based frameworks using cost-efficient Virtual Machines (VMs) and edge servers have been used to offload these tasks. However, cloud frameworks suffer from extended boot times and high transmission overhead, while edge servers have limited computational resources. To overcome these challenges, this study introduces a Microservices Container-Based Mobile Edge Cloud Computing (MCBMEC) environment and proposes an innovative framework, Optimization Task Scheduling and Computational Offloading with Cost Awareness (OTSCOCA). This framework addresses Resource Matching, Task Sequencing, and Task Scheduling to enhance server utilization, reduce service latency, and improve service bootup times. Empirical results validate the efficacy of MCBMEC and OTSCOCA, demonstrating significant improvements in server efficiency, reduced service latency, faster service bootup times, and notable cost savings. These outcomes underscore the pivotal role of these methodologies in advancing mobile edge computing applications amidst the challenges of edge server limitations and traditional cloud-based approaches.

To tackle the problem of resource competition among service migrations caused by limited edge server resources in mobile edge computing (MEC) scenarios, a service migration optimization method for resource competition based on Lyapunov and game theory (OMRC-LG) was proposed. Considering the system's limited migration costs and the difficulty of predicting trajectories when the number of users was large, the service migration was modeled as an optimization problem with migration cost constraints and used the Lyapunov technique to transform it into an online problem without user trajectory prediction. To alleviate resource competition among users, a distributed method based on game theory was proposed. By sharing user service migration decisions, the method obtained accurate information on available edge server resources and would continuously update these decisions to optimize service migration. Simulation results show that the OMRC-LG method can reduce the average service delay while satisfying the migration cost constraints.

In a single UAV-assisted mobile edge computing system, in order to enable the UAV to serve all user devices in a large area, the large area can be divided into a plurality of sub-areas and the UAV can be set to fly between the sub-areas with a fixed route to provide computing services for the user devices. Considering the scarcity of computational resources for user devices and the fact that users outside the coverage area of the UAV may choose to move to the coverage area for task offloading in order to maximize their own utility, the partial offloading problem of user devices can be transformed into the problem of maximizing the utility of each user device. The mixed-strategy game and the submodular game are used to determine the movement probability of user devices and the amount of offloaded data, so as to derive the optimal offloading strategy, and the existence of mixed-strategy Nash equilibrium and pure-strategy Nash equilibrium is proved, respectively. Simulation results show that the proposed scheme can effectively improve the utility of user device compared with classical schemes such as MBO (Binary Offloading Based on Mixed Strategy Game), and its convergence and stability are verified.

Abstract Cybertwin (CT) is an innovative network structure that digitally simulates humans and items in a virtual environment, significantly influencing Cybertwin instances more than regular VMs. Cybertwin-driven networks, combined with Mobile Edge Computing (MEC), provide practical options for transmitting IoT-enabled data. This research introduces a hybrid methodology integrating deep learning with Cybertwin-driven resource allocation to enhance energy-efficient workload offloading and resource management in MEC networks. Offloading work is essential in MEC networks since several applications require significant resources. The Cybertwin-driven approach considers user mobility, virtualization, processing power, load migrations, and resource demand as crucial elements in the decision-making process for offloading. The model optimizes job allocation between on-premises and distant execution using a task-offloading strategy to reduce the operating burden on the MEC network. The model uses a hybrid partitioning approach and a cost function to optimize resource allocation efficiently. This cost function accounts for energy consumption and service delays associated with job assignment, execution, and fulfilment. The model calculates the cost of several segmentation and offloading procedures and chooses the lowest cost to enhance energy efficiency and performance. The approach employs a deep learning architecture called “CNN-LSTM-TL” to accomplish energy-efficient task offloading, utilizing pre-trained transfer learning models. Batch normalization is used to speed up model training and improve its robustness. The model is trained and assessed using an extensive mobile edge computing public dataset. The experimental findings confirm the efficacy of the proposed methodology, indicating a 20% decrease in energy usage compared to conventional methods while achieving comparable or superior performance levels. Simulation studies emphasize the advantages of incorporating Cybertwin-driven insights into resource allocation and workload-offloading techniques. This research enhances energy-efficient and resource-aware MEC networks by incorporating Cybertwin-driven techniques.

Home appliance manufacturers are increasingly focusing on building smarter home systems by incorporating user feedback to enhance products and services. To support this, we designed a federated learning (FL) system that includes a reputation mechanism to help manufacturers leverage customer data to train machine learning models. First, it downloads the initial model provided by the manufacturer and trains it with local data. Then, it asks customers to sign their models and upload them to the blockchain. To protect customer privacy, we implemented differential privacy and introduced a new normalization technique. In addition, we also attract more customers to participate in crowdsourced FL tasks by rewarding their contributions, thereby ensuring that the datasets for model training are robust and diverse. This system not only promotes collaboration between customers and manufacturers, but also facilitates the development of more responsive and smarter home appliance systems through advanced FL and blockchain technologies.

Given the problems with a centralized cloud and the emergence of ultra-low latency applications, and the needs of the Internet of Things (IoT), it has been found that novel methods are needed to support centralized cloud technology. Mobile edge computing is one of the solutions to mitigate these challenges. In this paper, we study task caching at Device to Device (D2D)-assisted network edge. In the proposed scheme, we predict the possibility of re-requesting tasks in the future using convolutional neural networks (CNN). Based on this predicted possibility, the number of last requests, and the number of cached versions of this task type in the neighbors, in addition to the characteristics of a task itself, including the required cache volume and processing resources, we rank the tasks using the proposed Multi-Criteria Task Ranking using Predicted requests (MCTRP) scheme and select the best replacement option in the cache of each Mobile User Equipment (MUE). The proposed scheme has proved to be of considerable benefit in terms of reducing delay and energy consumption and improving the utility of MUEs. [ABSTRACT FROM AUTHOR]

Summary: The rapid evolution of user equipment (UE) and 5G networks drives significant transformations, bringing technology closer to end‐users. Managing resources in densely crowded areas such as airports, train stations, and bus terminals poses challenges due to diverse user demands. Integrating mobile edge computing (MEC) and network function virtualization (NFV) becomes vital when the service provider's (SP) primary goal is maximizing profitability while maintaining service level agreement (SLA). Considering these challenges, our study addresses an online resource allocation problem in an MEC network where computing resources are limited, and the SP aims to boost profit by securely admitting more UE requests at each time slot. Each UE request arrival rate is unknown, and the requirement is specific resources with minimum cost and delay. The optimization problem objective is achieved by allocating resources to requests at the MEC network in appropriate cloudlets, utilizing abandoned instances, reutilizing idle and soft slice instances to shorten delay and reduce costs, and immediately scaling inappropriate instances, thus minimizing the instantiation of new instances. This paper proposes a deep reinforcement learning (DRL) method for request prediction and resource allocation to mitigate unnecessary resource waste. Simulation results demonstrate that the proposed approach effectively accepts network slice requests to maximize profit by leveraging resource availability, reutilizing instantiated resources, and upholding goodwill and SLA. Through extensive simulations, we show that our proposed DRL‐based approach outperforms other state‐of‐the‐art techniques, namely, MaxSR, DQN, and DDPG, by 76%, 33%, and 23%, respectively. [ABSTRACT FROM AUTHOR]

We address the problem of resource allocation with multi-attribute demand considering heterogeneous servers in mobile edge computing (MEC). A mobile device (MD) may be within the coverage area of multiple access points and can get resources from any server that can establish direct communication. However, the configurations of heterogeneous servers are different, so the demand for each MEC server is different. We tackle this problem and consider multi-attribute demand, where each MD is assigned exactly one of multiple demands. We formulate the allocation problem in an auction-based setting to provide server scalability. We propose a family of greedy mechanisms to solve the resource allocation problem. However, each MD is self-interested and may try to manipulate the system to maximize its utility. We show our mechanisms are truthful, and they drive the system into an equilibrium where no MD can declare an untrue value to obtain higher utility. We also analyze the approximation ratios of our greedy mechanisms. Experimental results demonstrate that the greedy mechanisms obtain the near-optimal allocation in a short period while benefiting MDs and edge cloud providers. [ABSTRACT FROM AUTHOR]

Home appliance manufacturers are increasingly focusing on building smarter home systems by incorporating user feedback to enhance products and services. To support this, we designed a federated learning (FL) system that includes a reputation mechanism to help manufacturers leverage customer data to train machine learning models. First, it downloads the initial model provided by the manufacturer and trains it with local data. Then, it asks customers to sign their models and upload them to the blockchain. To protect customer privacy, we implemented differential privacy and introduced a new normalization technique. In addition, we also attract more customers to participate in crowdsourced FL tasks by rewarding their contributions, thereby ensuring that the datasets for model training are robust and diverse. This system not only promotes collaboration between customers and manufacturers, but also facilitates the development of more responsive and smarter home appliance systems through advanced FL and blockchain technologies. [ABSTRACT FROM AUTHOR]

In mobile edge computing, unmanned aerial vehicles (UAVs) equipped with computing servers have emerged as a promising solution due to their exceptional attributes of high mobility, flexibility, rapid deployment, and terrain agnosticism. These attributes enable UAVs to reach designated areas, thereby addressing temporary computing swiftly in scenarios where ground-based servers are overloaded or unavailable. However, the inherent broadcast nature of line-of-sight transmission methods employed by UAVs renders them vulnerable to eavesdropping attacks. Meanwhile, there are often obstacles that affect flight safety in real UAV operation areas, and collisions between UAVs may also occur. To solve these problems, we propose an innovative A*SAC deep reinforcement learning algorithm, which seamlessly integrates the benefits of Soft Actor-Critic (SAC) and A* (A-Star) algorithms. This algorithm jointly optimizes the hovering position and task offloading proportion of the UAV through a task offloading function. Furthermore, our algorithm incorporates a path-planning function that identifies the most energy-efficient route for the UAV to reach its optimal hovering point. This approach not only reduces the flight energy consumption of the UAV but also lowers overall energy consumption, thereby optimizing system-level energy efficiency. Extensive simulation results demonstrate that, compared to other algorithms, our approach achieves superior system benefits. Specifically, it exhibits an average improvement of 13.18% in terms of different computing task sizes, 25.61% higher on average in terms of the power of electromagnetic wave interference intrusion into UAVs emitted by different auxiliary UAVs, and 35.78% higher on average in terms of the maximum computing frequency of different auxiliary UAVs. As for path planning, the simulation results indicate that our algorithm is capable of determining the optimal collision-avoidance path for each auxiliary UAV, enabling them to safely reach their designated endpoints in diverse obstacle-ridden environments. [ABSTRACT FROM AUTHOR]

In the domain of 5G/6G wireless communications, mobile edge computing (MEC) technology is widely utilized for efficient data transmission. Unmanned aerial vehicles (UAVs) have emerged as the most recent transmission carriers in this landscape. However, the challenges associated with UAV deployment and path planning are often regarded as NP-hard, nonconvex, and nonlinear problems. Traditional optimization techniques struggle to address these complexities effectively. To address this issue, this study proposes "Edge-UAV", a novel mobile edge computing system specifically designed for UAVs. The primary objective of Edge-UAV is to minimize energy consumption and optimize the operational efficiency of UAVs. To achieve this goal, this study introduces a two-stage optimization strategy and a nonhovering transmission strategy. First, the coordinate updating operation of the UAVs' hovering points is decoupled from the path planning task. Additionally, the perturbation-inheritance algorithm is employed to enhance the coordinate updating process. In the second stage, the nonhovering transmission strategy enables UAVs to perform data transmission tasks while in flight, effectively optimizing their working time. This paper provides a detailed elucidation of the roles played by these innovative strategies within the Edge-UAV system. To assess the superiority of the proposed strategies, eight sets of comparative experiments involving 60–200 individual devices awaiting data transmission are conducted. The experimental results demonstrate the significant advantages of the Edge-UAV system in terms of reducing total energy consumption and optimizing the operational hours of UAVs. Through comprehensive experimentation and analysis, this study contributes to the advancement of UAV-assisted mobile edge computing in 5G/6G wireless communication networks. The proposed strategies exhibit promising potential for enhancing the efficiency and performance of UAVs. [ABSTRACT FROM AUTHOR]

In this paper, we introduce the Enhanced Whale Optimization Algorithm (EWA) to optimize dependent task offloading in a multi-edge cloud computing environment. Our proposed algorithm aims to identify the most suitable offloading scenario for dependent tasks, focusing on minimizing total processing latency, energy consumption, and associated costs. We operate within a system comprising many decentralized Mobile Edge Computing servers (MECs) and a centralized cloud server. Two novel improvement operations, namely Frame Shifting (FS) and Load Redistribution Strategy (LRS), are introduced to enhance the performance of the whale algorithm. Through simulation, our results demonstrate the superior performance of EWA. Specifically, compared to the Whale Optimization Algorithm (WOA), EWA achieves a remarkable reduction in latency by 22.84%, a substantial decrease in energy consumption by 78.28%, and a notable reduction in cost usage by 61.47%. These outcomes underscore the efficacy and practical significance of the proposed EWA in addressing the challenges posed by dependent task offloading in the multi-edge cloud computing landscape.

Abstract With the advent of Mobile Edge Computing (MEC), shifting data processing from cloud centers to the network edge presents an advanced computational paradigm for addressing latency-sensitive applications. Specifically, in radar systems, the real-time processing and prediction of radar echo data pose significant challenges in dynamic and resource-constrained environments. MEC, by processing data near its source, not only significantly reduces communication latency and enhances bandwidth utilization but also diminishes the necessity of transmitting large volumes of data to the cloud, which is crucial for improving the timeliness and efficiency of radar data processing. To meet this demand, this paper proposes a model that integrates a spatiotemporal Attention Module (STAM) with a Long Short-Term Memory Gated Recurrent Unit (ST-ConvLSGRU) to enhance the accuracy of radar echo prediction while leveraging the advantages of MEC. STAM, by extending the spatiotemporal receptive field of the prediction units, effectively captures key inter-frame motion information, while optimizations to the convolutional structure and loss function further boost the model’s predictive performance. Experimental results demonstrate that our approach significantly improves the accuracy of short-term weather forecasting in a mobile edge computing environment, showcasing an efficient and practical solution for processing radar echo data under dynamic, resource-limited conditions.

Abstract Sensitive data identification represents the initial and crucial step in safeguarding sensitive information. With the ongoing evolution of the industrial internet, including its interconnectivity across various sectors like the electric power industry, the potential for sensitive data to traverse different domains increases, thereby altering the composition of sensitive data. Consequently, traditional approaches reliant on sensitive vocabularies struggle to adequately address the challenges posed by identifying sensitive data in the era of information abundance. Drawing inspiration from advancements in natural language processing within the realm of deep learning, we propose a transferable Sensitive Data Identification method based on Product Quantization, named PQ-SDI. This innovative approach harnesses both the composition and contextual cues within textual data to accurately pinpoint sensitive information within the context of Mobile Edge Computing (MEC). Notably, PQ-SDI exhibits proficiency not only within a singular domain but also demonstrates adaptability to new domains following training on heterogeneous datasets. Moreover, the method autonomously identifies sensitive data throughout the entire process, eliminating the necessity for human upkeep of sensitive vocabularies. Extensive experimentation with the PQ-SDI model across four real-world datasets, resulting in performance improvements ranging from 2% to 5% over the baseline model and achieves an accuracy of up to 94.41%. In cross-domain trials, PQ-SDI achieved comparable accuracy to training and identification within the same domain. Furthermore, our experiments showcased the product quantization technique significantly reduces the parameter size by tens of times for the subsequent sensitive data identification phase, particularly beneficial for resource-constrained environments characteristic of MEC scenarios. This inherent advantage not only bolsters sensitive data protection but also mitigates the risk of data leakage during transmission, thus enhancing overall security measures in MEC environments.