SearcharxivSearch

arXiv subjects

Ruan Yanjiao

Publications and source records attributed to Ruan Yanjiao.

2 recordsLinked to original sources

Encryption Mechanism And Resource Allocation Optimization Based On Edge Computing Environment

A method for optimizing encryption mechanism and resource allocation based on edge computing environment is proposed. A local differential privacy algorithm based on a histogram algorithm is used to protect user information during task offloading, which allows accurate preservation of user contextual information while reducing interference with the playback decision. To efficiently offload tasks and improve offloading performance, a joint optimization algorithm for task offloading and resource allocation is proposed that optimizes overall latency. A balance will be found between privacy protection and task offloading accuracy. The impact of contextual data interference on task offloading decisions is minimized while ensuring a predefined level of privacy protection. In the concrete connected vehicle example, the method distributes tasks among roadside devices and neighboring vehicles with sufficient computational resources.

cs.CR

Base Station Selection and Task Offloading of the Mobile Edge Computing System

Based on the two decision variables, service location and base station selection, construct a computational model of the switching delay, communication delay, and queuing delay patterns of a mobile edge computing system in each time horizon; minimize the non-switching latency to obtain the service deployment and base station selection decision at the initial time horizon; compute the switching latency and non-switching latency of the current time horizon based on the decision of the previous time horizon, and determine the current time horizon based on the principle of larger non-switching latency tolerance. If the service is not reallocated, the decision for the current time slot remains the same as the decision for the previous time slot; if the service is reallocated, the non-reach time of the current time slot is minimized and the service allocation and base station selection decision for the current time slot is obtained; the service allocation and base station selection decisions for all time slots are iteratively computed. This paper provides low-latency processing and quality of service for users to satisfy the randomness of user movement.

cs.NI